Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged nptel-quiz
1
votes
1
answer
61
NPTEL Assignment Question
Natural language constructs are (A) Unambiguous (B) Ambiguous (C) May be unambiguous or ambiguous (D) None of the other options
Natural language constructs are(A) Unambiguous (B) Ambiguous (C) May be unambiguous or ambiguous (D) None of the other options
rsansiya111
832
views
rsansiya111
asked
Dec 6, 2021
Compiler Design
compiler-design
nptel-quiz
ambiguous-grammar
+
–
0
votes
0
answers
62
NPTEL Assignment Question
The length of a door handle (in cm), manufactured by a factory, is normally distributed with µ = 6.0 and σ = 0.2 . The place to fix on the door can allow error in length up to 0.3 cm. What percentage of handles manufactured in the factory will be defective? How much should be the value of σ , so that the number of defectives in reduced to only 5%?
The length of a door handle (in cm), manufactured by a factory, is normally distributed with µ = 6.0 and σ = 0.2 . The place to fix on the door can allow error in lengt...
rsansiya111
196
views
rsansiya111
asked
Dec 6, 2021
Probability
nptel-quiz
+
–
1
votes
0
answers
63
NPTEL Assignment Question
A survey of people in given region showed that 25% drank regularly. The probability of death due to liver disease, given that a person drank regularly, was 6 times the probability of death due to liver disease, given that a person did not drink regularly. ... in the region is 0.005. If a person dies due to liver disease what is the probability that he/she drank regularly?
A survey of people in given region showed that 25% drank regularly. The probability of death due to liver disease, given that a person drank regularly, was 6 times the pr...
rsansiya111
238
views
rsansiya111
asked
Dec 6, 2021
Probability
nptel-quiz
iit
+
–
3
votes
1
answer
64
NPTEL Assignment
Consider a direct-mapped cache with 64 blocks and a block size of 16 bytes. Byte address 1200 will map to block number ………… of the cache.
Consider a direct-mapped cache with 64 blocks and a block size of 16 bytes. Byte address 1200 will map to block number ………… of the cache.
LRU
1.2k
views
LRU
asked
Dec 4, 2021
CO and Architecture
nptel-quiz
co-and-architecture
cache-memory
+
–
2
votes
1
answer
65
NPTEL Assignment
Consider a two-level memory hierarchy with separate instruction and data caches in level 1, and main memory in level 2. The clock cycle time in 1 ns. The miss penalty is 20 clock cycles for both read and write. 2% of the instructions are not found ... access time (including hit detection) is 1 clock cycle. The average access time of the memory hierarchy will be . nanoseconds
Consider a two-level memory hierarchy with separate instruction and data caches in level 1, and main memory in level 2. The clock cycle time in 1 ns. The miss penalty is ...
LRU
604
views
LRU
asked
Dec 4, 2021
CO and Architecture
nptel-quiz
co-and-architecture
effective-memory-access
+
–
2
votes
1
answer
66
NPTEL Assignment
Assume that a read request takes 50 nsec on a cache miss and 5 nsec on a cache hit. While running a program, it is observed that 80% of the processor’s read requests result in a cache hit. The average read access time is ………….. nsec.
Assume that a read request takes 50 nsec on a cache miss and 5 nsec on a cache hit. While running a program, it is observed that 80% of the processor’s read requests re...
LRU
285
views
LRU
asked
Dec 4, 2021
CO and Architecture
nptel-quiz
co-and-architecture
effective-memory-access
+
–
0
votes
1
answer
67
Nptel Assignment Question
Using DeMorgan’s rule, state the negation of the statement: “The car is out of gas or the fuel line is plugged.” (a) The car has gas or the fuel line is unplugged (b) The car has gas and the fuel line is unplugged (c) The car is out of gas and the fuel line is plugged (d) The car is out of gas or the fuel line is plugged
Using DeMorgan’s rule, state the negation of the statement: “The car is out of gas or the fuel line is plugged.” (a) The car has gas or the fuel line is unplugged(b...
rsansiya111
208
views
rsansiya111
asked
Dec 3, 2021
Set Theory & Algebra
nptel-quiz
discrete-mathematics
+
–
0
votes
1
answer
68
Nptel Assignment Question
Given p, we want to prove q. Which of the following will suffice: (a) ¬q =⇒ ¬p (b) p ∧ q =⇒ q (c) ¬p ∧ ¬q =⇒ p (d) ¬q =⇒ q (e) p ∧ ¬q ∧ r =⇒ ¬r (f) none of these
Given p, we want to prove q. Which of the following will suffice:(a) ¬q =⇒ ¬p(b) p ∧ q =⇒ q(c) ¬p ∧ ¬q =⇒ p(d) ¬q =⇒ q(e) p ∧ ¬q ∧ r =⇒ ¬r(f) non...
rsansiya111
397
views
rsansiya111
asked
Dec 3, 2021
Set Theory & Algebra
nptel-quiz
discrete-mathematics
set-theory
+
–
2
votes
1
answer
69
Nptel Assignment Question
The sum $\displaystyle{}\sum_{k=1}^{n}(1 + 2 + \dots + k)$ is a polynomial of what degree $1$ $2$ $3$ $4$ $5$
The sum $\displaystyle{}\sum_{k=1}^{n}(1 + 2 + \dots + k)$ is a polynomial of what degree$1$$2$$3$$4$$5$
rsansiya111
359
views
rsansiya111
asked
Dec 3, 2021
Set Theory & Algebra
nptel-quiz
discrete-mathematics
+
–
0
votes
0
answers
70
Nptel Assignment Question
Let P(n) be a statement and we prove P(k) ⇒ $P(k^{2})$ and P(k) ⇒ P(k + 3). Then we to prove that P(n) is true for all n (a) it is enough to prove the base case for k = 1 (b) it is enough to prove the base case for k = 1 and k = 2. (c) it is enough to prove that base case for k = 1 and k = 2 and k = 3 (d) No base case can prove the statement.
Let P(n) be a statement and we prove P(k) ⇒ $P(k^{2})$ and P(k) ⇒ P(k + 3). Then we to prove that P(n) is true for all n (a) it is enough to prove the base case for ...
rsansiya111
316
views
rsansiya111
asked
Dec 3, 2021
Set Theory & Algebra
nptel-quiz
discrete-mathematics
+
–
0
votes
0
answers
71
Nptel Assignment Question
Let P(n) be a statement and we prove P(k) ⇒ P(k − 3) and P(k) ⇒ P(2k). Then we to prove that P(n) is true for all n (a) it is enough to prove the base case for k = 1 (b) it is enough to prove the base case for k = 1 and k = 2. (c) it is enough to prove that base case for k = 1 and k = 2 and k = 3 (d) No base case can prove the statement
Let P(n) be a statement and we prove P(k) ⇒ P(k − 3) and P(k) ⇒ P(2k). Then we to prove that P(n) is true for all n (a) it is enough to prove the base case for k = ...
rsansiya111
187
views
rsansiya111
asked
Dec 3, 2021
Set Theory & Algebra
nptel-quiz
discrete-mathematics
+
–
0
votes
0
answers
72
Nptel Assignment Question
Please solve this. I got 24. but it this wrong. Kindly solve this ?
Please solve this. I got 24. but it this wrong. Kindly solve this ?
rsansiya111
229
views
rsansiya111
asked
Dec 3, 2021
Computer Networks
nptel-quiz
+
–
0
votes
1
answer
73
Nptel Assignment Question
How long does the receiver wait before it sends a delayed acknowledgement for receiving few more packets. ? RTT 2*RTT 250 ms 500 ms
How long does the receiver wait before it sends a delayed acknowledgement for receiving few more packets. ? RTT2*RTT250 ms500 ms
rsansiya111
297
views
rsansiya111
asked
Dec 3, 2021
Computer Networks
nptel-quiz
+
–
1
votes
3
answers
74
Nptel Assignment Question
if 93 /4 = 23, the base of the number system is 8 9 10 11
if 93 /4 = 23, the base of the number system is 891011
rsansiya111
1.0k
views
rsansiya111
asked
Dec 2, 2021
Digital Logic
nptel-quiz
digital-logic
digital-circuits
+
–
1
votes
1
answer
75
Nptel Assignment Question
what is the decimal equivalent of ${{(1221)}}_{3}$ ${{(50)}}_{10}$ ${{(53)}}_{10}$ ${{(52)}}_{10}$ ${{(51)}}_{10}$
what is the decimal equivalent of ${{(1221)}}_{3}$${{(50)}}_{10}$${{(53)}}_{10}$${{(52)}}_{10}$${{(51)}}_{10}$
rsansiya111
315
views
rsansiya111
asked
Dec 2, 2021
Digital Logic
nptel-quiz
digital-logic
+
–
0
votes
0
answers
76
Nptel Assignment Question
Consider a graph G. Let T be a BFS tree with root r. Let d(u,v) denote the length of the shortest path between the nodes u and v. If v is visited before u in the breadth first search traversal, which of the following statements is true ? A. d(r,v) > d(r,u) B. d(r,v) = d(r,u) C. d(r,v) < d(r,u) D. insufficient information to comment on d(r,v) and d(r,u)
Consider a graph G. Let T be a BFS tree with root r. Let d(u,v) denote the length of the shortest path between the nodes u and v. If v is visited before u in the breadth ...
rsansiya111
327
views
rsansiya111
asked
Nov 30, 2021
Algorithms
nptel-quiz
algorithms
+
–
1
votes
1
answer
77
Nptel Assignment Question
The instruction $LDA$ $FF0$ (machine code of $LDA$ is $5$) is stored in location $7F0$. The contents in memory location $FF0$ are loaded into accumulator. After its execution, accumulator stores value $8$. The figure below shows a snapshot of the registers and their contents. ... $MAR = 7F0$, $IR = 5FF0$, $MBR = 5FF0$ $MAR = FF1$, $IR = 5FF0$, $MBR = 7F0$
The instruction $LDA$ $FF0$ (machine code of $LDA$ is $5$) is stored in location $7F0$. The contents in memory location $FF0$ are loaded into accumulator. After its exe...
Yaman Sahu
541
views
Yaman Sahu
asked
Oct 7, 2021
CO and Architecture
co-and-architecture
nptel-quiz
instruction-execution
+
–
6
votes
1
answer
78
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.
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...
ajaysoni1924
1.7k
views
ajaysoni1924
asked
Aug 13, 2019
Digital Logic
nptel-quiz
digital-logic
+
–
1
votes
0
answers
79
NPTEL: OS
Hirak
774
views
Hirak
asked
May 9, 2019
Operating System
operating-system
nptel-quiz
+
–
0
votes
1
answer
80
nptel Assignment
amitqy
1.1k
views
amitqy
asked
Dec 31, 2018
CO and Architecture
nptel-quiz
co-and-architecture
+
–
0
votes
0
answers
81
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; }
/* 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 m...
rishabhgupta12
728
views
rishabhgupta12
asked
Sep 10, 2018
Programming in C
nptel-quiz
+
–
0
votes
1
answer
82
NPTEL Assignment
10 rooms, numbered 1 to 10, need to be rewired, but there are constraints on the order in which this can get done. Rooms 5 and 8 must be rewired before starting on 6 Room 1 must be rewired rewired before starting on 7 and 9 Rooms 4 and 5 must be rewired before starting ... and 3-1-7-10-8-5-2 each of length 7." <--quoted from answer How is it done?How is it connected to DAG?
10 rooms, numbered 1 to 10, need to be rewired, but there are constraints on the order inwhich this can get done.Rooms 5 and 8 must be rewired before starting on 6Room 1 ...
amitqy
1.3k
views
amitqy
asked
Aug 24, 2018
Algorithms
algorithm-design
topological-sort
nptel-quiz
+
–
2
votes
1
answer
83
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
1 pointThe variable turn can have values 0 or 1 Void Process (i) { while(1) { //Non-critical section While (turn!=i); //...
gulsanchouhan
729
views
gulsanchouhan
asked
Oct 14, 2017
Operating System
operating-system
nptel-quiz
+
–
0
votes
4
answers
84
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
If the value of a counting semaphore s = 4, then the maximum number of requests for the critical section before it blocks is _____________ ?1. 02. 13. 24. 4
gulsanchouhan
2.0k
views
gulsanchouhan
asked
Oct 14, 2017
Operating System
operating-system
nptel-quiz
+
–
1
votes
3
answers
85
NPTEL
State True/False Bakery algorithm ensures that no process is starved. 1. True 2. False
State True/False Bakery algorithm ensures that no process is starved.1. True2. False
gulsanchouhan
818
views
gulsanchouhan
asked
Oct 13, 2017
Operating System
operating-system
nptel-quiz
+
–
1
votes
1
answer
86
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
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. Y...
gulsanchouhan
909
views
gulsanchouhan
asked
Oct 13, 2017
Operating System
operating-system
nptel-quiz
+
–
0
votes
1
answer
87
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?
By using Intel hardware xchg instruction ensures thatThe critical section is deadlock freeSolution is starvation freeProcess enters CS in FIFO orderMore than one process ...
gulsanchouhan
758
views
gulsanchouhan
asked
Oct 13, 2017
Operating System
operating-system
nptel-quiz
+
–
0
votes
1
answer
88
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
Return value of xchg instruction is_____________1. Old value2. New value3 . 1 if operation succeeds and 0 if operation fails4. None of the above
gulsanchouhan
476
views
gulsanchouhan
asked
Oct 13, 2017
Operating System
operating-system
nptel-quiz
+
–
2
votes
0
answers
89
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
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)unlo...
gulsanchouhan
735
views
gulsanchouhan
asked
Sep 28, 2017
Databases
databases
nptel-quiz
+
–
2
votes
0
answers
90
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
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 de...
gulsanchouhan
967
views
gulsanchouhan
asked
Sep 28, 2017
Databases
databases
nptel-quiz
+
–
Page:
« prev
1
2
3
4
5
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register