JNTU
JNTU B.Tech III DATA STRUCTURES Previous Question Paper (May - 2019 - R16)
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.
Part A
Classify the types of data structures.
Answer
Data structures are primarily classified into two main categories: Linear and Non-Linear data structures.
1. Linear Data Structures: Elements are arranged in a sequential or linear order where each element is attached to its previous and next adjacent element. Examples include arrays, linked lists, stacks, and queues.
2. Non-Linear Data Structures: Elements are not arranged sequentially; instead, they are organized in a hierarchical or interconnected manner. Examples include trees and graphs.
What is an algorithm? What criteria it has to satisfy.
Answer
An algorithm is a well-defined, finite sequence of computational steps that transforms a given input into a desired output to solve a specific problem. To be considered valid, an algorithm must satisfy the following five criteria:
- Input: Zero or more quantities are externally supplied to the algorithm.
- Output: At least one quantity is produced as a result of the process.
- Definiteness: Each step must be precisely defined and unambiguous.
- Finiteness: The algorithm must terminate after a finite number of steps for any input.
- Effectiveness: Every instruction must be basic enough to be carried out, in principle, by a person using only paper and pencil within a finite amount of time.
Define a stack. What operations can be performed on it?
Answer
Sign in to view the complete answer paper.
By using the stack find the value for the postfix expression 242/*68*-
Answer
Sign in to view the complete answer paper.
How will you find the maximum no.of nodes present at a particular level of a binary tree?
Answer
Sign in to view the complete answer paper.
Distinguish between complete and full binary tree.
Answer
Sign in to view the complete answer paper.
Write the average, worst and best case time complexity for linear search.
Answer
Sign in to view the complete answer paper.
What is meant by collision? How will you resolve it?
Answer
Sign in to view the complete answer paper.
What is a skewed tree? Give example.
Answer
Sign in to view the complete answer paper.
Write the properties of a typical Red – Black Tree.
Answer
Sign in to view the complete answer paper.
Part B
With the help of suitable example explain the various asymptotic notations used in algorithms.
Answer
Sign in to view the complete answer paper.
With the help of a neat sketch and example explain the various possible positions to insert a node into a double linked list.
Answer
Sign in to view the complete answer paper.
Write a procedure to convert any given infix expression into postfix form? Using step by step procedure, convert the following infix expression into postfix form: A + (B * C )-((D*E+F)/G)
Answer
Sign in to view the complete answer paper.
Write and explain the different types of double ended queues.
Answer
Sign in to view the complete answer paper.
Give brief description about the queue storage using arrays.
Answer
Sign in to view the complete answer paper.
What is meant by tree traversal? List the different traversal used in trees? Find the different orders for the following binary tree.
Answer
Sign in to view the complete answer paper.
What is a graph? Where you are going to use the graphs? With the help of an example explain the different techniques to represent a graph.
Answer
Sign in to view the complete answer paper.
Write the procedure to sort the set of elements by using Quick sort? Apply quick sort mechanism to sort the following data {J, N, T, U, H, E, X, A, M}.
Answer
Sign in to view the complete answer paper.
Apply max heap sort on the list of elements 14, 12, 9, 8, 7, 10, 18, 20, 30.
Answer
Sign in to view the complete answer paper.
What are the limitations of a typical binary search tree? Explain L – L and R – R rotations with an example.
Answer
Sign in to view the complete answer paper.
Explain the KMP pattern matching algorithm with example.
Answer
Sign in to view the complete answer paper.