DATA STRUCTURES & PROGRAMMING METHODOLOGY (CS-207)
Time: 03 Hours Maximum Marks: 60
Instruction to Candidates:
1) Section - A is compulsory.
2) Attempt any Four questions from Section - B.
3) Attempt any Two questions from Section - C.
Section - A
Ql)
a)What is Non -Linear Data structure?
b)What is Sorting and Merging?
c)Explain operations on Data Structures.
d)Write a short note on Linear search.
e)Explain about Binary tree.
f)Explain Representing the graph.
g)Explain Depth - First search.
h)Define Stack.
i)Write a short note on Bubble sort.
j)What are the Advantages of Data structure?
Section - B
Q2) What is recursion? What are the Advantages of recursion? Write a procedure
to implement. Quick sort using recursion?
Q3) Write a program for the Evolution of post fix expression.
Q4) What is tree? Explain the type of Branches of a tree.
Q5) What is hashing? Explain various Hashing Techniques.
Q6) Explain the concept of stack along with it's Applications.
Section - C
Q7) What is linked list? Write an Algorithm to insist, delete and modify operations
on Double linked list.
Q8) What is binary tree? Write a program to create a tree and display it in (a) in -order
(b) pre-order
( c ) post-order.
Q9) Define Stack? How stacks are implemented using linked list?
