diff --git a/ASD_Task_3.depend b/ASD_Task_3.depend index 831bfcc..71335ca 100644 --- a/ASD_Task_3.depend +++ b/ASD_Task_3.depend @@ -52,3 +52,31 @@ "operation.h" "my_data.h" +1582352018 source:d:\informatika\semester 2\struktur data\asd_task_3\main.cpp + + "list.h" + "operation.h" + "my_data.h" + +1582313472 d:\informatika\semester 2\struktur data\asd_task_3\list.h + + "my_data.h" + +1582350172 d:\informatika\semester 2\struktur data\asd_task_3\my_data.h + + +1581592462 d:\informatika\semester 2\struktur data\asd_task_3\operation.h + "list.h" + +1582350541 source:d:\informatika\semester 2\struktur data\asd_task_3\my_data.cpp + "my_data.h" + +1582350641 source:d:\informatika\semester 2\struktur data\asd_task_3\operation.cpp + "list.h" + "operation.h" + "my_data.h" + +1582350450 source:d:\informatika\semester 2\struktur data\asd_task_3\list.cpp + "list.h" + "my_data.h" + diff --git a/ASD_Task_3.layout b/ASD_Task_3.layout index 17b1801..b98f26f 100644 --- a/ASD_Task_3.layout +++ b/ASD_Task_3.layout @@ -2,39 +2,39 @@ - + - + - + - + - + - + - + - + - + - + - + - + - + - + diff --git a/bin/Debug/ASD_Task_3.exe b/bin/Debug/ASD_Task_3.exe new file mode 100644 index 0000000..49ecc47 Binary files /dev/null and b/bin/Debug/ASD_Task_3.exe differ diff --git a/list.cpp b/list.cpp index fe0655c..145351e 100644 --- a/list.cpp +++ b/list.cpp @@ -6,7 +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 +20,14 @@ 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,9 +37,7 @@ void deallocate(address &P) { * FS : delete element pointed by P */ //-------------your code here------------- - your code here - - + delete P; //---------------------------------------- } @@ -43,9 +47,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 +64,9 @@ void insertLast(List &L, address P) { * FS : element pointed by P became the last element in List L */ //-------------your code here------------- - your code here - - + next(last(L)) = P; + prev(P) = last(L); + last(L) = P; //---------------------------------------- } @@ -70,9 +79,11 @@ 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 +94,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 +113,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 +132,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 = 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; //---------------------------------------- }; @@ -61,7 +63,7 @@ void insertLast(List &L, address P); void deleteFirst(List &L, address &P); void deleteLast(List &L, address &P); void insertAfter(List &L, address Prec, address P); -void deleteAfter(List&L, address Prec, address &P); +void deleteAfter(List &L, address Prec, address &P); // define search-by-ID function and view procedure address findElm(List L, infotype x); diff --git a/main.cpp b/main.cpp index 9e0b483..370b390 100644 --- a/main.cpp +++ b/main.cpp @@ -51,10 +51,54 @@ void mainMenu() { case 1: X = create_data(); P = allocate(X); - insertFirst(L,P) + if (findElm(L,info(P))==NULL){ + insertFirst(L,P); + } break; - } - } while(true); + case 2: + printInfo(L); + break; + case 3: + cout<<"Enter ID : "; + cin>>X.ID; + P = findElm(L,X); + if (P != NULL){ + view_data(info(P)); + } else { + cout<<"Tidak ditemukan"; + } + break; + case 4: + cout<<"Enter ID : "; + cin>>X.ID; + P = findElm(L,X); + if (P != NULL){ + edit_data(info(P)); + } else { + cout<<"Tidak ditemukan"; + } + break; + case 5: + cout<<"Enter ID : "; + cin>>X.ID; + if (findElm(L,X) != NULL){ + deletebyID(L,X.ID); + } else { + cout<<"Tidak ditemukan"; + } + break; + case 6: + savePassedMember(L,L_passed); + break; + case 7: + printInfo(L_passed); + break; + } + if (choice == 0){ + break; + } + } + while(true); //---------------------------------------- } diff --git a/my_data.cpp b/my_data.cpp index 68b9d77..0633486 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 : I WAYAN ADI WAHYUDI + STUDENT ID : 1301194084 **/ mytype create_data() { @@ -15,10 +15,14 @@ mytype create_data() { mytype d; // =========================== // YOUR CODE HERE - your code here - - - + cout<<"ID : "; + cin>>d.ID; + cout<<"Nama : "; + cin>>d.name; + cout<<"Rank : "; + cin>>d.rank; + cout<<"Score : "; + cin>>d.score; // =========================== return d; @@ -32,7 +36,7 @@ void view_data(mytype d) { // =========================== // YOUR CODE HERE - your code here + cout<>d.name; + cout<<"Edit Rank : "; + cin>>d.rank; + cout<<"Edit Score : "; + cin>>d.score; diff --git a/my_data.h b/my_data.h index 2937b48..a9f4e21 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 : I WAYAN ADI WAHYUDI + STUDENT ID : 1301194084 **/ 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..69edd6e 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..359ec4f 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..57f5b33 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..5418eba Binary files /dev/null and b/obj/Debug/operation.o differ diff --git a/operation.cpp b/operation.cpp index c2dc0b0..54b991e 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,9 +14,17 @@ 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)); + } //---------------------------------------- } @@ -29,7 +37,18 @@ 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,8 +62,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){ + deleteFirst(L,P); + } else { + deleteAfter(L,prev(P),P); + } + } else { + Q = next(Q); + } + } //---------------------------------------- }