Indira Gandhi National Open University (IGNOU) 2009 B.C.A Computer Application CS-62 C Programming & Data Structure - Question Paper

1.a) What do you mean by Sparse Matrix. Write a program to calculate the transpose a sparse matrix.[6 marks]
b) List the advantages and disadvantages of doubly link list over singly link list. What is a priority Queue? Write an algorithm for inserting an element into circular queue.[8 marks]
c) write an algorithm for insertion sort. Apply insertion sort algorithm for the subsequent list of elements.
17,36,95,25,54,72,68 [7 marks]
d) describe Postorder and Preorder traversal of tree. provided the subsequent Postorder and Preorder traversals,construct the corresponding Binary tree.
Post order: J H D E B I F G C A
Pre order: D J H B E A F I C G
[8 Marks]

2. (a) What is recursion? Write a recursive function to obtain factorial of a number.[4 Marks]
(b) Convert the subsequent infix expression into postfix. Write an algorithm for the identical.
(i) ((A-(B+C)*D)/(E+F))
(ii)(A^(B*C)-D)+(E/F)*(G+H)

3.a) what is B-tree? elaborate the properties of a B-tree of Order M. [5 marks]
(b) Write a program in C for implementing Breadth 1st Search (BFS).[5 marks]

4.(a) What is a File? Write a C program to copy the contents of 1 file to a different file.
(b)Define Binary Search Tree (BST. Write an algorithm to insert a node in a BST. [5 marks]

5. Write short notes on the folowing: [10 marks]
(a) Stack
(b) Circular Link List
(c) Complete Binary Tree
(d) Storage Pool
(e) Pointers

Earning:   Approval pending.