Dark Mode

Recent questions tagged nptel-quiz

3 votes

1 answer

91

nptel
Choose the correct option about the following schedule. S:R2(A);W3(A);(commitT3);W1(A);(commitT1);W2(B);R2(C);(commitT2);R4(A);R4(B);(commitT4) 1. S is both recoverable and conflict serializable 2. S is neither recoverable nor conflict serializable 3. S is recoverable but not conflict serializable 4. S is not recoverable but conflict serializable

gulsanchouhan asked in Databases Sep 28, 2017

by gulsanchouhan

635 views

1 vote

0 answers

92

NPTEL
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. Map Reduce 2 .OLAP 3. Mahout 4. Cloud Computing

gulsanchouhan asked in Databases Sep 28, 2017

by gulsanchouhan

339 views

1 vote

0 answers

93

nptel
Consider the following database Col 1 Col 2 Col 3 1 2 3 4 5 6 7 8 9 If 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 9 B. 1 4 7 2 5 8 3 6 9 C. 1 2 4 5 7 8 3 6 9 D. 1 4 7 3 6 9 2 5 8

gulsanchouhan asked in Databases Sep 28, 2017

by gulsanchouhan

387 views

1 vote

0 answers

94

NPTEL
Suppose a deadlock occurs in the schedule S given below. 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) A transaction that causes the least number of cascading rollbacks is decided to be chosen as victim, then which of the following transaction cannot be chosen as a victim? 1. T3 2. T2 3. T1 4. Cannot be decided

gulsanchouhan asked in Databases Sep 28, 2017

by gulsanchouhan

236 views

1 vote

0 answers

95

nptel
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 that are potential victims? 1. {T1,T2,T3,T5} 2. {T1,T2} 3. {T1,T2,T3,T4} 4. {T1,T2,T3}

gulsanchouhan asked in Databases Sep 28, 2017

by gulsanchouhan

405 views

1 vote

0 answers

96

NPTEL
Consider the following schedule. All the locks are exclusive, and between the lock l and unlock u operations, the corresponding data item is first read and then written. 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) The schedule will result in a deadlock. 1. True 2. False

gulsanchouhan asked in Databases Sep 28, 2017

by gulsanchouhan

301 views

1 vote

1 answer

97

Security
Suppose a source code has bigger overflow vulnerabilities. Which of the following can cause buffer overflow vulnerabilities a. Scanf("%s",...) b. Strcpy(destination, source) c. Send command use for network connection Options are 1. Only a 2. b and c 3. a and b 4. All of the above

Suman Acharya asked in Operating System Sep 19, 2017

by Suman Acharya

488 views

0 votes

0 answers

98

NPTEL
Which one of the following option does not follow deferred database modification scheme in the system crash situation? 1. After system crash if there is no ``commit T'' instruction in log file then it requires nothing to recover. 2. After a system crash, all ... log record (i.e. last log record first). 3. No undo operations are required in the deferred database scheme. 4. None

gulsanchouhan asked in Databases Aug 26, 2017

by gulsanchouhan

656 views

1 vote

1 answer

99

NPTEL
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. 1024 4. 512

gulsanchouhan asked in Databases Aug 26, 2017

by gulsanchouhan

524 views

1 vote

1 answer

100

NPTEL
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. (2n−1)!/n!(n−1)! 4. None

gulsanchouhan asked in Databases Aug 26, 2017

by gulsanchouhan

423 views

2 votes

0 answers

101

NPTEL
Choose the correct set of replacements for operation ⊕ for which following equivalence relation holds: σθ(E1⊕E2)≡σθ(E1)⊕E2 1. Union only 2. Union and Intersection 3. Intersection and Set Difference 4. Intersection and Union

gulsanchouhan asked in Databases Aug 26, 2017

by gulsanchouhan

642 views

2 votes

2 answers

102

NPTEL
Which of the following is not a cause of transaction failure? 1. System Crash 2. Deadlock 3. Exception 4. All of the above are causes of transaction failures

gulsanchouhan asked in Databases Aug 26, 2017

by gulsanchouhan

997 views

0 votes

0 answers

103

NPTEL
Consider the following database schema where the primary keys are underlined. Employee(EId, EName, ESal, PId) Project(PId, PName, PDeadline, PBudget). Which of the following is the most optimized query while retrieving employee names whose salary is more ... ))⋈PIdΠPId,PBudget(σPBudget>50000 (Project))) 4. ΠEName(ΠEName,PId(σESal>1000(Employee))⋈PIdΠPId(σPBudget>50000(Project)))

gulsanchouhan asked in Databases Aug 26, 2017

by gulsanchouhan

719 views

0 votes

0 answers

104

NPTEL
For which of the following operators does the following relation hold. ΠL(E1⊕E2)=ΠL(E1)⊕ΠL(E2) 1. ∪ 2. ∩ 3. − 4. Both ∩ and ∪

gulsanchouhan asked in Databases Aug 26, 2017

by gulsanchouhan

436 views

1 vote

0 answers

105

NPTEL
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)!

gulsanchouhan asked in Databases Aug 26, 2017

by gulsanchouhan

426 views

1 vote

0 answers

106

NPTEL
The most generalized form of a join tree is a zig-zag tree. 1. False 2. True

gulsanchouhan asked in Databases Aug 26, 2017

by gulsanchouhan

557 views

0 votes

0 answers

107

