JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech III DATA STRUCTURES Previous Question Paper (July - 2023 - R16)

B.Tech | III | II | R16 | July - 2023

Answer PaperPaper Code: 136EVMaximum Marks: 75Time: 3 Hours

Note: i) Question paper consists of Part A, Part B. ii) Part A is compulsory, which carries 25 marks. In Part A, Answer all questions. iii) In Part B, Answer any one question from each unit. Each question carries 10 marks and may have a, b as sub questions.

Part A

125 marks
a

What is the time complexity of linear loop and quadratic loop?

2 marks

Answer

The time complexity of a linear loop is O(n), where n is the number of iterations. The time complexity of a quadratic loop (a nested loop where both loops depend on n) is O(n2).

b

Give the classification of data structures.

3 marks

Answer

Data structures are primarily classified into two categories:

  1. Linear Data Structures: Elements are arranged in a sequential order (e.g., Arrays, Linked Lists, Stacks, and Queues).
  2. Non-Linear Data Structures: Elements are arranged in a hierarchical or interconnected manner (e.g., Trees and Graphs).
c

What are the advantages of circular queues compared with linear queue?

2 marks

Answer

Sign in to view the complete answer paper.

d

Convert the following infix expression into postfix expression: A+B*C/D+E-F+G

3 marks

Answer

Sign in to view the complete answer paper.

e

Define Max Priority queue.

2 marks

Answer

Sign in to view the complete answer paper.

f

Define tree, binary tree and heap tree.

3 marks

Answer

Sign in to view the complete answer paper.

g

Compare linear search and binary search.

2 marks

Answer

Sign in to view the complete answer paper.

h

Write the time complexity of selection sort, Quick sort and Radix sort.

3 marks

Answer

Sign in to view the complete answer paper.

i

Define Red-Black Tree and Splay Tree.

2 marks

Answer

Sign in to view the complete answer paper.

j

Construct the binary search tree using the following traversal sequences. Inorder Traversal: 10 20 30 100 150 200 300; Preorder Traversal: 100 20 10 30 200 150 300

3 marks

Answer

Sign in to view the complete answer paper.

Part B

210 marks
a

Write a function to delete an element from the front of the linked list.

5 marks

Answer

Sign in to view the complete answer paper.

b

Write an algorithm to insert an element at the front of doubly linked list.

5 marks

Answer

Sign in to view the complete answer paper.

OR
310 marks
a

Write a function to print transpose of a sparse matrix.

5 marks

Answer

Sign in to view the complete answer paper.

b

Write a function to concatenate two singly linked lists.

5 marks

Answer

Sign in to view the complete answer paper.

410 marks
a

Write the program to implement operations of stack using linked lists.

5 marks

Answer

Sign in to view the complete answer paper.

b

Explain insert and delete operations of circular queue.

5 marks

Answer

Sign in to view the complete answer paper.

OR
510 marks
a

Write the program to implement operations of queue using arrays.

5 marks

Answer

Sign in to view the complete answer paper.

b

Write the program to evaluate the postfix expression.

5 marks

Answer

Sign in to view the complete answer paper.

610 marks
a

Write a procedure to insert an element into binary tree.

5 marks

Answer

Sign in to view the complete answer paper.

b

Write the traversal sequences of the following Graph using BFS and DFS.

5 marks

Answer

Sign in to view the complete answer paper.

OR
710 marks
a

Write a function to perform delete operation in max heap.

5 marks

Answer

Sign in to view the complete answer paper.

b

Write functions to perform the following operations of binary tree: i) pre order traversal ii) in order traversal.

5 marks

Answer

Sign in to view the complete answer paper.

810 marks
a

What is hashing? How hashing can used to insert and search elements into a hash table.

5 marks

Answer

Sign in to view the complete answer paper.

b

Write a program to implement selection sort.

5 marks

Answer

Sign in to view the complete answer paper.

OR
910 marks
a

Write a program to perform quick sort.

5 marks

Answer

Sign in to view the complete answer paper.

b

Write a program to search for an element using linear search.

5 marks

Answer

Sign in to view the complete answer paper.

1010 marks
a

Write a function to delete an element from a binary search tree.

5 marks

Answer

Sign in to view the complete answer paper.

b

Explain various rotations of the Red-Black tree.

5 marks

Answer

Sign in to view the complete answer paper.

OR
1110 marks
a

Write the process to insert and delete an element in AVL Tree.

5 marks

Answer

Sign in to view the complete answer paper.

b

Explain the procedure to delete an element from B-Tree.

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 EEE III II, July - 2023, R16.

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

Other papers in DATA STRUCTURES

Loading Question Papers

Fetching data from database...