diff --git a/ASD_Task_3.depend b/ASD_Task_3.depend
index 831bfcc..5a1cc85 100644
--- a/ASD_Task_3.depend
+++ b/ASD_Task_3.depend
@@ -52,3 +52,32 @@
 	"operation.h"
 	"my_data.h"
 
+1582346390 source:d:\kuliah\semester 2\asd_task_3\list.cpp
+	"list.h"
+	"my_data.h"
+	<iostream>
+
+1582345192 d:\kuliah\semester 2\asd_task_3\list.h
+	<iostream>
+	"my_data.h"
+
+1581926406 d:\kuliah\semester 2\asd_task_3\my_data.h
+	<iostream>
+
+1582347753 source:d:\kuliah\semester 2\asd_task_3\main.cpp
+	<iostream>
+	"list.h"
+	"operation.h"
+	"my_data.h"
+
+1581918600 d:\kuliah\semester 2\asd_task_3\operation.h
+	"list.h"
+
+1582383090 source:d:\kuliah\semester 2\asd_task_3\my_data.cpp
+	"my_data.h"
+
+1582382247 source:d:\kuliah\semester 2\asd_task_3\operation.cpp
+	"list.h"
+	"operation.h"
+	"my_data.h"
+
diff --git a/ASD_Task_3.layout b/ASD_Task_3.layout
index 17b1801..ea29f5c 100644
--- a/ASD_Task_3.layout
+++ b/ASD_Task_3.layout
@@ -2,39 +2,39 @@
 <CodeBlocks_layout_file>
 	<FileVersion major="1" minor="0" />
 	<ActiveTarget name="Debug" />
-	<File name="my_data.h" open="0" top="0" tabpos="5" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
+	<File name="operation.h" open="1" top="0" tabpos="6" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="496" topLine="7" />
+			<Cursor1 position="58" topLine="0" />
 		</Cursor>
 	</File>
-	<File name="operation.cpp" open="0" top="0" tabpos="0" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
+	<File name="my_data.h" open="1" top="0" tabpos="4" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="288" topLine="0" />
+			<Cursor1 position="418" topLine="0" />
 		</Cursor>
 	</File>
-	<File name="list.cpp" open="0" top="0" tabpos="4" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
+	<File name="operation.cpp" open="1" top="1" tabpos="5" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="2862" topLine="116" />
+			<Cursor1 position="1613" topLine="53" />
 		</Cursor>
 	</File>
-	<File name="main.cpp" open="0" top="0" tabpos="1" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
+	<File name="list.cpp" open="1" top="0" tabpos="7" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="1006" topLine="0" />
+			<Cursor1 position="532" topLine="0" />
 		</Cursor>
 	</File>
-	<File name="my_data.cpp" open="0" top="0" tabpos="3" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
+	<File name="list.h" open="1" top="0" tabpos="2" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="774" topLine="0" />
+			<Cursor1 position="542" topLine="34" />
 		</Cursor>
 	</File>
-	<File name="list.h" open="0" top="0" tabpos="6" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
+	<File name="main.cpp" open="1" top="0" tabpos="1" split="0" active="1" splitpos="0" zoom_1="1" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="688" topLine="17" />
+			<Cursor1 position="1311" topLine="77" />
 		</Cursor>
 	</File>
-	<File name="operation.h" open="0" top="0" tabpos="0" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
+	<File name="my_data.cpp" open="1" top="0" tabpos="3" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="207" topLine="0" />
+			<Cursor1 position="454" topLine="9" />
 		</Cursor>
 	</File>
 </CodeBlocks_layout_file>
diff --git a/bin/Debug/ASD_Task_3.exe b/bin/Debug/ASD_Task_3.exe
new file mode 100644
index 0000000..03123ae
Binary files /dev/null and b/bin/Debug/ASD_Task_3.exe differ
diff --git a/list.cpp b/list.cpp
index fe0655c..cb161e5 100644
--- a/list.cpp
+++ b/list.cpp
@@ -1,14 +1,15 @@
 #include "list.h"
 #include "my_data.h"
+#include <iostream>
+using namespace std;
 
 void createList(List &L) {
     /**
     * FS : set first(L) and last(L) with Null
     */
     //-------------your code here-------------
-    your code here
-
-
+    L.first = NULL;
+    L.last = NULL;
     //----------------------------------------
 }
 
@@ -19,9 +20,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,9 +36,7 @@ void deallocate(address &P) {
     * FS : delete element pointed by P
     */
     //-------------your code here-------------
-    your code here
-
-
+    delete P;
     //----------------------------------------
 }
 
