B.C.A./B.B.A. (Semester-III) EXAMINATION, 2018
DATA STRUCTURE USING-C
(2013 PATTERN)
Time Three Hours Maximum Marks 80
N.B. All questions are compulsory.
(ii All questions carry equal marks.
(iii Assume suitable data if necessary.
1. Attempt any eight of the following
State the types of graph.
Define Data Structure.
How to measure performance of an Algorithm.
How to calculate count of Best, Worst and Average case
What is Ancestor of Node
What is ADT for an array
What is searching
What are the operations we can perform on queue
State the difference between Stack and Linked List.
What is Pointer to Pointer
[5363]-302 2
2. Attempt any four of the following
What is the difference between array and structure
Explain BFS traversing technique with an example.
Sort the following data by using bubble sorts techniques
56, 23, 98, 67, 87, 45, 77, 99
Write a program for addition of two polynomials.
Write a function to merge given two singly linked lists.
3. Attempt any four of the following
Explain quick sort technique with an example.
Explain different types of Dynamic Memory Allocation Functions.
Explain different types of Asymptotic notation in detail.
Write a function to reverse a singly linked list.
Explain Prim's algorithm for minimal spanning tree.
4. Attempt any four of the following
Write a function to create and display circular singly linked
list.
What is Graph Explain Adjacency list of graph.
Write a function to count the number of leaf and non-leaf
nodes in a tree (Recursive functions).
[5363]-302 3 P.T.O.
What is an Algorithm Explain its characteristics in detail.
Write a function to check whether a given string is palindrome
or not (use stack).
5. Attempt any four of the following
Write an algorithm for evaluation of prefix expression.
Write a function to remove last node of singly linked list and
add it at the beginning of linked list.
Sort the following data by using Insertion sort techniques
87, 45, 12, 90, 67, 54, 34, 23, 60
What is circular queue Explain it with an example.
Write the recursive functions to traverse a tree by using
inorder(), preorder() and postorder() traversing techniques.