Verified past paper — 10 questions
MCQs taken directly from the official verified paper record.
Showing 1–10
of 10 MCQs
Page 1 / 1
1
What is the time complexity of binary search on a sorted array of n elements in the worst case?
A. O(n)
B. O(log n)
C. O(n log n)
D. O(1)
Discuss
Save
Correct Option
Explanation
Binary search halves the search interval each step, producing a logarithmic worst-case time of O(log n).
2
Which ACID property of database transactions ensures that once a transaction has been committed its effects persist even after a crash?
A. Atomicity
B. Consistency
C. Isolation
D. Durability
Discuss
Save
Correct Option
Explanation
Durability guarantees that committed transaction results are permanently recorded and survive system failures.
3
Which of the following is NOT a necessary condition for a deadlock to occur in an operating system?
A. Mutual exclusion
B. Hold and wait
C. Circular wait
D. Preemption
Discuss
Save
Correct Option
Explanation
No-preemption (the inability to preempt resources) is a necessary condition; the presence of preemption prevents the deadlock condition, so preemption itself is not a required condition.
4
Which set of functional dependencies indicates a transitive dependency that would violate Third Normal Form (3NF)?
A. A -> B only
B. A -> B and B -> C
C. A -> B and C -> D
D. AB -> C
Discuss
Save
Correct Option
Explanation
A -> B and B -> C implies A -> C transitively, creating a transitive dependency that violates 3NF if the middle attribute is non-prime.
5
Which page-replacement algorithm is a practical approximation of Least Recently Used (LRU) using a reference bit and a circular buffer?
A. FIFO (First-In First-Out)
B. Optimal (Belady's)
C. Clock (Second-Chance) algorithm
D. Random replacement
Discuss
Save
Correct Option
Explanation
The Clock (Second-Chance) algorithm uses a reference bit and a circular pointer to approximate LRU without expensive timestamping, making it a common LRU approximation.
6
Which characteristic most closely describes a RISC (Reduced Instruction Set Computer) architecture?
A. Extensive microcode for complex instructions
B. Many complex addressing modes
C. Load/store architecture with fixed-length instructions
D. Variable-length CISC-style instruction set
Discuss
Save
Correct Option
Explanation
RISC architectures emphasize a load/store model and typically use fixed-length, simple instructions to enable efficient pipelining.
7
Which compiler phase is responsible for removing comments and insignificant whitespace and producing tokens?
A. Lexical analysis (scanner)
B. Syntax analysis (parser)
C. Semantic analysis
D. Code generation
Discuss
Save
Correct Option
Explanation
Lexical analysis (the scanner) groups characters into tokens and removes comments and irrelevant whitespace before parsing.
8
Which database isolation level is sufficient to prevent dirty reads (reading uncommitted changes)?
A. Read Uncommitted
B. Read Committed
C. Repeatable Read
D. Serializable
Discuss
Save
Correct Option
Explanation
Read Committed ensures a transaction only reads data that has been committed, thereby preventing dirty reads.
9
Which computational model recognizes exactly the class of regular languages?
A. Finite automaton (deterministic or nondeterministic)
B. Pushdown automaton
C. Turing machine
D. Linear bounded automaton
Discuss
Save
Correct Option
Explanation
Finite automata (DFAs/NFAs) accept exactly the regular languages; more powerful models accept strictly larger language classes.
10
Which Agile principle emphasizes people and their interactions over rigid processes and tool enforcement?
A. Individuals and interactions over processes and tools
B. Customer collaboration over contract negotiation
C. Responding to change over following a plan
D. Working software over comprehensive documentation
Discuss
Save
Correct Option
Explanation
One of the Agile Manifesto principles explicitly values individuals and their interactions above processes and tools to foster collaboration and adaptability.
