Tilka Manjhi Bhagalpur University 2007 M.C.A C

COPYRIGHT RESERVED MCA – CS (12)

2007

Time : three hours

Full Marks : 80

Candidate are needed to provide their answers in
Their own words as far as possible.

The ques. are of equal value .
ans any 5 ques. opted at lowest
1 from every Group Q. No . one is compulsory

1. Indicate the accurate answers of the subsequent :
A. What is the size in memory of long double ?
a. 10 byte
b. 6 byte
c. 4 byte
d. 8 byte
B. Lower bound of the array in C is :
a. 1
b. 0
c. – one
d. 2
C. Queue work on the principle of :
a. FIFO
b. LIFO
c. FILO
d. IFFO
D. Recursive function work on the principle of :
a. Queue
b. Interaction
c. Stack
d. None
E. What is the efficiency of Quicksort ?
a. O (n log2 n)
b. O (log2 n)
c. O (log n log n)
d. O (n log n2 )
F. Total no. of elements in a tree having height h :
a. 2h-1
b. 2h - one
c. 2h +1
d. 2h
G. Pre – processor is used to describe :
a. Macro statement
b. Function
c. User describe function definition
d. None
H. Which 1 has the higher precedence operator ?
a. [ ]
b. + +
c. + =
d. ? :
Group – A

2. (a) What are the important control structure in C – language ?
(b) Write a program to check Armstrong number ?
3. (a) describe 1 and 2 dimensional array ?
(b) Write a program to print transpose of a provided matrix and check symmetric
Condition ?
four (a) describe the subsequent file handling function with syntax and example :
1. f write ()
2. f puts ()
3. f close ()
4. f open ()
5. f seek ()
(b) Write the various file opening mode ?
5 Define and discuss the subsequent :
a. Identifier
b. Operators and their associativity
c. Formatted I/O function
d. Mathematical function sin ( ) , round ( ) ,sqrt ( ) , log ( )

Group – B

six (a) elaborate graph representation techniques in C ? Write with example .
(b) Write recursive function for DFS .
seven (a) Convert the subsequent expression into prefix and postfix :
1. ( a + b * c ) – c * d / k
2. c / d * k – p +q * r +s
3. ( a * b ) + (c + d ) * ( p * t / r ) – r
(b) Create expression tree of above expression ?
8 (a) What is ADT ? is the array work as ADT ? If yes then how ?
(b) describe recursive function and their working principle with example ?
nine (a) Create a B. S. T. for the subsequent elements :
30 , 90 ,70 , 15 , 24 , 86 ,87 ,40 , 25.
(b) Transverse the above tree in order , past order and pre order .
(c) Write the function to transverse tree of degree n in pre order and in order .

Earning:   Approval pending.