0% found this document useful (0 votes)
1 views3 pages

Computer Programming

The document is an examination paper for the CST 101 course on Computer Programming, intended for Bachelor of Engineering students. It includes various programming tasks such as flowchart creation, number conversion, variable declaration rules, and program writing for specific outputs. The exam consists of multiple sections where candidates must solve questions related to programming concepts, data types, and algorithms.

Uploaded by

brute.svp.666
Copyright
© © All Rights Reserved
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
0% found this document useful (0 votes)
1 views3 pages

Computer Programming

The document is an examination paper for the CST 101 course on Computer Programming, intended for Bachelor of Engineering students. It includes various programming tasks such as flowchart creation, number conversion, variable declaration rules, and program writing for specific outputs. The exam consists of multiple sections where candidates must solve questions related to programming concepts, data types, and algorithms.

Uploaded by

brute.svp.666
Copyright
© © All Rights Reserved
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/ 3

Course Code : CST 101 KOLP/RW – 19 / 9003

First / Second Semester Bachelor of Engineering Examination


(Old Scheme)
COMPUTER PROGRAMMING

Time : 3 Hours ] [ Max. Marks : 60


Instructions to Candidates :—
(1) Due credit will be given to neatness.
(2) Illustrate your answers wherever necessary with the help of neat sketches.

1. Solve any Two :––


(a) Draw a flowchart to find prime number from 1 to n where the value
of n given by the user. 5(CO1)
(b) Convert the following :––
(i) (256.09) 10=(?) 2
(ii) (AB.CD)16=(?) 2
(iii) (52.16) 7=(?) 5 5(CO1)

(c) Enlist various system software. Explain compiler and interpreter in detail.
5(CO1)

2. Solve any Two :––


(a) State the different rules to declare variable in C programming with proper
justification. 5(CO2)
(b) (i) With the help of an example explain dangling if - else problem.
(ii) With the help of an example explain decision control structure.
5(CO2)

(c) The marks obtained by a student in 5 different subjects are input through
the keyboard. The student gets a division as per the following rules :
Percentage above or equal to 60 - First division
Percentage between 50 and 59 - Second division
KOLP/RW-19 / 9003 Contd.
Percentage between 40 and 49 - Third division
Percentage less than 40 - Fail
Write a program to calculate the division obtained by the student. 5(CO2)

3. Solve any Two :––


(a) Write a program to produce the following output :––
1
1 2
1 2 3
1 2 3 4
1 2 3 4 5 5(CO2)
(b) Illustrate the use of break and continue with example. 5(CO2)
(c) Explain enumerated data type and typedef with example. 5(CO2)

4. Solve any Two :––


(a) Write a program to copy content of one string to another without using
strycpy. 5(CO3)
(b) Explain how elements of two dimensional array are stored in memory by
following method :––
(1) Row major order
(2) Column major order. 5(CO3)

(c) Entire one dimensional array can be passed with function. Explain with example.
5(CO3)

5. Solve any Two :––


(a) Differentiate between structure and union with example. 5(CO4)

KOLP/RW-19 / 9003 2 Contd.


(b) Define a structure to store information about a person : his/her name, citizenship
number and salary. Write a program to print details of 15 person in table
format. 5(CO4)
(c) Explain nesting of structure with example. 5(CO4)

6. Solve any Two :––


(a) Write short notes on :––
(1) Iteration
(2) Recursion. 5(CO4)

(b) Differentiate between call by value and call by reference with example.
5(CO4)
(c) Write a program to find XY using recursion. Do not use pow().
5(CO4)

KOLP/RW-19 / 9003 3 105

You might also like