Data Structures and Programming Methodology - DSPM Paper 1 interview-questions

Download FREE Computer Science Engineering (CSE Engg. Branch) Previous 5 Years solved Regular and Reappear Question Papers B.tech PTU (2007, 2006, 2005, 2004, 2003) and related Placement HR - Technical Interview Questions for subject Data Structures and Programming Methodology - DSPM

Data Structures and Programming Methodology
(B.Tech 3rd Semester, 2122)
Time : 3 Hours Maximum Marks : 60
NOTE:- This paper consist of Three Sections. Section A is compulsory. Do any Four questions from
Section B and any two questions from Section C

Section-A Marks : 20
1(a) Define the term Data Structure.
(b) What is recursion and advantages ?
(c) Define full tree and complete tree.
(d) Write infix equvilent of :
abc * c/-d+
(e) What is Priority Queue ?
(f) Whay do we go for dynamic data storage ?
(g) What is the criteria behind the design of hash function ?
(h) Name various application of Stacks and Queues.
(i) What are the various ways to store the Graphs in Memory ?
(j) Whay are the advantages of circular link list ?
Section-B Marks:5 Each
2. Write an algrothim to check whether a given string is palindrom or not using stacks.
3. in what way, double linked listis better than single link list. Give example.
4. Construct a binary tree whose nodes are in two orders as under :
inorder : B, C, E, D, F, A, G, H
Preorder : A, B, C, D, E, F, G, H
5. Compare the time complexity of various sorting algrothims (Best and Worst case).
6. Write a non-recursive algrothim to insert a node into a single-lin list.
Section-C Marks : 10 Each
7.(a) What is Graph ? Can a tree can be Graph ? Name various applications of Graph.
(b) Write a function to delete a node from a binary search tree.
8.(a) An array contains 25 elements. Write an algo to print all pirs whose sum is 20.
(b) Define Garbage Collection. When it takes place and how ?
9. Write short notes on the following :
(a) Operations on sets
(b) Methods for Hash functions.

Data Structures and Programming Methodology - DSPM Paper 2 interview-questions

Download FREE Computer Science Engineering (CSE Engg. Branch) Previous 5 Years solved Regular and Reappear Question Papers B.tech PTU (2007, 2006, 2005, 2004, 2003) and related Placement HR - Technical Interview Questions for subject DATA STRUCTURES & PROGRAMMING METHODOLOGY

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?

Data Structures and Programming Methodology - DSPM Paper 3 interview-questions

Download FREE Computer Science Engineering (CSE Engg. Branch) Previous 5 Years solved Regular and Reappear Question Papers B.tech PTU (2007, 2006, 2005, 2004, 2003) and related Placement HR - Technical Interview Questions for subject Data Structures and Programming Methodology

CS-207
Data Structures and Programming Methodology
(B.Tech 3rd Semester, 1202)
Time : 3 Hours Maximum Marks : 60
NOTE:- This paper consist of Three Sections. Section A is compulsory. Do any Four questions from
Section B and any two questions from Section C

Section-A Marks : 20
1(a) What is sparse about a sparse matrix ?
(b) Is a two dimensional M X M array more or less efficient than a one dimensional array of extent M X M ?
(c) Under what circumstances would you not use a quick sort.
(d) Sort the given set of elements s = (1,7,3,2,0,5,0,8) using selection sort.
(e) Given the following expression, represent the generalized list L
L = (a,(d,(f,g),e),b,c)
(f) Write the prefix form of
(i) A ** -B + C
(ii) -A + B - C + D
(g) Running time of merge sort algrothim is............
(h) Draw the binary tree with threads to indicate the post order traversal for the expression A - B + C * E/F
(i) From the followinf B tree of order 3 delete4 the key 30. Assuming that the tree is kept an a disk and one node may
be fetched at a time how many disk accesses are neede ?
(j) Differentiate between the internal sorting and external sorting.
Section-B Marks:5 Each
2. How one would implement a queue if the elements that are to be placed on the queue are arbitary length strings ? How
long does it takes to enqueue a string ?
3. Given an Array A(20.. 50,20..40). The elements are stored in Column Major Order. What is the starting location of
A (32,23) ?
4. Write an algrothim (non-recursive) to implement quick sort.
5. Write a C function to insert an element into an AVL tree.
6. Define Threaded Binary tree. Write an algrothim for preorder trrnversal of threaded binary tree without a stack.
Section-C Marks : 10 Each
7. Develop a C function (T,X, Y) which returns 1 if X is the ancestor of Y in the binary tree T and 0 otherwise.
8. Implement transposition of a sparse matrix in C-language.
9. Write an algrothim to find a longest simlpe path from a given vertex of a diagram