RAJA COLLEGE OF ENGINEERING & TECHNOLOGY

Size: px

Start display at page:

Download "RAJA COLLEGE OF ENGINEERING & TECHNOLOGY"

Roxanne Goodwin
6 years ago
Views:

1 RAJA COLLEGE OF ENGINEERING & TECHNOLOGY (Affiliated to Anna University) Veerapanjan, Madurai DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING BACHELOR OF ENGINEERING THIRD SEMESTER CS6311 PROGRAMMING AND DATA STRUCTURE LABORATORY II LAB MANUAL (Regulation 2013)

2 CS6311 PROGRAMMING AND DATA STRUCTURE LABORATORY I I T P C OBJECTIVES: The student should be made to: - Down design. LIST OF EXPERIMENTS: IMPLEMENTATION IN THE FOLLOWING TOPICS: 1. Constructors & Destructors, Copy Constructor. 2. Friend Function & Friend Class. 3. Inheritance. 4. Polymorphism & Function Overloading. 5. Virtual Functions. 6. Overload Unary & Binary Operators Both as Member Function & Non Member Function. 7. Class Templates & Function Templates. 8. Exception Handling Mechanism. 9. Standard Template Library concept. 10. File Stream classes. 11. Applications of Stack and Queue 12. Binary Search Tree 13. Tree traversal Techniques 14. Minimum Spanning Trees 15. Shortest Path s OUTCOMES: At the end of the course, the student should be able to: TOTAL: 45 PERIODS graphs. ods for program development. LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS: Standalone desktops with C++ complier 30 Nos. (or) Server with C++ compiler supporting 30 terminals or more.

3 CONTENTS Sl.No Ex.No. Title of the Experiments 1 1 Constructors Page No. 2 2 Destructors 3 3 Copy Constructor. 4 4 Friend Function 5 5 Friend Class 6 6 Inheritance 7 7 Function Overloading 8 8 Virtual Functions 9 9a Unary Operator Overloading Using Member function 10 9b Unary Operator Overloading Using Friend function 11 10a Binary Operators Overloading Using Member function 12 10b Binary Operators Overloading Using Friend function 13 11a Function Templates 14 11b Class Templates Exception Handling Mechanism Standard Template Library concept File Stream classes Application of Stack Applications of Queue Binary Search Tree & Tree traversal Techniques Minimum Spanning Trees Shortest Path s

4 Ex.No 1 CONSTRUCTOR To initialize data members of an object using copy constructor 2. Declare class distance containing data members inch and feet. 3. Define default constructor that initializes data members to Define parameterized constructor that initializes data members with values provided. 5. Define display function to print value of data members 6. Create distance objects to invoke the constructors. 7. Call display function for each distance object. 8. Stop class distance int feet; int inch; distance() distance (int n, int d = 0) ] void print() ; int main() 0.0ft 4.0ft 22.7ft

5 Ex.No 2 COPY CONSTRUCTOR To initialize data members of an object using copy constructor 2. Declare class complex with data members real and imag 3. Define parameterized constructor that initializes data members with given values 4. Define copy constructor that uses an object reference to initialize data members of another object 5. Define display function to print data members 6. Create complex objects that invoke copy constructor in various ways. 7. Call display function for each distance object. 8. Stop class complex int real; int imag; ; int main() complex(int r, int i) complex(const complex &c1) void display() 2 + 3i i

6 Ex.No 3 DESTRUCTOR To allocate memory for objects dynamically and release memory using destructor. 2. Declare class mystring with data member str and len 3. Define dynamic constructor using new operator 4. Define display function to print string contents 5. Define destructor that releases memory using delete operator 6. Create objects using constructor and invoke destructor when they go out of scope 7. Stop class mystring char *str; int len; mystring (char *s) void display() ~mystring() // Destructor ; int main() mystring s1("smkfit"); s1.display(); Dynamic memory allocation SMKFIT Memory released

7 Ex.No 4 FRIEND FUNCTION To access data members of a class using friend function. 2. Declare class sample with data members 3. Define a non-member function mean that returns aggregate of data members 4. Declare function mean as friend to class sample 5. Provide value for data members 6. Call function mean 7. Stop class sample int a; int b; void setvalue() friend float mean(sample s) int main() sample X; X.setvalue(); cout << "Mean value = " << mean(x) ; Mean value = 32.5

