CP-II

In a linked list , insertion can be done at ......

• Beginning

• Middle

• End

• All of the above

A double linked list has .......pointers with each node.

• 0

• 1

• 2

• 3

.......... is not the operation that can be performed on queue.

• Traversal

• Retrieval

• Deletion

• Insertion

The quick sort algorithm exploit ..........technique.

• Overflow

• Backtracking

• Dynamic Programming

• Divide and Conquer

The value of REAR is increased by 1 when .....

• An element is merged in a queue

• An element is added in a queue

• An element is traversed in a queue

• An element is deleted in a queue

...... is the term used to delete an element from the stack.

• push

• pull

• pop

• All of the above

......... is the term used to insert an element into stack.

• push

• pull

• pop

• All of the above

Which is the following data structure is non-linear type

• graph

• stack

• lists

• Non of the above

A technique for direct search is .....

• Hashing

• Tree Search

• Binary Search

• Linear Search

A full binary tree with n leaves contains .......nodes

• n-1

• 2n-1

• 3n-1

• n