AKTU B-Tech Last 10 Years 2010-2020 Previous Question Papers || Dr. A.P.J. Abdul Kalam Technical University
Firstranker's choice
Printed Pages: 2
Paper Id: 110258
--- Content provided by FirstRanker.com ---
Sub Code: RCS 405
Roll No.
B TECH
(SEM IV) THEORY EXAMINATION 2018-19
DATA STRUCTURES
--- Content provided by FirstRanker.com ---
Time: 3 Hours Total Marks: 70
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
SECTION A
- Attempt all questions in brief. 2 x 7 = 14
- What is asymptotic notation? Explain Big Oh notation?
- Given a 2D array A [-100:100,-5:50]. Find the address of element A [99, 49] considering base address 10 and each element requires 4 bytes for storage. Follow row major order?
- If the in order traversal of a binary tree is D, J, G, B, A, E, H, C, F, I and its pre order traversal is A, B, D, G, J, C, E, H, F, I Determine the binary tree?
- Evaluate postfix expression 8 2 – 4 + 567 - + ×
- Explain collision resolution strategies used in hashing?
- Write a recursive solution to solve Tower of Hanoi problem.
- Define complete binary tree and full binary tree.
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
SECTION B
- Attempt any three of the following: 3 x 3 = 21
- Consider the following infix expression and convert it into postfix using stack A + (B * C – (D/E-F) * G) * ?
- What is doubly linked list? Write an algorithm to insert a node at begin in single linked list.
- Construct a Huffman tree for given characters A, B, C, D, E, F, G, H having frequencies 22, 5, 11, 19, 2, 11, 25, 5 respectively. What will be the code of HEAD in binary?
- Find the shortest path from S to all remaining vertices of graph using Dijikstra Algorithm
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
--- Content provided by FirstRanker.com ---