STUPIDSID
1(a)
What are pointer variables ?How to declare a pointer variable?
5 M
1(b)
What are the various memory allocation techniques? Explain how dynamic allocation is done using malloc()?
10 M
1(c)
What is recursion? What are the various types of recursion?
5 M
2(a)
Define structure and union with suitable example
8 M
2(b)
Write a C program with appropriate structure definition and variable declaration to store information about an employee,using nested structures.Consider the following fields like: ENAME, EMPD, DOJ (Date, Month,Year) and Salary (Basic,DA,HRA)
12 M
3(a)
Define stack.Give the C implementation of push and pop function. Include check for empty and full conditions of stack.
8 M
3(b)
Write an algorithm to convert infix to post fix expression and apply the same to convert the following expression form in fix to post fix:
i) (a×b)+c/d
ii) ((( a/b(-e)+(d×e))-(a×c))
i) (a×b)+c/d
ii) ((( a/b(-e)+(d×e))-(a×c))
12 M
4(a)
Define linked list. Write a C program to implement the insert and delete operation on queue using linked list.
10 M
4(b)
Explain the different types of linked list with diagram.
10 M
5(a)
Define the following :
i) binary tree
ii) Complete binary tree
Almost complete binary tree
iv) Binary search tree
v) Depth of a tree.
i) binary tree
ii) Complete binary tree
Almost complete binary tree
iv) Binary search tree
v) Depth of a tree.
10 M
5(b)
In brief describe any five application of trees.
5 M
5(c)
What is thrcaded binary tree? Explain right and left in threaded binary tree.
5 M
6(a)
Write C function for the following tree traversals :
i) inorder
II) preorder
iii) postorder.
i) inorder
II) preorder
iii) postorder.
10 M
6(b)
Explain min and heap with example.
10 M
7(a)
implement Fibonacci with example.
10 M
7(b)
What is binomial heap? Explain the steps involved in the deletion of min element form a binomial heap.
10 M
8(a)
Explain AVL tree.
10 M
8(b)
Explain the red-black tree.Also,state its properties.
10 M
More question papers from Data Structures and Applications