Andhra University 2005 M.C.A SYSTEMS PROGRAMMING - Question Paper

2005 Andhra University M.C.A Computer Applications SYSTEMS PROGRAMMING ques. paper

SYSTEMS PROGRAMMING

First ques. is Compulsory

ans any 4 from the remaining

ans all parts of any ques. at 1 place.

Time: three Hrs.
Max. Marks: 100

1. Briefly ans the subsequent questions:
a. describe 'Abstract Data Type' ? How are they used in program development?
b. Write the primitive operations of ADT queue.
c. Write the prefix and postfix equivalents to the infix expression A/B+C-D *(E+F).
d. Write the best, worst and avg. case time complexity estimates of Quick Sort algorithm.
e. What is an Almost Complete Binary Tree? Write an application that makes use of it.
f. Write the applications of depth 1st traversal of a graph.
g. When does interpolation search performs better than binary search?

2. a. presume that every element of an array 'A' stored in row-major order occupies 4 bytes of memory . If 'A' is declared as: int a [10][20][5]. And the address of the 1st element of 'A' is 2000, obtain the address of the array element A[5][12][4].
b. Write a C program to evaluate a provided postfix expression using stack and discuss it with an example.

3. a. Write a recursive function in C to obtain the nth Fibonacci number.
b. Write a non – recursive function for the above issue.
c. Compare the efficiencies of the above 2 functions.

4. a. Compare and contrast the ADTs Queue and Priority Queue.
b. Write a C function to concatenate 2 singly linked circular list without traversing either of them and discuss it.

5. a. explain various ways of representing a binary tree and suggest an application for every of the representations.
b. discuss how the threads are used to simplify the traversal of a binary tree.

6. a. Construct a binary search tree to accommodate the provided list of integers.
47,56,23,17,64,36,29,22
b. obtain the in order, preorder and post order sequence of nodes of the above tree. discuss the process of deletion of node '23' from the above tree and draw the resulting tree.

7. Write a C function to organize the elements of an array in ascending order using Radix sort algorithm and discuss it with a suitable example.

8. explain the Dijkstra's algorithm for finding the shortest paths from a source to all other vertices in a directed graph. What is its time complexity.

Earning:   Approval pending.