Data Structure Semester QP
Data Structure Semester QP
Attempt total 5 questions. First question is compulsory. Rest 4 questions do selecting from each
section.
(a) Explain the following:- 2*7=14
(1) what are the features of Algorithm.
(2) Define Data structure with an example.
(3) what is sparse Array with example?
(4) Transpose the matrix with an example.
(5) What is Binary Search Tree?
(6) One difference between binary tree and general Tree.
(7) Definition of Tree Traversal.
SECTION A
(b) Sort the given unsorted list through Bubble sort. Write its Algorithm also. MM14
13 88 9 42 32 33 19 54 26 4
OR
(c ) What is minimum cost spanning Tree and show through an example
SECTION B
(d) Write a program of Linked List – Insertion at beginning & end , Deletion at beginning and end.
MM14
OR
(e) Define stack data structure, its applications, its operations( with diagrams). Write algorithm
of its operations
SECTION C
(f) Make a binary search tree of a given list: 23, 9, 16, 30, 42, 10, 15, 58, 40, 20. Write all steps to
make binary tree. MM14
OR
(g) Define doubly linked list, its types with diagrams and its applications.
SECTION D
(h) Convert infix expression to postfix expression (A+B/C*(D+C)-F). Write algorithm also.
OR
(i) Evaluate the postfix expression 4,5,9,2,^,+,*,2,2,^,9,3,/,*,- with Algorithm. MM14