EC6301 OBJECT ORIENTED PROGRAMMING AND DATA STRUCTURES IMPORTANT QUESTIONS
UNIT 1 :
- What are the advantages of using default arguments? Explain with example program.
- What is a structure and explain the members of structure with an example program
- Briefly explain function overloading and operator overloading with examples
- What is friend function? What is the use of using friend functions in c++ ? Explain with a program.
- Explain i) copy constructor arid destructor with suitable CPP coding
ii) static member and this pointer with suitable code.
UNIT 2 :
- Explain the various types of Inhieritance with suitable example program.
- What are virtual functions? Explain their needs using a suitable example .What are the rules.associated with virtual functions?
- What are abstract classes? Give an example (with the 'program) to illustrate the use of abstract class.
- Explain type conversion and Code Reuse with example
- Explain inheritance, polymorphism, with example
UNIT 3:
- Explain about Linked list, its Types, insertion and deletion routines
- Explain the insertion and deletion operation in singly linked list.
- Explain the implementation stack using linked list and Write the ADT operation for insertion and deletion routine in stack
- Explain the process of postfix, prefix, infix expression evaluation with an exampie. Give the procedure to convert an infix expression a+b*c+(d*e+f)*g to postfix notation.
- What is a queue? Write an algorithm to implement queue.
- Write the AUT operation for insertion and deletion routine in linked Lists & Queue
UNIT 4:
- Explain the operations of insertion of nodes into and deletion of nodes from, a binary search tree with code.
- Draw the binary search tree fur the following input 25,75,15,50,66,33,44. Trace an algorilthrn to delete the nodes 25, 75, 44 from the tree,
- What are the graph traversal methods? Explain it with example
- Write an algorithm for finding minimum spanning Tree and explain application, illustrate the algorithm with typical data of yours own example.
UNIT 5 :
- Explain the operation of Merge Sort and External sorting.
- Write Quick sort Algorithm and Explain.
- Trace Quick sort algorithm for the following : 90,77,60,99,55,88,66
- Write down merge sort algorithm and Write about its worst case , best case, and average case analysis.
- Quick sort Algorithm with Example.
- Linear search and Binary Search with Example.
We are a community of students and proffessors striving hard to bridge the gap between Students and Anna university. We provide all types of information related with Anna University and we also help students with their Exam Preparations.
ConversionConversion EmoticonEmoticon