8 Ex.No 5 FRIEND CLASS5 To demonstrate usage of friend classes 2. Declare class rectangle with length and breadth as data members 3. Declare class square with side as data member 4. Declare class rectangle as friend to class square 5. Define function convert in rectangle class that takes square object as argument 6. Create objects for both classes 7. Call function convert to demonstrate friend class. 8. Stop class square; class rectangle int width; int height; int area () void convert (square a) ; ; class square friend class rectangle; int side; square (int a) ; int main() rectangle rect; square sqr(4); rect.convert(sqr); cout << "Rectangle area : " << rect.area(); return 0; Rectangle area: 16

9 Ex.No 6 SINGLE INHERITANCE To demonstrate single inheritance 2. Declare class rectangle with protected members length and breadth 3. Define function rectdim to read values 4. Derive class box from rectangle in public mode with data member depth. 5. Define function getdata for box class that calls rectdim function 6. Create object for box class 7. Display volume of the box. 8. Stop class rectangle protected: int length; int breadth; void rectdim() ; class box : public rectangle protected: int depth; void getdata() void display() ; int main() Enter length and breadth : 4 5 Enter depth : 6 Box area : 120

10 Ex.No 7 FUNCTION OVERLOADING To create a family of functions with same name to implement function polymorphism. 2. Declare prototypes for function area to compute area of various shapes. 3. Define area functions that varies on argument and implementation. 4. Call area function with corresponding arguments 5. Stop int area(int); int area(int, int); double area(double); area(int, double); double area(double, int); int area(int, int, int); // square // rectangle // circle double // triangle // equilateral triangle // trapezoid int main() cout << "\n Square area : " << area(5); cout << "\n Rectangle area : " << area(5,4); cout << "\n Circle area : " << (PI*area(4.6)); cout << "\n Triangle area : " << (0.5 * area(5, 6.2)); cout << "\n Equi. Triangle area : " << (0.5 * area(5.3, 6)); cout << "\n Trapezoid area : " << area(5, 6, 7); return 0; Square area : 25 Rectangle area : 20 Circle area : Triangle area : 15.5 Equi. Triangle area : 15.9 Trapezoid area : 210

11 Ex.No 8 VIRTUAL FUNCTION To design a simple hierarchical classification for vehicle class and demonstrate runtime polymorphism using virtual function. 2. Declare class vehicle with protected members capacity, fuel, feature and virtual function display 3. Derive class bicycle, autorickshaw and lorry from vehicle publicly. 4. Define default constructor for derived classes to initialize derived data members. 5. Redefine display function to print details for the corresponding vehicle 6. Create a vehicle class pointer and assign bicycle / autorickshaw / lorry object 7. Call display function to demonstrate runtime polymorphism 8. Stop #include <iostream.h> #include<conio.h> #include <string.h> class vehicle protected: int capacity; char fuel[30]; char feature[100]; virtual void display() = 0; ; class bicycle : public vehicle bicycle() capacity = 2; strcpy(fuel, "Air"); strcpy(feature, "Green environment"); void display() cout << "Bicycle \n"; cout << "Capacity : " << capacity << "\n"; cout << "Fuel : " << fuel << "\n"; cout << "Features : " << feature << "\n";

12 ; class autorikshaw : public vehicle autorikshaw() void display() ; class lorry : public vehicle lorry() void display() ; int main() vehicle *v1; v1 = new bicycle; v1- >display(); v1 = new autorikshaw; v1- >display(); v1 = new lorry; v1- >display(); return 0; Bicycle Capacity : 2 Fuel : Air Features : Green environment Autorickshaw Capacity : 3 Fuel : Petrol/Diesel/LPG Features : Urban transport Lorry Capacity : 2 Fuel : Diesel Features : Cargo transport

13 Ex.No 9a UNARY OPERATOR OVERLOADING - MEMBER FUNCTION To overload unary operator using member function. 2. Declare class space with data members x, y and z 3. Define parameterized constructor for space class 4. Define display function to print data members 5. Overload unary minus ( ) using operator member function 6. Create a space object 7. Invoke unary minus on space object 8. Call display member function. 9. Stop #include <iostream.h> #include <conio.h> class space int x; int y; int z; space(int a, int b, int c) void display() void operator-() ; int main() Original 3D coordinates : Negated 3D coordinates :

