diff --git a/ASD_Task_3.depend b/ASD_Task_3.depend index 831bfcc..a8d23f3 100644 --- a/ASD_Task_3.depend +++ b/ASD_Task_3.depend @@ -52,3 +52,31 @@ "operation.h" "my_data.h" +1582336450 source:c:\latihan coding\asd_task_3\my_data.cpp + "my_data.h" + +1582336450 c:\latihan coding\asd_task_3\my_data.h + + +1582336235 source:c:\latihan coding\asd_task_3\main.cpp + + "list.h" + "operation.h" + "my_data.h" + +1582295284 c:\latihan coding\asd_task_3\list.h + + "my_data.h" + +1582270112 c:\latihan coding\asd_task_3\operation.h + "list.h" + +1582334491 source:c:\latihan coding\asd_task_3\operation.cpp + "list.h" + "operation.h" + "my_data.h" + +1582336535 source:c:\latihan coding\asd_task_3\list.cpp + "list.h" + "my_data.h" + diff --git a/ASD_Task_3.layout b/ASD_Task_3.layout index 17b1801..5f261d9 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..ea24098 Binary files /dev/null and b/bin/Debug/ASD_Task_3.exe differ diff --git a/list.cpp b/list.cpp index fe0655c..d245bed 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,10 @@ address allocate(infotype x) { address P; //-------------your code here------------- - your code here - - + P = new elmlist; + info(P) = x; + next(P) = NULL; + prev(P) = NULL; //---------------------------------------- return P; } @@ -31,9 +31,7 @@ void deallocate(address &P) { * FS : delete element pointed by P */ //-------------your code here------------- - your code here - - + delete P; //---------------------------------------- } @@ -43,9 +41,15 @@ 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 && last(L) == NULL){ + first(L) = P; + last(L) = P; + } + else{ + next(P) = first(L); + prev(first(L)) = P; + first(L) = P; + } //---------------------------------------- } @@ -55,9 +59,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(first(L) == NULL && last(L) == NULL){ + insertFirst(L,P); + } + else{ + next(last(L)) = P; + prev(P) = last(L); + last(L) = P; + } //---------------------------------------- } @@ -68,11 +77,13 @@ address findElm(List L, infotype x) { return Null if such ID is not found */ - address P; + 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); + prev(first(L)) = NULL; + next(P)= NULL; + } //---------------------------------------- } @@ -96,10 +113,14 @@ 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 (first(L) == last(L)) { + deleteFirst(L,P); + }else{ + P = last(L); + last(L) = prev(P); + next(last(L)) = NULL; + prev(P) = NULL; + } //---------------------------------------- } @@ -109,9 +130,12 @@ 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; //---------------------------------------- }; diff --git a/main.cpp b/main.cpp index 9e0b483..aeede7f 100644 --- a/main.cpp +++ b/main.cpp @@ -51,7 +51,57 @@ void mainMenu() { case 1: X = create_data(); P = allocate(X); - insertFirst(L,P) + 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 << "ID 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 << "ID Not Found\n"; + } + break; + case 5: + cout << "Masukkan ID: "; + cin >> X.ID; + if (findElm(L, X) != NULL) + { + deletebyID(L, X.ID); + } + else + { + cout << "ID Not Found" << endl; + } + 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..e27cd5e 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 : BAGJA 9102 KURNIAWAN + STUDENT ID : 1301194020 **/ mytype create_data() { @@ -15,11 +15,14 @@ mytype create_data() { mytype d; // =========================== // YOUR CODE HERE - your code here - - - - + cout<<"ID : "; + cin>>d.ID; + cout<<"Name : "; + cin>>d.Name; + cout<<"Rank : "; + cin>>d.Rank; + cout<<"Score : "; + cin>>d.Score; // =========================== return d; } @@ -32,11 +35,12 @@ void view_data(mytype d) { // =========================== // YOUR CODE HERE - your code here - - - - + cout<<"======================"<>d.ID; + cout<<"Name : "; + cin>>d.Name; + cout<<"Rank : "; + cin>>d.Rank; + cout<<"Score : "; + cin>>d.Score; // =========================== } diff --git a/my_data.h b/my_data.h index 2937b48..ad0b89c 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 : BAGJA 9102 KURNIAWAN + STUDENT ID : 1301194020 **/ 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..cb18d5d 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..3980f3a 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..395b575 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..d7e4c89 Binary files /dev/null and b/obj/Debug/operation.o differ diff --git a/operation.cpp b/operation.cpp index c2dc0b0..c80ba8e 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 Q,P; + 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)) { + Prec = prev(P); + deleteAfter(L, Prec, P); + } + P = next(P); + } + } //---------------------------------------- @@ -43,7 +62,22 @@ 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); + } + } //----------------------------------------