100% Solved:
#include <iostream> #include <string.h> using namespace std; const int arrLength = 10; struct Student{ string userVUID; string userDetails; }std1={"NULL","NULL"}; class ArrQueue{ private: //Data Members Student arr[arrLength]; int front; int rear; public: //Constructor ArrQueue(){ for(int i=0; i<arrLength; i++) arr[i] = std1; front = -1; rear = -1; } //Member Functions void enQue(Student std){ if(isEmpty()){ arr[0] = std; front++; rear++; } else if(isFull()){ cout << " Queue is full."; } else{ arr[rear+1] = std; rear++; } } void deQue(){ if(isEmpty()){ cout<< " No Student In the Queue.\n"; } else if(rear == 0){ arr[front] = std1; front = -1; rear = -1; } else{ int tempfront = front; arr[front] = std1; for(int i=1; i<=rear; i++ ){ arr[front] = arr[i]; front++; } rear--; front = tempfront; } } int queLength(){ return rear+1; } bool isEmpty(){ if(front==-1 || rear==-1) return true; else return false; } bool isFull(){ if(rear == arrLength-1) return true; else return false; } void showQue(){ cout << "\n |Sr. VU ID Details |"; cout << "\n --- -------------------------------\n"; for(int i=front; i<=rear; i++){ cout<<" "<< i+1<< ". "<< arr[i].userVUID << " " << arr[i].userDetails <<"\n"; } } }; int main(){ /*Code For Even Id's Student std[] = {{"BC12345684","Bilal (BSCS)"}, {"BC12345685","Bilal (BSCS)"},{"BC12345686","Bilal (BSCS)"},{"BC12345687","Bilal (BSCS)"}, {"BC12345688","Bilal (BSCS)"}};*/ /*Code For Odd Id's */ Student std[] = {{"BC12345683","Bilal (BSCS)"}, {"BC12345684","Bilal (BSCS)"},{"BC12345685","Bilal (BSCS)"},{"BC12345686","Bilal (BSCS)"}, {"BC12345687","Bilal (BSCS)"}}; ArrQueue arrQue; cout << "\n -----------------------------------"; cout << "\n | Queue (After Adding Students) |"; cout << "\n -----------------------------------"; for(int i=0; i<=4; i++){ arrQue.enQue(std[i]); } arrQue.showQue(); cout << "\n -----------------------------------"; cout << "\n | Queue (After Removing Students) |"; cout << "\n -----------------------------------"; /* Code For Even Id's for(int i=0; i<=1; i++){ arrQue.deQue(); }*/ /*Code For Odd Id's*/ for(int i=0; i<1; i++){ arrQue.deQue(); } arrQue.showQue(); }CS301 Assignment 3 Solution and Discussion
-
Re: CS301 Assignment 3 Solution and Discussion
Assignment No. 03SEMESTER FALL 2020
CS301- Data Structures Total Marks: 20
Due Date: 21/01/2021
Instructions
Please read the following instructions carefully before solving & submitting assignment:
It should be clear that your assignment will not get any credit (zero marks) if:
o The assignment is submitted after due date.
o The submitted assignment is other than .doc/.docx file.
o The submitted assignment does NOT open or file is corrupted.
o The assignment is copied (from other student or ditto copy from handouts or internet).
Uploading instructionso For clarity and simplicity, you are required to Upload/Submit only .doc/.docx file.
Objective
The objective of this assignment is:
o Binary Search trees
o AVL trees
o Rotation cases of AVL trees
o Balancing Factor of treesFor any query about the assignment, contact at [email protected]
GOOD LUCK
Marks: 20Problem Statement:
You are required to construct AVL tree from the following data:
15 ,18 ,12, 8, 54, 5, 14, 13, 9, 61, 20, 17, 21
Solution Guidelines:
- You need to insert these data items one by one starting from the data item 15 in the same order in which they have written above.
- Show and perform necessary rotations where needed.
- In Solution show only the final AVL tree and only those steps in which rotation is applied.
Note: If you show only final tree and do not show the rotation steps then your marks will be deducted.
Lectures Covered: This assignment covers Lecture # 15-26
Deadline: Your assignment must be uploaded/submitted at or before January 21 , 2021 -
-
100% Off on Your FEE Join US! Ask Me How?
If you want to know how you can join us and get 100% Discount on your FEE ask Cyberian in Chat Room!
