1. Arrays are best data structures

A) for relatively permanent collections of data

B) for the size of the structure and the data in the structure are constantly changing

C) for both of above situation

D) for none of above situation

2. 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

3. 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

4. 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

5. 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

6. 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

7. The time complexity of quick sort is ..............

A) O(n)

B) O(n2)

C) O(n log n)

D) O(log n)

8. 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

9. The data structure which is one ended is ..................

A) queue

B) stack

C) tree

D) graph

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

A) linear

B) non linear

C) linked list

D) trees

1. Arrays are best data structures

A) for relatively permanent collections of data

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

D) None of the above

3. The disadvantage in using a circular linked list is .........................

A) It is possible to get into infinite loop.

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

C) Doubly Linked List

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

D) dequeue

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

D) any position

7. The time complexity of quick sort is ..............

C) O(n log n)

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

D) all of the above

9. The data structure which is one ended is ..................

B) stack

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

A) linear

A) for relatively permanent collections of data

B) for the size of the structure and the data in the structure are constantly changing

C) for both of above situation

A Linked List data structure that starts with a head reference to the first node, and each node contains a 'next' field that points to the next node. The final node has a 'next' value of null. (Photo credit: Wikipedia) |

D) for none of above situation

2. 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

3. 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

4. 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

5. 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

6. 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

7. The time complexity of quick sort is ..............

A) O(n)

B) O(n2)

C) O(n log n)

D) O(log n)

8. 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

9. The data structure which is one ended is ..................

A) queue

B) stack

C) tree

D) graph

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

A) linear

B) non linear

C) linked list

D) trees

#### Answers:

1. Arrays are best data structures

A) for relatively permanent collections of data

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

D) None of the above

3. The disadvantage in using a circular linked list is .........................

A) It is possible to get into infinite loop.

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

C) Doubly Linked List

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

D) dequeue

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

D) any position

7. The time complexity of quick sort is ..............

C) O(n log n)

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

D) all of the above

9. The data structure which is one ended is ..................

B) stack

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

A) linear