Download as pdf or txt
Download as pdf or txt
You are on page 1of 3

Total No of Pages: p

B. Tech. If Sem. (I.Iain / Back) Exam., May 2017 -


206 Fundarpentals of Compqt." prog";#il'

Time SHours .'. ' ,Maximuth Marks: 80


Min. Passing Marks Main: 26
Min. Passing Marks Backz 24
Instructions to Candidates :
Attempt any five questians, selecting one question
from each unit. All questions
carry equal marks. schematic diagrams must be sh,own wherever
nrrrrrr,ry. eny
data youfeel missing suitably be assumed andstated ctearly.
units of quantities used./calcuraued must be stated clearly
use of following supporting material is permitted during
examination.
(Mentioned inform No. 205)
I. NIL 2. NIL

UNIT.I
F
Q.1 (a) Describe the structure of C program in detail.
t8l
(b) what do you understand by precedence of operator? How it is considered
in
expression evaluation?
t8l
OR
Q.1 (a) Describe the arithmetic and logical operator available in
c Language. t8l
(b) Explain following with suitable example:
(i) Basic Data types
12tr
(ii) Scope of variable
t2)
(iii) Type casting
t2t
(iv) Identifiers
12)
[zqzoo61 Page l of3 ]4212a1
.i

',: :
':

Q,2 (a) write a c prog.am to reverse an inputted integer number, e.g. if:inplt ls;2375

.[10]
(b) write syntax of switch' ase decision making statenrent.

OR
Q'2 1a1 what are comnrand line arguments? Explain with example.
t6l
(b) Write a C program to multiply two matrices. ',
t10I

Q'3 what do you undershnd uy fite trandling? Enumeratq and explain


various file handling
functions used in C language.
t16l
OR
Q.3 (a) What is structure? Explain.

(b): ffiat do you underst4nd:by dynamic,memory allocation?


, [u]
tsl
tsI

Q,4 (a) WriteaCprograrq using function to display first n numbers of a Fibonacci


series.
t8I
(b) Whatis function? Explain iall by value and call Uy net e with"example. t8l
OB
Q.4 (a)
t6l
o) What is void pointer? Discuss its uses. ': .:
;. tsI
..(c) Discuss pointer to structure.
tsI

[282AA61 Page 2 of3


l+2,2al
ri.
ExDlaln:
t6l.
(a) PriffiI memory and secondary storage'
floln' ahart ts]
(b) nepdfuiing algorithfi'tlisough
'tsl
method
(c) Random, direct ad sequential access

::
I :
, EB,
-i

Q.$ eouErsitfqtlowitrg: '

[4]
(a) (12363)w=8)z ' ,
,

: t'',_ I ., ..

H
,.-

(c). (A B2OC.00C) ro= (Drir


w
t4l
(d) (1'01026f)r= (?)z
.,

.. I i r

-'---li!----b---t_!?

Pege 3.of'3 t4?fzot


[2E2006}

You might also like