Exam Details
Subject | c and data structures | |
Paper | ||
Exam / Course | m.sc. (se) | |
Department | ||
Organization | Alagappa University Distance Education | |
Position | ||
Exam Date | May, 2016 | |
City, State | tamil nadu, karaikudi |
Question Paper
DISTANCE EDUCATION
M.Sc. years Integrated) DEGREE EXAMINATION,
MAY 2016.
C AND DATA STRUCTURES
Time Three hours Maximum 100 marks
SECTION A — 8 40 marks)
Answer any FIVE of the following questions.
1. Write a short notes on
Keywords
Identifiers
Tokens
Data types.
2. Explain about Implicit and Explicit type conversions.
3. Explain Recursion with example.
4. Write a program that would sort a list of names in
alphabetical order.
5. Explain structures with example.
6. Write a short note about Primitive operations on circular
lists.
7. Discuss about Trees and their Applications.
8. Write a program for Towers of Hanoi.
Sub. Code
14
DE-3909
2
Ws2
SECTION B — 15 60 marks)
Answer any FOUR of the following questions.
9. How to manage input and output operations? Explain it
with example.
10. Write a program to determine whether a given number is
or and print the message 'NUMBER IS EVEN'
or NUMBER IS ODD'.
Without using else option
With else option.
11. Define array and its types. Write a program for matrix
multiplication.
12. Discuss in detail about Pointers with example.
13. Explain about File Operations with example.
14. Define Stack. How to implement push and pop operations
in Stack?
15. How to define Linked List as a Data Structure? Discuss
about getnode and freenode operations.
M.Sc. years Integrated) DEGREE EXAMINATION,
MAY 2016.
C AND DATA STRUCTURES
Time Three hours Maximum 100 marks
SECTION A — 8 40 marks)
Answer any FIVE of the following questions.
1. Write a short notes on
Keywords
Identifiers
Tokens
Data types.
2. Explain about Implicit and Explicit type conversions.
3. Explain Recursion with example.
4. Write a program that would sort a list of names in
alphabetical order.
5. Explain structures with example.
6. Write a short note about Primitive operations on circular
lists.
7. Discuss about Trees and their Applications.
8. Write a program for Towers of Hanoi.
Sub. Code
14
DE-3909
2
Ws2
SECTION B — 15 60 marks)
Answer any FOUR of the following questions.
9. How to manage input and output operations? Explain it
with example.
10. Write a program to determine whether a given number is
or and print the message 'NUMBER IS EVEN'
or NUMBER IS ODD'.
Without using else option
With else option.
11. Define array and its types. Write a program for matrix
multiplication.
12. Discuss in detail about Pointers with example.
13. Explain about File Operations with example.
14. Define Stack. How to implement push and pop operations
in Stack?
15. How to define Linked List as a Data Structure? Discuss
about getnode and freenode operations.
Other Question Papers
Subjects
- c and data structures
- digital computer fundamentals