Download AKTU B-Tech 4th Sem 2017-18 RCS405 Data Structure Question Paper

Firstranker's choice

www.FirstRanker.com

--- Content provided by⁠ FirstRanker.com ---

Printed Pages: 02

Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

--- Content provided by⁠ FirstRanker.com ---

SECTION A

Attempt all questions in brief. 2 x 7 = 14

1. a. The initial configuration of a queue is p, q, r, s (‘p' is in the front end). To get the configuration s, r, q, p, how many minimum dequeues and enqueues are required?
2. b. Write the structure of binary search tree, threaded binary tree.
3. c. Define activity network with suitable example.

--- Content provided by‍ FirstRanker.com ---

4. d. Calculate the minimum number of nodes in AVL tree with height 8.
5. e. Write a C program to multiply two integer number using recursion
6. f. What do you mean by priority queue?
7. g. Explain Transitive Closure.

--- Content provided by‍ FirstRanker.com ---

SECTION B

Attempt any three of the following: 7 x 3 = 21

1. a. An array DSUC 50 60 is stored in row major order with each element occupies 2 bytes of memory, and the address of D DSUC[12][34] is stored at the location 1000. Find the address of CS [34][56]. Assume array index starting with '1'
2. b Write short notes on following:
   1. Activity network
   2. Garbage collection and compaction

   --- Content provided by FirstRanker.com ---

3. c. Define stack with suitable example. Write a program to reverse a string using Stack. Choose a C data structure for such a stack and design push and pop functions for it.
4. d. Translate the infix string (a+b^c^d)*(e+f/d) to reverse polish notation using stack.
5. e. Explain any three commonly used hash function with the suitable example? A hash function H defined as H(key) =key%7, with linear probing, is used to insert the key 37,38,72,48,98,11,56 into a table indexed from 0 to 6. what will be the location of key 11? Justify your answer, also count the total number of collision in this probing.

--- Content provided by​ FirstRanker.com ---

SECTION C

Attempt any one part of the following: 7x1=7

1. a. What are the advantages of linked list over arrays? Implement Doubly Circular linked list and insert an element at given position in this linked list.
2. b. Assume that the operators +, -, × are left associative and ^ is right associative. The order of precedence (from highest to lowest) is ^, x, +, -. Then find the postfix expression corresponding to the infix Expression a +bxc-d^e^f

Attempt any one part of the following: 7x1=7

--- Content provided by FirstRanker.com ---

1. a. Draw the Huffman tree for the following symbols (each of 7 bits) whose frequency Of occurrence of a message is stated along with the symbols below: M1: 0.45 M2:0.02 M3: 0.24 M4: 0.18 M5: 0.11 decode the following message 10110011011111001100101111101101100. and what is the average number of bits required per message.
2. b. Write algorithm for Floyd warshall algorithm also explains with a suitable example.

Attempt any one part of the following: 7x1=7

1. a. Write C function for following in Binary Tree
   1. Count the number of total nodes.
   2. Height of Binary Tree.

   --- Content provided by​ FirstRanker.com ---

2. b. Write Prim's algorithms and Find the Minimum Spanning tree for following graph
   

   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