CS-62: June, 2005 Term-End Examination

IGNOU BCA CS-62: 'C' PROGRAMMING & DATA STRUCTURE - JUNE 2005 QUESTION PAPER

---

BACHELOR IN COMPUTER APPLICATIONS
Term-End Examination
June, 2005
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.

---

Q.1(a) Write the syntax of any five file handling commands supported by C .

(b) Write a ‘C program to count the number of characters and lines in a text file whose name is supplied command line.

(c) Define an adjacency matrix and an adjacency list. Create an adjacency list and an adjacency matrix for the following graph:

(d) Define a graph. Explain at least two traversal techniques in graphs,

(e) What do you understand by a height balanced tree. Construct a height balanced tree for the following list: 5, 10, 0, 7, 8, 2, 6, 3

(f) Write an algorithm to sort a list using quick sort. Show it’s operations on the following list:
5, 10, 3, 0, 15, 7, 3

Q.2(a) What is a singly linked list ? Mention any two advantage of singly linked list Give linked list representation of the following sparse matrix:

(b) What is a variable length argument ? Give an example of such an argument. How are variable length arguments passed to a function ?

Q.3(a) Write a program in ‘C language that accepts a number as input and prints it in words. (For example, if 256 is the input number, then ‘Two hundred and fifty six’ is the output.)

(b) Write ‘C program which accepts a stack as input and reverses the elements of stack using one additional queue.

Q.4(a) What is garbage collection ? Explain the process of Fragmentation, Relocation, and Compaction w.r.t. garbage collection.

(b) Consider the following declaration :
diagram is not available

Write an algorithm to insert a value *M’ after the last node in the Singly Linked List.

Q.5(a) Describe the steps involved in creating a minimum cost spanning tree from a graph with the help of an example of a graph consisting of at least 4 vertices.

(b) Write at least two differences between a Structure and a Union j, “C language. Give an example each of a structure and Union.