and 2 others joined a min ago.
0
423views
Data Structures Question Paper - Jun 17 - Information Technology (Semester 3) - Jawaharlal Nehru Technological University (JNTUH)
1 Answer
0
0views
written 6.9 years ago by
teamques10
★ 70k
|
Data Structures - Jun 17
Information Technology (Semester 3)
Total marks: 75
Total time: 3 Hours
INSTRUCTIONS
(1) This question paper contains two parts A and B.
(2) Part A is compulsory which carries 25 marks. Answer all questions in Part A.
(3) Part B consists of 5 units. Answer any one full question from each unit.
(4) Each question carries 10 marks and may have a, b, c as sub questions
PART-A
1.a.
What are the disadvantages of an array?
(2 marks)
00
1.b.
Explain how to find the performance of an algorithm.
(3 marks)
00
1.c.
What are the disadvantages of queue which is implemented using array and how to overcome it?
(2 marks)
00
1.d.
Differentiate between doubly and circular linked lists.
(3 marks)
00
1.e.
Explain how binary tree is represented using an array and linked list.
(2 marks)
00
1.f.
Explain the threaded binary tree with suitable example.
(3 marks)
00
1.g.
Define Hash Clashing.
(2 marks)
00
1.h.
Compare Selection sort and Quick sort with an example.
(3 marks)
00
1.i.
Write an algorithm to insert an element into the binary search tree.
(2 marks)
00
1.j.
Explain the properties of Red-Black tree
(3 marks)
00
PART-B
2.a.
Write a program to concatenate singly linked lists.
(5 marks)
00
2.b.
How two dimensional arrays are represented in memory? Also obtain the-formula for calculating the address of any element stored in the array, in case of column major order.
(5 marks)
00
OR
3.a.
Write a program to implement a sparse matrix.
(5 marks)
00
3.b.
How can we represent a polynomial in a linked list?
(5 marks)
00
4.a.
Explain the Towers of Hanoi problem with an example.
(5 marks)
00
4.b.
Write a program to implement the operations of Queue.
(5 marks)
00
OR
5.a.
Write a recursive procedure to compute the $\mathrm{n}^{\mathrm{th}}$ Fibonacci number.
(5 marks)
00
5.b.
What are the applications of queue?
(5 marks)
00
6.a.
Write an algorithm to find the components of a graph.
(5 marks)
00
6.b.
Define Priority Queue? Explain with an example.
(5 marks)
00
OR
7.a.
Differentiate between BFS and DFS.
(5 marks)
00
7.b.
Define Binary tree. Explain the Binary tree representations with an example.
(5 marks)
00
ADD COMMENT
EDIT
Please log in to add an answer.