1. Write the output of the following segments of code. Justify your answers with short explanations.

(a) int main()
{
int n x
while
x
n/
printf("%d", int
int
printf("%d a
return int
int i
int i 20;
printf("%d
",
printf("%d",
return int
int
for(i i i
for j j
printf("%d",
printf("
return int
int x
printf("%d", x
return

2.(a) Write a program in to compute the factorial of the input integer using recursion.

(b) Write preorder traversal of the following binary tree:

<br> <img src='./qimages/12215-2b.jpg'>

3.(a) Write any two differences between a function and a macro.

(b) Write a function in to check whether the input string consists of at least one vowel in lower Case.

4.(a) Explain the operations that-can be performed on a Queue.
Evaluate the following postfix expression:
6, ­

5.(a) Write the syntax for defining a node of a Doubly Linked List containing floating point data. Also write a function create_node() which creates a new node and returns the pointer to it. Define the term 'Binary Search Tree'. List the operations that can be performed on a Binary Search Tree.