Same chapter3 marksDifficulty: Medium
Write the algorithm for deletion from a linear queue held in an array.
Queues
3 marksDifficulty: Medium
What is a queue? State two differences between a stack and a queue.
Original Khojo Papers practice question — not from a past board paper.
Answer
A queue is a linear data structure in which insertion takes place at the rear and deletion at the front, so the first element added is the first removed. A stack is last-in-first-out while a queue is first-in-first-out, and a stack uses one end for both operations while a queue uses two.
No citable source has been recorded for this record. Treat it as practice material, not as fact.
Explanation
A printer spooler is a queue; the browser back button is a stack.
Related questions
From the same topic and chapter, at a similar level.
Same chapter3 marksDifficulty: Medium
A linear queue held in an array of capacity 5 has front = 2 and rear = 4. How many elements does it hold, and can a further element be inserted?
Queues
Same chapter3 marksDifficulty: Medium
What is a circular queue and what problem does it solve?
Queues
Same subject3 marksDifficulty: Medium
Write a recursive Java method to compute the factorial of a non-negative integer n.
Recursion
Same subject3 marksDifficulty: Medium
State and verify the absorption law X + X·Y = X using a truth table.
Boolean Algebra
Same subject3 marksDifficulty: Medium
Convert the Boolean expression F(A, B, C) = Σ(1, 3, 5) into its canonical sum of products form.
Boolean Algebra