Data Structures 2018 Question Paper — Government College of Engineeri…
The 2018 Data Structures previous year question paper (Government College of Engineering and Technology, Jammu), with every question and its marks.
- University: Government College of Engineering and Technology, Jammu
- Subject: Data Structures
- Course: Data Structures
- Branch: COMP. ENGG.
- Year: 2018
- Paper: end-term
- Duration: 180 minutes
- Total marks: 100
Instructions
- There shall be eight questions of 20 marks each, four from each section.
- Five questions have to be attempted selecting atleast two questions from each section
Questions
Section - A
- Q1. a) What is an algorithm? Explain different steps used in design of an algorithm. (10) b) Explain the algorithm for creation of queue and adding and deleting elements from it. (10) [20 marks]
- Q2. a) Define the terms : static and dynamic data structures. List some of the static and dynamic data structure in C. (10) b) What is traversing? Write an algorithm for traversing a link list? Also write an algorithm for reversing a linear linked list. (10) [20 marks]
- Q3. What is the postfix and prefix representation of following expressions. Also write the algorithms for converting infix expression to postfix and prefix form. (A*(b-1+C))+(b/d)*a+z (a+(b+c*(d+e/1)))+f (20) [20 marks]
- Q4. a) Let there be a doubly linked list with three elements P,Q,R. How S can be added between P and Q. Also write an algorithm for deleting from doubt linked list. (10) b) What Criteria is used for evaluating the suitability of a particular data structure for a given application. (10) [20 marks]
Section - B
- Q5. a) Construct the binary tree for following expression $((A+B)*C-(D-E))\$(F+G)$, Give the sequence obtained when tree is traversed in post order form and preorder form. (10) b) What are various binary tree traversal techniques? Discuss with example. Also write non recursive algorithm for inorder traversal of a binary tree. (10) [20 marks]
- Q6. Write short notes on a) Threaded Binary Trees. (7) b) Minimum cost spanning trees. (6) c) Graph Traversal Techniques. (7) [20 marks]
- Q7. Explain selection sort, shell sort and address calculation sort with algorithm. (20) [20 marks]
- Q8. a) Explain the various graph representation methods. List merits and demerits of each. (10) b) What is the use of searching techniques? Discuss the various searching techniques with help of examples. (10) [20 marks]
Related pages
Other years
- Data Structures 2018 question paper — end-term
- Data Structures 2018 question paper — end-term