Same chapter3 marksDifficulty: Medium
Write the algorithm for deletion from a linear queue held in an array.
Queues
3 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?
Original Khojo Papers practice question — not from a past board paper.
Answer
It holds three elements, and no further element can be inserted.
No citable source has been recorded for this record. Treat it as practice material, not as fact.
Explanation
The number of elements is rear − front + 1 = 3. The rear is already at index 4, the last position of the array, so a linear queue reports overflow even though the two positions in front of the queue are free. That waste is exactly what a circular queue removes.
Related questions
From the same topic and chapter, at a similar level.
Same chapter3 marksDifficulty: Medium
What is a circular queue and what problem does it solve?
Queues
Same chapter3 marksDifficulty: Medium
What is a queue? State two differences between a stack and a queue.
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