Exam Details
Subject | c and data structures | |
Paper | ||
Exam / Course | p.g.d.c.a. | |
Department | ||
Organization | Alagappa University Distance Education | |
Position | ||
Exam Date | May, 2017 | |
City, State | tamil nadu, karaikudi |
Question Paper
DISTANCE EDUCATION
P.G.D.C.A. EXAMINATION, MAY 2017.
First Semester
C AND DATA STRUCTURES
(2011 Calendar Year Onwards)
Time Three hours Maximum 100 marks
SECTION A — 8 40 marks)
Answer any FIVE questions.
1. Describe the various data types supported by ANSI C
with examples.
2. Differentiate loop with while' loop with their
syntax.
3. How can you define and call a function? Explain.
4. Describe any three string handling functions with its
usage.
5. Write in brief about structure initialization.
6. List down the basic file operations and explain them in
brief.
7. Transform the prefix expression to its infix form.
GHI
8. Discuss the operations on Binary Trees.
Sub. Code
12
DE-030
2
sp3
SECTION B — × 15 60 marks)
Answer any FOUR questions.
9. Discuss about the different categories of operators.
10. Describe the formatted input output statements in
language.
11. Write a program to find the sum of the digits of a
given three digit number.
12. Describe the various categories of functions.
13. Write a program in to check whether the given string
in a Palindrome or not.
14. Define a queue data structure with its operations.
15. Differentiate singly linked list with doubly linked list
with its operations.
P.G.D.C.A. EXAMINATION, MAY 2017.
First Semester
C AND DATA STRUCTURES
(2011 Calendar Year Onwards)
Time Three hours Maximum 100 marks
SECTION A — 8 40 marks)
Answer any FIVE questions.
1. Describe the various data types supported by ANSI C
with examples.
2. Differentiate loop with while' loop with their
syntax.
3. How can you define and call a function? Explain.
4. Describe any three string handling functions with its
usage.
5. Write in brief about structure initialization.
6. List down the basic file operations and explain them in
brief.
7. Transform the prefix expression to its infix form.
GHI
8. Discuss the operations on Binary Trees.
Sub. Code
12
DE-030
2
sp3
SECTION B — × 15 60 marks)
Answer any FOUR questions.
9. Discuss about the different categories of operators.
10. Describe the formatted input output statements in
language.
11. Write a program to find the sum of the digits of a
given three digit number.
12. Describe the various categories of functions.
13. Write a program in to check whether the given string
in a Palindrome or not.
14. Define a queue data structure with its operations.
15. Differentiate singly linked list with doubly linked list
with its operations.
Other Question Papers
Subjects
- c and data structures
- communication skills
- computer graphics
- digital computer organization
- object oriented programming and c++
- operating system
- relational database management systems
- unix and shell programming