Worksheetsonline quiz-19/11/25
Total questions: 49
Worksheet time: 8mins
Name
Class
Date
1.
Which protocol ensures strict ordering of conflicting transactions?
a)
Basic 2PL
b)
Strict 2PL
c)
Timestamp
d)
MVCC
2.
Which decomposition guarantees dependency preservation?
a)
Lossless
b)
BCNF
c)
3NF
d)
2NF
3.
Which logging method enforces Write-Ahead Logging?
a)
Undo logging
b)
Redo logging
c)
ARIES
d)
Shadow paging
4.
Phantom problem occurs due to?
a)
Tuple-level lock
b)
Predicate lock
c)
Row versions
d)
Strict 2PL
5.
Which index is preferred for high-cardinality columns?
a)
Bitmap
b)
B-Tree
c)
Hash
d)
Dense
6.
Multiversion timestamp ordering avoids what anomaly?
a)
Dirty read
b)
Lost update
c)
Write skew
d)
Phantom
7.
In relational algebra, natural join removes what explicitly?
a)
Duplicate columns
b)
Duplicate rows
c)
NULLs
d)
Cartesian noise
8.
Which algorithm solves the count-to-infinity problem?
a)
Distance Vector
b)
Link State
c)
Split Horizon with Poison Reverse
d)
Flooding
9.
Which protocol discovers MTU along a path?
a)
ARP
b)
PMTUD
c)
ICMP Echo
d)
IGMP
10.
TCP’s congestion avoidance grows window how?
a)
Exponentially
b)
Linearly
c)
Logarithmically
d)
Step function
11.
Which QoS model reserves resources along the path?
a)
DiffServ
b)
IntServ
c)
Best effort
d)
MPLS
12.
Which routing protocol uses Dijkstra?
a)
RIP
b)
BGP
c)
OSPF
d)
EIGRP
13.
Which multiple access eliminates collisions?
a)
ALOHA
b)
CSMA/CD
c)
TDMA
d)
FDMA
14.
Which method ensures reliability in RTP?
a)
ACK
b)
NAK
c)
RTCP
d)
Timers
15.
Which property proves a language is not regular?
a)
Subset
b)
Pumping Lemma
c)
Right linear grammar
d)
DFA closure
16.
Which machine characterizes Type-1 languages?
a)
DFA
b)
PDA
c)
LBA
d)
TM
17.
Which problem about TM is decidable?
a)
Halting
b)
Equivalence
c)
Emptiness
d)
Regularity of TM language
18.
CYK algorithm complexity is?
a)
O(n)
b)
O(n^2)
c)
O(n^3)
d)
O(n log n)
19.
Which closure is false for CFLs?
a)
Union
b)
Concatenation
c)
Kleene Star
d)
Intersection
20.
Which grammar form guarantees no left recursion?
a)
CNF
b)
GNF
c)
ENF
d)
TNF
21.
Deterministic PDA recognizes which classes?
a)
CFL
b)
Regular
c)
Sub-CFL
d)
DCFL
22.
Which scheduling gives minimum average turnaround time?
a)
FCFS
b)
RR
c)
SJF
d)
Priority
23.
Which technique eliminates external fragmentation?
a)
Segmentation
b)
Paging
c)
Swapping
d)
Buddy system
24.
Copy-on-write is triggered on?
a)
Read
b)
Write
c)
Fork
d)
Context switch
25.
Which algorithm avoids deadlock by safe state detection?
a)
Banker
b)
FIFO
c)
Priority
d)
Mutex
26.
TLB miss requires?
a)
Page walk
b)
Context switch
c)
Interrupt
d)
Kernel panic
27.
Which kernel design gives minimal attack surface?
a)
Monolithic
b)
Microkernel
c)
Hybrid
d)
Exokernel
28.
Thrashing is detected by?
a)
CPU usage drop
b)
Memory leak
c)
High IO wait
d)
Large page fault rate
29.
Which parser handles most deterministic CFLs?
a)
LL(1)
b)
LR(1)
c)
SLR
d)
Recursive
30.
Which analysis computes available expressions?
a)
Liveness
b)
Reaching definitions
c)
Constant propagation
d)
Dominator
31.
Which transformation uses SSA?
a)
Inlining
b)
Copy propagation
c)
Constant folding
d)
Register allocation
32.
Which grammar property leads to shift/reduce conflicts?
a)
Ambiguity
b)
Left recursion
c)
Right recursion
d)
Left factoring
33.
Purpose of lexical lookahead?
a)
Disambiguation
b)
Symbol table
c)
Optimization
d)
Codegen
34.
Which IR is platform-independent?
a)
Three-address code
b)
AST
c)
DAG
d)
Control flow graph
35.
Which binding happens at runtime?
a)
Static
b)
Dynamic
c)
Early
d)
Hybrid
36.
Which data structure ensures worst-case O(log n)?
a)
AVL
b)
Red-Black
c)
Heap
d)
All
37.
Which hashing resolves collision fastest on average?
a)
Open addressing
b)
Linear probing
c)
Quadratic probing
d)
Chaining
38.
DFS is implemented using?
a)
Queue
b)
Stack
c)
Heap
d)
Array
39.
Which tree supports order statistics?
a)
AVL
b)
Red-Black
c)
Segment tree
d)
Order-statistic tree
40.
Which algorithm uses priority queue?
a)
Prim
b)
Dijkstra
c)
Kruskal
d)
All
41.
Which structure supports prefix search?
a)
Trie
b)
Heap
c)
AVL
d)
Splay
42.
Which representation uses adjacency lists?
a)
Dense graph
b)
Sparse graph
c)
Complete graph
d)
Tree
43.
CPI depends on?
a)
Instruction mix
b)
Pipeline depth
c)
Branch predictor
d)
All
44.
Which hazard is solved by forwarding?
a)
Structural
b)
Data
c)
Control
d)
None
45.
Which architecture uses VLIW?
a)
CISC
b)
RISC
c)
EPIC
d)
MIMD
46.
Cache thrashing occurs in?
a)
Direct-mapped
b)
Fully associative
c)
Set associative
d)
Victim cache
47.
Which improves ILP?
a)
Pipelining
b)
Superscalar
c)
Out-of-order
d)
All
48.
Which mode uses displacement + register?
a)
Immediate
b)
Direct
c)
Indexed
d)
Register
49.
Which memory is persistent?
a)
SRAM
b)
DRAM
c)
Flash
d)
Registers
100 %
