50+ Important Data Structure MCQ for Class 12

50+ Important Data Structure MCQ for Class 12

 

1. ___________________ is a way to represent data in memory.

a) Data Handling

b) Data Structure

c) Data Dumping

d) Data Collection

b) Data Structure

 

 

2. Python built-in data structures are

a) integer,float,string

b) list,tuple,dictionary,sets

c) math,pyplot

d) All of the above

b) list,tuple,dictionary,sets

 

3. Data structure can be of two type’s namely___________

a) Simple and Compound

b) Simple and Nested

c) Sequential and random

d) All of the above

a) Simple and Compound

 

 

4. Array or linear list comes under the category of______

a) Simple Data Structure

b) Compound Data Structure

c) random

d) None of these

a) Simple Data Structure

 

 

5. Compound Data structure can be ______ & _______

a) Sequential and random

b) Simple & Nested

c) Linear & Non Linear

d) Simple and Linear

c) Linear & Non Linear

 

 

6. The examples of Linear Data Structures are

a) Stacks, Queues, Linked list

b) int, float, complex

c) Operators, tokens, punctuators

d) All of the above

a) Stacks, Queues, Linked list

 

 

7. Stacks follows____________ order

a) FIFO (First In First Out )

b) LIFO (Last In First Out)

c) Random

d) All of the above

b) LIFO (Last In First Out)

 

 

8. Queue follows____________ order

a) FIFO (First In First Out )

b) LIFO (Last In First Out)

c) Random

d) None of the above

a) FIFO (First In First Out )

 

9. Main Operations in Stacks are called

a) Insertion and deletion

b) append and insertion

c) Push and Pop

d) append and deletion

c) Push and Pop

 

 

10. Main Operations in Queue are called

a) Insertion and deletion

b) append and insertion

c) Push and Pop

d) append and deletion

a) Insertion and deletion

 

 

11. In Stack Insertion and deletion of an element is done at single end called ________

a) Start

b) Last

c) Top

d) Bottom

c) Top

 

 

12. In stack we cannot insert an element in between the elements that are already inserted.

a) True

b) False

a) True

 

 

13. The process of visiting each element in any Data structure is termed as ____________

a) Visiting

b) Searching

c) Traversing

d) Movement

c) Traversing

 

 

14. While implementing Stack using list when we want to delete element we must use pop function as__________

a) list.pop(pos)

b) list.pop(0)

c) list.pop()

d) list.push()

c) list.pop()

 

 

15. Arranging elements of a data structure in increasing or decreasing order is known as_________

a) Searching

b) Arrangement

c) Sorting

d) Indexing

c) Sorting

 

 

16. Searching of any element in a data structure can be done in 2 ways _________ and ________

a) Sequential and random

b) linear and non linear

c) linear and binary

d) sequential and binary

c) linear and binary

 

 

17. _________ is an example of nonlinear data structure

a) Stack

b) Queue

c) Sorting

d) Tree

d) Tree

 

 

18. In a stack, if a user tries to remove an element from empty stack it is called _________

a) Underflow

b) Empty

c) Overflow

d) Garbage Collection

a) Underflow

 

19. What is the value of the postfix expression 6 3 2 4 + – *

a) 1

b) 40

c) 74

d) -18

d) -18

 

 

20. If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, in what order will they be removed?

a) ABCD

b) DCBA

c) DCAB

d) ABDC

b) DCBA

 

21. Which of the following data structure is linear type?

a) Stack

b) Array

c) Queue

d) All of the above

d) All of the above

 

 

22. The postfix form of the expression (A+ B)*(C*D- E)*F / G is?

a) AB + CDE * – * F *G /

b) AB+ CD*E – FG /**

c) AB + CD* E – F **G /

d) AB + CD* E – *F *G /

b) AB+ CD*E – FG /**

 

 

23. The postfix form of A*B+C/D is?

a) *AB/CD+

b) AB*CD/+

c) A*BC+/D

d) ABCD+/*

b) AB*CD/+

 

 

24. Which of the following statement(s) about stack data structure is/are NOT correct?

a) Stack data structure can be implemented using linked list

b) New node can only be added at the top of the stack

c) Stack is the FIFO data structure

d) The last node at the bottom of the stack has a NULL link

c) Stack is the FIFO data structure

 

Leave a Reply

Your email address will not be published. Required fields are marked *