Semester : SEMESTER 3
Subject : Computer Programming
Year : 2019
Term : MAY
Scheme : 2015 Full Time
Course Code : EE 207
Page:1
Reg No.:_. Name:
Max. Marks: 100
10
1]
12
13
೩)
a)
b)
a)
b)
a)
b)
a)
b)
C1156 Pages 2
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
THIRD SEMESTER B.TECH DEGREE EXAMINATION(S), MAY 2019
Course Code: EE207
Course Name: COMPUTER PROGRAMMING
PARTA
Answer all questions, each carries 5 marks.
Which are the logical operators used in C language. Explain with example.
With suitable example explain the syntax of switch -case statement in C language.
Write a C program to read an array of integers and search for the occurrence of a given
value.
What is the use of a static variable? Explain with example.
Define a structure and union with following as members - an integer variable, a
character array having 20 characters, and a floating point variable. How many bytes are
allotted for each? Illustrate and explain.
Write a C program to swap two variables using pointers.
Which are the different options for opening a file in C. Explain any four with example.
What are the advantages of Python as a programming language? Write a Python
program to find the larger of two numbers.
PART 1
Answer any two full questions, each carries 10 marks.
Write an algorithm and draw flow chart for finding the number of numbers divisible by
3 between 100 and 200.
Which are the basic data types in C language? How the memory allocation is done for
each data type.
Write a C program to swap two numbers without using third variable
Write a C program to find the sum of the digits of a number.
Write a C program to print first 10 numbers of Fibonacci series.
PART C
Answer any two full questions, each carries 10 marks.
Give the syntax and example for two methods of reading a string.
Write a C program for multiplication of two matrices.
Write a C program to read a string and check whether it is palindrome or not.
What are the advantages of recursive function? Write a recursive function using C to
find the factorial of a number.
Page 1 of 2
Duration: 3 Hours
Marks
(5)
(5)
(5)
(5)
(5)
(5)
(5)
(5)
(10)
(5)
(5)
(5)
(5)
(4)
(6)
(5)
(5)