Write an algorithm to generate the first 10 Fibonacci numbers.

Evaluate the following postfix expression using stack:



Show every step of the evaluation process.

Write the postfix form of the expression:



Apply BFS to the following graph and list the vertices in the order they would be visited:

<img src='./qimages/13928-1d.jpg'>

Traverse the tree as given below in preorder, inorder and postorder and list the vertices in the order they would be visited in each traversal scheme

<img src='./qimages/13928-1e.jpg'>

Apply 2-way merge sort to the following data:

7 12 14 5 9 8 6 3

Give an example of a ternary operator in C-language.

Apply a single source (Node shortest path algorithm to the following weighted graph:

<img src='./qimages/13928-2a.jpg'>

Show how an array A is stored in column major order.

Let P be the pointer to the first node in a singly linked list and X be an arbitrary node in this list. Write an algorithm to delete this node from the list.

Explain the meaning of the following statements in C-language

Px

y

y

y

What is a heap Perform bottom-up construction of a heap for the list

3 9 7 4 5 8

Explain the following terms:

Seek time

Latency time

Transfer time

What is a binary search tree? Show the result of inserting 7 into an initially empty binary search tree.

Answer the following questions:

What are the differences between a graph and a tree?

Write the syntax and meaning of dynamic memory allocation functions in C-language.