Q1. Define the term complexity. Describe Big(O) notation with an illustration.
Q2. Write down the prefix and postfix of the given infix:
A+(B*C-(D/E↑F)*G)*H
Q3. When is a directed graph a strongly joined graph? Is the directed graph described below is a strongly connected? Give some reasons. Exhibit how this graph would look if represented by the adjacency matrix.
Q4. Why B+ Tree is considered a better structure as compared to the B Tree for implementation of an indexed sequential file?
Q5. How to declare an array of N pointers to the functions returning pointers to functions returning pointers to characters?
Q6. Illustrate the meaning of threaded binary tree? How null pointers are substituted in it?
Q7. Describe how address computation is done in the row major ordering for a two dimensional array. As well generalize it for n dimensions.