14 Ex.No: 9b UNARY OPERATOR OVERLOADING - FRIEND FUNCTION To overload unary operator ++ on fraction number using friend function 2. Declare class fraction with data members num and den 3. Define parameterized constructor for fraction class 4. Define display function to print data members 5. Declare operator function to overload ++ as friend to class fraction 6. Overload increment operator (++) as a non-member function 7. Create a fraction object 8. Invoke increment operator on fraction object 9. Call display member function. 10. Stop #include <iostream.h> #include<conio.h> class fraction int num; int den; fraction(int n, int d) void display() friend void operator ++(fraction &f) ; int main() fraction f1(22,7); Before increment : 22/7 After increment : 29/7

15 Ex.No: 10a. BINARY OPERATOR OVERLOADING - MEMBER FUNCTION To overload operator + to perform addition of two distance objects. 2. Declare class distance with data members inch and feet 3. Define default and parameterized constructor for distance class 4. Define display function to print data members 5. Overload operator + using operator member function Add feet values & store it into var f Add inch values & store it into var i If i>12.0 then decrement i by 12 & increment f by 1 Return f & i 6. Create two distance object with input values. 7. Sum the distance objects using overloaded + and store result in another distance object 8. Call display member function. 9. Stop Program #include <iostream.h> #include<conio.h> class distance int feet; int inch; distance() () distance (int f, int i) void display() distance operator +(distance d2) ; int main() Distance1 : 10.6ft Distance2 : 11.6ft Distance3 : 22.0ft

16 Ex.No:10b BINARY OPERATOR OVERLOADING FRIEND FUNCTION To create an array1d class and to overload operators + to perform addition of one dimensional array 2. Declare class array1d with data members arr containing an array 3. Define getdata function to obtain input for array elements 4. Define display function to print array elements 5. Declare overloading of operator + as friend to class Array 6. Overload operator + as a non-member function to perform scalar addition on array elements 7. Create Array objects. 8. Call getdata function for each object 9. Invoke the overloaded operator + Array objects 10. Call display member function. 11.Stop #include <iostream.h> #include<conio.h> class Array int arr[100]; void getdata() void display() friend Array operator + (Array x, Array y) ; int main() Enter 5 elements for B array : Enter 5 elements for C array : B+C =

17 Ex.No:11a FUNCTION TEMPLATE To perform bubble sort on an array using function templates. 2. Define function template arrange to implement bubble sort with array argument of template type 3. Declare different types of array containing unordered elements 4. Call arrange function for each array 5. Display array elements for each array 6. Stop #include <iostream.h> template <class T> // Template function void arrange(t arr[], int size) int main() Sorted Arrays Int Float Char I a d i n n

18 Ex.No: 11b CLASS TEMPLATES To implement stack operations push and pop using class template. 2. Declare a template class mystack with array data member st of template type 3. Define a default constructor that initializes top data member 4. Define push and pop operation with template arguments 5. Define function full and empty to indicate stack full or empty 6. Create mystack objects of different types. 7. Invoke stack operations for each mystack object 8. Stop Program #include <iostream.h> const int size = 5; template <class T> class mystack T st[size]; int top; mystack() void push(t var) T pop() int empty() int full() ; int main() mystack <char> s1; // Character Stack mystack <int>s2; // Integer stack Character Stack Pop : e d c b a Integer Stack Pop :

19 Ex.No: 12 EXCEPTION HANDLING To demonstrate exception handling in C++ using try, throw and catch mechanism. 2. Read two numbers a and b 3. Within try block, if b = 0 then raise exception for b 4. Otherwise execute arithmetic expression a / b 5. Define catch block to handle divide by zero exception 6. Stop Program #include <iostream.h> int main() try catch(int i) Enter values for A and B : 3 0 Divide by zero error for A/B

20 Ex. No: 13 STL VECTOR To demonstrate the functionality of sequence container STL vector class 2. Include header file vector 3. Create a vector object v1 to store integers. 4. Use push_back member function to append elements onto v1 5. Delete last element in v1 using pop_back member function 6. Display first and last element of v1 using front and back member function 7. Display length of v1 using size member function 8. Display v1 elements using a loop 9. Stop ProgramOutline #include <iostream> #include <vector> using namespace std; int main() vector <int> v1(5); // Vector of size cout << "Enter element to append : "; cin >> data; v1.push_back(data); // Add element dynamically cout << "Current size: " << v1.size() << "\n"; cout << "First element : " << v1.front() << "\n"; cout << "Last element : " << v1.back() << "\n"; v1.pop_back(); // Deleting last element

