The array is as follows: 1,2,3,6,8,10. At what time the element 6 is found? (By using linear search(recursive) algorithm)

Apply Quick sort on a given sequence 7 11 14 6 9 4 3 12. What is the sequence after first phase, pivot is first element?

The keys 12, 18, 13, 2, 3, 23, 5 and 15 are inserted into an initially empty hash table of length 10 using open addressing with hash function h(k) = k mod 10 and linear probing. What is the resultant hash table?

The inorder and preorder traversal of a binary tree are d b e a f c g and a b d e c f g, respectively. The postorder traversal of the binary tree is _________.

Given two vertices in a graph s and t, which of the two traversals (BFS and DFS) can be used to find if there is path from s to t?

What is the result of the given postfix expression? abc*+ where a=1, b=2, c=3.

Evaluate the postfix expression ab + cd/- where a=5, b=4, c=9, d=3.

Consider the following rooted tree with the vertex P labeled as root ( Check Image)

The order in which the nodes are visited during in-order traversal is

The Breadth First Search algorithm has been implemented using the queue data structure. One possible order of visiting the nodes of the following graph is