JNTU
JNTU B.Tech III DATA STRUCTURES Previous Question Paper (February - 2023 - R16)
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
What is the need of asymptotic notation?
Answer
Asymptotic notation is needed to represent the efficiency of an algorithm in terms of input size, independent of machine-specific factors like hardware speed or compiler optimizations. It provides a mathematical framework to describe the growth rate of an algorithm's time or space complexity, allowing for the comparison of different algorithms.
Compare data type with data structure.
Answer
A data type is a classification of data that tells the compiler or interpreter how the programmer intends to use the data (e.g., int, float, char), defining the range of values and operations possible. A data structure is a specialized format for organizing, processing, retrieving, and storing data, which may involve grouping multiple data types together (e.g., arrays, linked lists, trees) to manage data efficiently.
In which situations a stack is preferred over a queue?
Answer
Sign in to view the complete answer paper.
What are the challenges in implementing circular queue?
Answer
Sign in to view the complete answer paper.
What is a max heap? Give an example.
Answer
Sign in to view the complete answer paper.
List the applications of threaded binary tree.
Answer
Sign in to view the complete answer paper.
What are the limitations of binary search?
Answer
Sign in to view the complete answer paper.
How can a heap be used in sorting?
Answer
Sign in to view the complete answer paper.
What is a trie? Give example.
Answer
Sign in to view the complete answer paper.
What is the significance of colours in red-black tree?
Answer
Sign in to view the complete answer paper.
Part B
How to compute best case complexity of an algorithm? Give illustration.
Answer
Sign in to view the complete answer paper.
Write an algorithm to find largest of three given numbers and perform its analysis.
Answer
Sign in to view the complete answer paper.
Write an algorithm to concatenate two single linked list and explain it by tracing with appropriate input.
Answer
Sign in to view the complete answer paper.
Demonstrate usage of stack in converting an infix expression into a postfix expression.
Answer
Sign in to view the complete answer paper.
How to implement queue using stacks? Give your justification.
Answer
Sign in to view the complete answer paper.
Write a C program to create a double ended queue using arrays and perform insertion and deletion operations.
Answer
Sign in to view the complete answer paper.
Explain the properties of binary tree.
Answer
Sign in to view the complete answer paper.
Write a program to implement max priority queue.
Answer
Sign in to view the complete answer paper.
Which graph representation approach is preferred in programming? Justify your answer.
Answer
Sign in to view the complete answer paper.
Make a comparison of breadth first search and depth first search traversals.
Answer
Sign in to view the complete answer paper.
How to handle collisions in hashing? Explain with an example.
Answer
Sign in to view the complete answer paper.
Compare the algorithm complexities of linear search and binary search.
Answer
Sign in to view the complete answer paper.
Sort the following numbers using radix sort, explain each pass: 3423 1238 9017 7756 5487 9836 2567 1100
Answer
Sign in to view the complete answer paper.
With suitable example, demonstrate insertion and deletion operations on a binary search tree.
Answer
Sign in to view the complete answer paper.
Illustrate different types of rotations used for AVL trees.
Answer
Sign in to view the complete answer paper.
Write the steps of Knuth-Morris-Pratt algorithm for pattern matching.
Answer
Sign in to view the complete answer paper.