1000+ Top Data Structure MCQ Questions and Answers [ SET - 6 ] | Data Structure Multiple Choice Questions and Answers pdf Free Download

 

1. The main advantage of the array data structure is ..................

A) Elements of an array cannot be sorted
B) Easier to access the elements in an array
C)  Elements of mixed data types can be stored
D) All of the above

ANSWER= (B) Easier to access the elements in an array

 

2. A linked list is made up of a set of objects known as

A) nodes
B) arrays
C)  entities
D)  instances

ANSWER= (A) nodes

 

3.  A complete directed graph of 5 nodes has.. 

A) 5
B) 10
C) 20
D) 25

ANSWER= (B) 10

 

4. A double linked list contains reference to _____

A) previous node
B) next node
C) current node
D) both a & b

ANSWER= (D) both a & b

 

5. The minimum number of edges in a connected cyclic graph on n vertices is

A) n-1
B) n
C) n+1
D)  none of the above

ANSWER= (B) n

 

6. A vertex with degree one in a graph is called 

A) leaf 
B) pendant vertex
C) end vertex
D) None of these

ANSWER= (B) pendant vertex

 

7.…………… is not the component of data structure.

A) operations
B) storage structures
C) algorithms
D) none of above

ANSWER= (D) none of above

 

8. Which of the following data structure can’t store the non-homogeneous data elements?

A)  arrays
B)  records
C)  pointers 
D) stacks

ANSWER= (A) arrays

 

9.  When the push operation is performed on stack the value of TOS will be ______

A) decrement
B)  increment
C) one
D) none of these

ANSWER= (B) increment

 

10. A machine took 200 sec to sort 200 names, using bubble sort. In 800 sec, it can approximately sort

A) 400 names
B) 800 names
C) 750 names
D) 800 names

ANSWER= (A) 400 names

 

11. The number of binary trees with 3 nodes which when traversed in post-order gives the sequence A,B,C is

A) 3
B) 9
C) 7
D) 5

ANSWER= (D) 5

 

12. A queue where all elements have equal priority is a

A) ILFO data structure
B) LILO data structure
C) FIFO data structure
D) LIFO data structure

ANSWER= (C) FIFO data structure

 

13.A file that is only read by a program is known as ____

A) Input file
B)  Temporary file
C) Work file
D)  Input/output file

ANSWER= (A)  Input file

 

14. Which of the following is not an entity?

A)  Book
B) Student
C) Employee
D)  Roll number

ANSWER= (D) Roll number

 

15. A purpose in algorithm needs to describe___.

A) Program Execution
B) Processing
C) Requirements
D)  None of the above

ANSWER= (B) Processing

 

16.  Memory allocation at the compile time is known as

A) Static memory allocation
B) Dynamic memory allocation
C) Paging
D) None of the above

ANSWER= (A)  Static memory allocation

 

17. If a binary tree satisfies shape and order property, it is known as

A)  Rooted tree
B)  Heap
C) Sequential search tree
D) Binary search tree

ANSWER= (B) Heap

 

18. Which of the following is not the part of ADT description ?

A) data
B) operations
C) both of the above
D) none of the above

ANSWER= (D) none of the above

 

19.  Which of the following is non-liner data structure?

A)  stacks
B) list
C)  strings
D)  trees

ANSWER= (D) trees

 

20. The total number of elements in a stack at a given point of time can be calculated from the value of______.

A) overflow
B) top
C) queues
D) underflow

ANSWER= (B) top

 

21. Stack is useful for implementing

A) recursion
B) breadth first search
C) depth first search
D) both (a) and (c)

ANSWER= (D) both (a) and (c)

 

22. The average number of comparisons performed by the merge sort algorithm, in merging two sorted lists of length 2 is

A) 8/3
B) 8/5
C) 11/7
D)  11/6

ANSWER= (A)  8/3

 

23. Which of the following sorting algorithm is the slowest ?

A) Bubble sort
B)  Heap sort
C) Shell sort
D) Quick sort

ANSWER= (A) Bubble sort

 

24. Worst space complexity of stack data structure is

A) o(log(n))
B) o(1)
C)  n/a
D)  o(n)

ANSWER= (A) o(n)

 

25.An enqueue operation adds an element

A) At any position in the queue
B) To the front of the queue
C) To the rear of the queue
D) None of above

ANSWER= (C) To the rear of the queue

 

26. Memory allocation at the runtime is known as

A) Static memory allocation
B) Dynamic memory allocation
C) Paging
D) None of the above

ANSWER= (B)  Dynamic memory allocation

 

27. With an array-based stack, the algorithm for push is

A) Increment top and add item to the new top location
B) Add item to the top location and then increment top
C) Return the top item and increment top
D)  Return the top item and decrement top

ANSWER= (A) Increment top and add item to the new top location

 

28. What happens when the stack is full and there is no space for a new element, and an attempt is made to push a new element?

A)  overflow
B) underflow
C)  top
D) none of the above

ANSWER= (A) overflow

 

29. The maximum degree of any vertex in a simple graph with n vertices is

A) n
B)  n-1
C) n+1
D) 2n-1

ANSWER= (B)  n-1

 

30. Which f the following need not be a binary tree ?

A) Search tree
B) Heap
C) AVL-Tree
D) B-Tree

ANSWER= (D) B-Tree

Friends if you like this post,kindly comment bellow and do share your responce.Thank You for Visiting.