CS301 – Data Structures | Cyberian Learn Smartly

Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

The objective of this assignment is

o Binary Search trees
o AVL trees
o Rotation cases of AVL trees
o Balancing Factor of trees

CS301 – Data Structures
CS301 Assignment 1 Solution and Discussion

Re: CS301 Assignment 1 Solution and Discussion
Assignment No. 01
Semester Spring 2020
CS301- Data Structures
Total Marks: 20

Due Date :1 June 2020
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 code does NOT compile.
o The submitted assignment is other than .CPP 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 instructions
For clarity and simplicity, You are required to Upload/Submit only ONE .CPP file.

Note: Use ONLY Dev-C++ IDE.
Objective
The objective of this assignment is

o To make you familiar of programming with stack data structure.

For any query about the assignment, contact at [email protected]

GOOD LUCK
Marks: 20
You are required to write a program in C++ to implement Stack data structure and use this data structure to store different types of books based on their identity number. You have to implement Stack data structure using array. A stack is a LIFO structure in which data elements are stored in an order such that last element pushed on the stack will be popped up first.
Your program should cover the following scenario.
Suppose a student is collecting books and throwing them into stack of books. You need to develop an application that will count different books in the stack. This stack will consist of three types of books i.e. software, hardware and other books.
You will identify book with unique numeric identity number. If book identity number will fully dividable by 8, will consider it software book. While the number fully dividable by 5 will consider it hardware book and consider rest of the books as other books.

First, the program will ask the user to input size of the stack. Then the programmer will ask the user to input total number of books. Then according to the number of Books, it will ask the user to enter identity number for each book. The book identity number can be any random number between 1 and 99. If book identity number is fully dividable by 8, we will consider it software book. While the number fully dividable by 5 will consider it hardware book and consider rest of the books as other books.

Programmer should implement isFull() function of the stack to check if the number of books exceed the size of the stack and isEmpty() function to check if the stack is empty or not. Programmer should also display the message “Books not found” if no books found.

Program’s sample output is given below

Output 1:

Out Put 2:

Output 3:

Solution Guidelines:
First understand the code given in handouts about stack. Get stack size from user to allocate space for stack dynamically. Get identity number of books that user want to enter into the stack. Get value one by one and push into stack. Don’t allow popping if stack is empty and pushing if stack is full. If identity number of book is dividable by 8 and 5 then priority should be given to 8.
Lectures Covered: This assignment covers Lecture # 1-7.
Deadline: Your assignment must be uploaded/submitted at or before, 1 June 2020

CS301 – Data Structures
CS301 Assignment 3 Solution and Discussion

Re: CS301 Assignment 3 Solution and Discussion
Assignment No. 03
SEMESTER 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 instructions

o 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 trees

For any query about the assignment, contact at [email protected]
GOOD LUCK
Marks: 20

Problem 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

CS301 – Data Structures
CS301 Assignment 2 Solution and Discussion Spring 2020

Re: CS301 Assignment 2 Solution and Discussion
Assignment No. 02
Spring 2020
CS301- Data Structures
Total Marks: 20

Due Date: 17-Jun-2020
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:
 The assignment is submitted after due date.
 The submitted assignment is other than .CPP file.
 The submitted code does NOT compile.
 The submitted assignment does NOT open or file is corrupted.
 The assignment is copied (from other student or ditto copy from handouts or internet).

Uploading instructions
For clarity and simplicity, you are required to upload/submit only one .CPP file.

Note: Use only Dev-C++ IDE.

Objectives
The objectives of this assignment are;

 To make you familiar of programming with Tree data structure
 To traverse Binary Search Tree (BST) using different techniques
 To perform some basic operations on BST

For any query about the assignment, contact at [email protected]

Good Luck!
Total Marks: 20
Problem Statement:

As you know, Binary Search Tree (BST) has property that on the addition of a node in the tree, we compare it with root node. If new node is less than root node, it can be added to the left sub-tree. Otherwise, it will be added to the right sub-tree. So, the BST will have numbers (or nodes) less than the root in the left sub-tree and the numbers greater than the root will be in the right sub-tree.

