Exam Details
Subject | programming in c and data structures | |
Paper | ||
Exam / Course | b.sc. information technology | |
Department | ||
Organization | alagappa university | |
Position | ||
Exam Date | April, 2018 | |
City, State | tamil nadu, karaikudi |
Question Paper
B.Sc. DEGREE EXAMINATION, APRIL 2018
Second Semester
Information Technology
PROGRAMMING IN C AND DATA STRUCTURES
(CBCS 2011 onwards)
Time 3 Hours Maximum 75 Marks
Part A (10 x 2 20)
Answer all questions.
1. Define Variables.
2. What is the use of Bitwise operators?
3. Give syntax for Initializing One Dimensional Array.
4. What is Dynamic Memory Allocation?
5. Define Structures.
6. Give syntax for Creating a File.
7. Define Postfix with an example.
8. What is a Queue?
9. What is a Binary Tree?
10. List out any two applications of Trees.
Sub. Code
IBIT2C1
AFC-10813
2
Sp 5
Part B x 5 25)
Answer all questions, choosing either or
11. Discuss about Decision Making Statements in C
with suitable examples.
Or
Write a C program to find out Sum of series
.... n).
12. Specify declaration and initialization of Two
Dimensional Array.
Or
Write a C program to find out Total and average
using Pointers.
13. Briefly explain about Union.
Or
Write short notes on Unformatted Data File.
14. Briefly discuss about Queue with suitable example.
Or
Illustrate Command Line Parameters.
15. Write short notes on applications of Trees.
Or
Discuss the concept of Lists with an example.
AFC-10813
3
Sp 5
Part C x 10 30)
Answer any three questions.
16. Illustrate Switch ... case statement in C with suitable
example.
17. Explain passing Functions to other Function with an
example.
18. Specify the concepts of File such as Opening a file,
Read/Write a file and Closing a file.
19. Discuss Stack with an example.
20. Exemplify Binary Tree Representation.
————————
Second Semester
Information Technology
PROGRAMMING IN C AND DATA STRUCTURES
(CBCS 2011 onwards)
Time 3 Hours Maximum 75 Marks
Part A (10 x 2 20)
Answer all questions.
1. Define Variables.
2. What is the use of Bitwise operators?
3. Give syntax for Initializing One Dimensional Array.
4. What is Dynamic Memory Allocation?
5. Define Structures.
6. Give syntax for Creating a File.
7. Define Postfix with an example.
8. What is a Queue?
9. What is a Binary Tree?
10. List out any two applications of Trees.
Sub. Code
IBIT2C1
AFC-10813
2
Sp 5
Part B x 5 25)
Answer all questions, choosing either or
11. Discuss about Decision Making Statements in C
with suitable examples.
Or
Write a C program to find out Sum of series
.... n).
12. Specify declaration and initialization of Two
Dimensional Array.
Or
Write a C program to find out Total and average
using Pointers.
13. Briefly explain about Union.
Or
Write short notes on Unformatted Data File.
14. Briefly discuss about Queue with suitable example.
Or
Illustrate Command Line Parameters.
15. Write short notes on applications of Trees.
Or
Discuss the concept of Lists with an example.
AFC-10813
3
Sp 5
Part C x 10 30)
Answer any three questions.
16. Illustrate Switch ... case statement in C with suitable
example.
17. Explain passing Functions to other Function with an
example.
18. Specify the concepts of File such as Opening a file,
Read/Write a file and Closing a file.
19. Discuss Stack with an example.
20. Exemplify Binary Tree Representation.
————————
Other Question Papers
Subjects
- and os
- cloud computing
- database management systems
- elective : multimedia technology and its
- elective — client server computing
- elective — computer networks
- elective — graphics and multimedia
- elective — mobile communication
- elective — xml and web services
- elective: distributed computing
- information technology
- java programming
- mobile communication
- principles of information technology
- principles of information technology and os
- programming in c and data structures
- programming in c++ and algorithms
- software engineering
- visual programming
- web design technology
- web programming