Unit 1

Sr. Question Marks

No.
1. Explain Pointers in C with examples 8
2. Explain Pointers in C with examples 6
3. Write C program to calculate average using Array. 7
4. Write C program to calculate average using Array. 6
5. Write C program to calculate Factorial using Recursion. 7
6. Write C program to calculate Factorial using Recursion. 6
7. Explain Data Types in C with example 8
8. Explain control structures in C with relative examples. 9
9. What is bound checking in an array? Explain with example 6
10. What is recursion? Explain with example. 6
11. What is call by value & call by reference in the functions. Explain with example. 8
12. What is space complexity & Time complexity explain with example. 8
13. What is space complexity & Time complexity explain with example. 9
14. What is time complexity? Explain with example. 6

Unit 2
Sr. Question Marks
No.
1. Apply Merge Sort on: 38 27 43 3 9 82 10 8
2. Write C program for Bubble Sort. 7
3. Write C program for Insertion Sort. 7
4. Apply Quick Sort on: 54 26 93 17 77 31 44 55 20 9
5. Write C program for Binary Search. 7
6. What is linear search? Explain with example. 7
7. Following are the elements in array. 8/9
65 20 10 55 32 12 50 99
Search element is 12. Explain searching mechanism with Linear search example.
8. Write a program for Linear Search using array. 6/7
9. Following are the elements in array. 9/8
10 14 19 26 27 31 33 35 42 44
Search element is 31. Explain searching mechanism with Binary search example.
10. Following are the elements in array. 6/7
7 4 5 2
Sort the elements in the array using bubble sort.
11. Following are the elements in array. 8/9
42 1 84 1 77 2 53
6 2 6
Sort the elements in the array using Selection sort.
12. Following are the elements in array. 8/9
4 3 2 10 1 1 5 6
 2
Sort the elements in the array using Insertion sort.
13. Following are the elements in array. 9
10 21 17 3 44 11 654 123
4
Sort the elements in the array using Radix sort.
14. Following are the elements in array. 8
4 10 3 5 1
Sort the elements in the array using Heap sort. (heapify)

Unit 3
Sr. Question Marks
No.
1. Write C program for array implementation of Stack(Menu Driven). 7
2. Convert infix expression to postfix expression 7/8/9
(A+B)*(C-D)
3. Evaluate postfix expression: 7/8
5 3 + 6 2 / * 3 5 * +
4. Write C program for array implementation of Queue(Menu Driven). 8
5. Convert infix expression to postfix expression 8/9
A+(B*C-(D/E-F)*G)*H
6. Evaluate postfix expression: 6
5 3 + 8 2 - *
7. Check whether following expression has balanced symbols or not with stack 8
( A + B )) * ( C - D ))
8. Convert infix expression to prefix expression 8/9
(A-B/C)*(A/K-L)
9. State the applications of stack & queue 6
10. What is circular queue & why it is preferred over normal queue? State with 8
example.
11. What is priority queue? State with an example. 6/7

Unit 4
Sr. Question Marks
No.
Write C function to perform Insertion on SLL 8
a)insertAtBegining b)insertAtEnd
Write C function for Deletion from SLL 8
a) removeBegining b)removeEnd
Explain different types of Linked List. 6/7
Write C function to perform Insertion on DLL 8
a)insertAtBegining b)insertAtEnd
 Write C function for Creating & Displaying elements from SLL 6
Write C function for Deletion from DLL 8
removeBegining b)removeEnd
Write C function for Deletion from CLL 8
removeBegining b)removeEnd
Write C function to perform Insertion on CLL 8
a)insertAtBegining b)insertAtEnd

Unit 5
Sr. Question Marks
No.
1. With the help of following Tree find out 1. Siblings 2. Degree of each Node 3. 8/9
Internal Nodes 4. Level of each node 5. Height of each node 6. Depth of each
node

2. Explain following with examples. 8

a. Subtree
b. Forest
3. Explain in detail about tree traversal and construct tree for the given 9
postorder ACEDBHIGF. Also find its inorder and preorder
4. Develop a function to insert node into BST. Constrcut BST for the following 9
set of elements
60,12,56,23,63,1,6
5. Construct a tree from the given post-order 6
Post-order of tree is : {8,4,5,2,6,7,3,1}
Also find its in-order
6. Explain basic terminologies used in Trees 9
7. Explain two methods of representing tree data structure with examples. 8
8. What are the types of binary tree. Explain in detail. 6/7
9. What are the methods of Binary tree representations? 6
 10.What are the methods of tree traversing. Explain with example. 9
11.Write the steps of following operations of BST 9
a. Search
b. Insertion
c. Deletion
12.Write the steps of Search operation in BST with one example 6
13.Write the steps of Insertion operation in BST with one example 6
14.Write the steps of Deletion operation in BST with one example 6

Unit 6
Sr. Question Marks
No.
1. Explain in detail about BFS using queue 9
2. Explain in detail about graph representation using sparse matrix 9
3. Explain in detail about DFS using stack for the given graph along with its 9
functions
(Figure Pending)
4. Discuss about how graph is represented? 6
5. Explain following terminologies in graph theory 6
a. Connected graph
b. Complete graph
c. Weighted graph
6. What is graph? What are the types of Grpah? 7
7. What are the terms used in Graph Theory? Explain them. 9