Data Structures and Algorithms

What condition should be checked before the deletion operation from the Queue?

• Overflow

• Underflow

• Front value

• Rear value

The postfix form of the expression (A+ B)*(C*D- E)*F / G is

• AB+ CD*E - FG /**

• AB + CD* E - F **G /

• AB + CD* E - F G /

• AB + CDE - F *G /

What is the result of the following operation
Top (Push (S, X))

• S

• NULL

• X

• ERROR

From the given AVL tree which node is unbalanced

• The unbalanced node is 4

• The unbalanced node is 8

• The unbalanced node is 12

• All are balanced

what will be the peek() element after these operations

operations are:

1)pop()

2)push(7)

3)push(10)

4)push(8)

5)pop()

• 5

• 10

• 7

• stack will be empty can't do peek operation

what will be the order after breadth first search traversal for the given graph and let 6 be the source node

• 6-4-5-3-2-1

• 6-5-4-3-2-1

• 6-4-3-5-2-1

• 6-3-2-1-4-5

what will be the order after the depth first search traversal for the given graph let 0 be the source node

• 0-1-2-4-3

• 0-2-3-1-4

• 0-1-2-3-4

• 0-3-2-4-1

What will be the front and rear after the following operations

1)dequeue()

2)enqueue(10)

3)enqueue(12)

4)dequeue()

5)dequeue()

• front=7 and rear=10

• front=6 and rear=9

• front=2 and rear =12

• front=9 and rear=12

What will be the inorder traversal of the given tree?

• B-D-E-A-C-G-F

• D-B-E-A-F-C-G

• D-B-A-E-F-C-G

• A-B-D-E-C-F-G

Which element can replace after deletion of node 3 in the given bst tree?

• 4 or 7

• 1 or 4

• 7 or 6

• 1 or 6