Download JNTUA MCA 2016 May Supply 1st Sem 9F00105 Data Structures Question Paper

FirstRanker.com

Code: 9F00105

MCA I Semester Supplementary Examinations May 2016

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

DATA STRUCTURES

(For students admitted in 2010, 2011, 2012, 2013, 2014 & 2015 only)

Time: 3 hours Max. Marks: 60

Answer any FIVE questions

All questions carry equal marks

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

1. (a) Write C program to concatenate two strings without using built-in function.
2. (b) Differentiate between structures and union. Write C program to add two complex numbers using structures.
3. (a) Bring out the difference between static and dynamic memory allocation.
4. (b) What is the advantage of circular singly linked list over singly linked list? Write C function to find the frequency of a given key in circular singly linked list.
5. (c) Write C function to delete a key in doubly linked list.

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

6. (a) Write C functions for push and pop operations of stack using singly linked list.
7. (b) Define recursion. Write recursive C program for factorial of a number.
8. (a) Differentiate between queues and stacks.
9. (b) List applications of queues. Write C program to implement queue using arrays.
10. (a) Trace radix sort for the following data: 125, 357, 408, 377, 120, 924, 836, 353

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

11. (b) Write C program for sorting N numbers using quick sort.
12. (a) What is linear probing? For the following keys: 28, 47, 20, 36, 43, 23, 25, 54 and table size of 11 show the keys storage using linear probing.
13. (b) Write C program for binary search.
14. (a) Write C program for constructing binary search tree.
15. (b) Write C recursive function for post-order tree traversal technique.

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

16. (c) Sketch the memory representation of binary tree given below using arrays and linked list.
17. (a) Explain threaded binary trees with an appropriate example.
18. (b) Describe height balanced trees. Construct AVL tree by inserting keys 4, 5,7, 2, 1, 3, 6.

FirstRanker.com

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