NPTEL
The distribution of values for each attribute is stored in the form of an equi-width histogram. Using this histogram, the estimated size for a non-equality selection when compared to no histogram being used 1. remains the same 2. improves 3. deteriorates 4. can be exactly predicted always

gulsanchouhan asked in Databases Aug 26, 2017

by gulsanchouhan

591 views

1 vote

1 answer

108

NPTEL
Assume that a data file contains 1000 records that are ordered by a key attribute A, and a primary index on attribute A is built. Let the size of key be 5B and block pointer be 5B. Each block of the system is of 105B, out of which 100B can be used to store data and 5B ... data. How many disk accesses will be required to fetch the record using the index in average case? a. 6 b. 3 c. 4 d. 5

gulsanchouhan asked in Databases Aug 26, 2017

by gulsanchouhan

952 views

1 vote

0 answers

109

NPTEL
Consider a relation R(a,b,c) ordered on a non-key attribute b, and an index is maintained on attribute c. To evaluate the following expression, which is a better order of operation? σ(b= abc′∧c=12)(R) 1.First filter tuples u sing index on c and then search ... search tuples for the given value of b and then use index on c 3.The order of operation does not matter 4.Insufficient data to answer

gulsanchouhan asked in Databases Aug 25, 2017

by gulsanchouhan

637 views

3 votes

2 answers

110

NPTEL
Consider two relations R and S of size 600 and 500 bytes respectively.The size of a tuple in both relations is 20B. The block size of the system is 200B. How would many extra block transfers be required, in the worst case, if nested loop join is used instead of block nested loop join technique to compute R⋈S? 1. 78 2. 93 3. 66 4. 105

gulsanchouhan asked in Databases Aug 25, 2017

by gulsanchouhan

1.2k views

0 votes

1 answer

111

NPTEL
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 join and Union

gulsanchouhan asked in Databases Aug 25, 2017

by gulsanchouhan

483 views

0 votes

1 answer

112

NPTEL
In what kind of index does an index entry appear only for certain keys? 1. Dense 2. Sparse 3. Simple 4. Inner

gulsanchouhan asked in Databases Aug 25, 2017

by gulsanchouhan

472 views

0 votes

2 answers

113

NPTEL
Consider the simple nested-loop join of the following two relations r and s. Relation r s Tuples (n) 2400 1500 Blocks (b) 40 50 Assuming the worst case memory availability, i.e., the memory can hold only one block of each relation at a time, what is the number of ... 120040, seeks = 4800 2. Transfers = 4800, seeks = 120040 3. Transfers = 60050, seeks = 3000 4. Transfers = 3000, seeks = 60050

gulsanchouhan asked in Databases Aug 25, 2017

by gulsanchouhan

579 views

1 vote

0 answers

114

NPTEL
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 totals seeks will happen? 1. ∼2400 2. ∼2700 3. ∼3000 4. ∼3300

gulsanchouhan asked in Databases Aug 25, 2017

by gulsanchouhan

318 views

0 votes

0 answers

115

NPTEL
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 block transfers will happen? 1. 2592 2. 3240 3. 3888 4. 4230

gulsanchouhan asked in Databases Aug 25, 2017

by gulsanchouhan

333 views

0 votes

1 answer

116

NPTEL
Which of the following does not interrupt a running process? 1. A device 2. Timer 3. Power Failure 4. None of the above

gulsanchouhan asked in Operating System Aug 23, 2017

by gulsanchouhan

825 views

6 votes

1 answer

117

NPTEL
Let L be a language. We define another language L′ as follow L′={w∣w is binary equivalent of 2^x, where x∈L and consider x as a binary number} Which of the following is false? 1) If L is regular then L′ is also regular 2) If L is regular then L′ may not regular 3) L′ is always regular irrespective of L 4) L′ is always non-regular irrespective of L

KOMURAVELLI PRASHANT asked in Theory of Computation Aug 15, 2017

by KOMURAVELLI PRASHANT

1.0k views

0 votes

1 answer

118

#network security
1. What is the difference between message integrity and message authentication ? I have read in frozen : message integrity -: message digest (generated by applying hash function on message ) is being added with original message and by verification of this digest( ... verifying digest in both for assurance of not modified data. Explain it pls. I m not able to visualise it . Thanks

bharti asked in Computer Networks Jun 15, 2017

by bharti

1.0k views

2 votes

1 answer

119

NPTEL DESIGN AND ANALYSIS OF ALGORITHMS
Suppose we have a graph with negative edge weights. We take the largest magnitude negative edge weight -k and reset each edge weight w to w+k+1. Which of the following is true? 1. Kruskal's algorithm will identify the same spanning ... There are more minimum cost spanning trees in the modified graph than in the original graph. is the correct answer 3 ?

shivamsat asked in DS Feb 20, 2017

1.9k views

3 votes

0 answers

120

NPTEL
Voting in Siruseri Zonal Computing Olympiad 2010 Elections are on for the Siruseri Town Council. Elections in Siruseri work in a rather odd manner. Each candidate is assigned a unique identification number. The town is divided into five zones and each zone proposes a list of candidates, in some ... 162 5 14 162 92 387 7 748 14 5 12 387 17 952 12 92 398 849 14 5 92 12 387 Sample Output 5

Madhan sai asked in Algorithms Feb 6, 2017

3.8k views

Page:

« prev
1
2
3
4
5
next »

Recent questions tagged nptel-quiz