Amrita Vishwa Vidyapeetham 2007 M.C.A Programing And Data Structures - Question Paper

M.C.A. Dec 2007
Programing And Data Structures
Time : 3 hours Maximum : 100 marks
ans any 5 ques..
every ques. carries equals marks.
1. (a) Explain various data kinds available in C.
(b) Define Expression. Also explain any 3 kinds of expression with examples.
2. (a) What is recursion? Write a C program to obtain N! using recursion.
(b) Explain the concept of stack data structures with a programming example.
3. (a) Explain the method of representing 2 dimensional array in memory. Write a C program to obtain matrix multiplication.
(b) Explain the procedure for inserting and deleting an item in a QUEUE.
4. (a) Explain the applications of STACK data structures.
(b) Write an algorithm to insert and delete a node in a singular linked list.
5. (a) Discuss :
(i) Sequential Representation of Binary Tree.
(ii) Linked Representation of Binary Tree.
(b) Explain Huffman Algorithm.
6. (a) Explain the terms with examples :
(i) Distinguish ranging from Graph and Tree. (2)
(ii) Complete Binary Tree. (2)
(iii) Binary Search Tree. (6)
(b) What is a game Tree? discuss it with an example.
(10)
7. Discuss the subsequent with examples :
(a) Insertion Sort.
(b) Radix Sort.
8. (a) Write an algorithm for the traversal.
(b) Write short notes on Hashing.

Earning:   Approval pending.