Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Hassan Rizky Putra Sailellah_1301190328_IF-43-05 #173

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
28 changes: 28 additions & 0 deletions ASD_Task_3.depend
Original file line number Diff line number Diff line change
Expand Up @@ -52,3 +52,31 @@
"operation.h"
"my_data.h"

1582438463 source:d:\telkom university\informatika\semester 2\struktur data\latihan_1301190328-master\asd_task_3\list.cpp
"list.h"
"my_data.h"

1582435213 d:\telkom university\informatika\semester 2\struktur data\latihan_1301190328-master\asd_task_3\list.h
<iostream>
"my_data.h"

1582433367 d:\telkom university\informatika\semester 2\struktur data\latihan_1301190328-master\asd_task_3\my_data.h
<iostream>

1582435929 source:d:\telkom university\informatika\semester 2\struktur data\latihan_1301190328-master\asd_task_3\main.cpp
<iostream>
"list.h"
"operation.h"
"my_data.h"

1582403452 d:\telkom university\informatika\semester 2\struktur data\latihan_1301190328-master\asd_task_3\operation.h
"list.h"

1582433848 source:d:\telkom university\informatika\semester 2\struktur data\latihan_1301190328-master\asd_task_3\my_data.cpp
"my_data.h"

1582437080 source:d:\telkom university\informatika\semester 2\struktur data\latihan_1301190328-master\asd_task_3\operation.cpp
"list.h"
"operation.h"
"my_data.h"

28 changes: 14 additions & 14 deletions ASD_Task_3.layout
Original file line number Diff line number Diff line change
Expand Up @@ -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="main.cpp" open="1" top="0" tabpos="1" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<Cursor>
<Cursor1 position="496" topLine="7" />
<Cursor1 position="1006" topLine="89" />
</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="operation.h" open="0" top="0" tabpos="0" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<Cursor>
<Cursor1 position="288" topLine="0" />
<Cursor1 position="207" 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="list.h" open="0" top="0" tabpos="6" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<Cursor>
<Cursor1 position="2862" topLine="116" />
<Cursor1 position="688" topLine="17" />
</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.cpp" open="0" top="0" tabpos="3" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<Cursor>
<Cursor1 position="1006" topLine="0" />
<Cursor1 position="774" 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="my_data.h" open="0" top="0" tabpos="5" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<Cursor>
<Cursor1 position="774" topLine="0" />
<Cursor1 position="496" topLine="7" />
</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="list.cpp" open="1" top="0" tabpos="3" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<Cursor>
<Cursor1 position="688" topLine="17" />
<Cursor1 position="2014" topLine="54" />
</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="operation.cpp" open="1" top="1" tabpos="2" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<Cursor>
<Cursor1 position="207" topLine="0" />
<Cursor1 position="1650" topLine="52" />
</Cursor>
</File>
</CodeBlocks_layout_file>
Binary file added bin/Debug/ASD_Task_3.exe
Binary file not shown.
93 changes: 61 additions & 32 deletions list.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -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;


//----------------------------------------
Expand All @@ -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;
}
Expand All @@ -31,9 +36,7 @@ void deallocate(address &P) {
* FS : delete element pointed by P
*/
//-------------your code here-------------
your code here


delete P;
//----------------------------------------
}

Expand All @@ -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 (first(L) != NULL){
next(P) = first(L);
prev(first(L)) = P;
first(L) = P;
}else {
first(L) = P;
last(L) = P;
}
//----------------------------------------
}

Expand All @@ -55,9 +63,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;
//----------------------------------------
}

Expand All @@ -70,9 +78,10 @@ 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;
}
Expand All @@ -83,10 +92,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;
}
//----------------------------------------
}

Expand All @@ -96,10 +111,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 (first(L) == last(L)){
P = first(L);
first(L) = NULL;
last(L) = NULL;
} else if (last(L) != NULL){
P = last(L);
last(L) = prev(P);
prev(P) = NULL;
next(last(L)) = NULL;
}
//----------------------------------------
}

Expand All @@ -109,9 +130,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;
P = first(L);
while (P != NULL){
view_data(info(P));
P = next(P);
}
cout<<endl;
//----------------------------------------
}

Expand All @@ -123,8 +148,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;
//----------------------------------------

}
Expand All @@ -135,9 +162,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;
//----------------------------------------
}

14 changes: 8 additions & 6 deletions list.h
Original file line number Diff line number Diff line change
Expand Up @@ -23,9 +23,9 @@ using namespace std;
* prev : address
* >
*
* Type List : <
* first : address
* last : address
* Type List : <
* first : address
* last : address
* >
*
**/
Expand All @@ -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;
//----------------------------------------
};

Expand Down
58 changes: 54 additions & 4 deletions main.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -20,7 +20,7 @@ int main() {

void mainMenu() {
address P;
infotype X;
infotype H;
/**
* IS : List has been created
* PR : prints menu to user
Expand Down Expand Up @@ -49,10 +49,60 @@ void mainMenu() {
cin>>choice;
switch(choice) {
case 1:
X = create_data();
P = allocate(X);
insertFirst(L,P)
H = create_data();
insertAndSort(L,H);
break;
case 2:
printInfo(L);
break;
case 3:
cout << "Masukkan ID: ";
cin >> H.ID;
P = findElm(L, H);
if (P != NULL)
{
view_data(info(P));
}
else
{
cout << "ID Data yang anda cari tidak ada\n";
}
break;
case 4:
cout << "Masukkan ID: ";
cin >> H.ID;
P = findElm(L, H);
if (P != NULL)
{
edit_data(info(P));
}
else
{
cout << "ID Data yang anda cari tidak ada\n";
}
break;
case 5:
cout << "Masukkan ID: ";
cin >> H.ID;
if (findElm(L, H) != NULL)
{
deletebyID(L, H.ID);
}
else
{
cout << "Not Found" << endl;
}
break;
case 6:
savePassedMember(L, L_passed);
cout<<"Member yang LULUS udah selesai"<<endl;
break;
case 7:
cout<<"Data mahasiswa yang LULUS : "<<endl;
printInfo(L_passed);
break;
default:
exit(0);
}
} while(true);

Expand Down
Loading