Recent questions tagged nptel-quiz

1 votes
0 answers
92
Which of the following can be described as a programming model used to develop applications processing massive amounts of data in a distributed and/or parallel manner?1. ...
1 votes
0 answers
93
Consider the following databaseCol 1Col 2Col 3123456789If Col1 and Col2 form a column family and Col3 is another column family, how is the data stored?A. 1 2 3 4 5 6 7 8 ...
1 votes
0 answers
95
Consider the following schedule $S$. S: l1(A),l3(D),l1(B),u1(A),l2(C),l2(B),l1(D),l2(B),l3(C),l4(A),l4(C),l5(A); Which of the following is a valid set of transactions tha...
1 votes
1 answer
99
If 5 relations are put through the zig-zag configuration of join tree and the order of join does not matter, how many different join trees are possible?1. 960 2. 840 3. 1...
1 votes
1 answer
100
A system where commutativity is considered different, in how many ways the join of n relations r1,r2,…, rn can be taken?1. (2n−2)!/(n−1)! 2. (2n−2)!/n!(n−1)! 3...
2 votes
2 answers
102
Which of the following is not a cause of transaction failure?1. System Crash2. Deadlock3. Exception4. All of the above are causes of transaction failures
0 votes
0 answers
104
For which of the following operators does the following relation hold. ΠL(E1⊕E2)=ΠL(E1)⊕ΠL(E2) 1. ∪ 2. ∩ 3. − 4. Both ∩ and ∪
1 votes
0 answers
105
The number of configurations of a zig-zag join tree that can be formed when the order of leaves matters.1. 2n−1 2. (2n−2)!2n−1(n−1)! 3. 2n−2 4. (2n−2)!n!(n−...
1 votes
0 answers
106
The most generalized form of a join tree is a zig-zag tree.1. False2. True
0 votes
0 answers
107
0 votes
1 answer
111
Which of the following relational operators is commutative?1. Difference, Union 2. Full outer join and Left outer join 3. Full outer join and intersection 4. Right outer...
0 votes
1 answer
112
In what kind of index does an index entry appear only for certain keys?1. Dense2. Sparse3. Simple4. Inner
1 votes
0 answers
114
In an external merge sort, where the number of blocks in the relation is 324, suppose we can put only 4 blocks at a time into the memory. In the worst case, how many tota...
0 votes
0 answers
115
In an external merge sort, where number of blocks in the relation is 324, suppose we can put only 4 blocks at a time into the memory. In the worst case, how many total bl...
0 votes
1 answer
116
Which of the following does not interrupt a running process?1. A device2. Timer3. Power Failure4. None of the above