Scribd
Upload
1 views2 pages

Computer Programming (2017)

This document outlines the examination structure for the CST 101 Computer Programming course, including instructions for candidates and a series of programming questions. The exam consists of multiple questions requiring candidates to demonstrate their understanding of algorithms, C programming, data structures, and recursion. Each question allows for the selection of sub-questions, with a focus on practical programming tasks and theoretical concepts.

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
1 views2 pages

Computer Programming (2017)

This document outlines the examination structure for the CST 101 Computer Programming course, including instructions for candidates and a series of programming questions. The exam consists of multiple questions requiring candidates to demonstrate their understanding of algorithms, C programming, data structures, and recursion. Each question allows for the selection of sub-questions, with a focus on practical programming tasks and theoretical concepts.

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

Course Code : CST 101 ITSJ/RW – 17 / 1003

First / Second Semester Bachelor of Engineering Examination

COMPUTER PROGRAMMING

Time : 3 Hours ] [ Max. Marks : 60

Instructions to Candidates :—
(1) All questions carry equal marks.
(2) Solve any Two sub–questions from each question except question no. Five.
(3) Illustrate your answers wherever necessary with the help of neat sketches.
(4) Assume suitable data wherever necessary.

1. (a) What do you mean by algorithm ? Propose an algorithm to find the minimum
of three numbers. 5(CO 1)
(b) State the differences between the followings :
(i) Procedure oriented and object oriented language.
(ii) Compiler and interpreter. 5(CO 1)

(c) Convert the following octal numbers into its equivalent decimal, binary and
hexadecimal number :
(i) 326.32
(ii) 12.76. 5(CO 1)

2. (a) Write short note on storage class available in C. Mention storage, default
initial value, scope and life for each of these classes. 5(CO 2,CO 3)
(b) If the three sides of a triangle are entered through the keyboard, write
a program to check whether the triangle is valid or not. The triangle is
valid if the sum of two sides is greater than the largest of the three
sides. 5(CO 2,CO 3)
(c) Write a C program to check whether an alphabet is vowel or consonant
using switch case. 5(CO 2,CO 3)

ITSJ/RW - 17 / 1003 Contd.


3. (a) Write a C program to print all the Armstrong numbers from 1 to n.
5(CO 3)
(b) Write a program to print all the ASCII values their equivalent characters
using a do–while loop. The ASCII values vary from 0 to 255.
5(CO 3)
(c) Write a program to produce the following output using any loop :
1
θθ
111
θθθθ
11111 5(CO 3)

4. (a) Write a progarm to compute transpose of a m x n matrix. The transpose


of a matrix is obtained by exchanging the elements of each row with
the elements of the corresponding column. 5(CO 4)
(b) Write a C program to multiply a matrix of size m x n with a vector
of size n x 1. 5(CO 4)
(c) Write a function in C which computes the difference between the largest
and smallest element in an array of n integers using pointers. 5(CO 4)

5. Create a structure to specify data on students given below :


Roll number. Name, Department, Course and Year of joining. Assume that there are
not more than 450 students in the college.
(1) Write a function to print names of all students who joined in a particular
year.
(2) Write a function to print the data of a student whose roll number is
given. 10(CO 5)

6. (a) Write a C program to find whether an entered number is palindrome or


not using recursion. 5(CO 5)
(b) Write a C program to compute the addition of all the elements of an
array using call by reference. 5(CO 5)
(c) Write a recursive function to obtain the sum of the first n numbers of
a Fibonacci sequence. In a Fibonacci sequence the sum of two successive
terms gives the third term. 5(CO 5)
ITSJ/RW - 17 / 1003 2 505

You might also like