JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech II DATA STRUCTURES Previous Question Paper (November/December - 2017 - R15)

B.Tech | II | I | R15 | November/December - 2017

Answer PaperPaper Code: 123BPMaximum Marks: 75Time: 3 Hours

Note: This question paper contains two parts A and B. 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.

Part A

125 marks
a

Define and List types of Arrays.

2 marks

Answer

An array is a collection of elements of the same data type stored in contiguous memory locations. Types of arrays include: 1) One-dimensional arrays, 2) Multi-dimensional arrays (e.g., 2D, 3D).

b

Explain types of Linked Lists.

3 marks

Answer

Linked lists are linear data structures where elements are stored in nodes connected by pointers. Types include: 1) Singly Linked List: Nodes point only to the next node. 2) Doubly Linked List: Nodes contain pointers to both the next and previous nodes. 3) Circular Linked List: The last node points back to the first node, forming a loop.

c

Discuss about recursion and its implementation.

2 marks

Answer

Sign in to view the complete answer paper.

d

Explain the ADT for Deque.

3 marks

Answer

Sign in to view the complete answer paper.

e

Write about Properties of Binary Trees.

2 marks

Answer

Sign in to view the complete answer paper.

f

Write about Directed & Undirected graphs.

3 marks

Answer

Sign in to view the complete answer paper.

g

Write the C logic for Binary Search.

2 marks

Answer

Sign in to view the complete answer paper.

h

Explain in brief about Insertion Sort.

3 marks

Answer

Sign in to view the complete answer paper.

i

Write short note on Red Black Tree.

2 marks

Answer

Sign in to view the complete answer paper.

j

Write the C Logic for Knuth-Morris-Pratt algorithm.

3 marks

Answer

Sign in to view the complete answer paper.

Part B

210 marks
a

Write about Asymptotic Notations.

5 marks

Answer

Sign in to view the complete answer paper.

b

Discuss about linked representation of Sparse Matrix.

5 marks

Answer

Sign in to view the complete answer paper.

OR
310 marks
a

What is Performance Analysis? Explain the Techniques.

5 marks

Answer

Sign in to view the complete answer paper.

b

Explain about Singly Linked Lists Operations.

5 marks

Answer

Sign in to view the complete answer paper.

410 marks
a

Explain Evaluation of Postfix expression using Stack.

5 marks

Answer

Sign in to view the complete answer paper.

b

Write a program to implement Queue Operations.

5 marks

Answer

Sign in to view the complete answer paper.

OR
510 marks
a

Discuss about Circular queues operations.

5 marks

Answer

Sign in to view the complete answer paper.

b

Write a C program to implement stack using singly linked list.

5 marks

Answer

Sign in to view the complete answer paper.

610 marks
a

Describe Binary Tree traversals with examples.

5 marks

Answer

Sign in to view the complete answer paper.

b

Write a C Program to implement DFS.

5 marks

Answer

Sign in to view the complete answer paper.

OR
710 marks
a

Explain about Graph Representation methods.

5 marks

Answer

Sign in to view the complete answer paper.

b

Explain the Binary Tree operations with an example.

5 marks

Answer

Sign in to view the complete answer paper.

810 marks
a

Write a C Program for Linear Search.

5 marks

Answer

Sign in to view the complete answer paper.

b

Explain Collision Resolution Methods.

5 marks

Answer

Sign in to view the complete answer paper.

OR
910 marks
a

Differentiate between Linear and Binary Search Methods.

5 marks

Answer

Sign in to view the complete answer paper.

b

Write a program for Quick Sort.

5 marks

Answer

Sign in to view the complete answer paper.

1010 marks
a

Explain about AVL Tree with an example.

5 marks

Answer

Sign in to view the complete answer paper.

b

Give the examples for types of Tries.

5 marks

Answer

Sign in to view the complete answer paper.

OR
1110 marks
a

Write about Splay Tree with an example.

5 marks

Answer

Sign in to view the complete answer paper.

b

Discuss about Binary Search Tree operations.

5 marks

Answer

Sign in to view the complete answer paper.

About this paper

This page contains the solved question paper with answers of DATA STRUCTURES from JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD for B.Tech CSE II I, November/December - 2017, R15.

For the question paper without answers, switch to the Question Paper tab.

Other papers in DATA STRUCTURES

Loading Question Papers

Fetching data from database...