diff --git a/ASD_Task_3.depend b/ASD_Task_3.depend index 831bfcc..4de835f 100644 --- a/ASD_Task_3.depend +++ b/ASD_Task_3.depend @@ -52,3 +52,31 @@ "operation.h" "my_data.h" +1582342870 source:c:\users\kamil\documents\github\asd_task_3\list.cpp + "list.h" + "my_data.h" + +1582342825 c:\users\kamil\documents\github\asd_task_3\list.h + + "my_data.h" + +1582342841 c:\users\kamil\documents\github\asd_task_3\my_data.h + + +1582342891 source:c:\users\kamil\documents\github\asd_task_3\my_data.cpp + "my_data.h" + +1582342907 source:c:\users\kamil\documents\github\asd_task_3\operation.cpp + "list.h" + "operation.h" + "my_data.h" + +1582342765 c:\users\kamil\documents\github\asd_task_3\operation.h + "list.h" + +1582342964 source:c:\users\kamil\documents\github\asd_task_3\main.cpp + + "list.h" + "operation.h" + "my_data.h" + diff --git a/ASD_Task_3.layout b/ASD_Task_3.layout index 17b1801..0d73359 100644 --- a/ASD_Task_3.layout +++ b/ASD_Task_3.layout @@ -2,39 +2,39 @@ - + - + - + - + - + - + - + - + - + - + - + - + - + - + diff --git a/bin/Debug/ASD_Task_3 b/bin/Debug/ASD_Task_3 new file mode 100644 index 0000000..e095646 Binary files /dev/null and b/bin/Debug/ASD_Task_3 differ diff --git a/bin/Release/ASD_Task_3.exe b/bin/Release/ASD_Task_3.exe new file mode 100644 index 0000000..3960d20 Binary files /dev/null and b/bin/Release/ASD_Task_3.exe differ diff --git a/list.cpp b/list.cpp index fe0655c..eca8155 100644 --- a/list.cpp +++ b/list.cpp @@ -6,9 +6,8 @@ void createList(List &L) { * FS : set first(L) and last(L) with Null */ //-------------your code here------------- - your code here - - + first(L)=NULL; + last(L)=NULL; //---------------------------------------- } @@ -19,9 +18,13 @@ address allocate(infotype x) { address P; //-------------your code here------------- - your code here - - + P = new elmlist; + info(P).ID = x.ID; + info(P).name = x.name; + info(P).rank = x.rank; + info(P).score = x.score; + next(P) = NULL; + prev(P) = NULL; //---------------------------------------- return P; } @@ -31,8 +34,7 @@ void deallocate(address &P) { * FS : delete element pointed by P */ //-------------your code here------------- - your code here - + delete P; //---------------------------------------- } @@ -43,9 +45,14 @@ void insertFirst(List &L, address P) { * FS : element pointed by P became the first element in List L */ //-------------your code here------------- - your code here - - + if(first(L)!=NULL){ + next(P)=first(L); + prev(first(L))=P; + first(L)=P; + }else{ + first(L)=P; + last(L)=P; + } //---------------------------------------- } @@ -55,9 +62,14 @@ void insertLast(List &L, address P) { * FS : element pointed by P became the last element in List L */ //-------------your code here------------- - your code here - - + if(last(L)!=NULL){ + prev(P)=last(L); + next(last(L))=P; + last(L)=P; + }else{ + first(L)=P; + last(L)=P; + } //---------------------------------------- } @@ -70,9 +82,10 @@ address findElm(List L, infotype x) { address P; //-------------your code here------------- - your code here - - + P=first(L); + while(P!=NULL && info(P).ID != x.ID){ + P=next(P); + } //---------------------------------------- return P; } @@ -83,10 +96,16 @@ void deleteFirst(List &L, address &P) { * FS : first element in List L is removed and is pointed by P */ //-------------your code here------------- - your code here - - - + if(first(L)==last(L)){ + P=first(L); + first(L)=NULL; + last(L)=NULL; + }else if(first(L)!=NULL){ + P=first(L); + first(L)=next(P); + next(P)=NULL; + prev(first(L))=NULL; + } //---------------------------------------- } @@ -96,10 +115,16 @@ void deleteLast(List &L, address &P) { * FS : last element in List L is removed and is pointed by P */ //-------------your code here------------- - your code here - - - + if(last(L)!=NULL){ + P=last(L); + last(L)=prev(P); + prev(P)=NULL; + next(last(L))=NULL; + }else if(first(L)==last(L)){ + P=first(L); + first(L)=NULL; + last(L)=NULL; + } //---------------------------------------- } @@ -109,9 +134,13 @@ void printInfo(List L) { * call the view_data function from my_data.h to print the info */ //-------------your code here------------- - your code here - - + address P; + P=first(L); + while(P!=NULL){ + view_data(info(P)); + P=next(P); + } + cout< * -* Type List : < -* first : address -* last : address +* Type List : < +* first : address +* last : address * > * **/ @@ -37,14 +37,16 @@ typedef struct elmlist *address; struct elmlist{ //------------- your code here ----------- - + infotype info; + address next; + address prev; //---------------------------------------- }; struct List{ //------------- your code here ----------- - - + address first; + address last; //---------------------------------------- }; diff --git a/main.cpp b/main.cpp index 9e0b483..a8df7cc 100644 --- a/main.cpp +++ b/main.cpp @@ -9,7 +9,8 @@ using namespace std; void mainMenu(); List L, L_passed; -int main() { +int main() +{ createList(L); createList(L_passed); @@ -18,7 +19,8 @@ int main() { return 0; } -void mainMenu() { +void mainMenu() +{ address P; infotype X; /** @@ -35,7 +37,8 @@ void mainMenu() { */ //-------------your code here------------- int choice; - do { + do + { cout<<"Menu"<>choice; - switch(choice) { + switch(choice) + { case 1: X = create_data(); P = allocate(X); - insertFirst(L,P) + if (findElm(L, info(P)) == NULL) + { + insertFirst(L, P); + } + break; + case 2: + printInfo(L); + break; + case 3: + cout << "Masukkan ID: "; + cin >> X.ID; + P = findElm(L, X); + if (P != NULL) + { + view_data(info(P)); + } + else + { + cout << "Not Found\n"; + } + break; + case 4: + cout << "Masukkan ID: "; + cin >> X.ID; + P = findElm(L, X); + if (P != NULL) + { + edit_data(info(P)); + } + else + { + cout << "Not Found\n"; + } + break; + case 5: + cout << "Masukkan ID: "; + cin >> X.ID; + if (findElm(L, X) != NULL) + { + deletebyID(L, X.ID); + } + else + { + cout << "Not Found" << endl; + } + break; + case 6: + savePassedMember(L, L_passed); + break; + case 7: + printInfo(L_passed); + break; + default: break; } - } while(true); - + } + while(true); //---------------------------------------- } diff --git a/my_data.cpp b/my_data.cpp index 68b9d77..6dd8509 100644 --- a/my_data.cpp +++ b/my_data.cpp @@ -1,10 +1,10 @@ - + #include "my_data.h" /** - CLASS : - NAME : - STUDENT ID : + CLASS : IF-43-05 + NAME : MUHAMMAD KAMIL HASAN + STUDENT ID : 1301190420 **/ mytype create_data() { @@ -14,12 +14,15 @@ mytype create_data() { */ mytype d; // =========================== - // YOUR CODE HERE - your code here - - - - + // YOUR CODE +62HERE + cout<<"input ID :"; + cin>>d.ID; + cout<<"input name :"; + cin>>d.name; + cout<<"input rank :"; + cin>>d.rank; + cout<<"input score :"; + cin>>d.score; // =========================== return d; } @@ -32,11 +35,7 @@ void view_data(mytype d) { // =========================== // YOUR CODE HERE - your code here - - - - + cout<<"ID :"<>d.name; + cout<<"input rank :"; + cin>>d.rank; + cout<<"input score :"; + cin>>d.score; // =========================== } diff --git a/my_data.h b/my_data.h index 2937b48..6502183 100644 --- a/my_data.h +++ b/my_data.h @@ -5,9 +5,9 @@ using namespace std; /** - CLASS : - NAME : - STUDENT ID : + CLASS : IF-43-05 + NAME : MUHAMMAD KAMIL HASAN + STUDENT ID : 1301190420 **/ struct mytype { @@ -20,8 +20,10 @@ struct mytype { */ //================================================= // YOUR CODE STARTS HERE - your code here - + int ID; + string name; + int rank; + float score; // YOUR CODE ENDS HERE //================================================= }; @@ -29,6 +31,6 @@ struct mytype { mytype create_data(); void view_data(mytype d); -void edit_data(mytype &d); +void edit_data(mytype &d); #endif // MY_DATA_H_INCLUDED diff --git a/obj/Debug/list.o b/obj/Debug/list.o new file mode 100644 index 0000000..7724cba Binary files /dev/null and b/obj/Debug/list.o differ diff --git a/obj/Debug/main.o b/obj/Debug/main.o new file mode 100644 index 0000000..96f6749 Binary files /dev/null and b/obj/Debug/main.o differ diff --git a/obj/Debug/my_data.o b/obj/Debug/my_data.o new file mode 100644 index 0000000..51008d8 Binary files /dev/null and b/obj/Debug/my_data.o differ diff --git a/obj/Debug/operation.o b/obj/Debug/operation.o new file mode 100644 index 0000000..3fe4fc3 Binary files /dev/null and b/obj/Debug/operation.o differ diff --git a/obj/Release/list.o b/obj/Release/list.o new file mode 100644 index 0000000..7208c2c Binary files /dev/null and b/obj/Release/list.o differ diff --git a/obj/Release/main.o b/obj/Release/main.o new file mode 100644 index 0000000..ec00731 Binary files /dev/null and b/obj/Release/main.o differ diff --git a/obj/Release/my_data.o b/obj/Release/my_data.o new file mode 100644 index 0000000..6572b0e Binary files /dev/null and b/obj/Release/my_data.o differ diff --git a/obj/Release/operation.o b/obj/Release/operation.o new file mode 100644 index 0000000..e523821 Binary files /dev/null and b/obj/Release/operation.o differ diff --git a/operation.cpp b/operation.cpp index c2dc0b0..a179e9e 100644 --- a/operation.cpp +++ b/operation.cpp @@ -1,7 +1,7 @@ #include "list.h" #include "operation.h" #include "my_data.h" - + void insertAndSort(List &L, infotype x) { /** @@ -14,7 +14,19 @@ void insertAndSort(List &L, infotype x) { */ //-------------your code here------------- - your code here + address P,Q; + P=first(L); + if(P==NULL || info(P).ID > x.ID){ + insertFirst(L,allocate(x)); + }else if(findElm(L,x)==NULL){ + while(P!=NULL && info(P).ID < x.ID){ + Q=P; + P=next(P); + } + insertAfter(L, Q, allocate(x)); + } else{ + insertLast(L,allocate(x)); + } //---------------------------------------- @@ -29,8 +41,17 @@ void deletebyID(List &L, int id_x) { address Prec, P; //-------------your code here------------- - your code here - + P=first(L); + if(P==first(L) && id_x == info(P).ID){ + deleteFirst(L,P); + }else{ + while(P!=NULL){ + if(id_x==info(P).ID && first(L)!=last(L)){ + deleteAfter(L, prev(P), P); + } + P=next(P); + } + } //---------------------------------------- } @@ -43,7 +64,21 @@ void savePassedMember(List &L, List &L2){ */ address P; //-------------your code here------------- - your code here + P=first(L); + address Q=P; + while(Q!=NULL){ + P=Q; + if(info(P).score>80){ + insertAndSort(L2,info(P)); + Q=next(Q); + if(prev(P)==NULL){ + deleteAfter(L,prev(P),P); + } + }else{ + Q=next(Q); + } + } + //----------------------------------------