M.Sc. DEGREE EXAMINATION, NOVEMBER 2017
First Semester
Information Technology
DATA STRUCTURES AND
(CBCS 2014 onwards)
Time 3 Hours Maximum 75 Marks
Part A (10 x 2 20)
Answer all questions.
1. What will happen when a decimal value is assigned to an
integer variable?
2. Consider the statements
Char c2 c3
c3=c1+c2;
Whether the above statements are valid and compile.
3. What will happen when a function with the same name is
declared and derived from two or more classes in multiple
inheritance?
4. Define pointer.
5. List the characteristics of an algorithm.
6. What is hashing?
7. List out the properties of NP complete problems.
Sub. Code
4MIT1C2
AFF-4969
2
Ws5
8. What are trees? How are they implemented?
9. Define sorting.
10. What is the property of a heap tree?
Part B x 5 25)
Answer all questions.
11. Write a simple program to explain the concept of
class definition and object creation in
Or
How are functions in a class accessed from main
function? Explain with example.
12. What is a stream? How are file streams used for
accessing the file contents in
Or
How are strings handled in Explain the
operation of string concatenation with example.
13. What is a heap? List down the application areas of
heap.
Or
Discuss about the concept of linked list data
structure with example.
14. Differentiate between linear and nonlinear data
structure with example.
Or
What is the need for an efficient searching
algorithm? Describe about binary search tree.
AFF-4969
3
Ws5
15. With example explain merge sorting.
Or
Discuss the properties of greedy algorithm with
example.
Part C x 10 30)
Answer any three questions.
16. What is overloading? With a program, explain how is a
binary operator overloaded?
17. Discuss about the concept of virtual function with a
sample program.
18. Explain the operations of queue data structure with
example.
19. List the characteristics of AVL tree and explain the
operations of AVL tree with example.
20. Explain the concept of dynamic programming. Briefly
discuss the Floyd's algorithm of finding the shortest path
between any two nodes.
————————