Data Structure & Algorithm-Quiz-1

Stack is also called as

• Last in first out

• First in last out

• Last in last out

• First in first out

Let the following circular queue can accommodate maximum six elements with the following data front = 2 rear = 4 queue = _______; L, M, N, ___, ___ What will happen after ADD O operation takes place?

• a) front = 2 rear = 5

  queue = ______; L, M, N, O, ___

• b) front = 3 rear = 5

  queue = L, M, N, O, ___

• c) front = 3 rear = 4

  queue = ______; L, M, N, O, ___

• d) front = 2 rear = 4

  queue = L, M, N, O, ___

Which of the following data structure is non linear type?

• string

• List

• stack

• graph

Identify the data structure which allows deletions at both ends of the list but insertion at only one end.

• Input restricted dequeue

• Output restricted dequeue

• Priority queues

• Linear queue

Consider the following data and specify which one is Preorder Traversal Sequence, Inorder and Postorder sequences.

S1: N, M, P, O, Q

S2: N, P, Q, O, M

S3: M, N, O, P, Q

• a) S1 is preorder, S2 is inorder and S3 is postorder

• b) S1 is inorder, S2 is preorder and S3 is postorder

• c) S1 is inorder, S2 is postorder and S3 is preorder

• d) S1 is postorder, S2 is inorder and S3 is preorder

Which of the following statement about binary tree is CORRECT?

• a) Every binary tree is either complete or full

• b) Every complete binary tree is also a full binary tree

• c) Every full binary tree is also a complete binary tree

• d) A binary tree cannot be both complete and full

For the tree below, write the pre-order traversal.

• 2, 7, 5, 2, 6, 9, 5, 11, 4

• 2, 7, 2, 6, 5, 11, 5, 9, 4

• 2, 5, 11, 6, 7, 4, 9, 5, 2

• 2, 7, 5, 6, 11, 2, 5, 4, 9

Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.

• push, pop

• pop, push

• insert, pop

• push, delete

What is the maximum height of an AVL tree with p nodes?

• a) p

• b) log(p)

• c) log(p)/2

• d) p⁄2

Name the function of double linked list operation

• InsertBegin

• DeleteBegin

• InsertEnd

• DeleteEnd