DISTANCE EDUCATION
B.Sc. (Information Technology) DEGREE EXAMINATION,
MAY 2016.
C AND DATA STRUCTURES USING
(2007 onwards)
Time Three hours Maximum 100 marks
Answer any FIVE questions.
All questions carry equal marks.
20 100)
1. Write a short note on History of C with the basic
structure of a C program.
How are nested if-else statements interpreted? In
particular, how the following interpreted?
if f1 if f2 r1
else r2
Which logical expression is associated with the else
clause?
2. State formal and actual arguments and explain the
relation between formal and actual arguments.
When are array declarations in contrast to array
definitions required in a C program? How do such
declarations differ from array definitions?
3. Discuss in brief about Dynamic Memory Allocation
with suitable example.
Describe the different ways in which data files can
be categorized in C.
Sub. Code
14
DE-3407
2
Ws7
4. Explain in detail about the stack operation with
example program.
Discuss briefly about various steps required to
perform enqueue and dequeue operations.
5. With suitable illustration, discuss briefly about the
operations of insertion and deletion of elements in a
linked list.
Construct a binary tree for the following

6. Write a C program to find the smallest number in a
given array.
Explain in detail about the C pre-processor with
necessary examples.
7. How is pointer variable declared? What is the
purpose of data type included in the deceleration?

Write a note on fopen( and fclose( functions and
describe the information that is returned by this
functions.
8. Compare and contrast singly linked list and doubly
linked list with example.
Write a short note on how to represent binary trees
with a sample program.