Semester : SEMESTER 3
Subject : Computer Programming
Year : 2019
Term : DECEMBER
Scheme : 2015 Full Time
Course Code : EE 207
Page:1
Reg No.:_ Name:
Max. Marks: 100
تم ~ >+ ہا
10
11
12
13
14
THIRD SEMESTER B.TECH DEGREE EXAMINATION(R&S), DECEMBER 2019
a)
b)
a)
b)
a)
b)
a)
b)
a)
b)
a)
b)
C192057 Pages:2
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
Course Code: EE207
Course Name: COMPUTER PROGRAMMING
PARTA
Answer all questions, each carries 5 marks.
Write an algorithm for printing all odd numbers between 10 and 50.
With the help of an example, explain the use of continue statement.
Write aC program to find the median of n integers stored in an array
Using an example, explain the concept of recursion.
Using pointers, write a C program to arrange the letters of a word in alphabetic
order.
What are unions? How are they different from structures?
Write 8 ( program to append the contents of one file to another file.
Write a Python program to check if the given string is a palindrome or not.
PART 13
Answer any two full questions, each carries 10 marks.
What are pre-processor directives? Give examples.
Draw a flow chart to determine sum of digits of an integer.
Differentiate between relational and logical operators in C
Write aC program to find the age of a person in years, months and days if his
date of birth is entered.
What is the purpose of go to statement? Give an example.
Write a program to compute the sum of the series 1+ بفر x°+x*+.....4 x"
PART C
Answer any two full questions, each carries 10 marks.
What are arrays? How are they advantageous when compared with normal
variables?
Write 8 ( program to find the product of two matrices.
Write a C program to count the number of words, vowels and consonants in a
sentence entered by the user.
Using a function write a C program to find the binary equivalent of an integer.
Describe the various storage classes in C.
Write a C program to find the largest element of each row of an m ೫ n matrix and
place it in the 1” column of the corresponding row. Use function.
Duration: 3 Hours
Marks
(5)
(5)
(5)
(5)
(5)
(5)
(5)
(5)
(4)
(6)
(4)
(6)
(4)
(6)
(4)
(6)
(5)
(5)
(4)
(6)