Data Structure Using C 22317 Important Questions MSBTE Exam
1.Attempt any FIVE of the following: 10
1. Define the term algorithm.
2. List any 4 applications of queue.
3. List any four operations on data structure.
4. Enlist queue operations condition.
5. Define : (i) Binary tree (ii) Binary search tree
6. Show the memory representation of stack using array with the help of a diagram.
7. Define given two types of graph and give example. (i) Direct graph (ii) Undirected graph
8. Differentiate between linear and non-linear data structures on any two parameters.
9. Describe following terms w.r.to tree :
(i) leaf node
(ii) level of node
10. Differentiate between stack and queue. (any two points)
11. Describe undirected and directed graph with suitable example.
12. Define the terms : linear data structure and non-linear data structure.
13. Convert infix expression into prefix expression : (A + B)*(C / G) + F.
14. Show the memory representation of stack using array with the help of a diagram
2. Attempt any THREE of the following : 12
(a) Describe working of linear and binary search with example.
(b) Describe the concept of linked list with the terminologies : node, next pointer, null pointer and empty list.
(c) Describe queue full and queue empty operation conditions on linear queue with suitable diagrams.
(d) Differentiate between general tree and binary tree. (any four points)
(e) Explain indegree and outdegree of a graph with example.
3. Attempt any THREE of the following : 12
(a) Write ‘c’ program for deletion of an element from an array.
(b) Explain time and space complexity with an example.
(b) Convert following expression into postfix form. Give stepwise procedure.
A + B ↑ C * (D / E) – F / G
(c) Find the position of element 29 using binary search method in an array ‘A’ given below. Show each step.
A = {11, 5, 21, 3, 29, 17, 2, 43}
(d) Give adjacency list and adjacency matrix for given graph :
4. Attempt any THREE of the following : 12
(a) Describe working of bubble sort with example.
(b) Construct a binary search tree for following elements :
30, 100, 90, 15, 2, 25, 36, 72, 78, 10 show each step of construction of BST.
(c) Write an algorithm to count number of nodes in singly linked list.
(d) Write a program in ‘C’ to insert and delete an element in a linear queue.
(e) Describe circular linked list with suitable diagram. Also state advantage of circular linked list over linear linked list.
(f) Differentiate between tree and graph. (Any 4 points)
(g) Compare Linked List and Array. (any 4 points)
(h) Show the effect of PUSH and POP operations on the stack of size 10. PUSH(10) PUSH(20) POP PUSH(30)
5. Attempt any TWO of following : 12
(a) Write algorithm for performing push and pop operations on stack.
(b) For given binary tree write in-order, pre-order and post-order traversal.
(c) Write an algorithm to insert an element at the beginning and at end of linked list.
6. Attempt any TWO of the following : 12
(a) Describe working of selection sort method. Also sort given input list in ascending order using selection sort input list – 55, 25, 5, 15, 35.
(b) Define the term recursion. Write a program in C to display factorial of a entered number using recursion.
(c) Describe procedure to insert and delete an element from singly linked list using diagram.
(d) Consider the graph given in following figure and answer given questions.
(1) All simple path from 1 to 5
(2) In-degree of and out-degree of4
(3) Give adjacency matrix for the given graph.
(4) Give adjacency list representation of the given graph.