BY Author

Data Structure and Algorithm MCQs Test part 5

• BY admin
• October 12 , 2020
• 0 Comments
• 41 views
• • Facebook
  • Twitter
  • Google plus
  • Tumblr
  • Pinterest
  • Email
  Share

Welcome to your Data Structure and Algorithm MCQs Test part 5

1. When does top value of the stack changes

A) Before deletion

B) While checking underflow

C) At the time of deletion

D) After deletion

2. Which of the following statement is false?

A. Arrays are dense lists and static data structure.

B. Data elements in linked list need not be stored in adjacent space in memory

C. Pointers store the next data element of a list.

D. Linked lists are collection of the nodes that contain information part and next pointer.

3. Which of the following data structure is not linear data structure?

A) Arrays

B) Linked lists

C) Both of the above

D) None of the above

4. The disadvantage in using a circular linked list is …………………….

A) It is possible to get into infinite loop.

B) Last node points to first node.

C) Time consuming

D) Requires more memory space

5. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ...

A) Singly Linked List

B) Circular Linked List

C) Doubly Linked List

D) Linear Linked List

6. A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.

A) circular queue

B) random of queue

C) priority

D) dequeue

7. In a priority queue, insertion and deletion takes place at ………………

A) front, rear end

B) only at rear end

C) only at front end

D) any position

8. The time complexity of quick sort is …………..

A) O(n)

B) O(n2)

C) O(n log n)

D) O(log n)

9. Which of the following is an application of stack?

A) finding factorial

B) tower of Hanoi

C) infix to postfix conversion

D) all of the above

10. The data structure which is one ended is ………………

A) queue

B) stack

C) tree

D) graph

11. A list which displays the relationship of adjacency between elements is said to be

A) linear

B) non linear

C) linked list

D) trees

4 out of 3

Please fill in the comment box below.

Time is Up!