and 5 others joined a min ago.
0
459views
Data Structures Question Paper - Dec 18 - Information Technology (Semester 3) - Jawaharlal Nehru Technological University (JNTUH)
1 Answer
0
0views
written 6.9 years ago by
teamques10
★ 70k
|
Data Structures - Dec 18
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 input and output statements in C++?
(2 marks)
00
1.b.
What is destructor? Explain.
(3 marks)
00
1.c.
Discuss about two dimensional arrays
(2 marks)
00
1.d.
What is stack? What are the operations performed on stack?
(3 marks)
00
1.e.
Define a max heap.
(2 marks)
00
1.f.
What are the properties of binary tree?
(3 marks)
00
1.g.
What is rehashing technique?
(2 marks)
00
1.h.
Compare linear search and binary search.
(3 marks)
00
1.i.
What is undirected graph? Give its properties
(2 marks)
00
1.j.
What are the applications of graphs?
(3 marks)
00
PART-B
2.a.
What is an exception? Discuss about throwing an exception and handling an exception.
(5 marks)
00
2.b.
Explain about call by reference technique.
(5 marks)
00
OR
3.a.
Explain new and delete operators with an example programs.
(5 marks)
00
3.b.
What is polymorphism? Explain
(5 marks)
00
4.a.
Discuss about linked implementation of queue ADT.
(5 marks)
00
4.b.
How to evaluate postfix expression? explain.
(5 marks)
00
OR
5.a.
Def‌ine and explain about circular queue and its operations with an examples.
(10 marks)
00
6.a.
Explain the linked representation of a threaded binary tree.
(5 marks)
00
6.b.
Differentiate between full binary tree and complete binary tree.
(5 marks)
00
OR
7.a.
Define tree. Explain all terms associated with trees.
(5 marks)
00
7.b.
What are various operations that can be performed on a binary tree? Explain.
(5 marks)
00
8.a.
Discuss the concept of quick sort with an example.
(5 marks)
00
8.b.
Explain the concept of merge sort in detail.
(5 marks)
00
OR
9.a.
What is searching? Discuss various types of searching technique.
(5 marks)
00
9.b.
Explain the concept hash table with an example.
(5 marks)
00
10.a.
Explain in detail about balanced binary trees.
(5 marks)
00
10.b.
Explain in brief about AVL trees.
(5 marks)
00
OR
11.a.
Discuss in detail about red-black trees.
(5 marks)
00
11.b.
Compare various search trees.
(5 marks)
00
ADD COMMENT
EDIT
Please log in to add an answer.