Scribd
Upload
112 views

MCA C & DS Jan 2010

The document contains a past exam for a C programming and data structures course. It lists 8 questions that could be answered, all worth equal marks. The questions cover topics like the execution of a C program, data types in C, loops, arrays, functions, pointers, structures, unions, searching algorithms like binary search, sorting algorithms like quick sort, and linked lists. It also includes questions on graph theory topics such as depth first search and minimum spanning trees.

Uploaded by

N. Janaki Ram
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
112 views

MCA C & DS Jan 2010

The document contains a past exam for a C programming and data structures course. It lists 8 questions that could be answered, all worth equal marks. The questions cover topics like the execution of a C program, data types in C, loops, arrays, functions, pointers, structures, unions, searching algorithms like binary search, sorting algorithms like quick sort, and linked lists. It also includes questions on graph theory topics such as depth first search and minimum spanning trees.

Uploaded by

N. Janaki Ram
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Subject Code: MC912

MCA I Semester [R09] Regular Examinations, January 2010


C PROGRAMMING AND DATA STRUCTURES
Time: 3 Hours Max.Marks: 60
Answer any FIVE questions ALL questions carry EQUAL marks

1. a) Write the various steps involved in executing a C program and illustrate it with a help
of flow chart.
b) Explain various data types defined in C.

2. a) Describe various loops defined in C.


b) How are initial values written in a one-dimensional array definition? Must the entire
array be initialized? What value is automatically assigned to those array elements not
explicitly initialized?

3. a) Describe different types of user defined functions.


b) Write a function which takes a square matrix and then return 1 if it is a “symmetric
matrix”. Otherwise returns zero. Also, write main program to check the function.

4. a) What is a pointer? How do use pointer variable in expression? Explain through


examples.
b) Describe dynamic memory management functions.

5. a) Describe structures types defined in C. How a structure is different from a Union.


b) Define a structure type struct ABS that contains name, age, designation and salary.
Using this structure, write a C program to read this information for one person from the
keyboard and print the same on the screen.

6. a) What is a searching? Write a C program to Binary Search method.


b) Explain Quick Sort method with suitable example.

7. Write an algorithm to insert an element in the linked list at the following positions:
a) In the beginning of a list.
b) After a specified element.
c) Before a specified element.
d) At the end of a list.

8. Write in detail about the following:


a) Depth first search of a graph.
b) Minimum spanning tree.

You might also like