CCS21 — C++ AND DATA STRUCTURES
JUNE/JULY 2021
Time : Three hours
Maximum : 75 marks
SECTION
A — (10 x 2 = 20 marks)
Answer
ALL questions.
1. Mention the purpose of Manipulators.
2. Specify the purpose of any two
Mathematical functions.
3. What are Command-line arguments?
4. Define the term — Polymorphism.
5. What is Data Abstraction?
6. Define the term –– Data Structure.
7. What are Graph Traversal techniques?
8. Define the term — Recursion.
9. What is Merge sort?
10. Define the term — Hashing.
SECTION B — (5 X 5 = 25 marks)
Answer
ALL the questions.
11. (a) Explain
the structure of a C++ Program using an example.
Or
(b) Discuss on Keywords, Identifiers and Constants.
12. (a) Describe
the Single Inheritance mechanism with example.
Or
(b) Explain the Exception handling mechanism
using example.
13. (a) Discuss
on different Views of Data.
Or
(b) Describe the Stack operations using
Linked List.
14. (a) Explain
the method of verifying and writing Recursive Functions.
Or
(b) Discuss on Tree Traversal techniques.
15. (a) Describe
the Bubble sort algorithm.
Or
(b) Explain the working of Linear and Binary
Search algorithms.
Answer
any THREE questions.
16. Describe the
importance of Inline Functions and Default arguments with examples.
17. Discuss on the method
of Overloading Binary Operators using example.
18. Explain the concept
of Queue, its operations and implementation.
19. Describe the Binary
Search Tree operations and implementation.
20. Explain the Selection
sort algorithm using a numerical example.
———————
No comments:
Post a Comment