Recent questions tagged nptel-quiz

+1 vote

0 answers

1

Digital logic- nptel assignment
Suppose we are using 4-bit carry lookahead adder modules to build a 64- bit adder with two-level carry lookahead, with ripple carry between the modules. If the delay of a basic gate (AND, OR, NOT) is 2 nanoseconds, the worst-case delay of the 64-bit adder will be ……….. nanoseconds.

asked Aug 13 in Digital Logic by ajaysoni1924 Boss (10.2k points) | 48 views

+1 vote

0 answers

2

NPTEL: OS

asked May 9 in Operating System by Hirak Active (3.4k points) | 81 views

0 votes

1 answer

3

nptel Assignment

asked Dec 31, 2018 in CO and Architecture by amitqy Active (1.8k points) | 102 views

0 votes

0 answers

4

NPTEL
/* sizeof(int)=4; sizeof(float)=8; sizeof(unsigned char)=1 ; */ What is the output of the following program ? #include<iostream> #include<stdio.h> using namespace std; int main(){ union Data{ int i; float f; unsigned char str[20]; }data; printf("size =%d\n",sizeof(data)); data.i=10; data.f=220.5; printf("data.i: %d\n",data.i); return 0; }

asked Sep 10, 2018 in Programming by rishabhgupta12 (57 points) | 89 views

+2 votes

1 answer

5

NPTEL
1 point The variable turn can have values 0 or 1 Void Process (i) { while(1) { //Non-critical section While (turn!=i); // Critical section turn = j; } } The above code does not provide 1. Mutual exclusion 2. Progress 3. Bounded wait 4. None of these

asked Oct 14, 2017 in Operating System by gulsanchouhan (249 points) | 67 views

0 votes

3 answers

6

NPTEL
If the value of a counting semaphore s = 4, then the maximum number of requests for the critical section before it blocks is _____________ ? 1. 0 2. 1 3. 2 4. 4

asked Oct 14, 2017 in Operating System by gulsanchouhan (249 points) | 156 views

+1 vote

1 answer

7

NPTEL
State True/False Bakery algorithm ensures that no process is starved. 1. True 2. False

asked Oct 14, 2017 in Operating System by gulsanchouhan (249 points) | 55 views

0 votes

1 answer

8

NPTEL
Your friend wants to design synchronization primitives and tells you that he would be better off by strictly ensuring that the processes alternate the critical section. Your response would be: 1. That might not satisfy the “progress” requirement 2. That might not satisfy the “mutual exclusion” requirement 3. That might not satisfy the “bounded wait” requirement 4. I guess that would suffice

asked Oct 14, 2017 in Operating System by gulsanchouhan (249 points) | 79 views

0 votes

1 answer

9

NPTEL
By using Intel hardware xchg instruction ensures that The critical section is deadlock free Solution is starvation free Process enters CS in FIFO order More than one process enters critical section at same time Which of the above statement is TRUE?

asked Oct 14, 2017 in Operating System by gulsanchouhan (249 points) | 46 views

0 votes

1 answer

10

NPTEL
Return value of xchg instruction is_____________ 1. Old value 2. New value 3 . 1 if operation succeeds and 0 if operation fails 4. None of the above

asked Oct 14, 2017 in Operating System by gulsanchouhan (249 points) | 48 views

+2 votes

0 answers

11

NPTEL
Which of the following transaction(s) follow 2-phase locking protocol? lock1(a)read1(a)lock2(b)write2(b)lock1(c)unlock2(b)unclock1(c)lock2(c)unlock1(a) lock1(a)lock1(b)unlock1(a)lock2(a)write2(a)unlock2(a)unlock1(b) lock1(a)lock2(b)lock1(c)lock3(d)unlock2(b)lock3(b)unlock1(a)unlock3(d)unlock1(c)lock3(c) 1. Only 1 2. Only 2 3. Only 1 and 3 4. None of them

asked Sep 29, 2017 in Databases by gulsanchouhan (249 points) | 84 views

+2 votes

0 answers

12

nptel
Which of the following statement is correct ? 1. 2 phase locking protocol does not suffer with problem of cascading rollback 2. Strict 2 phase protocol never results in deadlock 3. In strict 2 phase protocol, restriction of releasing exclusive locks until commit ensures no cascading rollbacks 4. Time-stamp ordering protocol can generate non-recoverable schedules

asked Sep 29, 2017 in Databases by gulsanchouhan (249 points) | 95 views

+3 votes

2 answers

13

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

asked Sep 29, 2017 in Databases by gulsanchouhan (249 points) | 68 views

+1 vote

0 answers

14

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

asked Sep 29, 2017 in Databases by gulsanchouhan (249 points) | 58 views

+1 vote

0 answers

15

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

asked Sep 29, 2017 in Databases by gulsanchouhan (249 points) | 74 views

+1 vote

0 answers

16

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

asked Sep 29, 2017 in Databases by gulsanchouhan (249 points) | 30 views

+1 vote

0 answers

17

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}

asked Sep 29, 2017 in Databases by gulsanchouhan (249 points) | 26 views

+1 vote

0 answers

18

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

asked Sep 29, 2017 in Databases by gulsanchouhan (249 points) | 28 views

+1 vote

0 answers

19

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

asked Sep 19, 2017 in Operating System by Suman Acharya (59 points) | 162 views

0 votes

0 answers

20

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 transactions ... log record (i.e. last log record first). 3. No undo operations are required in the deferred database scheme. 4. None

asked Aug 26, 2017 in Databases by gulsanchouhan (249 points) | 261 views

+1 vote

1 answer

21

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

asked Aug 26, 2017 in Databases by gulsanchouhan (249 points) | 291 views

+1 vote

2 answers

22

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

asked Aug 26, 2017 in Databases by gulsanchouhan (249 points) | 182 views

+2 votes

1 answer

23

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

asked Aug 26, 2017 in Databases by gulsanchouhan (249 points) | 404 views

+2 votes

3 answers

24

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

asked Aug 26, 2017 in Databases by gulsanchouhan (249 points) | 169 views

0 votes

0 answers

25

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

asked Aug 26, 2017 in Databases by gulsanchouhan (249 points) | 343 views

0 votes

0 answers

26

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 ∪

asked Aug 26, 2017 in Databases by gulsanchouhan (249 points) | 178 views

+1 vote

1 answer

27

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

asked Aug 26, 2017 in Databases by gulsanchouhan (249 points) | 270 views

+1 vote

1 answer

28

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

asked Aug 26, 2017 in Databases by gulsanchouhan (249 points) | 372 views

0 votes

0 answers

29

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

asked Aug 26, 2017 in Databases by gulsanchouhan (249 points) | 374 views

+1 vote

1 answer

30

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

asked Aug 26, 2017 in Databases by gulsanchouhan (249 points) | 372 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent questions tagged nptel-quiz

Recent Posts

Recent Blog Comments