MUHAMMAD KHIYARUS SYIAM || 1301194242 || IF-43-05

ASD_Task_3.depend

@@ -52,3 +52,31 @@
 	"operation.h"
 	"my_data.h"
 
+1582029680 source:c:\users\rulz\documents\github\asd_task_3\my_data.cpp
+	"my_data.h"
+
+1582029833 c:\users\rulz\documents\github\asd_task_3\my_data.h
+	<iostream>
+
+1582030192 source:c:\users\rulz\documents\github\asd_task_3\list.cpp
+	"list.h"
+	"my_data.h"
+
+1582028654 c:\users\rulz\documents\github\asd_task_3\list.h
+	<iostream>
+	"my_data.h"
+
+1582030314 source:c:\users\rulz\documents\github\asd_task_3\operation.cpp
+	"list.h"
+	"operation.h"
+	"my_data.h"
+
+1582028356 c:\users\rulz\documents\github\asd_task_3\operation.h
+	"list.h"
+
+1582030322 source:c:\users\rulz\documents\github\asd_task_3\main.cpp
+	<iostream>
+	"list.h"
+	"operation.h"
+	"my_data.h"
+

list.cpp

@@ -6,7 +6,7 @@ void createList(List &L) {
     * FS : set first(L) and last(L) with Null
     */
     //-------------your code here-------------
-    your code here
+    first(L) = NULL;
 
 
     //----------------------------------------
@@ -19,7 +19,9 @@ address allocate(infotype x) {
 
     address P;
     //-------------your code here-------------
-    your code here
+    P = new elmlist;
+    info(P) = x;
+    next(P) = NULL;
 
 
     //----------------------------------------
@@ -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,12 @@ 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);
+        first(L) = P;
+    } else{
+        first(L) = P;
+    }
 
 
     //----------------------------------------
@@ -55,7 +62,19 @@ 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){
+            address Q = first(L);
+            while ( next(Q)!= NULL)
+            {
+                Q=next(Q);
+            }
+            next(Q)=P;
+        }
+        else
+        {
+            insertFirst(L,P);
+        }
+
 
 
     //----------------------------------------
@@ -67,10 +86,25 @@ address findElm(List L, infotype x) {
     * FS : returns element with info.ID = x.ID,
            return Null if such ID is not found
     */
-
+    int ID;
     address P;
     //-------------your code here-------------
-    your code here
+    P = first(L);
+        while (P != NULL)
+        {
+            if (info(P).ID != x.ID)
+            {
+                P= next(P);
+            }
+            else if (info(P).ID == x.ID)
+            {
+                return P;
+            }
+            else
+            {
+                return NULL;
+            }
+        }
 
 
     //----------------------------------------
@@ -83,33 +117,69 @@ 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) != NULL){
+            P= first(L);
+            first(L)=next(P);
+            next(P)=NULL;
+        }
+        else
+        {
+            first(L)= NULL;
+        }
+    }
 
 
 
     //----------------------------------------
-}
+
 
 void deleteLast(List &L, address &P) {
     /**
     * IS : List L may be empty
     * FS : last element in List L is removed and is pointed by P
     */
     //-------------your code here-------------
-    your code here
+     P = first(L);
+        if (first(L)!= NULL)
+        {
+           while (next(next(P)) != NULL){
+                P   = next(P);
+           }
+           next(P)= NULL;
+        }
+        else
+        {
+            first(L)=NULL;
+        }
+    }
 
 
 
     //----------------------------------------
