Scribd
Upload
22 views2 pages

MCA1C (Dec09)

This document contains a programming exam with multiple choice and written answer questions covering various C programming concepts. The exam is divided into 5 sections (A-E). Sections A-D each contain 2 questions worth 10 marks each. Section E contains 10 sub-questions worth 2 marks each, for a total of 20 marks. The topics covered include data types, arrays, functions, pointers, structures, files and more. The exam is worth a total of 60 marks and allows the use of a non-programmable scientific calculator.

Uploaded by

Marcebel Jose
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
22 views2 pages

MCA1C (Dec09)

This document contains a programming exam with multiple choice and written answer questions covering various C programming concepts. The exam is divided into 5 sections (A-E). Sections A-D each contain 2 questions worth 10 marks each. Section E contains 10 sub-questions worth 2 marks each, for a total of 20 marks. The topics covered include data types, arrays, functions, pointers, structures, files and more. The exam is worth a total of 60 marks and allows the use of a non-programmable scientific calculator.

Uploaded by

Marcebel Jose
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/ 2

RotlNo.................."*.".'' Tbtal No.

of Questi*ns: 091
L^t4uLu"L AUSu4r.tft4y<,ct

[Total No. of pages : 02

MCA (Serft. l.)'

. CfrM

PROGRAMMING IN C SUBJECTCODE : MCA - 102(N2)

PaperID : [B0l02l
fill fNote: Please subjectcodeand paperID on OMRI

Time : 03 Hours

Maximum Marks : 60

Instruction to Candidates: l) Attempt any one questionfrom eachSectionsA, B, c, and D. 2) Section- E is Compulsory. 3) Use of Non-programmable Scientific Calculator is allowed. Section - A 10) QI) Q2) Discussthe gener alized,methodology involved in the proble-tfi;i .:

What is the range of various data types?Discussthe primary data types in detail. Section - B (IxI0=10) (a) Write a programin C to sort integer elementsof one dimensionalarray in ascendingorder. (b) List few conditional compilation directivesandtheir functionality.

Q3)

Q4)

(a) Write a functionthat interchange printsthe valueoftwo integersA and and B without using any extra variable. (b) Definerecursion. Section - C (I *.IA: I0) (a) What are the two common ways of selecting array elements for processing. (b) Differentiate betweendynamic and non dynamic datastructures. '

A,

Q6)

(a) Explain with examplethe relationship of one dimensional array with pointers. (b) Defineenumeration.

J-71e[812e1

nTo.

Section- D Q7) (1 x I0: l0) How C implementsthe conceptof What is meantby random file access? randomfile access"

QS) (u) Write the algorithmic stepsfor searchinga binary searchtree. (b) Differentiatebetweenexchangeselectionsortingand selectionsorting. Section - E

(10x2:20)

Qe)
a) b) c) d) e) 0 g) h) D ) Compiler. Recursivealgorithm. Bitwise operators" Difference betweena string and a character. Function prototype. file The functionsrelatedto the.header time-h. Pointerarithmetic. Exampleoffunctionreturningpointer' Needof structureinitialization. DifferencebetweenfseekQand ftellQ.

QSOS

J-719

You might also like