Following is a snapshot of Binary Search Tree (BST).

You are required to develop a C++ program implementing Binary Search Tree (BST) data structure for the above scenario.

For this you need to;
Construct Binary Search Tree, based upon above given tree data Calculate minimum node (or number), maximum node, height and total number of nodes for BST
Details:
Your solution must contain a tree node class named as TNode, insert() method, buildTree() method, minNode() method, maxNode() method, treeHeight() method and countNodes() method. You should call BuildTree() method in main() method and call insert() method inside BuildTree() method so that insert() method can actually add nodes in BST.

You must call the above-mentioned methods from main to calculate minimum node, maximum node, height and total number of nodes for the BST.

Remember, the height of root node is 1 while depth or level of root node is 0 in tree.

Required Output:

Note:
Make sure to follow class name, method names and variable/objects names as mentioned above in the scenario. Moreover, your solution must be according to the Required Output. Otherwise, you will get Zero marks.
Lectures Covered: Lecture No. 09 to 16.
Deadline: Your assignment must be uploaded / submitted on or before, Jun 17, 2020.

CS301 – Data Structures
CS301 GDB 1 Solution and Discussion

CS301 GDB 1 Solution and Discussion

CS301 – Data Structures
CS301 Assignment 2 Solution and Discussion

Assignment No. 02
SEMESTER Fall 2019
CS301- Data Structures
Total Marks: 20

Due Date: 29-Nov, 2019
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 code does NOT compile.
o The submitted assignment is other than .CPP 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 instructions
For clarity and simplicity, You are required to Upload/Submit only ONE .CPP file.

Note: Use ONLY Dev-C++ IDE.
Objective
The objective of this assignment is

o To make you familiar of Programming with Queue Data Structure.

For any query about the assignment, contact at [email protected]

GOOD LUCK

Marks: 20

Problem Statement:

You have to implement a Queue Data Structure for student’s admission applications in the university by using Array in C++ language. In which you have to create:
A structure (using struct keyword) named Student. A class named ArrQueue.
Details:

Student structure must have two variables of type string (using string.h library) in it.
userVUID userDetail Structure Variables Description userVUID It will store the student id e.g. BC12345688 userDetail It will store user details as Name (Degree Program) e.g. Bilal (BSCS)
ArrQueue should implement following data members and member functions:
Data Members Description arr[arrLength] “arr” is an array of type Student which will store queue students information in the array. While “arrLength” is the length of the array which is 5. front front variable will store the value of array index of first user in the queue. rear rear variable will store the value of array index of last user in the queue. Methods Description enQue(X) Place X after the rear of the queue (If array have empty space). e.g. queue.enQue(X). You have to handle these cases for enQue(). 1. If queue is empty. Then add Student to Queue. 2. If queue is full. Then show message: “Queue is full”. deQue() Remove the student from front position in the queue and move all students forward in the queue. (If array is not empty). e.g. queue.deQue(). You have to handle these cases for deQue(). 1. If queue is empty. Then show message at “Que is empty cannot remove students”. 2. If queue is not empty, remove element from the queue. Note: Removal of Students from Queue will be according to First In First Out (FiFO) Method (Means a student who comes to queue first will remove from the queue first then others). queLength() Return size of Queue. (Not array size) e.g. queue.queLength(). isEmpty() Return TRUE if Queue is empty, FALSE otherwise. isFull() Return TRUE if Queue is full, FALSE otherwise. showQue() Will show the Queue data as given in below screenshots (Detailed Output Screenshot). e.g. queue.showQue().
(“X” denote “Student” structure Object means a student profile record while “queue” denotes and Object of the class “ArrQueue”.)

