List of practice Questions

What is the value of the postfix expression: $6\ 12\ 2\ 4\ +\ /\ *\ ?$

Suppose you are given pointers to the first and the last nodes of a singly linked list, which one of the following operations would require traversal of the linked list?

What is the time complexity of the Bellman-Ford single-source shortest path algorithm on a completely connected weighted graph of $n$ vertices?

Consider the following C function foo(int n). How many times does foo(2) get called on making the call foo(5)?
C Function:

float foo(int n){
    if(n <= 2) return 1;
    else return (2*foo(n-1) + 3*foo(n-2));
}

Which one of the following recurrence relations best represents the time complexity of the binary search algorithm running on an ordered array of $n$ elements?

How many null links does an arbitrary binary tree with $n$ nodes have?