Download Students Aggregation System using Linked list c++

      

                     Project Name: Students Aggregation System

                     Language Name: C ++,C plus plus

                    Database Connectivity : Nil

                    Application Type: Console Application

Introduction

 Hi friends, today I am going to share another c++ project that based on two of the most   important concepts of data structure known as linked list and linear searching, while the name of the project is
"Student Aggregation System”. This project is completely fulfills the required function or methods for a student aggregation system. I hope when you download this project and take an overview, as a response you will definitely like this project.

       Functions

• Create a Record File.

• Insert Student's Record.

• Modify Student's Record.

• Delete Student's Record.

• Search Student's Record.

• Print All Records.

• Sort According To Name.

• Refresh the program.                                                                         Source Code                                          

#include<string.h> #include<iostream> #include<conio.h> #include<Windows.h> using namespace std; struct student { int id; char name[30]; double aggr; int matric_marks, inter_marks, entryTest_marks; }; struct node { struct student *data; struct node *next; }; struct student *readStudent(); double calculate_aggregiate(struct student *); struct node* createDatabase(int ); struct node *InsertRecord(struct node *); struct node *DeleteRecord(struct node *); void ModifyRecord(struct node *); void SearchRecord(struct node *); void print(struct node *); int compareStudents(struct student *, struct student *); struct node *sort(struct node *); void gotoxy(int, int); void SetColor(int); void drawRectangle(); void clearWindow_p(); void window(); void clearWindow(); struct student *readStudent() { clearWindow(); struct student *stdnt = new student; gotoxy(33,8);cout<<"Student ID: "; while(!(cin >> stdnt->id) || cin.peek() != '\n') { char ch; cin.clear(); gotoxy(33,8);cout<<"Error..!Enter Nos in The respective field"; gotoxy(33,9);cout<<"Student ID: "; while(cin.get(ch) && ch != '\n'); } cin.ignore(); gotoxy(33,10);cout<<"Student Name: "; cin.getline(stdnt->name, 30); gotoxy(33,12);cout<<"Enter Matriculation Marks: "; cin>>(stdnt->matric_marks); gotoxy(33,14);cout<<"Enter Intermediate Marks: "; cin>>(stdnt->inter_marks); gotoxy(33,16);cout<<"Enter Entry Test Marks: "; cin>>(stdnt->entryTest_marks); stdnt->aggr = calculate_aggregiate(stdnt); gotoxy(33,18);cout<<"Student Aggregate Marks: "<< stdnt->aggr; if (stdnt->aggr >= 70) { gotoxy(33,20);cout<<"Student Registered In Electrical Engg"; } else if (stdnt->aggr >= 60) { gotoxy(33,22);cout<<"Student Registered In Mechanical Engg"; } else if (stdnt->aggr >=50) { gotoxy(33,24);cout<<"Student Registered In Computer Science"; } else { gotoxy(33,20);cout<<"Sorry! The Student Doesnt Qualify"; } return stdnt; } struct node *createDatabase(int size) { int i = 0; struct node *head = NULL; struct node *last = NULL; for(i = 0; i < size; i++) { struct student *stdnt = readStudent(); struct node *current =new node; current->data = stdnt; current->next = NULL; if(last) last->next = current; else head = current; last=current; } return head; } struct node *InsertRecord(struct node *head) { struct node *record = new node; struct student *stdnt = readStudent(); record->data=stdnt; record->next=head; return record; } double calculate_aggregiate(struct student *stud) { student *stdnt = stud; double aggr; aggr = stdnt->matric_marks * 10/100 + stdnt->inter_marks * 50/100 + stdnt->entryTest_marks * 40/100; return aggr; } struct node *DeleteRecord(struct node *head) { clearWindow(); struct node *curr,*prev, *temp; int tdata; if(head==NULL) { gotoxy(33,10);cout<<"NO RECORDS TO DELETE......!"; } else { gotoxy(33,10);cout<<"Enter Student ID To Be Deleted: "; cin>>tdata; prev=curr=head; while((curr!=NULL)&&(curr->data->id!=tdata)) { prev=curr; curr=curr->next; } if(curr==NULL) { gotoxy(33,12);cout<<"The Requested ID Is `Not Found...!"; } else if(curr==head) { head=head->next; gotoxy(33,12);cout<<"DATA DELETED....!"; } else { prev->next=curr->next; if(curr->next==NULL) { temp=prev; } gotoxy(33,12);cout<<"DATA DELETED....!"; } delete(curr); } return head; } void ModifyRecord(struct node *head) { clearWindow(); int ch, sid; struct node *current; struct student *stdnt; if (head==NULL) { gotoxy(33,8);cout<<"NO RECORD TO MODIFY..!"; } else { gotoxy(33,8);cout<<"Enter Student ID To Modify: "; cin>>sid; current=head; while((current!=NULL) && (current->data->id!=sid)) { current=current->next; } if (current==NULL) {gotoxy(33,10);cout<<"The Requested ID is Not Found";} else if(current->data->id==sid) { gotoxy(33,10);cout<<"What Do You Want To Modify"; gotoxy(33,12);cout<<"1. Student's Name"; gotoxy(33,14);cout<<"2. Student's Matric Marks"; gotoxy(33,16);cout<<"3. Student's Intermediate Marks"; gotoxy(33,18);cout<<"4. Student's Entry Test Marks"; gotoxy(33,20);cout<<"Enter Your Choice: "; cin>>ch; cin.ignore(); switch(ch) { case 1 : gotoxy(33,22);cout<<"Enter New Name: "; cin.getline(current->data->name, 30);break; case 2 : gotoxy(33,22);cout<<"Enter New Matric Marks: "; cin>>(current->data->matric_marks);break; case 3 : gotoxy(33,22);cout<<"Enter New Intermediate Marks: "; cin>>(current->data->inter_marks);break; case 4 : gotoxy(33,22);cout<<"Enter New Entry Test Marks: "; cin>>(current->data->entryTest_marks);break; } current->data->aggr = current->data->matric_marks * 10/100 + current->data->inter_marks * 50/100 + current->data->entryTest_marks * 40/100; gotoxy(33,24);cout<<"RECORD MODIFIED....!"; } } } void SearchRecord(struct node *head) { clearWindow(); int s_id; struct node *current; if (head==NULL) { gotoxy(33,8);cout<<"NO RECORD TO SEARCH..!"; } else { gotoxy(33,8);cout<<"Enter Student ID To Be Searched: "; cin>>s_id; current=head; while ((current!=NULL) && (current->data->id!=s_id)) { current=current->next; } if (current==NULL) {gotoxy(33,10);cout<<"The Requested ID is Not Found";} else if (current->data->id==s_id) { gotoxy(33,10);cout<<"Student ID: "<<current->data->id; gotoxy(33,12);cout<<"Student Name: "<<current->data->name; gotoxy(33,14);cout<<"Student Matric Marks: "<<current->data->matric_marks; gotoxy(33,16);cout<<"Student Intermediate Marks: "<<current->data->inter_marks; gotoxy(33,18);cout<<"Student Entry Test Marks: "<<current->data->entryTest_marks; gotoxy(33,20);cout<<"Student Aggregate Marks: "<<current->data->aggr; if (current->data->aggr >= 70) { gotoxy(33,22);cout<<"Student Registered In Electrical Engg"; } else if (current->data->aggr >= 60) { gotoxy(33,22);cout<<"Student Registered In Mechanical Engg"; } else if (current->data->aggr >=50) { gotoxy(33,22);cout<<"Student Registered In Computer Science"; } else { gotoxy(33,22);cout<<"Sorry! The Student Doesnt Qualify"; } } } } void print(struct node *head) { struct node *current = head; if (head == NULL) { gotoxy(33,8);cout<<"No Student Registered Yet......!"; } else { clearWindow_p(); gotoxy(37,10);cout<<"STUDENTS STATISTICS"; while(current) { struct student *stdnt = current->data; cout<<"\n\t\t\t\t-------------------------------- "; cout<<"\n\t\t\t\tStudent ID :"<<stdnt->id; cout<<"\n\t\t\t\tStudent Name :"<<stdnt->name; cout<<"\n\t\t\t\tMatric Marks :"<<stdnt->matric_marks; cout<<"\n\t\t\t\tIntermediate Marks :"<<stdnt->inter_marks; cout<<"\n\t\t\t\tEntry Test Marks: "<<stdnt->entryTest_marks; cout<<"\n\t\t\t\tAggregate: "<<stdnt->aggr; if (stdnt->aggr >= 70) { cout<<"\n\t\t\t\tStudent Registered In Electrical Engg"; } else if (stdnt->aggr >= 60) { cout<<"\n\t\t\t\tStudent Registered In Mechanical Engg"; } else if (stdnt->aggr >=50) { cout<<"\n\t\t\t\tStudent Registered In Computer Science"; } else { cout<<"\n\t\t\t\tSorry! The Student Doesnt Qualify"; } current=current->next; } cout<<"\n\t\t\t\t--------------------------------"; } } int compareStudents(struct student *left, struct student *right) { return strcmp(left->name, right->name); } struct node *sort(struct node *head) { int swapped = 0; do { swapped = 0; struct node *current = head; struct node *previous = NULL; while(current && current->next) { if(compareStudents(current->data, current->next->data) > 0) { struct node *temp = current->next; if(previous) { previous->next = temp; } else { head = temp; } current->next = temp->next; previous = temp; previous->next = current; swapped = 1; } else { previous = current; current = current->next; } } } while(swapped); return head; } void SetColor(int ForgC) { WORD wColor; HANDLE hStdOut = GetStdHandle(STD_OUTPUT_HANDLE); CONSOLE_SCREEN_BUFFER_INFO csbi; if(GetConsoleScreenBufferInfo(hStdOut, &csbi)) { wColor = (csbi.wAttributes & 0xF0) + (ForgC & 0x0F); SetConsoleTextAttribute(hStdOut, wColor); } return; } void drawRectangle(){ int i, j; char c=205; char c1=201; gotoxy(0,0); cout<<c1; for(i = 1; i < 78; i++){ gotoxy(i, 0); cout<<c; } gotoxy(78,0); char c2=187, c3=185, c4=186; cout<<c2; for(i = 1; i < 29; i++){ gotoxy(78, i); if(i == 6){ cout<<c3; }else{ cout<<c4; } } gotoxy(78, 25); char c5=188, c6=202, c7=205; cout<<c5; for(i = 77; i > 0; i--){ gotoxy(i,28); if(i == 30){ cout<<c6; }else{ cout<<c7; } } gotoxy(0,25); char c8=200, c9=204; cout<<c8; for(i = 28; i > 0; i--){ gotoxy(0,i); if(i == 28){ cout<<c9; }else{ cout<<c4; } } char c11 = 203; for(i = 1; i < 78; i++){ gotoxy(i,6); if(i == 30){ cout<<c11; }else{ cout<<c7; } } for(i = 7; i < 28; i++){ gotoxy(30,i); cout<<c4; } } void window(){ drawRectangle(); gotoxy(22,2); SetColor(35); cout<<"STUDENT REGISTRATION AND RECORD SYSTEM"; gotoxy(25,4); cout<<"ABC UNIVERSITY, KARACHI, PAKISTAN"; } void clearWindow_p(){ int i,j; for(i = 0; i < 80; i++){ for(j = 0; j < 35; j++){ gotoxy(i,j);cout<<" "; } } return; } void clearWindow(){ int i,j; for(i = 32; i < 78; i++){ for(j = 7; j < 28; j++){ gotoxy(i,j);cout<<" "; } } return; } COORD coord = {0,0}; void gotoxy(int x, int y){ coord.X = x; coord.Y = y; SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), coord); } void main() { system("color f0"); window(); SetColor(35); int total,i,choice; int x = 2; struct node *head; head=NULL; do { gotoxy(x, 8);cout<<"1.Create a Record File"; gotoxy(x, 10);cout<<"2.Insert Student's Record"; gotoxy(x, 12);cout<<"3.Modify Student's Record"; gotoxy(x, 14);cout<<"4.Delete Student's Record"; gotoxy(x, 16);cout<<"5.Search Student's Record"; gotoxy(x, 18);cout<<"6.Print All Records"; gotoxy(x, 20);cout<<"7.Sort According To Names"; gotoxy(x, 22);cout<<"8.Refresh"; gotoxy(x, 24);cout<<"9.Exit"; gotoxy(x, 26);cout<<"Enter your choice"; cout<<" [ ]\b\b"; cin>>choice; switch(choice) { case 1: clearWindow(); gotoxy(33, 8);cout<<"How Many Students Do You Want To Register: "; cin>>total; head=createDatabase(total); break; case 2: head=InsertRecord(head); break; case 3: ModifyRecord(head); break; case 4: DeleteRecord(head); break; case 5: SearchRecord(head); break; case 6: print(head); break; case 7: head = sort(head); print(head); break; case 8: window(); clearWindow(); break; } }while(choice!=9); getch(); }