In the main() function you have to:
Create an array of objects having size 5 and of type “Student” and store five student’s data in it. Make a queue and add all students in it by using for loop with enQue() method. Then show the array using showQue() method like given in “Main Output Screenshot”. Then you have to remove students from the queue according the following conditions e.g.
Your id is “BC12345687” then last digit is 7.
a. If last digit is Even Number then remove first two students from the queue using for loop with deQue() method. There will be 3 remaining students in the queue out of 5 as we have removed two students.
For details see screenshots under “Main Output Screenshot” heading.
b. If last digit is an Odd Number (e.g. in above id 7 is an odd number) then remove first one student form the queue using for loop with deQue() method. There will be 4 remaining students in the queue out of 5 as we have removed three students.
For details see screenshots under “Main Output Screenshot” heading. After that show queue data using showQueue() method as given in “Main Output Screenshot”. Last student data should be your own data and all above ids must be one less than your id number according to Detailed Output Screenshot.
Note:
If you will not follow variables, functions and class names as mentioned and explained in this file also your actual output under heading “Main Output Screenshot” is not according to “Detailed Output Screenshot” then you will get Zero marks.
Detailed Output Screenshot:

Just For Your Information.

Note: Last record must be your VU ID, Name and Degree Program.

Main Output Screenshot:

For Students Id’s having Odd number in last of your id.

For Students Id’s having Even number in last of your id.

Lectures Covered: This assignment covers Lecture # 1-14.
Deadline: Your assignment must be uploaded/submitted at or before 29-Nov, 2019.

CS301 – Data Structures
CS301 Assignment 3 Solution and Discussion

Assignment No. 03
Fall 2019
CS301 - Data Structures
Total Marks: 20

Due Date: 21-1-2020
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 C++ file (.cpp).
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 instructions
You are required to upload / submit .CPP file.
Use Dev-C++, Version 5.11 or above.

Objective
The objective of this assignment is ;

o To make you familiar with Huffman Encoding technique.
o To learn how to write a program for Huffman Encoding in C++.

For any query about the assignment, contact at [email protected]

GOOD LUCK

Problem Statement

As you know, Huffman Encoding is a technique developed and used for data compression. It is widely used algorithm for JPEG images. Incomplete code of Huffman Encoding is given below. You are required to complete the missing code.

In the given code we are using two classes and two functions. The first class HeapNode_Min will consist of data members and a constructor. The second class Analyze will consist of a function which will compare two heap nodes and will return the result. We are also using display function to print the codes of Huffman tree from the root. HCodes function is used to build a Huffman tree, this function is using two while loops and at the end it calls display_Codes function. In main function we are using two arrays, one for frequency and the second one for alphabets. We are using size_of variable to store the size of data types after their division. At the end of the main function we will call HCodes function.

Note: Just add the missing code. Don’t change the given code. Instructions are highlighted with red color.
// Huffman Coding program in c++ #include <bits/stdc++.h> using namespace std; class HeapNode_Min { // Tree node of Huffman public: //Add data members here. HeapNode_Min(char d, unsigned f) { //Complete the body of HeapNode_Min function } }; class Analyze { // two heap nodes comparison public: bool operator()(HeapNode_Min* l, HeapNode_Min* r) { (l->f > r->f); //Complete this statement } }; void display_Codes(HeapNode_Min* root, string s) // To print codes of huffman tree from the root. { if (!root) return; if (root->d != '$') cout << root->d << "\t: " << s << "\n"; display_Codes(root->l, s + "0"); display_Codes( ); //Complete this statement by passing arguments } void HCodes(char data[], int freq[], int s) // builds a Huffman Tree { HeapNode_Min *t,*r, *l ; // top, right, left priority_queue<HeapNode_Min*, vector<HeapNode_Min*>, Analyze> H_min; int a=0; while (a<s){H_min.push(new HeapNode_Min(data[a], freq[a])); ++a;} while (H_min.size() != 1) { l = H_min.top(); H_min.pop(); r = H_min.top(); H_min.pop(); t = new HeapNode_Min('$', r->f + l->f); t->r = r; t->l = l; H_min.push(t); } display_Codes(H_min.top(), ""); } int main() { int frequency[] = { 3, 6, 11, 14, 18, 25 }; char alphabet[] = { 'A', 'L', 'O', 'R', 'T', 'Y' }; int size_of = sizeof() / sizeof(); //Complete this statement by passing data type to both sizeof operators cout<<"Alphabet"<<":"<<"Huffman Code\n"; cout<<"--------------------------------\n"; //Call Huffman_Codes function. return 0; }
Sample Output of the above program is given below.