-}
+
 
 void printInfo(List L) {
     /**
     * FS : view info of all element inside List L,
     *      call the view_data function from my_data.h to print the info
     */
     //-------------your code here-------------
-    your code here
+    address P;
+     if (first(L) != NULL)
+        {
+        P = first(L);
+            while (P != NULL)
+            {
+                cout << "======================================="<<endl;
+                view_data(info(P));
+                cout << "======================================="<<endl;
+                P = next(P);
+            }
+        }
+        else
+        {
+            cout<<"kosong"<<endl;
+        }
 
 
     //----------------------------------------
@@ -123,7 +193,16 @@ void insertAfter(List &L, address Prec, address P) {
     *      pointed by pointer Prec
     */
     //-------------your code here-------------
-    your code here
+    if (first(L) == NULL)
+        {
+            insertFirst(L,P);
+        }
+        else
+        {
+            address Prec;
+            next(P)=next(Prec);
+            next(Prec)=P;
+        }
 
     //----------------------------------------
 
@@ -135,7 +214,10 @@ 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);
+        next(P)=NULL;
+        deallocate(P);
 
 
     //----------------------------------------

list.h

@@ -23,9 +23,9 @@ using namespace std;
 *	prev : address
 * >
 *
-* Type List : < 
-*   first : address 
-*   last : address 
+* Type List : <
+*   first : address
+*   last : address
 * >
 *
 **/
@@ -37,13 +37,14 @@ typedef struct elmlist *address;
 
 struct elmlist{
     //------------- your code here -----------
-
+     infotype info;
+     address next;
     //----------------------------------------
 };
 
 struct List{
     //------------- your code here -----------
-
+    address first;
 
     //----------------------------------------
 };

main.cpp

@@ -51,7 +51,7 @@ void mainMenu() {
         case 1:
             X = create_data();
             P = allocate(X);
-            insertFirst(L,P)
+            insertFirst(L,P);
             break;
         }
     } while(true);

my_data.cpp

@@ -1,10 +1,10 @@
- 
+
 #include "my_data.h"
 
 /**
-    CLASS      :
-    NAME       :
-    STUDENT ID :
+    CLASS      : IF-43-05
+    NAME       : MUHAMMAD KHIYARUS SYIAM
+    STUDENT ID : 1301194242
 **/
 
 mytype create_data() {
@@ -15,7 +15,15 @@ mytype create_data() {
     mytype d;
     // ===========================
     // YOUR CODE HERE
-    your code here
+    cout << "ID anda : ";
+    cin >> d.ID;
+    cout << "Nama anda : ";
+    cin >> d.name;
+    cout << "Rangking anda : ";
+    cin >> d.ranking;
+    cout << "Score anda : ";
+    cin >> d.score;
+
 
 
 
@@ -32,7 +40,10 @@ void view_data(mytype d) {
 
     // ===========================
     // YOUR CODE HERE
-    your code here
+    cout << "ID : " << d.ID << endl;
+    cout << "Nama : " << d.name << endl;
+    cout << "Rank : " << d.ranking << endl;
+    cout << "Score : " << d.score << endl;
 
 
 
@@ -50,7 +61,19 @@ void edit_data(mytype &d) {
 
     // ===========================
     // YOUR CODE HERE
-        your code here
+    cout <<"ID       : "<< d.ID<<endl;
+    cout <<"Nama     : "<< d.name<<endl;
+    cout <<"Rangking : "<< d.ranking<<endl;
+    cout <<"Score    : "<< d.score<<endl;
+    cout << endl;
+    cout << "Masukkan Data Baru  : "<<endl;
+    cout <<"ID anda: " << d.ID<<endl;
+    cout << "Nama Baru : ";
+    cin >> d.name;
+    cout << "Ranking Baru : ";
+    cin >> d.ranking;
+    cout << "Score Baru : ";
+    cin >> d.score;
 
 
 

my_data.h

@@ -5,9 +5,9 @@
 using namespace std;
 
 /**
-    CLASS      :
-    NAME       :
-    STUDENT ID :
+    CLASS      : IF - 43 - 05
+    NAME       : MUHAMMAD KHIYARUS SYIAM
+    STUDENT ID : 1301194242
 **/
 
 struct mytype {
@@ -20,7 +20,10 @@ struct mytype {
     */
     //=================================================
     // YOUR CODE STARTS HERE
-    your code here
+    int ID;
+    string name;
+    int ranking;
+    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