The result evaluating the postfix expression 10 5 + 60 6 / * 8 – is

The number of comparisons done by sequential search is ________

What type of sorting algorithm is the Shell sort algorithm?

Which of the following sorting algorithms has the lowest worst-case time complexity?

A ___________ tree is a tree where for each parent node, there is only one associated child node

Which of the following statements about a simple graph is correct?

What is the difference between a normal (dense) array and a sparse array?

Choose the incorrect statement about exponential search from the following.

Match the algorithms with their time complexities :

Algorithms :

(P) Towers of Hanoi with n disks

(Q) Binary search given n sorted numbers

(S) Heap sort given n numbers at the worst case

(T) Addition of two n x n matrices

Time Complexity :

(i) O(n²)

(ii) O(n log n)

(iii) O(2ⁿ)

(iv) O(log n)

What is the pseudocode to compute the shortest path in Dijkstra's algorithm?