Start learning →

MCA Stacks and Queues — practice questions

Explore 30 free Stacks and Queues questions in MCA Computer Science. Open each question or exercise to read its content, reference answers and available explanation.

Practise Stacks and Queues with Quill →

Stacks and Queues questions and exercises with answers

Showing questions 1–30 of 30.

A stack follows which principle?Read the answer and worked solution →A queue works on which principle?Read the answer and worked solution →The end of a stack where elements are added or deleted is called the:Read the answer and worked solution →The two fundamental operations performed on a stack are POP and:Read the answer and worked solution →In a queue, new items are added at the end called the:Read the answer and worked solution →In a queue, items are removed from the end called the:Read the answer and worked solution →Stack and queue are described as two popular kinds of:Read the answer and worked solution →Adding an element to a stack that is already full raises an exception called:Read the answer and worked solution →Deleting from an empty stack raises an exception called:Read the answer and worked solution →Which queue operation inserts a new element at the rear end?Read the answer and worked solution →Which queue operation removes one element from the front?Read the answer and worked solution →Which operation views the front element without removing it?Read the answer and worked solution →A data structure in which elements are organised in a sequence is called:Read the answer and worked solution →REAR is also known by which other name in a queue?Read the answer and worked solution →FRONT is also known by which other name in a queue?Read the answer and worked solution →Which stack operation removes the topmost element?Read the answer and worked solution →Reversing a string is easily done by putting its characters in a:Read the answer and worked solution →The history of browsed pages in a web browser is maintained as a:Read the answer and worked solution →Which structure is used to handle the matching of parentheses?Read the answer and worked solution →Print requests are sent to the printer one by one on which basis?Read the answer and worked solution →Vehicles at a highway toll booth are served following which principle?Read the answer and worked solution →In a queue, the element removed first is the one that has been in it:Read the answer and worked solution →Stack or queueRead the answer and worked solution →Match the operationRead the answer and worked solution →Overflow or underflowRead the answer and worked solution →Order what leaves the stackRead the answer and worked solution →Catch the stack applicationsRead the answer and worked solution →True or false about queuesRead the answer and worked solution →One word is wrongRead the answer and worked solution →Stacks and queues bingoRead the answer and worked solution →

Worked practice questions

A stack follows which principle?

  1. Last in first out
  2. Least in first out
  3. Large in first out
  4. Level in first out
Show answer and solution

Correct answer: A. Last in first out

1. Elements enter and leave a stack at the same end. 2. That forces a particular order of removal. 3. A stack follows the Last-In-First-out principle. 4. So the answer is last in first out. _Source: syllabus Computer Science, Ch 3 'Stack' and Ch 4 'Queue'_

Open this question →

A queue works on which principle?

  1. Full in first out
  2. First in first out
  3. Fast in first out
  4. Fixed in first out
Show answer and solution

Correct answer: B. First in first out

1. A queue adds at one end and removes at the other. 2. That means arrival order is preserved. 3. A queue works on the First-In-First-Out principle. 4. So the answer is first in first out. _Source: syllabus Computer Science, Ch 3 'Stack' and Ch 4 'Queue'_

Open this question →

The end of a stack where elements are added or deleted is called the:

  1. TOP
  2. TAP
  3. TIP
  4. TAB
Show answer and solution

Correct answer: A. TOP

1. A stack has only one usable end. 2. That end has a name. 3. The end from which elements are added or deleted is called TOP of the stack. 4. So the answer is TOP. _Source: syllabus Computer Science, Ch 3 'Stack' and Ch 4 'Queue'_

Open this question →

How to practise

  1. Choose a Stacks and Queues question and try to work out your answer.
  2. Open the question to check the correct answer and read its worked solution.
  3. Continue in the app for bite-sized lessons, explanations and review with Quill. You can start without creating an account.

More Computer Science topics

Sorting and SearchingDatabase ConceptsStructured Query LanguageComputer ScienceOlympiad Computer ScienceProgrammingProgramming LanguagesSoftware Development