Roll No........................

Total No. of Questions : 13] [Total No. of Pages : 02

J-3151[S-1007] [2037]
M.Sc. (CST) (Semester - 1st)
PROGRAMMING IN C
(M.Sc. (CST) - 103)
Time : 03 Hours Maximum Marks : 75

Instruction to Candidates:
1) Section - A is compulsory.
2) Attempt any Nine questions from Section - B.

Section - A
Q1) (15 x 2 = 30)
a) What are the rules for naming of identifier?
b) How is executable program obtained from source program in C?
c) What is the working principle of prefix operators? Give example.
d) What are the advantages of arrays?
e) Differentiate between switch and if-else statements.
f) What are the components of user-defined functions?
g) What is the relationship between two dimensional array and pointers?
h) What dynamic memory allocation?
i) Differentiate between structure and union.
j) What are the advantages of recursion?
k) Explain briefly the two operations which can be performed on stacks.
1) What are the advantages of data file over other data types?
m) What are the two methods of opening a file?
n) What are the methods of detecting end-of-file?
o) List the properties of binary tree.

P.T.O.
 Section - B
(9 x 5 = 45)
Q2) Write a program to find the reverse of an integer number entered by the
user.

Q3) Explain basic data types available in C with the help of example.

Q4) Write a program in C to sort in ascending order integer elements of one-

dimensional array.

Q5) Explain the difference between break and continue statements with example(s).

Q6) Differentiate between pass by value and pass by reference with the help of
example.

Q7) Explain with the help of example the concept of passing array of functions.

Q8) Explain array of structures with example.

Q9) Explain with example the relationship of one dimensional array with pointers.

Q10) Write a program to create a file and display its contents. Assume suitable
data.

Q11) Explain traversal in a singly linked list.

Q12) What is path, length of path and height of a node for a tree?

Q13) What are the conditions under which operations on queue can take place?
What is FIFO? What is its connection with queue?

J-3151[S-1007] 2