JNTUH
JNTUH B.Tech II DATA STRUCTURES Previous Question Paper (April/May - 2018 - R13)
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
What is space complexity?
Answer
Space complexity is the total amount of memory space required by an algorithm to execute as a function of the input size. It includes both fixed space (program code, constants) and variable space (dynamic memory allocation, recursion stack space).
What is Big-O and Omega Notation?
Answer
Big-O Notation provides an asymptotic upper bound on the growth rate of a function, representing the worst-case time complexity. Omega Notation provides an asymptotic lower bound on the growth rate, representing the best-case time complexity.
What is a Queue? Give its basis operation.
Answer
Sign in to view the complete answer paper.
Convert to postfix: 2+3*4+6/2.
Answer
Sign in to view the complete answer paper.
State the different representations of a Graph.
Answer
Sign in to view the complete answer paper.
What is a Max-heap?
Answer
Sign in to view the complete answer paper.
What is the time complexity of linear search?
Answer
Sign in to view the complete answer paper.
What is a hash function? Give example.
Answer
Sign in to view the complete answer paper.
What is a Red-Black Tree?
Answer
Sign in to view the complete answer paper.
What is an AVL Tree?
Answer
Sign in to view the complete answer paper.
Part B
What is a Circular Linked List? Write an algorithm for insertion and searching an element into a circular linked list.
Answer
Sign in to view the complete answer paper.
How to represent One, Two, Three and Multidimensional arrays in C? Explain with example.
Answer
Sign in to view the complete answer paper.
What is a sparse matrix? Give representations.
Answer
Sign in to view the complete answer paper.
What is a Stack? Explain all the primitive operations performed on a stack.
Answer
Sign in to view the complete answer paper.
What is a Circular Queue? Explain various operations on a Circular Queue.
Answer
Sign in to view the complete answer paper.
Construct an expression tree for the given expression: A+(B-C)*D+(E*F).
Answer
Sign in to view the complete answer paper.
A binary tree has 9 nodes. The inorder and postorder traversal sequences are given below. Give the preorder traversal. Inorder: D G B A H E C F I Postoder: G D B H E I F C A
Answer
Sign in to view the complete answer paper.
Explain BFS and DFS algorithms.
Answer
Sign in to view the complete answer paper.
Explain linear search and binary search. Which method is efficient in terms of complexity?
Answer
Sign in to view the complete answer paper.
Explain how to sort the array of elements using heap sort.
Answer
Sign in to view the complete answer paper.
Write an algorithm for insertion and deletion in a Binary Search Tree?
Answer
Sign in to view the complete answer paper.
Show each step of the AVL Tree built from a sequence of insertions corresponding to the following keys 44,17,32,78,50,54,62,48,88?
Answer
Sign in to view the complete answer paper.