Important Note: Use Dev-C++, Version 5.11 or above.
Deadline: Your assignment must be uploaded/submitted at or before 21-1-2020.

CS301 – Data Structures
CS301 Quiz 1 Solution and Discussion

Share your current Quiz Data

CS301 – Data Structures
CS301 Assignment 1 Solution and Discussion

Assignment No. 01
Semester Fall 2019
CS301- Data Structures Total Marks: 20

Due Date : 18-Nov-2019
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 code does NOT compile.
o The submitted assignment is other than .CPP 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 instructions
For clarity and simplicity, You are required to Upload/Submit only ONE .CPP file.

Note: Use ONLY Dev-C++ IDE.
Objective
The objective of this assignment is

o To make you familiar with implementing the Doubly Linked List data structure in C++ programming language.

For any query about the assignment, contact at [email protected]

GOOD LUCK

Marks: 20
Problem Statement:

You have to implement a Double Linked List in C++ language in which you have to create a structure and two classes as given below:

A structure named as “StudentDetail” by using struct keyword.
StudentDetail structure should consist of following data members of type “string”.
name
vuid

A node class named as “Node” by using class keyword.
Node class will have following data members and member functions:

(“X” denotes StudentDetail variable means the student details and “Y” denotes the data value of the node).
A doubly linked list class named as “DoublyLinkedList” by using class keyword.
DoublyLinkedList class will have following data members and member functions:

Detailed description of member functions of DoublyLinkList class:

addAtBegining(X): To add the node at the beginning of the doubly linked list class.

addAtEnd(X): To add the node at the End of the doubly linked list class.

delNode(): To delete a node pointed by current pointer in the doubly linked list.

display():To display all student details in doubly linked list.
(“X” denote Node to add in the doubly linked list).
In the main ( ) function you have to do the following:

Create two objects of type StudentDetail at the Beginning of the doubly linked list class using addATBegining (X) method of DoublyLinkedList and use display() method to display doubly linked list.
Note that first object should contain your own VU ID and your own name otherwise you will get zero marks.

Create one objects of type StudentDetail at the End of the doubly linked list class using addAtEnd (X) method of DoublyLinkedList and use display() method to display doubly linked list.

Delete current node of the doubly linked list and use display() method to display doubly linked list.

Display doubly linked list after calling each functions.

Detailed Output Screenshot:

Lectures Covered: This assignment covers Lecture # 1-8.
Deadline: Your assignment must be uploaded/submitted at or before 18-Nov-2019.

CS301 – Data Structures
CS301 Final Term Current Paper

Cs301 Today paper
Q1.biner tree bnawa tha OS k levels btao.
Q2.carictrics of avl tree.
Q3.if node leaf and non leafe in binry tree then what the hight of tree of its depth is 7?
Q.4hight of nodes if hight is 5?
Q.6 [2 9 7 5 8] sort it.
Q.7 ik tree tha osko array mn conert krna tha.
Q8.crictristics of union method
Mostly mcqs and questions are from moazz files.
Shared By @Awais

CS301 – Data Structures

The objective of this assignment is
cs301 avl trees balancing factor of trees binary search trees rotation cases of avl trees • • zareen

2

0
Votes

2
Posts

9
Views

@zareen said in The objective of this assignment is:

o Binary Search trees

Binary Search Tree (BST) –
BST is a special type of binary tree in which left child of a node has value less than the parent and right child has value greater than parent. Consider the left skewed BST shown in Figure 2.

Searching: For searching element 1, we have to traverse all elements (in order 3, 2, 1). Therefore, searching in binary search tree has worst case complexity of O(n). In general, time complexity is O(h) where h is height of BST.

Insertion: For inserting element 0, it must be inserted as left child of 1. Therefore, we need to traverse all elements (in order 3, 2, 1) to insert 0 which has worst case complexity of O(n). In general, time complexity is O(h).

Deletion: For deletion of element 1, we have to traverse all elements to find 1 (in order 3, 2, 1). Therefore, deletion in binary tree has worst case complexity of O(n). In general, time complexity is O(h).
CS301 Assignment 1 Solution and Discussion
solution discussion assignment 1 spring 2020 cs301 • • zaasmi