21 cout << "Size after pop : " << v1.size() << "\n"; cout << "Vector elements : "; - Enter 5 vector elements : Enter element to append : 2 Current size: 6 First element : 9 Last element : 2 Size after pop : 5 Vector elements :

22 Ex. No: 14 CHARACTER FILE I/O To write characters onto a file and to find number of vowels in it using character file Input/output operations. 2. Include header file fstream 3. Declare a file object fp 4. Open file sample.txt in output mode using open function 5. Fetch character-by-character from console using get function 6. Write it onto file using put function, 7. Repeat steps 5-6 until end-of-file is encountered. 8. Close the file object fp using close function 9. Open file sample.txt in input mode using open function 10. Initialize vc to Read character-by-character from file using get function 12. If character is a vowel, then increment vc. 13. Repeat steps until end-of-file is encountered 14. Print vc 15. Close the file object fp using close function 16. Stop #include <iostream.h> #include <fstream.h> #include <ctype.h> int main() fstream fp;

23 char ch; fp.open("sample.txt", ios::out); fp.open("sample.txt", ios::in); Ctrl + Z to terminate: how are you i am fine bye ^Z No. of vowels : 10

24 Ex. No: 15 TOWERS OF HANOI To solve Towers of Hanoi problem using stack operations. 2. Get number of disks, say n. 3. Push parameters and return address onto stack 4. If the stopping value has been reached then pop the stack to return to previous level else move all except the final disc from starting to intermediate needle. 5. Move final discs from start to destination needle. 6. Move remaining discs from intermediate to destination needle. 7. Return to previous level by popping stack. 8. Stop Program #include <iostream.h> void tower(int a,char from,char aux,char to) if(a == 1) cout << "Move disc 1 from " << from; cout << " to " << to << "\n"; return; else tower(a-1, from, to, aux); cout << "Move disc " << a << " from " << from; cout << " to " << to <<"\n"; tower(a-1, aux, from, to);

25 int main() int n; cout << "Tower of Hanoi \n"; cout << "Enter number of discs : "; cin >> n; tower(n, 'A','B','C'); return 0; Output Tower of Hanoi Enter number of discs : 2 Move disc 1 from A to B Move disc 2 from A to C Move disc 1 from B to C

26 Ex.No: 16 FINDING THE LARGEST MULTIPLE OF 3 USING QUEUE : To find the Largest Multiples of 3 using Queue : 2. Enter Number of elements 3. Enter the values one by one 4. Sort the values in non-decreasing order. 5. Take Queue 6. Enqueue the elements which on dividing by 3 gives remainder as 0 7. Dequeue the first element from the queue 8. Display the element 9. stop class Queue int a[100],n; void Enqueue() int Dequeu() ; int main() Enter Number of Elements : 6 Enter the values one by one : 12,30,5,2,7,21 The Largest Multiples of 3 is : 30

27 Ex.No: 17 BINARY SEARCH TREE TRAVERSAL To create a binary search tree and to perform different methods of tree traversal. 2. Declare structure node to store element, left child and right child for a binary search tree 3. Declare class bst with member functions insert, preorder, inorder and postorder 4. Define insert member function to add an element a. If first element, then place it as root b. If element < root then traverse left subtree recursively until leaf c. If element > root then traverse right subtree recursively until leaf d. Insert new element as leaf 5. Define preorder member function to perform preorder traversal recursively a. Visit root node b. Visit left subtree c. Visit right subtree 6. Define inorder member function to perform inorder traversal recursively a. Visit left subtree b. Visit root node c. Visit right subtree 7. Define postorder member function to perform postorder traversal recursively a. Visit left subtree b. Visit right subtree c. Visit root node 8. Create object tree for bst class 9. Display a choice menu in main function 10. Accept choice and invoke appropriate member function for tree object 11. Stop #include<iostream.h> #include <process.h> #include<stdlib.h> #include <malloc.h> struct node int element; node *left;

28 node *right; ; typedef struct node *pnode; class bst void insert(int, pnode &); void preorder(pnode); void inorder(pnode); void postorder(pnode); ; int main() int choice, element, left_child, right_child; bst tree; char c = 'y'; pnode root, min, max; root = NULL; while(1) cout << "\n Binary Search Tree \n"; cout << "1.insert 2.preorder 3.inorder 4.postorder"; cout << " 0.Exit \n Enter your choice : "; cin >> choice; switch (choice) case 1: cout << "Enter the new element : "; cin >> element; tree.insert (element, root); cout << "Inorder traversal is : "; tree.inorder(root); break; case 2: break; case 3: break; case 4: break;

