diff --git a/ASD_Task_3.depend b/ASD_Task_3.depend
index 831bfcc..027b8fc 100644
--- a/ASD_Task_3.depend
+++ b/ASD_Task_3.depend
@@ -52,3 +52,31 @@
 	"operation.h"
 	"my_data.h"
 
+1582384994 source:c:\users\asus\documents\github\asd_task_3\my_data.cpp
+	"my_data.h"
+
+1582291814 c:\users\asus\documents\github\asd_task_3\my_data.h
+	<iostream>
+
+1582385561 source:c:\users\asus\documents\github\asd_task_3\main.cpp
+	<iostream>
+	"list.h"
+	"operation.h"
+	"my_data.h"
+
+1582291814 c:\users\asus\documents\github\asd_task_3\list.h
+	<iostream>
+	"my_data.h"
+
+1582044167 c:\users\asus\documents\github\asd_task_3\operation.h
+	"list.h"
+
+1582385746 source:c:\users\asus\documents\github\asd_task_3\operation.cpp
+	"list.h"
+	"operation.h"
+	"my_data.h"
+
+1582383117 source:c:\users\asus\documents\github\asd_task_3\list.cpp
+	"list.h"
+	"my_data.h"
+
diff --git a/ASD_Task_3.layout b/ASD_Task_3.layout
index 17b1801..6ab5d73 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="list.cpp" open="1" top="1" tabpos="1" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="496" topLine="7" />
+			<Cursor1 position="1199" topLine="44" />
 		</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.cpp" open="1" top="0" tabpos="3" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="288" topLine="0" />
+			<Cursor1 position="115" 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.h" open="1" top="0" tabpos="7" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="2862" topLine="116" />
+			<Cursor1 position="207" topLine="0" />
 		</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="my_data.h" open="1" top="0" tabpos="6" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="1006" topLine="0" />
+			<Cursor1 position="572" 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="main.cpp" 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="1533" topLine="39" />
 		</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="operation.cpp" open="1" top="0" tabpos="4" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="688" topLine="17" />
+			<Cursor1 position="773" topLine="12" />
 		</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="list.h" open="1" top="0" tabpos="5" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="207" topLine="0" />
+			<Cursor1 position="200" topLine="0" />
 		</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..b854589
Binary files /dev/null and b/bin/Debug/ASD_Task_3.exe differ
diff --git a/list.cpp b/list.cpp
index fe0655c..ea71bd6 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,11 +20,12 @@ address allocate(infotype x) {
 
     address P;
     //-------------your code here-------------
-    your code here
-
-
-    //----------------------------------------
+    P = new elmlist;
+    info(P)=x;
+    next(P)=NULL;
     return P;
+    //----------------------------------------
+
 }
 
 void deallocate(address &P) {
@@ -31,7 +33,7 @@ void deallocate(address &P) {
     * FS : delete element pointed by P
     */
     //-------------your code here-------------
-    your code here
+    delete P;
 
 
     //----------------------------------------
@@ -43,7 +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 && last(L)==NULL){
+        first(L)=P;
+        last(L)=P;
+    }else{
+        next(P)=first(L);
+        prev(first(L))=P;
+        first(L)=P;
+    }
 
 
     //----------------------------------------
@@ -55,7 +64,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){
+        first(L)=P;
+        last(L)=P;
+    }else{
+        prev(P)=last(L);
+        next(last(L))=P;
+        last(L)=P;
+    }
 
 
     //----------------------------------------
@@ -68,12 +84,10 @@ address findElm(List L, infotype x) {
            return Null if such ID is not found
     */
 
-    address P;
-    //-------------your code here-------------
-    your code here
-
-
-    //----------------------------------------
+    address P=first(L);
+    while (P!=NULL && info(P).ID!=x.ID){
+        P=next(P);
+    }
     return P;
 }
 
@@ -83,7 +97,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=first(L);
+    if (first(L)==last(L)){
+        first(L)=NULL;
+        last(L)=NULL;
+    }else {
+        first(L)=next(P);
+        next(P)=NULL;
+        prev(P)=NULL;
+    }
 
 
 
@@ -96,7 +118,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=last(L);
+    if (first(L)==last(L)){
+        first(L)=NULL;
+        last(L)=NULL;
+    }else {
+        last(L)=prev(P);
+        prev(P)=NULL;
+        next(P)=NULL;
+    }
 
 
 
@@ -109,8 +139,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<<endl;
 
     //----------------------------------------
 }