4

0
Votes

4
Posts

7
Views

@zareen
100% Solution Code
#include <iostream> using namespace std; /* The Student class */ class Student { private: string firstname, lastname, VUID; int marks; Student *nextStudent; public: // constructor of Student class to initialize data members of class Student(){ VUID = ""; marks = 0; firstname = ""; lastname = ""; nextStudent = NULL; } // Student class method to set VU ID of Student void setVUID(string val){ VUID = val; }; //Student class method to get VU ID of Student string getVUID(){ return VUID; }; // Student class method to set first name of Student void setFirstName(string val){ firstname = val; }; //Student class method to get first name of Student string getFirstName(){ return firstname; }; // Student class method to set last name of Student void setLastName(string val){ lastname = val; }; //Student class method to get last name of Student string getLastName(){ return lastname; }; //Student class method to set the Marks of Student void setMarks(int val) { marks = val; }; // Student class method to get the Marks of Student int getMarks() { return marks; } //Student class method to point current Student to next Student void setNext(Student *nextStudent) { this->nextStudent = nextStudent; } // Student class method to get memory address where pointer is pointing Student *getNext() { return nextStudent; } }; /* The List class */ class List { private: Student * head; Student * current; public: // constructor of list class to initialize data members of class List() { head = new Student(); head->setNext(NULL); current = NULL; } // list class method to add Students into list void add() { Student *newStudent = new Student(); int loc_marks = 0; string loc_vuid = "", loc_fname = "", loc_lname = ""; cout<<"\nEnter VU ID: "; cin>>loc_vuid; newStudent->setVUID(loc_vuid); cout<<"Enter Marks: "; cin>>loc_marks; newStudent->setMarks(loc_marks); cout<<"Enter First Name: "; cin>>loc_fname; newStudent->setFirstName(loc_fname); cout<<"Enter Last Name: "; cin>>loc_lname; newStudent->setLastName(loc_lname); if(head->getNext() == NULL){ newStudent->setNext(NULL); head->setNext(newStudent); current = newStudent; } else{ Student *temp = head; while(temp->getNext() != NULL && temp->getNext()->getMarks() >= loc_marks){ temp = temp->getNext(); } current = temp; newStudent->setNext(current->getNext()); current->setNext( newStudent ); current = newStudent; } }; // list class method to get the information of Student void getInfo() { if (current != NULL){ cout<<"VU ID: "<<current->getVUID()<<endl; cout<<"Marks: "<<current->getMarks()<<endl; cout<<"First Name: "<<current->getFirstName()<<endl; cout<<"Last Name: "<<current->getLastName()<<endl<<endl; } }; // list class method to move current to next Student bool next() { if (current == NULL){ return false; } current = current->getNext(); }; // frient function to list class to show all students in the list friend void showStudents(List list){ Student* savedCurrent = list.current; list.current = list.head; for(int i = 1; list.next(); i++){ list.getInfo(); } list.current = savedCurrent; }; }; main() { int input = 0; List lst; while(input != -1) { cout<<"1. To Add New Student in Ranking"<<endl; cout<<"2. To Display Ranking"<<endl; cout<<"3. To Close"<<endl<<endl; cout<<"Enter Your Choice: (1, 2 or 3) "; cin>> input; if(input == 1) { lst.add(); cout<<"Student's information saved successfully.\n"; } else if(input == 2) { cout<<"\nRanking Chart"<<endl; showStudents(lst); return 0; } else { return 0; } } }
CS301 Assignment 3 Solution and Discussion
solution discussion assignment 3 fall 2020 assignment cs301 • • zaasmi

3

0
Votes

3
Posts

157
Views

CS301-assignment-no3-Solution.docx
CS301 Assignment 2 Solution and Discussion Spring 2020
solution discussion assignment 2 spring 2020 cs301 • • zaasmi

2

0
Votes

2
Posts

9
Views

