What is the time complexity of ternary search?

What is the output of the given C code?

Given a complete binary tree, the total number of nodes is 15. The height of the tree is:

Using the division method, in a hash table of size 157, at what position will the key with value 172 be placed?

What is the other name of the greedy best-first search?

What is the principle on which a queue data structure works?

Which one of the following is the recurrence equation for the worst case time complexity of the Quicksort algorithm for sorting n(≥ 2) numbers? In the recurrence equations given in the options below, c is a constant.

Consider the following pseudo code that uses a stack:

declare a stack of characters

while (there are more characters in the word to read)

{

read a character

push the character on the stack

}

while (the stack is not empty)

{

pop a character off the stack

write the character to the screen

}

What is the output for the input "abcde"?

The following three are known to be the preorder, inorder and postorder sequences of a binary tree. But it is not known which is which.
MBCAFHPYK
KAMCBYPFH
MABCKYFPH
Pick the true statement from the following.

An algorithm performs (logN)^1/2 find operations, N insert operations, (logN)^1/2 delete operations, and (logN)^1/2 decrease-key operations on a set of data items with keys drawn from a linearly ordered set. For a delete operation, a pointer is provided to the record that must be deleted. For the decrease-key operation, a pointer is provided to the record that has its key decreased. Which one of the following data structures is the most suited for the algorithm to use, if the goal is to achieve the best total asymptotic complexity considering all the operations?