Exam Details
| Subject | data structures | |
| Paper | ||
| Exam / Course | b.e.(computer science and engineering) | |
| Department | ||
| Organization | SETHU INSTITUTE OF TECHNOLOGY | |
| Position | ||
| Exam Date | May, 2017 | |
| City, State | tamil nadu, pulloor |
Question Paper
Reg. No.
B.E. B.Tech. DEGREE EXAMINATION, MAY 2017
Third Semester
Computer Science and Engineering
01UCS302 DATA STRUCTURES
(Regulation 2013)
Duration: Three hours Maximum: 100 Marks
Answer ALL Questions.
PART A (10 x 2 20 Marks) 1. What are the objectives of studying data structures? 2. Differentiate: Linear data structures and Non-Linear data structures. 3. What are the various tasks performed while traversing a binary tree? 4. What is the use of threaded binary tree? 5. Define: AVL Tree. 6. Mention the applications of B-tree. 7. List out the collision resolution methods. 8. What is the need for path compression? 9. Define the term: biconnectivity. 10. What is meant by Minimum Spanning Tree?
PART B x 16 80 Marks) 11. Write an algorithm for converting infix expression to postfix expression. Illustrate with the example:
Question Paper Code: 31232
2
31232
Write routines for inserting and deleting elements from a queue. Check for the conditions Q-empty and Q-Full.
Or Discuss about various applications of stack.
What do you mean by doubly linked list? Write an algorithm for inserting and deleting an element from doubly linked list. Illustrate with example. 12. Explain about the representing lists as binary trees. Write an algorithm to find kth element and deleting it.
Write a function to perform delete the minimum element from a binary heap.
Or
Write an algorithm to insert an item into a binary search tree and trace the algorithm with the items 5.
13. Write a procedure to implement single and double rotations while inserting nodes in an AVL tree with example.
Or
Describe in detail about the binary heaps. Construct a min heap tree for the following: 4.
14. Explain in detail the path compression techniques.
Or
What is meant by open addressing hashing and closed addressing hashing? Discuss the common collision resolution strategies used in closed hashing system.
Explain about smart union algorithms in detail.
15. Explain with an example for breadth first and depth first search traversal of a graph.
Or
How do you construct a minimum cost spanning tree with Prim's algorithm? Write an algorithm and illustrate with your suitable example graph.
B.E. B.Tech. DEGREE EXAMINATION, MAY 2017
Third Semester
Computer Science and Engineering
01UCS302 DATA STRUCTURES
(Regulation 2013)
Duration: Three hours Maximum: 100 Marks
Answer ALL Questions.
PART A (10 x 2 20 Marks) 1. What are the objectives of studying data structures? 2. Differentiate: Linear data structures and Non-Linear data structures. 3. What are the various tasks performed while traversing a binary tree? 4. What is the use of threaded binary tree? 5. Define: AVL Tree. 6. Mention the applications of B-tree. 7. List out the collision resolution methods. 8. What is the need for path compression? 9. Define the term: biconnectivity. 10. What is meant by Minimum Spanning Tree?
PART B x 16 80 Marks) 11. Write an algorithm for converting infix expression to postfix expression. Illustrate with the example:
Question Paper Code: 31232
2
31232
Write routines for inserting and deleting elements from a queue. Check for the conditions Q-empty and Q-Full.
Or Discuss about various applications of stack.
What do you mean by doubly linked list? Write an algorithm for inserting and deleting an element from doubly linked list. Illustrate with example. 12. Explain about the representing lists as binary trees. Write an algorithm to find kth element and deleting it.
Write a function to perform delete the minimum element from a binary heap.
Or
Write an algorithm to insert an item into a binary search tree and trace the algorithm with the items 5.
13. Write a procedure to implement single and double rotations while inserting nodes in an AVL tree with example.
Or
Describe in detail about the binary heaps. Construct a min heap tree for the following: 4.
14. Explain in detail the path compression techniques.
Or
What is meant by open addressing hashing and closed addressing hashing? Discuss the common collision resolution strategies used in closed hashing system.
Explain about smart union algorithms in detail.
15. Explain with an example for breadth first and depth first search traversal of a graph.
Or
How do you construct a minimum cost spanning tree with Prim's algorithm? Write an algorithm and illustrate with your suitable example graph.
Subjects
- applied statistics and queuing networks
- artificial intelligence
- building enterprise applications
- c# and .net framework
- cloud computing
- computer communication and networks
- computer networks
- computer organization and architecture
- data structures
- data warehousing and data mining
- database management systems
- database system concepts
- design and analysis of algorithms
- discrete mathematics
- distributed systems
- environmental science and engineering
- fundamentals of information security
- fundamentals of mobile computing
- human computer interaction
- information storage management
- interactive computer graphics
- internet of things
- java programming
- microprocessors and microcontrollers
- multimedia
- object oriented analysis and design
- object oriented programming
- object oriented programming with c++
- operating systems
- principles of compiler design
- probability statistics and queuing systems
- project management and finance
- python programming
- qualitative and quantitative aptitude
- reasoning and quantitative aptitude
- software engineering
- software testing
- theory of computation
- transforms and partial differential equations
- value education and human rights
- web programming