#include<iostream> using namespace std; class TNode{ private: node* root; public: TNode(); int isEmpty(); void buildTree(int item); void insert(int item,node *,node *); void minNode(node*); void maxNode(node*); int countNodes(node*); int treeHeight(node*); void displayBinTree(); }; TNode::TNode(){ root = NULL; } int TNode::isEmpty() { return (root == NULL); } void TNode::buildTree(int item){ node *p = new node; node *parent; cout <<"Insert node in BST :" << item <<endl; insert(item,p,parent); } void TNode::insert(int item,node * p,node * parent){ p->data=item; p->left=NULL; p->right=NULL; parent=NULL; if(isEmpty()){ root = p; } else{ node *ptr; ptr = root; while(ptr != NULL){ parent = ptr; if(item > ptr->data){ ptr = ptr->right; } else{ ptr = ptr->left; } } if(item < parent->data){ parent->left = p; } else{ parent->right = p; } } } void TNode::minNode(node* p){ while (p->left != NULL){ p = p->left; } cout << "Minimum value : " << p->data <<endl; } void TNode::maxNode(node* p){ while (p->right != NULL){ p = p->right; } cout << "Maximum value : " << p->data <<endl; } int TNode::countNodes(node* p){ int node = 1; //Node itself should be counted if (p == NULL){ return 0; } else{ node += countNodes(p->left); node += countNodes(p->right); return node; } } int TNode::treeHeight(node* p){ if (p == NULL) { return 0; } else { int left_side = treeHeight(p->left); int right_side = treeHeight(p->right); if (left_side > right_side) { return(left_side + 1); } else { return(right_side + 1); } } } void TNode::displayBinTree(){ cout <<endl<<endl; minNode(root); maxNode(root); cout <<"Height of BST : "<<treeHeight(root); cout <<"\nTotal nodes : "<<countNodes(root); } int main(){ TNode b; int data[] = {7,2,9,1,5,14}; cout <<"Constructing Binary Search Tree by Inserting Nodes One by One "<<endl; cout <<"------------------------------------------------------------- "<<endl; int arrSize = sizeof(data)/sizeof(data[0]); for(int i = 0; i < arrSize; i++) { b.buildTree(data[i]); } }
CS301 GDB 1 Solution and Discussion
solution discussion fall 2019 gdb 1 cs301 • • zareen

1

0
Votes

1
Posts

3
Views

No one has replied
CS301 Assignment 2 Solution and Discussion
solution discussion fall 2019 assignment 2 cs301 • • zareen

2

0
Votes

2
Posts

12
Views

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
solution discussion fall 2019 assignment 3 cs301 • • zareen

4

0
Votes

4
Posts

25
Views

Solution Idea!
#include <bits/stdc++.h> using namespace std; class HeapNode_Min { // Tree node of Huffman public: //Add data members here. char d; unsigned f; HeapNode_Min *l, *r; HeapNode_Min(char d, unsigned f = -1) { //Complete the body of HeapNode_Min function this->d = d; this->f = f ; this->l = NULL; this->r = NULL; } }; class Analyze { // two heap nodes comparison public: bool operator()(HeapNode_Min* l, HeapNode_Min* r) { //add return before statement and statement is completed. return (l->f > r->f); //Complete this statement } }; void display_Codes(HeapNode_Min* root, string s) // To print codes of huffman tree from the root. { if (!root) return; if (root->d != '$') cout root->d "\t: " s "\n"; display_Codes(root->l, s + "0"); display_Codes(root->r, s + "1"); //Complete this statement by passing arguments } void HCodes(char data[], int freq[], int s) // builds a Huffman Tree { HeapNode_Min *t,*r, *l ; // top, right, left priority_queue<HeapNode_Min*, vector<HeapNode_Min*>, Analyze> H_min; int a=0; while (a<s){H_min.push(new HeapNode_Min(data[a], freq[a])); ++a;} while (H_min.size() != 1) { l = H_min.top(); H_min.pop(); r = H_min.top(); H_min.pop(); t = new HeapNode_Min('$', r->f + l->f); t->r = r; t->l = l; H_min.push(t); } display_Codes(H_min.top(), ""); } int main() { int frequency[] = { 3, 6, 11, 14, 18, 25 }; char alphabet[] = { 'A', 'L', 'O', 'R', 'T', 'Y' }; //Complete this statement by passing data type to both sizeof operators int size_of = sizeof(alphabet) / sizeof(*alphabet); cout"Alphabet"":""Huffman Code\n"; cout"--------------------------------\n"; //Call Huffman_Codes function. HCodes(alphabet, frequency, size_of); return 0; }
CS301 Quiz 1 Solution and Discussion
solution discussion fall 2019 quiz 1 cs301 • • zareen

