Firstranker's choice
Printed Pages: 02
Paper ID: 1004
--- Content provided by FirstRanker.com ---
Roll No.
B TECH (SEM III) THEORY EXAMINATION 2017-18
DATA STRUCTURES
Time: 3 Hours
Max. Marks: 70
--- Content provided by FirstRanker.com ---
Note: Attempt all Sections. Assume missing data, if any.
SECTION A
- Attempt all questions in brief: 2 x 7 = 14
- Define the term Data Structure. List some linear and non-linear data structures stating the application area where they will be used.
- Discuss the concept of "successor" and “predecessor” in Binary Search Tree.
- Convert the following arithmetic infix expression into its equivalent postfix expression.
Expression: A-B/C+D*E+F - Explain circular queue. What is the condition if circular queue is full?
- Calculate total number of moves for Tower of Hanoi for n=10 disks.
- List the different types of representation of graphs.
- Explain height balanced tree. List general cases to maintain the height.
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
SECTION B
- Attempt any three of the following: 7 x 3 = 21
- What do you understand by time space trade off? Explain best, worst and average case analysis in this respect with an example.
- Use quick sort algorithm to sort 15,22,30,10,15,64,1,3,9,2. Is it a stable sorting algorithm? – Justify.
- Define spanning tree. Also construct minimum spanning tree using prim's algorithm for the given graph.
- Define tree, binary tree, complete binary tree and full binary tree. Write algorithms or function to obtain traversals of a binary tree in preorder, postorder and inorder.
- Construct a B-tree on following sequence of inputs.
10, 20, 30, 40, 50, 60, 70, 80, 90
Assume that the order of the B-tree is 3.
--- Content provided by FirstRanker.com ---
SECTION C
- Attempt any one part of the following: 7x1=7
- What are the various asymptotic notations? Explain Big O notation.
- Write an algorithm to insert a node at the end in a Circular linked list.
--- Content provided by FirstRanker.com ---
- Attempt any one part of the following: 7x1=7
- What is a Stack .Write a C program to reverse a string using stack.
- Define the recursion. Write a recursive and non recursive program to calculate the factorial of the given number.
- Attempt any one part of the following: 7x1=7
- Draw a binary tree with following traversals:
Inorder: BCAEGDH FIJ
Preorder: ABCDEGFHIJ - Consider the following AVL Tree and insert 2, 12, 7and 10 as new node. Show proper rotation to maintain the tree as AVL.
- Draw a binary tree with following traversals:
- Attempt any one part of the following: 7x1=7
- What is a Threaded Binary Tree? Explain the advantages of using a threaded binary tree.
- Describe Dijkstra's algorithm for finding shortest path. Describe its working for the graph given below.
- Attempt any one part of the following:
- Write short notes on:
- Hashing Technique
- Garbage collection
--- Content provided by FirstRanker.com ---
- Explain the following:
- Heap Sort
- Radix Sort.
--- Content provided by FirstRanker.com ---
- Write short notes on:
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
This download link is referred from the post: AKTU B-Tech Last 10 Years 2010-2020 Previous Question Papers || Dr. A.P.J. Abdul Kalam Technical University