JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B. Tech II DATA STRUCTURES Previous Question Paper (September/October - 2023 - R15)
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
How do you measure the algorithm running time?
Answer
Algorithm running time is measured using Asymptotic Analysis, which evaluates the growth rate of the algorithm's time complexity as the input size (n) increases. It is typically expressed using Big O, Omega, or Theta notation to represent the number of primitive operations performed.
Describe best case, average case and worst case efficiency of an algorithm.
Answer
Best Case: The minimum time required by an algorithm for the most favorable input configuration. Worst Case: The maximum time required for the least favorable input. Average Case: The expected time taken over all possible inputs, assuming a uniform distribution of input data.
List the applications of queue.
Answer
Sign in to view the complete answer paper.
Define Circular Queue full condition.
Answer
Sign in to view the complete answer paper.
State the properties of a Binary Tree.
Answer
Sign in to view the complete answer paper.
Differentiate Max-heap and Min-heap.
Answer
Sign in to view the complete answer paper.
What is searching and list the types of searching techniques.
Answer
Sign in to view the complete answer paper.
Write the applications of binary search.
Answer
Sign in to view the complete answer paper.
Define binary search tree with example.
Answer
Sign in to view the complete answer paper.
Discuss the drawbacks of AVL trees.
Answer
Sign in to view the complete answer paper.
Part B
Explain Array and Linked representation of Sparse Matrix.
Answer
Sign in to view the complete answer paper.
Explain how to create circular linked list and insert nodes at end.
Answer
Sign in to view the complete answer paper.
Write algorithm for above operations.
Answer
Sign in to view the complete answer paper.
Explain the procedure to convert infix expression into postfix expression and write algorithm for it.
Answer
Sign in to view the complete answer paper.
Write C programs to implement a double ended queue ADT using arrays.
Answer
Sign in to view the complete answer paper.
Explain tree traversals with example.
Answer
Sign in to view the complete answer paper.
Explain different ways of representation of graphs.
Answer
Sign in to view the complete answer paper.
Explain with an example how to insert an element to maxheap.
Answer
Sign in to view the complete answer paper.
Given In order traversal of a binary tree is D,G,B,E,A,H,F,I,C and pre order traversal is A,B,D,G,E,C,F,H,I construct binary tree.
Answer
Sign in to view the complete answer paper.
Explain linear search with example.
Answer
Sign in to view the complete answer paper.
Compare and contrast various sorting techniques.
Answer
Sign in to view the complete answer paper.
State and explain heap sort with an example.
Answer
Sign in to view the complete answer paper.
Apply radix sort on the following list of elements 45, 37,05,09,06,11,18,27.
Answer
Sign in to view the complete answer paper.
Construct a binary search tree for the following 80, 40, 75, 30, 20, 90, 50.
Answer
Sign in to view the complete answer paper.
What is a trie? Briefly describe compressed tries with its disadvantages.
Answer
Sign in to view the complete answer paper.
Construct an AVL Tree for following elements:10,20,15,3,2,16,18,26.
Answer
Sign in to view the complete answer paper.
Explain about the Knuth-Morris-Pratt pattern matching algorithm.
Answer
Sign in to view the complete answer paper.