Syllabus of Andhra University BTech Information Technology - IT 2.2.8 - Oop Lab

Second year - Second Semester

Instruction: 3 Periods / week
Univ. Exam : 3 Hours

Sessional Marks: 50
Univ-Exam-Marks: 50

PART - A

1. Define a class Complex and overload operators + , - , * , << , >> for complex numbers.

2. Define a class Matrix and overload operators + , - , * , << , >>.

3. Define a class String and write a C++ program to overload + for concatenation, >= , <= , == for comparison of two strings.

4. Define a class Set whose objects are integers. Write a C++ program to implement member functions Set ( int SZ = 0 ), Void insert ( int x), int find ( int x) , Void unionset (set, set) , Void intersection ( set, set ), void difference ( set, set).

5. Define a basic two-dimensional Shape class from which objects such as rectangle, circle which can be derived. Let the user specify the position, size, of drawing 2-D object.

6. Implement ‘static class member function’ using class Item which has a static member count.

PART – B

1. Implement Stack operations insertion, deletion
(a) Infix to postfix conversion
(b) Postfix evaluation
(c) Extend insertion and deletion with exception handling and templates

2. Implement Queue operations insertion, deletion
(a) Extend insertion and deletion with exception handling and templates

3. Implement Linked list operations insertion, deletion, traversal, concatenation.
(a) Implement polynomial addition with linked list
(b) Implement polynomial multiplication with linked list
(c) Extend these operations with exception handling and templates

4. Implement tree operations insertion, searching, postorder traversal, inorder traversal, preorder traversal, deletion.
(a) Extend these operations with exception handling and templates

5. Implement Queue operations using linked list.

6. Implement Stack operations with linked list.

7. Implement operations on Double linked list.