BACHELOR IN COMPUTER APPLICATIONS
Term-End Examination
June, 2011
Term-End Examination
June, 2011
CS-62: 'C' PROGRAMMING & DATA STRUCTURE
Time : 2 Hours
Max. Marks : 60
Note : Question number 1 is compulsory. Answer any three questions from the rest. All algorithms should be written nearer to 'C' language.
1. (a) What are Arrays? How are Two-dimensional arrays stored in memory? Write a program to multiply two 2-dimensional arrays.
(b) Write the algorithm for Binary search. Also apply this algorithm on the following data.
22, 44, 11, 88, 33, 55, 77, 66
Show all possible steps.
(c) Define the following terms using suitable examples.
(i) Degree of Tree
(ii) Height of Thee
(iii) Internal Node of a Tree
(iv) Strongly connected graph
(v) Adjacency Matrix
(d) Write an algorithm to convert any Infix expression to its corresponding Postfix notation. Using this algorithm convert the following expression to postfix:
(a + b) / (c – d)
2. (a) What is circular Linked List ? Write an algorithm to add a node at the end of a circular linked list.
(b) Write a program in ‘C’ to add a node to a queue.
3. (a). Define Inorder and Postorder traversals of a tree using suitable example. Construct a Binary tree using the following data.
INORDER: - BGDKHAEICJF
POSTORDER: - GKHDBEIJFCA
(b) ) What is a Heap? Define its types and properties using suitable examples.
4. (a) What is Heapsort? Apply heapsort on the given data.
Show the steps involved.
(b) Write a program in ‘C’ to count the number of Vowels present in a text file. Display the count of each vowel separately.
5. Write short notes on.
(a) Priority Queue
(b) Storage Pool
(c) Quick Sort
(d) Loops in ‘C’ programming
(e) BPS Algorithm
0 comments:
Post a Comment