wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

12/11/25

Total questions: 56

Worksheet time: 9mins

Name
Class
Date
1.
Which normal form ensures every non-key attribute depends fully on the primary key?
a)
1NF
b)
2NF
c)
3NF
d)
BCNF
2.
Which concurrency control avoids cascading rollbacks?
a)
Strict 2PL
b)
Time stamping
c)
Graph-based
d)
None
3.
Lossless join ensures what?
a)
No spurious tuples
b)
No anomalies
c)
No redundancy
d)
No NULLs
4.
Which anomaly is removed by BCNF?
a)
Update
b)
Insertion
c)
Deletion
d)
All
5.
Purpose of ARIES recovery?
a)
Redo
b)
Logical undo
c)
WAL
d)
Shadow paging
6.
Snapshot isolation avoids which issue?
a)
Dirty reads
b)
Lost updates
c)
Phantoms
d)
Deadlocks
7.
Worst-case B-tree search time?
a)
O(1)
b)
O(log n)
c)
O(n)
d)
O(n log n)
8.
Serializable schedules are equivalent to what?
a)
Strict
b)
Serial
c)
Recoverable
d)
Cascadeless
9.
Which resolves IP to MAC?
a)
DNS
b)
ARP
c)
ICMP
d)
IGMP
10.
Cut-through switching forwards after reading?
a)
Destination
b)
Entire frame
c)
Header+CRC
d)
Hop table
11.
Which protocol uses AIMD?
a)
UDP
b)
DCCP
c)
TCP
d)
SCTP
12.
IPv6 address length?
a)
32
b)
64
c)
128
d)
256
13.
Routing is handled by which OSI layer?
a)
Link
b)
Transport
c)
Network
d)
Session
14.
Which TCP mechanism handles out-of-order?
a)
Slow start
b)
Fast retransmit
c)
Nagle
d)
Window scaling
15.
CSMA/CD detects what?
a)
Collisions
b)
Errors
c)
Jitter
d)
Congestion
16.
MPLS uses what addressing scheme?
a)
Labels
b)
IP
c)
MAC
d)
Port
17.
Which automaton recognizes context-sensitive languages?
a)
DFA
b)
PDA
c)
LBA
d)
TM
18.
Which grammar generates regular languages?
a)
Type 3
b)
Type 2
c)
Type 1
d)
Type 0
19.
Diagonalization proves undecidability of?
a)
Membership
b)
Emptiness
c)
Halting
d)
Equivalence
20.
Which language is not CFL?
a)
a^n b^n
b)
a^n b^n c^n
c)
Palindrome
d)
Balanced
21.
CYK algorithm tests what?
a)
Equivalence
b)
Regularity
c)
Membership
d)
Ambiguity
22.
Which closure property CFLs lack?
a)
Union
b)
Concatenation
c)
Intersection
d)
Kleene
23.
Which machine halts for all inputs?
a)
TM
b)
UTM
c)
Decider
d)
Recognizer
24.
CYK requires grammar in?
a)
CNF
b)
GNF
c)
ENF
d)
TNF
25.
Which replacement shows Belady anomaly?
a)
LRU
b)
FIFO
c)
OPT
d)
Clock
26.
Optimal waiting time scheduling?
a)
RR
b)
FCFS
c)
SJF
d)
Priority
27.
Which structure tracks process state?
a)
PCB
b)
TCB
c)
Page table
d)
Queue
28.
Which prevents deadlock?
a)
Hold and wait
b)
Circular wait
c)
Preemption
d)
None
29.
Segmentation + paging is?
a)
Virtual paging
b)
Paged segmentation
c)
Hierarchical
d)
Swapping
30.
Kernel's goal?
a)
UI
b)
Resource mgmt
c)
Compilation
d)
Networking
31.
Which predicts faults using future?
a)
LRU
b)
OPT
c)
MRU
d)
Random
32.
Thrashing is avoided by?
a)
Overcommit
b)
Working set
c)
FIFO
d)
Fair share
33.
Which parser handles left recursion?
a)
LL
b)
LR
c)
RD
d)
Predictive
34.
Symbol table built in?
a)
Lexer
b)
Parser
c)
Semantic
d)
Optimizer
35.
IR close to machine code?
a)
TAC
b)
Syntax tree
c)
AST
d)
High IR
36.
Which removes unreachable code?
a)
DCE
b)
Inlining
c)
Fusion
d)
Strength
37.
Which grammar causes shift-reduce?
a)
Ambiguous
b)
Unambiguous
c)
Regular
d)
Linear
38.
Which analysis gives variable lifetime?
a)
Flow
b)
Liveness
c)
Reach def
d)
Alias
39.
Runtime binding is?
a)
Static
b)
Early
c)
Late
d)
Compile-time
40.
Parser using ACTION-GOTO?
a)
LL(1)
b)
SLR
c)
Recursive
d)
Predictive
41.
Tree guaranteeing log height?
a)
AVL
b)
Binary
c)
Heap
d)
Trie
42.
Which hashing uses chaining?
a)
Linear
b)
Quadratic
c)
Chaining
d)
Rehash
43.
Heapify complexity?
a)
O(1)
b)
O(log n)
c)
O(n)
d)
O(n log n)
44.
BST sorted traversal?
a)
Pre
b)
Post
c)
In
d)
Level
45.
Amortized O(1) push?
a)
Stack
b)
Queue
c)
Vector
d)
Array
46.
Which checks bipartite?
a)
Tree
b)
Stack
c)
Graph
d)
Heap
47.
Min-priority queue algorithm?
a)
DFS
b)
Kruskal
c)
Dijkstra
d)
BFS
48.
Which stores strings charwise?
a)
BST
b)
Heap
c)
Trie
d)
AVL
49.
Resource conflict hazard?
a)
Data
b)
Control
c)
Structural
d)
All
50.
Vector instructions used in?
a)
SISD
b)
SIMD
c)
MISD
d)
MIMD
51.
Register storing next instruction?
a)
IR
b)
PC
c)
MAR
d)
MBR
52.
Simplest cache mapping?
a)
Direct
b)
Assoc
c)
Set-assoc
d)
Hybrid
53.
CPU performance metric?
a)
IPC
b)
MHz
c)
CPI
d)
Voltage
54.
Offset-based mode?
a)
Implied
b)
Immediate
c)
Indexed
d)
Register
55.
Volatile memory?
a)
ROM
b)
Flash
c)
SRAM
d)
Disk
56.
Executes multiple per cycle?
a)
Scalar
b)
Superscalar
c)
VN
d)
CISC