29 case 0: exit (0); return 0; Binary Search Tree 1.insert 2.preorder 3.inorder 4.postorder 0.Exit Enter your choice : 1 Enter the new element : 5 Inorder traversal is : 5--> Binary Search Tree 1.insert 2.preorder 3.inorder 4.postorder 0.Exit Enter your choice : 1 Enter the new element : 7 Inorder traversal is : 5-->7--> Binary Search Tree 1.insert 2.preorder 3.inorder 4.postorder 0.Exit Enter your choice : 1 Enter the new element : 3 Inorder traversal is : 3-->5-->7--> Binary Search Tree 1.insert 2.preorder 3.inorder 4.postorder 0.Exit Enter your choice : 2 Preorder traversal is : 5-->3-->7-->

30 Ex.No:18 MINIMUM SPANNING TREES To determine edges for minimum spanning tree in the given graph using Prim's algorithm 2. Define infinity to be a large number, say Declare class prim with requisite data members 4. Define create member function a. Get number of vertices nodes. b. Read adjacency matrix graph using a loop c. For nodes with cost 0, assign infinity using a loop 5. Define findmst member function to determine minimum spanning tree a. Initially all nodes are unselected b. Find smallest edge from the graph connecting the vertex c. Add that vertex d. Print associated cost e. Repeat the process until all vertices are added f. Print total cost of Prim's MST 6. Create object pmst for prim class 7. Stop a. Call create member function b. Call findmst member function #include <iostream.h> #define row 10 #define col 10 #define infi 999 #define false 0 #define true 1 class prims int graph[row][col]; int nodes;

31 prims() void create(); void findmst(); ; int main() prims pmst; cout << "Prims \n"; pmst.create(); cout << "Edges of Minimum Spanning Tree are : \n"; pmst.findmst(); return 0; Prims Enter Total Nodes : 7 Enter Adjacency Matrix : Edges of Minimum Spanning Tree are : 1 -> 4 = 1 1 -> 2 = 2 4 -> 3 = 2 4 -> 7 = 4 7 -> 6 = 1 7 -> 5 = 6 Cost of MST is : 16

32 Ex.No:19 SHORTEST PATH ALGORITHM To find shortest path from a given vertex to all other vertices using Dijkstra algorithm 2. Define infinity to be a large number, say Declare class dijkstra with requisite data members 4. Define read member function to obtain inputs a. Get the number of vertex vertices b. Read adjacency matrix adj using a loop c. Get vertex to start with source. 5. Define initialize member function to do initial configuration a. Initialize distance for each vertex to infinity b. Initialize all nodes marked as false c. Initialize all nodes as without any predecessor 6. Define unmarked member function a. Return vertex with minimum distance amongst unmarked vertices 7. Define calculate member function a. Call initialize member function b. Update variables marked, distance and predecessor for adjacent vertices 8. Define path member function to print path recursively 9. Define output member funct ion a. Call path member function to print path from source to each other vertex b. Print total distance from source to that vertex 10. Create object djk for dijkstra class a. Call read member function b. Call calculate member function c. Call output member function 11. Stop #include<iostream.h> #define infinity 999 class dijkstra int adj[15][15]; int predecessor[15]; int distance[15]; int mark[15]; int source; int vertices;

33 void read(); void initialize(); int unmarked(); void calculate(); void output(); void path(int); ; int main() dijkstra djk; djk.read(); djk.calculate(); cout << "Shortest path from source vertex are : \n"; djk.output(); return 0; Enter number of vertices : 7 Enter adjacency matrix for the graph : (For infinity enter 999) Enter the source vertex : 0 Shortest path from source vertex are : A->A = 0 A->B = 2 A->D->C = 3 A->D = 1 A->D->E = 3 A->D->G->F = 6 A->D->G = 5

Time: 3 HOURS Maximum Marks: 100

Time: 3 HOURS Maximum Marks: 100 ANNA UNIVERSITY:CHENNAI 600 025 M.E/M.Tech. DEGREE EXAMINATIONS, NOV./DEC. 2014 Regulations 2013 Third Semester B.E. Computer Science and Engineering CS6311: PROGRAMMING AND DATA STRUCTURES LABORATORY