Breaking News

CS301 Assignment No.1 Fall 2021

 CS301 Assignment No.1 Fall 2021 

CS301 Assignment No.1 Fall 2021

CS301 Assignment 1 Complete Solution, CS301 Assignment 1 solution, CS301 assignment Fall 2021, CS301 assignment solution 2021, CS301 Assignment 1, CS301 Assignment 1 solution Fall 2021, CS301, virtual university, CS301 assignment 1 solution, CS301 assignment 1 solution 2021, vu assignment, assignment solution, CS301 solution, CS301 Assignment 1 solution 2020, CS301 assignment solution 2020, CS301 Assignment 1 solution Fall 2020, CS301 assignment no 1 solution Fall 2020

or Copy From Here
#include<iostream>
#include<conio.h>
using namespace std;
int size=0;
class Student 
{
public:
string name;
int marks;
Student *nextStudent;
void setName(string setn)
{
name = setn;
}
string getName()
{
return name;
}
void setMarks(int setm)
{
marks = setm;
}
int getMarks()
{
return marks;
}
void setNextStudent(Student *setAddress)
{
nextStudent = setAddress;
}
Student* getNextStudent()
{
return nextStudent;
}
};
class Stack
{
public:
Student *headStudent = NULL;
bool isEmpty()
{
if(headStudent == NULL)
{
cout<<"\n\nStack is empty.\n\n";
return true;
}
else
return false;
}
void push()
{
string n;
int m;
Student *newNode = new Student;
cout<<"\n\nEnter the Name of Student: ";
cin>>n;
newNode -> setName(n);
cout<<"Enter the Marks of Student: ";
cin>>m;
newNode -> setMarks(m);
newNode -> setNextStudent(NULL);
if(headStudent == NULL)
{
headStudent = newNode;
}
else
{
Student *ptr = headStudent;
while(ptr -> getNextStudent() != NULL)
{
ptr = ptr -> getNextStudent();
}
ptr -> setNextStudent(newNode);
}
cout<<"Student's information saved successfully.\n\n";
size++;
}
void pop()
{
if(!isEmpty())
{
Student *pre = headStudent;
Student *ptr = headStudent;
while(ptr -> getNextStudent() != NULL)
{
pre = ptr;
ptr = ptr -> getNextStudent();
}
if(ptr == headStudent)
headStudent = NULL;
else
pre -> setNextStudent(NULL);
delete ptr;
size--;
cout<<"\n\nStudent is successfully removed from the stack\n\n";
}
}
void display()
{
if(!isEmpty())
{
string n[size];
int m[size],i=0,j=0;
cout<<"\n\nThe information of all students:";
cout<<"\nName\t\tMarks";
Student *ptr = headStudent;
while(ptr != NULL)
{
n[i++] = ptr -> getName();
m[j++] = ptr -> getMarks();
ptr = ptr -> getNextStudent();
}
for(int k=size-1;k>=0;k--)
cout<<"\n"<<n[k]<<"\t\t"<<m[k];
cout<<"\n\n";
}
}
void sortStack()
{
for(int i=0;i<size;i++)
{
Student *ptr = headStudent;
for(int j=0;j<size-1;j++)
{
string tmp;
if(ptr -> getMarks() < ptr -> getNextStudent() -> getMarks())
{
ptr -> setMarks(ptr -> getMarks() + ptr -> getNextStudent() -> getMarks());
ptr -> getNextStudent() -> setMarks(ptr -> getMarks() - ptr -> getNextStudent() -> getMarks());
ptr -> setMarks(ptr -> getMarks() - ptr -> getNextStudent() -> getMarks());
tmp = ptr -> getName();
ptr -> setName(ptr -> getNextStudent() -> getName());
ptr -> getNextStudent() -> setName(tmp);
}
ptr = ptr -> getNextStudent();
}
}
}
void top()
{
if(!isEmpty())
{
sortStack();
cout<<"\n\nTop positions:";
cout<<"\nName\t\tMarks";
Student *ptr = headStudent;
for(int k=0;k<3;k++)
{
cout<<"\n"<<ptr -> getName()<<"\t\t"<<ptr -> getMarks();
ptr = ptr -> getNextStudent();
}
cout<<"\n\n";
}
}
};
main()
{
Stack s;
p:
int choice;
cout<<"1. To add a student in the stack";
cout<<"\n2. To remove a student from the stack";
cout<<"\n3. Display all students of stack";
cout<<"\n4. Display top 3 students of stack";
cout<<"\n5. Press 5 or any other key to close the program";
cout<<"\n\nEnter your choice (1, 2, 3, 4 or 5): ";
cin>>choice;
switch(choice)
{
case 1:
s.push();
break;
case 2:
s.pop();
break;
case 3:
s.display();
break;
case 4:
s.top();
break;
default:
exit(0);
}
goto p;
}

CS301 Assignment 1 Complete Solution,CS301 Assignment 1 solution,CS301 assignment Fall 2021,CS301 assignment solution Fall 2021,CS301 Assignment 1 solution 2021,CS301 assignment solution 2021,CS301 Assignment 1,CS301 Assignment 1 solution Fall 2021,CS301 Assignment no 1 solution 2021,assignment solution Fall 2021,cs,vu,CS301,virtual university,CS301 assignment 1 solution,CS301 assignment 1 solution 2021,vu assignment, assignment solution CS301 Assignment 1 Complete Solution,CS301 Assignment 1,CS301 ,CS301 Assignment 1 solution,CS301 assignment Fall 2020,CS301 assignment solution Fall 2020,CS301 assignment, Assignment 1 CS301 solution, solution CS301 Assignment 1, CS301 Assignment 1 solution 2020,CS301 assignment solution 2020,CS301 Assignment 1,CS301 Assignment 1 solution Fall 2020,CS301 assignment no 1 solution Fall 2020,CS301 assignment no 1 solution 2020,CS301 1st assignment solution 2020,CS301 1st assignment solution #CS301 1st assignment solution Fall 2020 #assignment solution Fall 2020 #CS301 #CS301assignment1solution2020


No comments