5

0
Votes

5
Posts

5
Views
CS301 Assignment 1 Solution and Discussion
solution discussion fall 2019 assignment 1 cs301 • • zareen

3

0
Votes

3
Posts

22
Views

.CPP File Code
using namespace std; #include <stdlib.h> #include <iostream> struct StudentDetail{ string name; string vuid; }; //class Node* head; class Node{ struct StudentDetail newStd; class Node* next; class Node* prev; void Set(string name,string vuid) { newStd.name=name; newStd.vuid=vuid; } Node Get() { } void setNext(string name,string vuid){ if(next==NULL) { } else { class Node* newNode= new Node(); newStd.name=name; newStd.vuid=vuid; newNode->next= newNode; } } string getNext() { next; } void setPrev(string name,string vuid){ if(next==NULL) { } else { class Node* newNode= new Node(); newStd.name=name; newStd.vuid=vuid; newNode->next= newNode; } } string getPrev() { prev; } }; class DoublyLinkedList{ public: struct StudentDetail newStd; class DoublyLinkedList* headPtr; class DoublyLinkedList* curPtr; class DoublyLinkedList* nextPtr; int size; //dfdf class DoublyLinkedList* headDlinkList=NULL; void addAtBegining(string vuid, string name) { class DoublyLinkedList* dNode= new DoublyLinkedList(); dNode->newStd.vuid=vuid; dNode->newStd.name=name; dNode->nextPtr=headDlinkList; headDlinkList= dNode; dNode->curPtr=dNode; } void addAtEnd(string vuid, string name) { class DoublyLinkedList* dNode= new DoublyLinkedList(); dNode->newStd.vuid=vuid; dNode->newStd.name=name; dNode->nextPtr=headDlinkList; headDlinkList= dNode; dNode->curPtr=dNode; } void delNode() { class DoublyLinkedList* temp1=curPtr; class DoublyLinkedList* temp2= temp1; temp1->nextPtr= temp2->nextPtr; free(temp2); } void print() { class DoublyLinkedList* temp= headDlinkList; while(temp!=NULL) { cout<<temp->newStd.vuid<<" "<<temp->newStd.name<<endl; temp= temp->nextPtr; } } }; int main() { string vuid,name; cout<<"Add your vuID and Name at First Position "<<endl; cout<<"_ _ _ _ _ _ _ _ __ _ _ _ _ _ _ _ __ _ _ _ _ _ _ _ __ _ _"<<endl; DoublyLinkedList dlist1; cin>>vuid; cin>>name; dlist1.addAtBegining(vuid,name); dlist1.print(); cout<<"Insertion At Beginning in doubly Link List "<<endl; cout<<"_ _ _ _ _ _ _ _ __ _ _ _ _ _ _ _ __ _ _ _ _ _ _ _ __ _ _"<<endl; cin>>vuid; cin>>name; dlist1.addAtBegining(vuid,name); dlist1.print(); cout<<"Insertion At End in doubly Link List "<<endl; cout<<"_ _ _ _ _ _ _ _ __ _ _ _ _ _ _ _ __ _ _ _ _ _ _ _ __ _ _"<<endl; cin>>vuid; cin>>name; dlist1.addAtEnd(vuid,name); dlist1.print(); cout<<"Deletion of Current Node (Last Node) "<<endl; cout<<"_ _ _ _ _ _ _ _ __ _ _ _ _ _ _ _ __ _ _ _ _ _ _ _ __ _ _"<<endl; dlist1.delNode(); dlist1.print(); }
Download .cpp File
CS301 Final Term Current Paper
spring 2019 final term current paper phy101 • • zareen

