Scribd
Upload
49 views1 page

Common To CSE, IT

The document contains a sample exam paper for a Data Structures course through C++. It has two parts - Part A containing 10 short answer questions covering various data structures concepts, and Part B containing 5 long answer questions each with internal sub-questions, from which students must answer one full question from each unit. Some of the concepts covered include arrays, linear and non-linear data structures, queues, linked lists, heaps, hash functions, trees, graphs, sorting, searching, and graph traversal algorithms.

Uploaded by

Sai Ram
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
49 views1 page

Common To CSE, IT

The document contains a sample exam paper for a Data Structures course through C++. It has two parts - Part A containing 10 short answer questions covering various data structures concepts, and Part B containing 5 long answer questions each with internal sub-questions, from which students must answer one full question from each unit. Some of the concepts covered include arrays, linear and non-linear data structures, queues, linked lists, heaps, hash functions, trees, graphs, sorting, searching, and graph traversal algorithms.

Uploaded by

Sai Ram
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Injntu.com Injntu.com Injntu.

com

R16
JJ JJ JJ JJ JJ JJ JJ
Code No: 133AG
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
B.Tech II Year I Semester Examinations, April/May - 2018
DATA STURCTURES THROUGH C++
(Common to CSE, IT)
Time: 3 Hours Max. Marks: 75

Note: This question paper contains two parts A and B.

JJ JJ JJ JJ JJ
Part A is compulsory which carries 25 marks. Answer all questions in Part A.
Part B consists of 5 Units. Answer any one full question from each unit.
Each question carries 10 marks and may have a, b, c as sub questions.
JJ JJ

om
PART- A
(25 Marks)
1.a) What is an array? Explain array types. [2]

JJ JJ JJ JJ JJ JJ JJ
b) Differentiate linear and non-linear data structures. [3]
c) What is queue ADT? [2]
d) Discuss about double linked list. [3]
e) Define a max heap. [2]
f) What is hash function? [3]
g) Differentiate between trees and binary trees. [2]
h) Compare insertion sort and selection sort. [3]

JJ JJ JJ JJ JJ JJ JJ
i) What is directed graph? [2]
j)
.c
What are the applications of graphs?

PART-B
[3]

(50 Marks)
2. What is Constructor? Explain various types of constructors with an examples. [10]
OR
tu
3. Discuss in detail about asymptotic notations with an examples. [10]

JJ 4.a)
b)
JJ JJ JJ
Discuss about linked implementation of stack ADT. JJ JJ
What are the various applications of stacks? Explain infix to postfix conversion. [5+5]
JJ
OR
5.a) Define and explain about circularly linked list and it’s operations with an examples.
jn

b) Discuss about sparse matrices. [5+5]

JJ 6.a)
b)
JJ JJ JJ
What is a priority queue? Explain its applications.
JJ
Explain the array representation of a threaded binary tree.
OR
JJ [5+5]
JJ
7. Explain in detail about binary tree traversal and its various traversal techniques. [10]
in

8.a) Differentiate between binary search and linear search.


b) Explain in detail about linear probing and quadratic probing. [5+5]

JJ JJ JJ JJ JJ JJ JJ
OR
9.a) Explain about heap sorting technique with an example.
b) Compare various sorting techniques. [5+5]

10.a) What is graph? Explain types with examples.


b) Explain in detail about graph ADT. [5+5]
OR
11. Explain the following.

JJ
Injntu.com
JJ JJ JJ
a) Depth-First-search method b) AVL tree properties.

---oo0oo---
JJ JJ [5+5]
JJ
Injntu.com

You might also like