Download JNTUA MCA 2014 Feb 1st Sem 9F00105 Data Structures Question Paper

FirstRanker.com

MCA I Semester Regular & Supplementary Examinations February 2014

DATA STRUCTURES

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

(For 2009, 2010, 2011, 2012 & 2013 admitted batches only)

Time: 3 hours Max. Marks: 60

Answer any FIVE questions

All questions carry equal marks

1. (a) What is a function? Distinguish between user defined and system defined functions.
   

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

   (b) Write a C program to find the sum of even and odd number from 1 to 100.
2. (a) Discuss in detail about the polynomial representation.
   (b) Explain with a suitable example, the insertion operation of single linked lists.
3. (a) Write a procedure to convert an infix expression into postfix form. Explain it by using an example.
   (b) Write a C program to find the factorial of a given number by using iterative method.

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

4. (a) What are limitations of queues? Explain the circular queues in detail.
   (b) Explain insertion and delete operation by using priority queues.
5. (a) Derive the average case time complexity for quick sort.
   (b) Write and explain the algorithms for sorting a set of elements by using bubble sort technique.
6. (a) Give brief description about Fibonacci search.
   

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

   (b) Write a program to find an element by using linear search technique.
7. Explain with an example, the insertion and deletion operations on a binary search trees.
8. Write short notes on the following:
   Min heaps.
   Threaded binary trees.
   

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

   Height balanced trees.

FirstRanker.com