@@ -123,7 +157,10 @@ void insertAfter(List &L, address Prec, address P) {
     *      pointed by pointer Prec
     */
     //-------------your code here-------------
-    your code here
+    next(P)=next(Prec);
+    prev(P)=Prec;
+    prev(next(Prec))=P;
+    next(Prec)=P;
 
     //----------------------------------------
 
@@ -135,7 +172,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..a285944 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
 * >
 *
 **/
@@ -36,16 +36,14 @@ typedef mytype infotype;
 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..1740f3f 100644
--- a/main.cpp
+++ b/main.cpp
@@ -51,7 +51,50 @@ void mainMenu() {
         case 1:
             X = create_data();
             P = allocate(X);
-            insertFirst(L,P)
+            insertFirst(L,P);
+            break;
+        case 2:
+            printInfo(L);
+            cout<<endl;
+            break;
+        case 3:
+            cout<<"Masukkan ID yang dicari: ";
+            cin>>X.ID;
+            P=findElm(L, X);
+            if (P!=NULL){
+                view_data(info(P));
+            }else{
+                cout<<"Data Not Found";
+            }
+            break;
+        case 4:
+            cout<<"Masukkan ID yang akan diedit: ";
+            cin>>X.ID;
+            P=findElm(L, X);
+                if (P!=NULL){
+                    edit_data(info(P));
+                }else{
+                    cout<<"Data tidak ada"<<endl;
+                }
+            break;
+        case 5:
+            cout<<"Masukkan ID yang akan dihapus: ";
+            cin>>X.ID;
+            P=findElm(L, X);
+            if (P!=NULL){
+                deletebyID(L, X.ID);
+                cout<<"Data telah dihapus"<<endl;
+            }else{
+                cout<<"Data tidak ada"<<endl;
+            }
+            break;
+        case 6:
+            savePassedMember(L, L_passed);
+            cout<<"Data sudah dipisah"<<endl;
+            break;
+        case 7:
+            cout<<"Hasil: \n\n";
+            printInfo(L_passed);
             break;
         }
     } while(true);
diff --git a/my_data.cpp b/my_data.cpp
index 68b9d77..1b68ebb 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       : MAYANG SARI
+    STUDENT ID : 1301194227
 **/
 
 mytype create_data() {
@@ -15,8 +15,15 @@ mytype create_data() {
     mytype d;
     // ===========================
     // YOUR CODE HERE
-    your code here
-
+    cout<<"Masukkan ID: ";
+    cin>>d.ID;
+    cout<<"Masukkan Nama: ";
+    cin>>d.name;
+    cout<<"Masukkan Rank: ";
+    cin>>d.Rank;
+    cout<<"Masukkan Score: ";
+    cin>>d.score;
+    cout<<endl;
 
 
 
@@ -32,11 +39,11 @@ void view_data(mytype d) {
 
     // ===========================
     // YOUR CODE HERE
-    your code here
-
-
-
-
+    cout<<"ID: "<<d.ID<<endl;
+    cout<<"Nama: "<<d.name<<endl;
+    cout<<"Ranking: "<<d.Rank<<endl;
+    cout<<"Score: "<<d.score<<endl;
+    cout<<endl;
     // ===========================
 }
 
@@ -50,8 +57,13 @@ void edit_data(mytype &d) {
 
     // ===========================
     // YOUR CODE HERE
-        your code here
-
+    cout<<"Masukkan nama baru: ";
+    cin>>d.name;
+    cout<<"Masukkan ranking baru: ";
+    cin>>d.Rank;
+    cout<<"Masukkan score baru: ";
+    cin>>d.score;
+    cout<<endl;
 
 
 
diff --git a/my_data.h b/my_data.h
index 2937b48..e4ab177 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       : Mayang Sari
+    STUDENT ID : 1301194227
 **/
 
 struct mytype {
@@ -20,7 +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 +32,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..886e7c3
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..dda9350
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..87f6775
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..6d80242
Binary files /dev/null and b/obj/Debug/operation.o differ
diff --git a/operation.cpp b/operation.cpp
index c2dc0b0..51569bf 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,23 @@ void insertAndSort(List &L, infotype x) {
     */
 
     //-------------your code here-------------
-    your code here
+    address Q;
+    Q=allocate(x);
+    if (first(L)==NULL || info(first(L)).ID > x.ID){
+        insertFirst(L, Q);
+    }else {
+        address P = first(L);
+        while(next(P)!=NULL && info(next(P)).ID<=x.ID){
+            P=next(P);
+        }
+        if (info(P).ID==x.ID){
+            cout<<"ID tidak boleh sama";
+        }else if(next(Q)==NULL){
+            insertLast(L, Q);
+        }else if (info(Q).ID!=x.ID){
+            insertAfter(L, P, Q);
+        }
+    }
 
 
     //----------------------------------------
@@ -29,9 +45,20 @@ void deletebyID(List &L, int id_x) {
 
     address Prec, P;
     //-------------your code here-------------
-    your code here
-
-
+    if (first(L)!=NULL){
+        if (info(first(L)).ID==id_x){
+            deleteFirst(L, P);
+        }else if (info(last(L)).ID==id_x){
+            deleteLast(L, P);
+        }else{
+            address Q=first(L);
+            while (next(Q)!=NULL && info(next(Q)).ID != id_x){
+                Q=next(Q);
+            }
+            Prec=Q;
+            deleteAfter(L, Prec, P);
+        }
+    }
     //----------------------------------------
 }
 
@@ -41,9 +68,16 @@ void savePassedMember(List &L, List &L2){
     * IS : List L and L2 may be empty
     * FS : any element with score greater than 80 is moved to L2
     */
-    address P;
+    address P=first(L);
+    address Q;
     //-------------your code here-------------
-    your code here
+    while(P!=NULL){
+        if (info(P).score>80){
+            Q=allocate(info(P));
+            insertLast(L2, Q);
+        }
+        P=next(P);
+    }
 
 
     //----------------------------------------