B.Sc Computer Science (April 2012) Madras University -Data Structures Using C++

Started by vedha.v, Dec 10, 2012, 01:59 PM

Previous topic - Next topic

vedha.v

(April 2012), Madras University, B.Sc Computer Science, Second Year, Semester-III, Data Structures Using C++, PC3A Question paper

Course: B.Sc B.Sc Computer Science       University/board: Madras University



University Name: Madras University
Name of the Degree: B.Sc Computer Science
Title of the Paper: Data Structure Using C++
Month & Year of Examination: April - 2012
Subject Code: PC3A
Semester: III
Year: Second Year


Time: Three hours
Maximum: 100 marks

PART-  A
(10 * 3 = 30 marks)

Answer any TEN questions.
All questions carry equal marks.


1. Enumerate the rules for naming variables in C++.
2. Write the uses of Inline function. Write the syntax for defining Inline function.
3. What are tokens? Give examples.
4. What are the types of Inheritances?
5. What is a destructor? Is it mandatory to define a destructor in C++ program?
6. Write any four error handling functions of C++.
7. What is meant by asymptotic notation?
8. Write the procedure for converting Infix notation to post fix notation.
9. What do you mean by recursion?
10. Write the advantage of double linked list over single linked list.
11. What is a Graph? What are its types?
12. What is a hashing function?

PART- B 
(5 * 6 = 30 marks)

Answer any FIVE questions.
All questions carry equal marks.


13. Discuss about control structures in C++.
14. Explain about friend function with proper example.
15. Discuss on various types of constructors.
16. Write notes on hybrid inheritance.
17. Describe about primitives and composite data types.
18. Write about various operations on Queue.
19. Explain about conversion of Forest to Binary tree.

PART-  C (
4 * 10 = 40 marks)
Answer any FOUR questions.
All questions carry equal marks.
Each answer should not exceed 500 words.


20. Write notes on the following
(a)   Parameter passing in function. (5)
(b)   Virtual functions (5)
21. Write the rules for operator overloading. Explain operator overloading with suitable example.
22. Explain about polymorphism with examples.
23. Write notes on command line arguments.
24. Describe about linked list operations.
25. Explain about Dijkstras algorithm.