Roll No……
Total No. of
Questions: 09
Paper
ID [B0102]
MCA
(Sem.-1st)
PROGRAMMING
IN C (MCA-102)
Time: 3 Hrs. Max.
Marks: 60
Instruction to Candidates:
1.
Attempt any one question from each Sections A, B, C & D.
2.
Section-E is Compulsory.
SECTION-A
1. Discuss the generalized methodology
involved in the problem solving.
2.
What is the range of various data
types? Discuss the primary data types in detail.
SECTION-B
3. (a)
Write a program in C to sort integer elements of one dimensional array in
ascending order.
(b) List few conditional compilation directives and
their functionality?
4. (a)
Write a function that interchange and prints the value of two integers A and B
without using any extra variable.
(b) Define recursion.
SECTION-C
5. (a)
What are the two common ways of selecting array elements for processing?
(b) Differentiate between dynamic and non dynamic
data structures.
6. (a)
Explain with example the relationship of one dimensional array with pointers.
(b) Define enumeration.
SECTION-D
7. What
is meant by random file access? How C implements the concept of random file
access.
8.
(a) Write the algorithmic steps for
searching a binary search tree.
(b) Differentiate between exchange selection sorting
and selection sorting.
SECTION-E
9.
(a) Compiler.
(b) Recursive algorithm.
(c) Bitwise operators
(d) Difference between a string and a character.
(e) Function prototype.
(f) The functions related to the header file time h.
(g) Pointer arithmetic
(h) Example of function returning pointer.
(i) Need of structure initialization.
(j) Difference between fseek() and ftell().
0 comments:
Post a Comment
North India Campus