DISTANCE EDUCATION
B.Sc. (Computer Science) DEGREE EXAMINATION,
MAY 2017.
DATA STRUCTURES USING
(2007 onwards)
Time Three hours Maximum 100 marks
Answer any FIVE questions.
All questions carry equal marks.
20 100)
1. Explain different looping statements in C with
example.
Discuss the bitwise operators with suitable
example.
2. Explain Recursive function with an example
program.
What is a pre-processor? How are they categorized
and explain each with suitable example?
3. State and explain various modes of file opening and
file closing.
Explain dynamic memory allocation and releasing
dynamically allocated memory.
4. What is a Queue? Explain its operations with
example.
Discuss the applications of stack.
Sub. Code
14
DE-209
2
wk11
5. Explain single linked list with an example.
Discuss about binary tree representation.
6. With the syntax and example, explain break and
continue statement.
Write a C program to cheek whether the given
number is prime or not.
7. Define array. Explain different types of array in
detail.
Write short notes on Macros.
8. Convert the given infix expression to postfix
expression using stack and show the details of stack
at each step of conversion.
b c f
Note indicates exponent operator.
Discuss the stepwise procedure for in-order and
post-order traversal of binary tree.