4

0
Votes

4
Posts

39
Views

@zareen
The Linked List ADT
We have been using linked nodes to generate our structures for the Stack ADT and the Queue ADT. Now we will consider the linked list. As we have been using this structure for implementing the previous ADT structures, it is perhaps more constructive to look at a variation of the single linked list (known as the ‘sorted’ linked list).

The idea behind this type of list is that any element we put into the list will have to be put into the correct position by comparing some common value held in each of the nodes. So far the Stack ADT and the Queue ADT did not impose any ordering on the elements we added. If we were looking for a basic linked list, we could use these as the basis for the structure and operations. This is a task you might attempt for yourselves.

Our sorted linked list ADT will consist of the following primitive operations:

Create()
Destroy()
Add(element)
Remove(element)
Traverse()
IsEmpty()
Search(element)

We would generally need a display operation for testing purposes to ensure that the elements are being put into the correct locations. However, the Sorted linked list is a linear structure so any processing done on the list has to be carried out in a linear manner. We must access the list through the Start link / pointer and the list has to be accessed/processed in the order that the nodes appear on the list.

As we have previously seen, one of the great advantages of the linked data structure is the ease with which it may be modified. Changing the structure does not involve moving the existing nodes. In order to delete a node we update the link / pointer of the node before it and point / link this to the node after it.

Source

50% Off on Your FEE Join US!

If you want to know how you can join us and get 50% Discout on your FEE ask Cyberian in Chat Room!

solution1222 discussion1185 fall 2019813 assignment 1420 assignment 2292 spring 2020265 gdb 1237 assignment 380 crw10174 spring 201955

| |

Live Chat

1 / 1

The objective of this assignment is cs301 avl trees balancing factor of trees binary search trees rotation cases of avl trees • • zareen

CS301 Assignment 1 Solution and Discussion solution discussion assignment 1 spring 2020 cs301 • • zaasmi

CS301 Assignment 3 Solution and Discussion solution discussion assignment 3 fall 2020 assignment cs301 • • zaasmi

CS301 Assignment 2 Solution and Discussion Spring 2020 solution discussion assignment 2 spring 2020 cs301 • • zaasmi

CS301 GDB 1 Solution and Discussion solution discussion fall 2019 gdb 1 cs301 • • zareen

CS301 Assignment 2 Solution and Discussion solution discussion fall 2019 assignment 2 cs301 • • zareen

CS301 Assignment 3 Solution and Discussion solution discussion fall 2019 assignment 3 cs301 • • zareen

CS301 Quiz 1 Solution and Discussion solution discussion fall 2019 quiz 1 cs301 • • zareen

CS301 Assignment 1 Solution and Discussion solution discussion fall 2019 assignment 1 cs301 • • zareen

CS301 Final Term Current Paper spring 2019 final term current paper phy101 • • zareen

50% Off on Your FEE Join US!

The objective of this assignment is
cs301 avl trees balancing factor of trees binary search trees rotation cases of avl trees • • zareen

CS301 Assignment 1 Solution and Discussion
solution discussion assignment 1 spring 2020 cs301 • • zaasmi

CS301 Assignment 3 Solution and Discussion
solution discussion assignment 3 fall 2020 assignment cs301 • • zaasmi

CS301 Assignment 2 Solution and Discussion Spring 2020
solution discussion assignment 2 spring 2020 cs301 • • zaasmi

CS301 GDB 1 Solution and Discussion
solution discussion fall 2019 gdb 1 cs301 • • zareen

CS301 Assignment 2 Solution and Discussion
solution discussion fall 2019 assignment 2 cs301 • • zareen

CS301 Assignment 3 Solution and Discussion
solution discussion fall 2019 assignment 3 cs301 • • zareen

CS301 Quiz 1 Solution and Discussion
solution discussion fall 2019 quiz 1 cs301 • • zareen

CS301 Assignment 1 Solution and Discussion
solution discussion fall 2019 assignment 1 cs301 • • zareen

CS301 Final Term Current Paper
spring 2019 final term current paper phy101 • • zareen