Data Structures Class 12 MCQ, A data structure helps to store, organise and access data efficiently. In this chapter all the important MCQs related to data structure and stack operation are given below.
Data Structures Class 12 MCQ
1. A data structure is a way of __.
a. Organizing data
b. Storing data
c. Accessing data
d. All of the above
2. Which of the following popular data structures used in programming language.
a. Stack
b. Queue
c. Both a) and b)
d. None of the above
3. Which of the following data strucutre operates on a Last-In, First-Out (LIFO) principle.
a. Stack
b. Queue
c. Both a) and b)
d. None of the above
4. Which of the following sutable example of stack in real life.
a. Pile of clothes in an almirah
b. Bangles worn on wrist
c. Multiple chairs in a vertical pile
d. All of the above
5. While browsing the web, we move from one web page to another by accessing links between them. In order to go back to the last visited web page, we may use the back button on the browser. This is an example of?
a. Stack
b. Queue
c. Both a) and b)
d. None of the above
6. The end from which elements are added or deleted is called __.
a. END of the stack
b. TOP of the stack
c. CLOSING of the stack
d. All of the above
7. Which of the following fundament operation we can perform on the stack?
a. PUSH operation
b. POP operation
c. Both a) and b)
d. None of the above
8. _ adds a new element at the TOP of the stack.
a. PUSH operation
b. POP operation
c. Both a) and b)
d. None of the above
9. If stack is full and no element can be added is known as __.
a. Full stack
b. Overflow
c. TOP stack
d. None of the above
10. _ operation is used to remove the top most element of the stack.
a. PUSH operation
b. POP operation
c. Both a) and b)
d. None of the above
11. If the stack is empty and trying to delete an element is known as __.
a. Overflow
b. Empty stack
c. Underflow
d. All of the above
12. A stack is used to insert and delete elements in __ order.
a. LIFO
b. FILO
c. FIFO
d. None of the above
13. Example of Linear data structrues are _.
a. Stack
b. Queue
c. Both a) and b)
d. None of the above
14. _ data strucutres refer to the lists stored and accessed in a special way, Where LIFO (Last in first out) technique is followed.
a. Stack
b. Queue
c. Linked List
d. None of the above
15. What are the different searching algorithms in Data structre.
a. Linear Search
b. Binary Search
c. Both a) and b)
d. None of the above
16. Which data structure is mostly used in the recursive algorithm’s implementation?
a. Queue
b. Stack
c. Binary tree
d. Linked list
17. Stacks are __ lists where insertions and deletions take place only at one end.
a. LIFO (Last in First Out)
b. FIFO (First in First Out)
c. Both a) and b)
d. None of the above
Disclaimer: We have taken an effort to provide you with the accurate handout of “Data Structures Class 12 MCQ“. If you feel that there is any error or mistake, please contact me at anuraganand2017@gmail.com. The above CBSE study material present on our websites is for education purpose, not our copyrights. All the above content and Screenshot are taken from Computer Science Class 12 NCERT Textbook, CBSE Sample Paper, CBSE Old Sample Paper, CBSE Board Paper and CBSE Support Material which is present in CBSEACADEMIC website, NCERT websiteThis Textbook and Support Material are legally copyright by Central Board of Secondary Education. We are only providing a medium and helping the students to improve the performances in the examination.
Images and content shown above are the property of individual organizations and are used here for reference purposes only.
For more information, refer to the official CBSE textbooks available at cbseacademic.nic.in