Computer Science Engineering (CSE)
An e-NFA is ___________ in representation.- a)Quintuple
- b)Quadruple
- c)Triple
- d)None of the mentioned
Correct answer is option 'A'. Can you explain this answer?
An e-NFA is ___________ in representation.
a)
Quintuple
b)
Quadruple
c)
Triple
d)
None of the mentioned
NAVDEEP SINGH answered • yesterdayCorrect Answer :- A
Explanation : An e-NFA consist of 5 tuples: A=(Q, S, d, q0, F)
Note: e is never a member of SAn e-NFA consist of 5 tuples: A=(Q, S, d, q0, F)
Note: e is never a member of S.
If every non-key attribute is functionally dependent on the primary key, then the relation will be in- a)First normal form
- b)Third normal form
- c)Second normal form
- d)Fourth normal form
Correct answer is option 'C'. Can you explain this answer?
If every non-key attribute is functionally dependent on the primary key, then the relation will be in
a)
First normal form
b)
Third normal form
c)
Second normal form
d)
Fourth normal form
DHIRENDRA GUPTA answered • yesterdayConditions for various normal forms:
- 1 NF – A relation R is in first normal form (1NF) if and only if all underlying domains contain atomic values only.
- 2 NF – A relation R is in second normal form (2NF) if and only if it is in 1NF and every non-key attribute is fully dependent on the primary key.
- 3 NF – A relation R is in third normal form (3NF) if and only if it is in 2NF and every non-key attribute is non-transitively dependent on the primary key.
- BCNF – A relation R is in Boyce-Codd normal form (BCNF) if and only if every determinant is a candidate key.
Example:
Relation R(XYZ) with functional dependencies {X -> Y, Y -> Z, X -> Z}.
Notice here Y -> Z, in question it is not mention that non prime attribute is only dependent on primary key so this FD is perfectly valid.
This relation is in 2NF but not in 3NF because of every non-key attribute is transitively dependent on the primary key. Here {X} will be candidate key.
Relation R(XYZ) with functional dependencies {X -> Y, Y -> Z, X -> Z}.
Notice here Y -> Z, in question it is not mention that non prime attribute is only dependent on primary key so this FD is perfectly valid.
This relation is in 2NF but not in 3NF because of every non-key attribute is transitively dependent on the primary key. Here {X} will be candidate key.
Following algorithm (s) can be used to sort n integers in the range [1 ... n3] in O(n) time?- a)Heap sort
- b)Quick sort
- c)Merge sort
- d)Radix sort
Correct answer is option 'D'. Can you explain this answer?
Following algorithm (s) can be used to sort n integers in the range [1 ... n3] in O(n) time?
a)
Heap sort
b)
Quick sort
c)
Merge sort
d)
Radix sort
SPARSH PANWAR answered • yesterdayRadix sort is a non-comparative integer sorting algorithm that sorts data with integer keys by grouping keys which share same position and value. So it take O(n) time.
Quicksort is run on two inputs shown below to sort in ascending order:
(i) 1 , 2 , 3 .... n .
(ii) n, n - 1, n - 2 , .... 2, 1Let C1, and C2 be the number of comparisons made for the inputs (i) and (ii) respectively. Then,- a)C1 < C2
- b)C1 > C2
- c)C1 = C2
- d)We cannot say anything for arbitrary n
Correct answer is option 'C'. Can you explain this answer?
Quicksort is run on two inputs shown below to sort in ascending order:
(i) 1 , 2 , 3 .... n .
(ii) n, n - 1, n - 2 , .... 2, 1
(i) 1 , 2 , 3 .... n .
(ii) n, n - 1, n - 2 , .... 2, 1
Let C1, and C2 be the number of comparisons made for the inputs (i) and (ii) respectively. Then,
a)
C1 < C2
b)
C1 > C2
c)
C1 = C2
d)
We cannot say anything for arbitrary n
ARYAMAN PANDEY answered • yesterdayBoth of given cases are Quicksort Worst cases problem, so comparisons are equal.
If one uses straight two-way merge sort algorithm to sort the following elements in ascending order:
20,47,15,8,9,4,40,30,12,17
Then the order of these elements after the 2nd pass of the algorithm is- a)8, 9, 15, 20, 47, 4, 12, 17, 13,40
- b)8, 15, 20, 47, 4, 9, 30, 40,12, 17
- c)15, 20, 47, 4, 8, 9, 12, 30, 40, 17
- d)4, 8, 9, 15, 20, 47, 12, 17, 30, 40
Correct answer is option 'B'. Can you explain this answer?
If one uses straight two-way merge sort algorithm to sort the following elements in ascending order:
20,47,15,8,9,4,40,30,12,17
Then the order of these elements after the 2nd pass of the algorithm is
20,47,15,8,9,4,40,30,12,17
Then the order of these elements after the 2nd pass of the algorithm is
a)
8, 9, 15, 20, 47, 4, 12, 17, 13,40
b)
8, 15, 20, 47, 4, 9, 30, 40,12, 17
c)
15, 20, 47, 4, 8, 9, 12, 30, 40, 17
d)
4, 8, 9, 15, 20, 47, 12, 17, 30, 40
AKSHIT MALHOTRA answered • yesterday
The recurrence relation that arises in relation with the complexity of binary search is- a)
k is a constant - b)
k is a constant - c)
- d)
Correct answer is option 'A'. Can you explain this answer?
The recurrence relation that arises in relation with the complexity of binary search is
a)
k is a constantb)
k is a constantc)
d)
AMISH KUMAR answered • yesterdayBinary search only half of the array.
So,
So,
Consider the following functions:
Which of the following is true?- a)h(n) is O(F(n))
- b)g(n) is not O(F(n))
- c)F(n) is θ(g(n))
- d)None of these
Correct answer is option 'C'. Can you explain this answer?
Consider the following functions:
Which of the following is true?
Which of the following is true?
a)
h(n) is O(F(n))
b)
g(n) is not O(F(n))
c)
F(n) is θ(g(n))
d)
None of these
ANURAG PANDEY answered • yesterday
Here f(n) is O(g(n))
f(n) is O(h(n))
If f(n) is O(g(n))
f(n) is O(g(n)) and g(n) is O (f(n))
Which sort will operate in quadratic time relative to the number of elements in the array (on the average)?- a)Quick sort
- b)Bubble sort
- c)Heap sort
- d)Merge sort
Correct answer is option 'B'. Can you explain this answer?
Which sort will operate in quadratic time relative to the number of elements in the array (on the average)?
a)
Quick sort
b)
Bubble sort
c)
Heap sort
d)
Merge sort
SUBHADIP KHAWAS answered • 2 days agoBubbles sort have time complexity of O(n2) and all other have times complexity 0(nlogn).
Sarat Rath asked • 2 hours agoWhat is the number of 3*8 decoders required to construct a 7*18 decoders?
If one uses straight two-way merge sort algorithm to sort the following elements in ascending order:
20,47, 15,8,9,4,40,30, 12, 17
Then the order of these elements after second pass of the algorithm is- a)8, 9, 15, 20, 47, 4, 12, 17, 30, 40
- b)8, 15, 20, 47, 4, 9, 30, 40, 12, 17
- c)15, 20, 47, 4, 8, 9, 12, 30, 40, 17
- d)4, 8, 9, 15, 20, 47, 12,17, 30, 40
Correct answer is option 'B'. Can you explain this answer?
If one uses straight two-way merge sort algorithm to sort the following elements in ascending order:
20,47, 15,8,9,4,40,30, 12, 17
Then the order of these elements after second pass of the algorithm is
20,47, 15,8,9,4,40,30, 12, 17
Then the order of these elements after second pass of the algorithm is
a)
8, 9, 15, 20, 47, 4, 12, 17, 30, 40
b)
8, 15, 20, 47, 4, 9, 30, 40, 12, 17
c)
15, 20, 47, 4, 8, 9, 12, 30, 40, 17
d)
4, 8, 9, 15, 20, 47, 12,17, 30, 40
VUTUKURI SMS answered • 2 days agoGiven: 20, 47, 15, 8, 9, 4, 40, 30, 12, 17
2-way merge sort so group of 2 is taken at once.
2nd pass:
The order of elements after second pass of the algorithm is 8, 15, 20, 47, 4, 9, 30, 40, 12, 17.
2-way merge sort so group of 2 is taken at once.
2nd pass:
The order of elements after second pass of the algorithm is 8, 15, 20, 47, 4, 9, 30, 40, 12, 17.
Each of the function 2√n and nlogn has a growth rate .... than that of any polynomial.- a)Greater
- b)Less
- c)Equal to
- d)Uncertain
Correct answer is option 'A'. Can you explain this answer?
Each of the function 2√n and nlogn has a growth rate .... than that of any polynomial.
a)
Greater
b)
Less
c)
Equal to
d)
Uncertain
PAWAN KUMAR answered • 2 days ago2√n and nlogn grows exponentially which have growth rate greater than any polynomial.
Mrudul Addipalli asked • 2 hours agoA function f(x) is continuous in the interval [0,2]. It is known that f(0) = f(2) = -1 and f(1) =1 . which one of the following statemnts must be true?- a)There exists a y in the interval (0,1) such that f(y)= f(y+1)
- b)for every y in the interval (0,1), f(2) = f(2-y)
- c)The maximum value of the function in the interval (0,2) is 1
- d)There exists a y in the interval (0,1) such that f(y) = -f(2-y)
Correct answer is option 'A'. Can you explain this answer?
A function f(x) is continuous in the interval [0,2]. It is known that f(0) = f(2) = -1 and f(1) =1 . which one of the following statemnts must be true?
a)
There exists a y in the interval (0,1) such that f(y)= f(y+1)
b)
for every y in the interval (0,1), f(2) = f(2-y)
c)
The maximum value of the function in the interval (0,2) is 1
d)
There exists a y in the interval (0,1) such that f(y) = -f(2-y)
Which of the following is the average number of key comparisons done by sequential reach in the successful case?- a)
- b)n/2
- c)(n + 1)
- d)2n
Correct answer is option 'A'. Can you explain this answer?
Which of the following is the average number of key comparisons done by sequential reach in the successful case?
a)
b)
n/2
c)
(n + 1)
d)
2n
ASHUTOSH ARYAN answered • 2 days agoin linear or sequential search the maximum number of comparisons are (n) for V elements hence the number of comparisons when the element to be found is at the middle of the array
= n/2 [If n is even]
In general average case =
= n/2 [If n is even]
In general average case =
For merging two sorted lists of sizes m and n into a sorted list of size m + n, we required comparisons of- a)O(m)
- b)O(n)
- c)O(m + n)
- d)O(logm + logn)
Correct answer is option 'C'. Can you explain this answer?
For merging two sorted lists of sizes m and n into a sorted list of size m + n, we required comparisons of
a)
O(m)
b)
O(n)
c)
O(m + n)
d)
O(logm + logn)
SUMRILIK SHAUNAK answered • 2 days agoThe number of comparisons required in the worst case is O(m + n).
Consider the following two functions:
Which of the following is true?- a)g1(n) is O(g2(n))
- b)g1(n) is O(n3)
- c)g2(n) is O(g1(n))
- d)g2(n) is O(n)
Correct answer is option 'A'. Can you explain this answer?
Consider the following two functions:
Which of the following is true?
Which of the following is true?
a)
g1(n) is O(g2(n))
b)
g1(n) is O(n3)
c)
g2(n) is O(g1(n))
d)
g2(n) is O(n)
SHIVANG VAISH answered • 2 days ago
Therefore;
n2 ≤ n3 for N ≥ 10000
g1(n) = O(g2(n))
, has the solution T(n) equal to
Prashant Waghwase asked • 3 hours agoLet q, r, and s represent “You can ride the roller coaster,” “You are under 4 feet tall,” and “You are older than 16 years old,” respectively. What is the logical expression for “You cannot ride the roller coaster if you are under 4 feet tall unless you are older than 16 years old"- a)
- b)
- c)
- d)
Correct answer is option 'A'. Can you explain this answer?
Let q, r, and s represent “You can ride the roller coaster,” “You are under 4 feet tall,” and “You are older than 16 years old,” respectively. What is the logical expression for “You cannot ride the roller coaster if you are under 4 feet tall unless you are older than 16 years old"
a)
b)
c)
d)
f(n) = 3n2 + 4n + 2
Which will be the exact value for f(n)?- a)Ø(n2)
- b)O(n2)
- c)Ω(n2)
- d)None of these
Correct answer is option 'B'. Can you explain this answer?
f(n) = 3n2 + 4n + 2
Which will be the exact value for f(n)?
Which will be the exact value for f(n)?
a)
Ø(n2)
b)
O(n2)
c)
Ω(n2)
d)
None of these
SHIRKE SIDDHESH answered • 2 days agof(n) = 3 n2 + 4n + 2
So, f(n) = n2 + n2 + n2 = O (n2)
So, f(n) = n2 + n2 + n2 = O (n2)
Apurva Patel asked • 3 hours agoConsider the relation "enrolled(student, course)" in which (student, course) is the primary key, and the relation "paid(student, amount)" where student is the primary key. Assume no null values and no foreign keys or integrity constraints. Given the following four queries:
Q. Which one of the following statements is correct?- a)All queries return identical row sets for any database
- b)Query2 and Query4 return identical row sets for all databases but there exist databases for which Query1 and Query2 return different row sets.
- c)There exist databases for which Query3 returns strictly fewer rows than Query2
- d)There exist databases for which Query4 will encounter an integrity violation at runtime.
Correct answer is option 'B'. Can you explain this answer?
Consider the relation "enrolled(student, course)" in which (student, course) is the primary key, and the relation "paid(student, amount)" where student is the primary key. Assume no null values and no foreign keys or integrity constraints. Given the following four queries:
Q. Which one of the following statements is correct?
a)
All queries return identical row sets for any database
b)
Query2 and Query4 return identical row sets for all databases but there exist databases for which Query1 and Query2 return different row sets.
c)
There exist databases for which Query3 returns strictly fewer rows than Query2
d)
There exist databases for which Query4 will encounter an integrity violation at runtime.
The concept of order (Big O) is important because- a)It can be used to decide the best algorithm that solves a given problem
- b)It determines the maximum size of a problem that can be solved in a given amount of time
- c)It is the lower bound of the growth rate of algorithm
- d)Both (a) and (b) above
Correct answer is option 'D'. Can you explain this answer?
The concept of order (Big O) is important because
a)
It can be used to decide the best algorithm that solves a given problem
b)
It determines the maximum size of a problem that can be solved in a given amount of time
c)
It is the lower bound of the growth rate of algorithm
d)
Both (a) and (b) above
PRADUYMNA MISHRA answered • 2 days agoBig O notation gives worst case limit for a given problem: Also find out the least upper bound of problem.
Tarun Kumar asked • 3 hours agoThe correct matching for the following pairs is:
(A) DMA I/O (1) High speed RAM
(B) Cache (2) Disk
(C) Interrupt I/O (3) Printer
(D) Condition Code Register (4) ALU- a)A-4 B-3 C-1 D-2
- b)A-2 B-1 C-3 D-4
- c)A-4 B-3 C-2 D-1
- d)A-2 B-3 C-4 D-1
Correct answer is option 'B'. Can you explain this answer?
The correct matching for the following pairs is:
(A) DMA I/O (1) High speed RAM
(B) Cache (2) Disk
(C) Interrupt I/O (3) Printer
(D) Condition Code Register (4) ALU
(A) DMA I/O (1) High speed RAM
(B) Cache (2) Disk
(C) Interrupt I/O (3) Printer
(D) Condition Code Register (4) ALU
a)
A-4 B-3 C-1 D-2
b)
A-2 B-1 C-3 D-4
c)
A-4 B-3 C-2 D-1
d)
A-2 B-3 C-4 D-1
Nisi Gupta asked • 4 hours agoConsider six memory partitions of size 200 KB, 400 KB, 600 KB, 500 KB, 300 KB, and 250 KB, where KB refers to kilobyte. These partitions need to be allotted to four processes of sizes 357 KB, 210 KB, 468 KB and 491 KB in that order. If the best fit algorithm is used, which partitions are NOT allotted to any process?
Correct answer is between '200 KB,300 KB'. Can you explain this answer?
Consider six memory partitions of size 200 KB, 400 KB, 600 KB, 500 KB, 300 KB, and 250 KB, where KB refers to kilobyte. These partitions need to be allotted to four processes of sizes 357 KB, 210 KB, 468 KB and 491 KB in that order. If the best fit algorithm is used, which partitions are NOT allotted to any process?
Mahidar N asked • 4 hours agoConsider the following pseudo code, where x and y are positive integers.beginq := 0r := x
while ?? ≥ ?? dobeginr := r – yq := q + 1endendThe post condition that needs to be satisfied after the program terminates is- a)
- b)
- c)
- d)
Correct answer is option 'B'. Can you explain this answer?
Consider the following pseudo code, where x and y are positive integers.
begin
q := 0
r := x
while ?? ≥ ?? do
while ?? ≥ ?? do
begin
r := r – y
q := q + 1
end
end
The post condition that needs to be satisfied after the program terminates is
a)
b)
c)
d)
Adepu Veena asked • 8 hours agoThe temporal aspect of the locality of reference means- a)That the recently executed instruction wont be executed soon
- b)That the recently executed instruction is temporarily not referenced
- c)That the recently executed instruction will be executed soon again
- d)None of the mentioned
Correct answer is option 'C'. Can you explain this answer?
The temporal aspect of the locality of reference means
a)
That the recently executed instruction wont be executed soon
b)
That the recently executed instruction is temporarily not referenced
c)
That the recently executed instruction will be executed soon again
d)
None of the mentioned
Shweta Sonkar asked • 11 hours agoGiven an unsorted array. The array has this property that every element in array is at most k distance from its position in sorted array where k is a positive integer smaller than size of array. Which sorting algorithm can be easily modified for sorting this array and what is the obtainable time complexity?- a)Insertion Sort with time complexity O(kn)
- b)Heap Sort with time complexity O(nLogk)
- c)Quick Sort with time complexity O(kLogk)
- d)Merge Sort with time complexity O(kLogk)
Correct answer is option 'B'. Can you explain this answer?
Given an unsorted array. The array has this property that every element in array is at most k distance from its position in sorted array where k is a positive integer smaller than size of array. Which sorting algorithm can be easily modified for sorting this array and what is the obtainable time complexity?
a)
Insertion Sort with time complexity O(kn)
b)
Heap Sort with time complexity O(nLogk)
c)
Quick Sort with time complexity O(kLogk)
d)
Merge Sort with time complexity O(kLogk)
Nikhil Mhatre asked • 15 hours agoWhich of the following is fundamental characteristic of information?
Rajendra Malaviya asked • 18 hours agoThree of the five students allocated to a hostel put in special requests to the warden. Given the floor plan of the vacant rooms, select the allocation plan that will accommodate all their requests.
Request X: Due to pollen allergy, I want to avoid a wing next to the garden.
Request by Y: I want to live as far from the washrooms as possible, since I am very sensitive to
smell.
Request by Z: I believe in Vaastu and so want to stay in the South-west wing.
The shaded rooms are already occupied. WR is washroom.- a)
- b)
- c)
- d)
Correct answer is option 'A'. Can you explain this answer?
Three of the five students allocated to a hostel put in special requests to the warden. Given the floor plan of the vacant rooms, select the allocation plan that will accommodate all their requests.
Request X: Due to pollen allergy, I want to avoid a wing next to the garden.
Request by Y: I want to live as far from the washrooms as possible, since I am very sensitive to
smell.
Request by Z: I believe in Vaastu and so want to stay in the South-west wing.
The shaded rooms are already occupied. WR is washroom.
Request X: Due to pollen allergy, I want to avoid a wing next to the garden.
Request by Y: I want to live as far from the washrooms as possible, since I am very sensitive to
smell.
Request by Z: I believe in Vaastu and so want to stay in the South-west wing.
The shaded rooms are already occupied. WR is washroom.
a)
b)
c)
d)
Damayanti Daule asked • 20 hours agoSuppose a polynomial time algorithm is discovered that correctly computes the largest clique in a
given graph. In this scenario, which one of the following represents the correct Venn diagram of the
complexity classes P, NP and NP Complete (NPC)?- a)
- b)
- c)
- d)
Correct answer is option 'D'. Can you explain this answer?
Suppose a polynomial time algorithm is discovered that correctly computes the largest clique in a
given graph. In this scenario, which one of the following represents the correct Venn diagram of the
complexity classes P, NP and NP Complete (NPC)?
given graph. In this scenario, which one of the following represents the correct Venn diagram of the
complexity classes P, NP and NP Complete (NPC)?
a)
b)
c)
d)
Rama Devi asked • 20 hours agoConsider a set of 5 processes whose arrival time, CPU time needed and the priority are given below:
Note: Smaller the number, higher the priority.If the CPU scheduling policy is SJF with preemption, the average waiting time will be - a)8 ms
- b)14 ms
- c)5.6 ms
- d)None of the above
Correct answer is option 'C'. Can you explain this answer?
Consider a set of 5 processes whose arrival time, CPU time needed and the priority are given below:
Note: Smaller the number, higher the priority.
Note: Smaller the number, higher the priority.
If the CPU scheduling policy is SJF with preemption, the average waiting time will be
a)
8 ms
b)
14 ms
c)
5.6 ms
d)
None of the above
Simplified expression for function 
Javed Ahmad asked • 20 hours agoWhich of the following is not true about comparison based sorting algorithms?- a)The minimum possible time complexity of a comparison based sorting algorithm is O(nLogn) for a random input array
- b)Any comparison based sorting algorithm can be made stable by using position as a criteria when two elements are compared
- c)Counting Sort is not a comparison based sorting algortihm
- d)Heap Sort is not a comparison based sorting algorithm
Correct answer is option 'D'. Can you explain this answer?
Which of the following is not true about comparison based sorting algorithms?
a)
The minimum possible time complexity of a comparison based sorting algorithm is O(nLogn) for a random input array
b)
Any comparison based sorting algorithm can be made stable by using position as a criteria when two elements are compared
c)
Counting Sort is not a comparison based sorting algortihm
d)
Heap Sort is not a comparison based sorting algorithm
Ambati Rajendra asked • 20 hours agoHow is a privilege exception dealt with?- a)The program is alted and the system switches into supervisor mode and restarts the program execution
- b)The Program is stopped and removed from the queue
- c)The system switches the mode and starts the execution of a new process
- d)The system switches mode and runs the debugger
Correct answer is option 'A'. Can you explain this answer?
How is a privilege exception dealt with?
a)
The program is alted and the system switches into supervisor mode and restarts the program execution
b)
The Program is stopped and removed from the queue
c)
The system switches the mode and starts the execution of a new process
d)
The system switches mode and runs the debugger
Susan Oomen asked • yesterdayTwo processors A and B have clock frequencies of 700 Mhz and 900 Mhz respectively. Suppose A can execute an instruction with an averageof 3 steps and B can execute with an average of 5 steps.For the execution of the same instruction which processor is faster- a)A
- b)B
- c)Both take the same time
- d)Insufficient information
Correct answer is option 'A'. Can you explain this answer?
Two processors A and B have clock frequencies of 700 Mhz and 900 Mhz respectively. Suppose A can execute an instruction with an averageof 3 steps and B can execute with an average of 5 steps.For the execution of the same instruction which processor is faster
a)
A
b)
B
c)
Both take the same time
d)
Insufficient information
Neha Prajaapati asked • yesterdayWhich of the following derivations does a top-down parser use while parsing an input string? The input is assumed to be scanned in left to right order.- a)Leftmost derivation
- b)Leftmost derivation traced out in reverse
- c)Rightmost derivation
- d)Rightmost derivation traced out in reverse
Correct answer is option 'A'. Can you explain this answer?
Which of the following derivations does a top-down parser use while parsing an input string? The input is assumed to be scanned in left to right order.
a)
Leftmost derivation
b)
Leftmost derivation traced out in reverse
c)
Rightmost derivation
d)
Rightmost derivation traced out in reverse
Satish Gaikwad asked • yesterdayConsider the following pseudo code. What is the total number of multiplications to be performed?
- a)Half of the product of the 3 consecutive integers.
- b)One-third of the product of the 3 consecutive integers.
- c)One-sixth of the product of the 3 consecutive integers.
- d)None of the above.
Correct answer is option 'C'. Can you explain this answer?
Consider the following pseudo code. What is the total number of multiplications to be performed?
a)
Half of the product of the 3 consecutive integers.
b)
One-third of the product of the 3 consecutive integers.
c)
One-sixth of the product of the 3 consecutive integers.
d)
None of the above.
Damayanti Daule asked • yesterdayThe number of students in a class who have answered correctly, wrongly, or not attempted each question in exam, are listed in the table below. The marks fro each question are also listed. There is no negative or partial marking.
What is the average of the marks obtained by the class in the examination?- a)2.290
- b)2.970
- c)6.795
- d)8.795
Correct answer is option 'C'. Can you explain this answer?
The number of students in a class who have answered correctly, wrongly, or not attempted each question in exam, are listed in the table below. The marks fro each question are also listed. There is no negative or partial marking.
What is the average of the marks obtained by the class in the examination?
a)
2.290
b)
2.970
c)
6.795
d)
8.795
Rasazna Kls asked • yesterdayA priority queue can efficiently implemented using which of the following data structures? Assume that the number of insert and peek (operation to see the current highest priority item) and extraction (remove the highest priority item) operations are almost same.- a)Array
- b)Linked List
- c)Heap Data Structures like Binary Heap, Fibonacci Heap
- d)None of the above
Correct answer is option 'C'. Can you explain this answer?
A priority queue can efficiently implemented using which of the following data structures? Assume that the number of insert and peek (operation to see the current highest priority item) and extraction (remove the highest priority item) operations are almost same.
a)
Array
b)
Linked List
c)
Heap Data Structures like Binary Heap, Fibonacci Heap
d)
None of the above
Sai Kumar asked • yesterdayWhich of the following is true about Kruskal and Prim MST algorithms? Assume that Prim is implemented for adjacency list representation using Binary Heap and Kruskal is implemented using union by rank.- a)Worst case time complexity of both algorithms is same.
- b)Worst case time complexity of Kruskal is better than Prim
- c)Worst case time complexity of Prim is better than Kruskal
Correct answer is option 'A'. Can you explain this answer?
Which of the following is true about Kruskal and Prim MST algorithms? Assume that Prim is implemented for adjacency list representation using Binary Heap and Kruskal is implemented using union by rank.
a)
Worst case time complexity of both algorithms is same.
b)
Worst case time complexity of Kruskal is better than Prim
c)
Worst case time complexity of Prim is better than Kruskal
Hemant Gaikwad asked • yesterdayGiven the relationsemployee (name, salary, deptno) and department (deptno, deptname, address)Q. Which of the following queries cannot be expressed using the basic relational algebra operations (U, -, x,
, p)?- a)Department address of every employee
- b)Employees whose name is the same as their department name
- c)The sum of all employees’ salaries
- d)All employees of a given department
Correct answer is option 'C'. Can you explain this answer?
Given the relations
employee (name, salary, deptno) and department (deptno, deptname, address)
Q. Which of the following queries cannot be expressed using the basic relational algebra operations (U, -, x, , p)?
, p)?a)
Department address of every employee
b)
Employees whose name is the same as their department name
c)
The sum of all employees’ salaries
d)
All employees of a given department
Vishakha Kakde asked • 2 days agoAfter several defeats in wars, Robert Bruce went in exile and wanted to commit suicide. Just
before committing suicide, he came across a spider attempting tirelessly to have its net. Time
and again, the spider failed but that did not deter it to refrain from making attempts. Such
attempts by the spider made Bruce curious. Thus, Bruce started observing the nearimpossible
goal of the spider to have the net. Ultimately, the spider succeeded in having its
net despite several failures. Such act of the spider encouraged Bruce not to commit suicide.
And then, Bruce went back again and won many a battle, and the rest is history.
Which one of the following assertions is best supported by the above information?- a)Failure is the pillar of success
- b)Honesty is the best policy
- c)Life begins and ends with adventures
- d)No adversity justifies giving up hope
Correct answer is option 'D'. Can you explain this answer?
After several defeats in wars, Robert Bruce went in exile and wanted to commit suicide. Just
before committing suicide, he came across a spider attempting tirelessly to have its net. Time
and again, the spider failed but that did not deter it to refrain from making attempts. Such
attempts by the spider made Bruce curious. Thus, Bruce started observing the nearimpossible
goal of the spider to have the net. Ultimately, the spider succeeded in having its
net despite several failures. Such act of the spider encouraged Bruce not to commit suicide.
And then, Bruce went back again and won many a battle, and the rest is history.
before committing suicide, he came across a spider attempting tirelessly to have its net. Time
and again, the spider failed but that did not deter it to refrain from making attempts. Such
attempts by the spider made Bruce curious. Thus, Bruce started observing the nearimpossible
goal of the spider to have the net. Ultimately, the spider succeeded in having its
net despite several failures. Such act of the spider encouraged Bruce not to commit suicide.
And then, Bruce went back again and won many a battle, and the rest is history.
Which one of the following assertions is best supported by the above information?
a)
Failure is the pillar of success
b)
Honesty is the best policy
c)
Life begins and ends with adventures
d)
No adversity justifies giving up hope
Pooja Daphal asked • 2 days agoA computer has a 256 KByte, 4-way set associative, write back data cache with block size of 32 Bytes. The
processor sends 32 bit addresses to the cache controller. Each cache tag directory entry contains, in
addition to address tag, 2 valid bits, 1 modified bit and 1 replacement bit.The size of the cache tag directory is- a)160 Kbits
- b)136 Kbits
- c)40 Kbits
- d)32 Kbits
Correct answer is option 'A'. Can you explain this answer?
A computer has a 256 KByte, 4-way set associative, write back data cache with block size of 32 Bytes. The
processor sends 32 bit addresses to the cache controller. Each cache tag directory entry contains, in
addition to address tag, 2 valid bits, 1 modified bit and 1 replacement bit.
processor sends 32 bit addresses to the cache controller. Each cache tag directory entry contains, in
addition to address tag, 2 valid bits, 1 modified bit and 1 replacement bit.
The size of the cache tag directory is
a)
160 Kbits
b)
136 Kbits
c)
40 Kbits
d)
32 Kbits
Kamlesh Prajapat asked • 2 days agoThe non- Kleene Star operation accepts the following string of finite length over set A = {0,1} | where string s contains even number of 0 and 1- a)01,0011,010101
- b)0011,11001100
- c)ε,0011,11001100
- d)ε,0011,11001100
Correct answer is option 'B'. Can you explain this answer?
The non- Kleene Star operation accepts the following string of finite length over set A = {0,1} | where string s contains even number of 0 and 1
a)
01,0011,010101
b)
0011,11001100
c)
ε,0011,11001100
d)
ε,0011,11001100
Anonymous Keepprivacy asked • 2 days agoA relation (from the relational database model) consists of a set of tuples, which implies that- a)Relational model supports multi-valued attributes whose values can be represented in sets.
- b)For any two tuples, the values associated with all of their attributes may be the same.
- c)For any two tuples, the value associated with one or more of their attributes must differ.
- d)All tuples in a particular relation may have different attributes.
Correct answer is option 'C'. Can you explain this answer?
A relation (from the relational database model) consists of a set of tuples, which implies that
a)
Relational model supports multi-valued attributes whose values can be represented in sets.
b)
For any two tuples, the values associated with all of their attributes may be the same.
c)
For any two tuples, the value associated with one or more of their attributes must differ.
d)
All tuples in a particular relation may have different attributes.
Virat Kohli asked • 2 days agoWhich of the following is true about merge sort?- a)Merge Sort works better than quick sort if data is accessed from slow sequential memory.
- b)Merge Sort is stable sort by nature
- c)Merge sort outperforms heap sort in most of the practical situations.
- d)All of the above.
Correct answer is option 'D'. Can you explain this answer?
Which of the following is true about merge sort?
a)
Merge Sort works better than quick sort if data is accessed from slow sequential memory.
b)
Merge Sort is stable sort by nature
c)
Merge sort outperforms heap sort in most of the practical situations.
d)
All of the above.
Madhu Arasi asked • 2 days agoWhich of the following statements about relative addressing mode is FALSE?
A. It enables reduced instruction size
B. It allows indexing of array element with same instruction
C. It enables easy relocation of data
D. It enables faster address calculation than absolute addressing- a)A
- b)B
- c)C
- d)D
Correct answer is option 'D'. Can you explain this answer?
Which of the following statements about relative addressing mode is FALSE?
A. It enables reduced instruction size
B. It allows indexing of array element with same instruction
C. It enables easy relocation of data
D. It enables faster address calculation than absolute addressing
A. It enables reduced instruction size
B. It allows indexing of array element with same instruction
C. It enables easy relocation of data
D. It enables faster address calculation than absolute addressing
a)
A
b)
B
c)
C
d)
D
Fetching relevant content for you
Ask a question
Related Courses
Follow Us
