Reg. No.
B.E. B.Tech. DEGREE EXAMINATION, MAY 2017
Fourth Semester
Electrical and Electronics Engineering
(Common to Electronics and Instrumentation Engineering and
Instrumentation and Control Engineering)
01UIT424 DATA STRUCTURES AND ALGORITHMS
(Regulation 2013)
Duration: Three hours Maximum: 100 Marks
Answer ALL Questions.
PART A (10 x 2 20 Marks)
1. Difference between Class and structure.
2. Write a program to check the given integer is Prime or composite number.
3. Illustrate the exception handling mechanism.
4. What do you mean by pure virtual function?
5. What are the features of an efficient algorithm?
6. Define algorithm.
7. What are the two traversal strategies used in traversing a graph.?
8. What is complete binary tree?
9. How to perform union operation?
10. What is the time complexity of quick sort and binary search?
Question Paper Code: 31804
2
31804
PART B x 16 80 Marks)
11. Write a member function and friend function to subtract two complex numbers in
Or
What is the purpose of constructor and destructor? Explain with suitable example the different types of constructors in
12. What is inheritance? Discuss in detail about the various types of inheritances in with suitable examples.
Or
What is virtual function? Explain with an example how late binding is achieved using virtual function.
13. Write some set of routines for implementing two stacks within a single array.
Or
Write a code to perform addition of two polynomials using link list form of queue.
14. Illustrate the depth first search algorithm with a graph and explain.
Or
Write code for the implementation of different types of tree traversals. State few tree applications.
15. Discuss the quick sort algorithm and apply the same for the following numbers 90, 77, 60, 99, 55, 88, 66.
Or
Explain in detail about linear search algorithm with an example.