@@ -43,9 +46,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 (L.first != NULL){
+        P->next = L.first;
+        prev(L.first) = P;
+        L.first = P;
+    }else{
+        L.first = P;
+        L.last = P;
+    }
     //----------------------------------------
 }
 
@@ -55,9 +63,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 (L.first!=NULL){
+        P->prev = L.last;
+        next(L.last) = P;
+        L.last = P;
+    }else{
+        L.last = P;
+        L.first = P;
+    }
     //----------------------------------------
 }
 
@@ -70,9 +83,15 @@ address findElm(List L, infotype x) {
 
     address P;
     //-------------your code here-------------
-    your code here
-
-
+    P = L.first;
+    if (L.first!=NULL){
+        while (P != NULL && info(P).ID != x.ID)
+        {
+            P = P -> next;
+        }
+    }else{
+        P=NULL;
+    }
     //----------------------------------------
     return P;
 }
@@ -83,10 +102,15 @@ 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
-
-
-
+    P = L.first;
+    if (L.first!=last(L)){
+        L.first = next(P);
+        next(P) = NULL;
+        prev(L.first)=NULL;
+    }else {
+        L.first = NULL;
+        L.last = NULL;
+    }
     //----------------------------------------
 }
 
@@ -96,10 +120,15 @@ 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
-
-
-
+    P = L.last;
+    if (L.last!=first(L)){
+        L.last = prev(P);
+        prev(P) = NULL;
+        next(L.last)=NULL;
+    }else {
+        L.first = NULL;
+        L.last = NULL;
+    }
     //----------------------------------------
 }
 
@@ -109,9 +138,16 @@ 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);
+    if (P==NULL){
+        cout<<"Data Tidak Ada.."<<endl;
+    }else{
+        while (P!=NULL){
+            view_data(info(P));
+            P = next(P);
+        }
+    }
+    cout<<endl;
     //----------------------------------------
 }
 
@@ -123,8 +159,10 @@ void insertAfter(List &L, address Prec, address P) {
     *      pointed by pointer Prec
     */
     //-------------your code here-------------
-    your code here
-
+    P->next = Prec->next;
+    P->prev = Prec;
+    prev(next(Prec)) = P;
+    Prec->next = P;
     //----------------------------------------
 
 }
@@ -135,9 +173,11 @@ void deleteAfter(List &L, address Prec, address &P) {
     *      is removed and pointed by pointer P
     */
     //-------------your code here-------------
-    your code here
-
-
+    P = next(Prec);
+    next(Prec) = next(P);
+    prev(next(P)) = Prec;
+    next(P) = NULL;
+    prev(P) = NULL;
     //----------------------------------------
 }
 
diff --git a/list.h b/list.h
index c21344f..c070520 100644
--- a/list.h
+++ b/list.h
@@ -23,9 +23,9 @@ using namespace std;
 *	prev : address
 * >
 *
