Deemed University 2010 B.Tech Computer Science and Engineering University: Lingayas University Term: III Title of the : Data Structural and Algorithms - Question Paper
Roll No. ..
Lingayas University, Faridabad
Examination May, 2010
Course: B.Tech. Year: IInd
Semester: III Paper Code: CSE-201E
Subject: Data Structural and Algorithms
[Time: 3 Hours] [Max. Marks: 100]
Before answering the question, candidate should ensure that they have been supplied the correct and complete question paper. No complaint in this regard, will be entertained after examination.
Note: Attempt Five Question in all. All questions carry equal marks.
Q.1. (a) What is an abstract data type? Explain operations on a stack using linked lists. (12)
(b) Explain the term garbage collection with an example. (8)
Q-2. (a) Describe the methods of a tree traversal with an example (12)
(b) Convert the following expressions to post fix form: (4x2=8)
(i) (A+B) * (C-D)
(ii) A$B*C-D+E/F/(G+H)
(iii) ((A+B) *C-(D-E)) $ (F+G)
(iv) A-B / (C*D$E)
Q-3. Differentiate between the following: (5x4=20)
(i) Linear data structure and non linear data structure.
(ii) Linear queue and priority queue.
(iii) Breadth first search and depth first search
(iv) Time complexity and space complexity
(v) Sequential search and binary search.
Q-4. (a) Describe Towers of Hanoi problem. Prove that the number of moves performed by the method in moving n disks equals 2n-1 (15)
P.T.O.
(b) Explain two-way threaded tree with a header node. (5)
Q-5.(a) Explain all types of operations on a graph. (5)
(b) Give the array based and linked list based representation of a graph. (8)
(c) Give any shortest path algorithm for a weighted graph. (7)
Q-6. (a) What is divide and conquer algorithm? Explain in brief. (5)
(b) Give the algorithm for implementation of quick sort. Also describe the
steps to sort the following set of numbers using quick sort:
14, 8, 7, 12, 6, 4, 5, 1, 9, 13, 11, 2, 3, 10 (15)
Q-7. (a) Give the linked list implementation of queues and circular queues.
(10)
(b) Describe the advantages and disadvantages of circular linked list. (5)
(c) What do you understand by the term heap? How do you delete an element from the heap. (5)
Q-8. (a) Insert the following entries into a initially empty B-tree of order 5:
a, g, f, b, k, c, h, n, j, d, r, i, s, x, e, l, m, t, u, v (15)
(b) Explain threaded binary trees with an example. (5)
Roll No. ..
Lingayas University, Faridabad
Examination December, 2009
Course: B.Tech. Year: IInd
Semester: III Paper Code: CSE-201E
Subject: Data Structural and Algorithms
[Time: 3 Hours] [Max. Marks: 100]
Before answering the question, candidate should ensure that they have been supplied the correct and complete question paper. No complaint in this regard, will be entertained after examination.
Note: Attempt Five Question in all. All questions carry equal marks.
Q.1. (a) What is an abstract data type? Explain operations on a stack using linked lists. (12)
(b) Explain the term garbage collection with an example. (8)
Q-2. (a) Describe the methods of a tree traversal with an example (12)
(b) Convert the following expressions to post fix form: (4x2=8)
(i) (A+B) * (C-D)
(ii) A$B*C-D+E/F/(G+H)
(iii) ((A+B) *C-(D-E)) $ (F+G)
(iv) A-B / (C*D$E)
Q-3. Differentiate between the following: (5x4=20)
(i) Linear data structure and non linear data structure.
(ii) Linear queue and priority queue.
(iii) Breadth first search and depth first search
(iv) Time complexity and space complexity
(v) Sequential search and binary search.
Q-4. (a) Describe Towers of Hanoi problem. Prove that the number of moves performed by the method in moving n disks equals 2n-1 (15)
P.T.O.
(b) Explain two-way threaded tree with a header node. (5)
Q-5.(a) Explain all types of operations on a graph. (5)
(b) Give the array based and linked list based representation of a graph. (8)
(c) Give any shortest path algorithm for a weighted graph. (7)
Q-6. (a) What is divide and conquer algorithm? Explain in brief. (5)
(b) Give the algorithm for implementation of quick sort. Also describe the
steps to sort the following set of numbers using quick sort:
14, 8, 7, 12, 6, 4, 5, 1, 9, 13, 11, 2, 3, 10 (15)
Q-7. (a) Give the linked list implementation of queues and circular queues.
(10)
(b) Describe the advantages and disadvantages of circular linked list. (5)
(c) What do you understand by the term heap? How do you delete an element from the heap. (5)
Q-8. (a) Insert the following entries into a initially empty B-tree of order 5:
a, g, f, b, k, c, h, n, j, d, r, i, s, x, e, l, m, t, u, v (15)
(b) Explain threaded binary trees with an example. (5)
| Earning: Approval pending. |