-* 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..98bcbac 100644
--- a/main.cpp
+++ b/main.cpp
@@ -19,8 +19,9 @@ int main() {
 }
 
 void mainMenu() {
-    address P;
+    address P,R;
     infotype X;
+    mytype idpeserta;
     /**
     * IS : List has been created
     * PR : prints menu to user
@@ -50,8 +51,63 @@ void mainMenu() {
         switch(choice) {
         case 1:
             X = create_data();
-            P = allocate(X);
-            insertFirst(L,P)
+            insertAndSort(L,X);
+            cout<<endl;
+            break;
+        case 2:
+            cout<<"Data semua member: "<<endl;
+            printInfo(L);
+            cout<<endl;
+            break;
+        case 3:
+            cout<<"Masukkan ID member yang ingin dilihat: ";
+            cin>>idpeserta.ID;
+            P= findElm(L, idpeserta);
+            if(P!=NULL){
+                view_data(info(P));
+            }else{
+                cout << "ID yang anda cari TIDAK ADA.." << endl;
+            }
+            cout<<endl;
+            break;
+        case 4:
+            cout << "Masukkan ID member yang ingin di edit: ";
+            cin >> idpeserta.ID;
+            P = findElm(L, idpeserta);
+            if (P!=NULL){
+                cout<<"Silahkan mengedit data member: "<<endl;
+                edit_data(info(P));
+                cout<<"Data berhasil diperbarui"<<endl;
+            }else{
+                cout<<"ID yang anda cari TIDAK ADA.."<<endl;
+            }
+            cout<<endl;
+            break;
+        case 5:
+            cout << "Masukkan ID member yang ingin di hapus: ";
+            cin >> idpeserta.ID;
+            P = findElm(L, idpeserta);
+            if (P!=NULL){
+                deletebyID(L, idpeserta.ID);
+                cout<<"Data berhasil dihapus.."<<endl;
+            }else{
+                cout<<"Data Tidak ada.."<<endl;
+            }
+            cout<<endl;
+            break;
+        case 6:
+            savePassedMember(L, L_passed);
+            cout<<"Pemindahan Member yang LULUS selesai.."<<endl;
+            cout<<endl;
+            break;
+        case 7:
+            cout<<"Data Mahasiswa yang LULUS:"<<endl;
+            printInfo(L_passed);
+            cout<<endl;
+            break;
+        }
+        if (choice == 0)
+        {
             break;
         }
     } while(true);
diff --git a/my_data.cpp b/my_data.cpp
index 68b9d77..3559a06 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       : NAUFAL REZKY ANANDA
+    STUDENT ID : 1301190478
 **/
 
 mytype create_data() {
@@ -15,11 +15,17 @@ mytype create_data() {
     mytype d;
     // ===========================
     // YOUR CODE HERE
-    your code here
-
+    cout<<"ID member: ";
+    cin>>d.ID;
 
+    cout<<"Nama: ";
+    cin>>d.name;
 
+    cout<<"Rank: ";
+    cin>>d.rank;
 
+    cout<<"Score: ";
+    cin>>d.score;
     // ===========================
     return d;
 }
@@ -32,11 +38,10 @@ void view_data(mytype d) {
 
     // ===========================
     // YOUR CODE HERE
-    your code here
-
-
-
-
+    cout<<"ID member: "<<d.ID<<endl;
+    cout<<"Nama: "<<d.name<<endl;
+    cout<<"Rank: "<<d.rank<<endl;
+    cout<<"Score: "<<d.score<<endl;
     // ===========================
 }
 
@@ -50,11 +55,15 @@ void edit_data(mytype &d) {
 
     // ===========================
     // YOUR CODE HERE
-        your code here
-
-
-
-
+    cout<<"Nama baru: ";
+    cin>>d.name;
+    cout<<endl;
+    cout<<"Rank baru: ";
+    cin>>d.rank;
+    cout<<endl;
+    cout<<"Score baru: ";
+    cin>>d.score;
+    cout<<endl;
     // ===========================
 }
 
diff --git a/my_data.h b/my_data.h
index 2937b48..132332a 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       :NAUFAL REZKY ANANDA
+    STUDENT ID :1301190478
 **/
 
 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..c990382
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..116fc24
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..b783447
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..79701fe
Binary files /dev/null and b/obj/Debug/operation.o differ
diff --git a/operation.cpp b/operation.cpp
index c2dc0b0..3fcb35d 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,20 @@ void insertAndSort(List &L, infotype x) {
     */
 
     //-------------your code here-------------
-    your code here
-
-
+    address P, Q;
+    P = L.first;
+    if (P == NULL || P->info.ID >= x.ID) {
+        insertFirst(L, allocate(x));
+    } else if (info(last(L)).ID<=x.ID) {
+        insertLast(L, allocate(x));
+    } else {
+        while (P != NULL && P->info.ID < x.ID)
+        {
+            P = P->next;
+        }
+        P = prev(P);
+        insertAfter(L, P, allocate(x));
+    }
     //----------------------------------------
 }
 
@@ -27,10 +38,36 @@ void deletebyID(List &L, int id_x) {
     * FS : an element with ID info = id_x is deleted from List L (deallocate)
     */
 
-    address Prec, P;
+    //address Prec, P;
     //-------------your code here-------------
-    your code here
+    address P,R;
+    P = L.first;
 
+    if (L.first==NULL){
+        deleteFirst(L,R);
+        deallocate(R);
+    }else{
+        if (P->info.ID == id_x)
+        {
+            deleteFirst(L, R);
+            deallocate(R);
+        }
+        else if (info(last(L)).ID == id_x)
+        {
+            deleteLast(L, R);
+            deallocate(R);
+        }
+        else
+        {
+            while (P != NULL && P->info.ID != id_x)
+            {
+                P = P->next;
+            }
+            P = prev(P);
+            deleteAfter(L, P, R);
+            deallocate(R);
+        }
+    }
 
     //----------------------------------------
 }
@@ -43,8 +80,13 @@ void savePassedMember(List &L, List &L2){
     */
     address P;
     //-------------your code here-------------
-    your code here
-
+    P = L.first;
+    while(P!=NULL){
+        if (info(P).score>=80){
+            insertLast(L2, allocate(info(P)));
+        }
+        P = next(P);
+    }
 
     //----------------------------------------
 }