{"id":209,"date":"2005-02-06T02:44:19","date_gmt":"2005-02-05T18:44:19","guid":{"rendered":"https:\/\/www.azfar.my\/2005\/02\/node\/209"},"modified":"2005-02-06T02:46:47","modified_gmt":"2005-02-05T18:46:47","slug":"data-struct-program","status":"publish","type":"post","link":"https:\/\/azfar.my\/home\/2005\/02\/data-struct-program.php","title":{"rendered":"data struct program"},"content":{"rendered":"

this is an old stuff. anywhoo, i got this question for my final project:<\/p>\n

Menggunakan konsep baris gilir, bina program untuk operasi insert, delete, search nod dalam baris gilir tersebut. Gunakan kaedah pointer.<\/p><\/blockquote>\n

This program was written using a C language. So, with the help of my friend, here is the answer…<\/p>\n

<\/p>\n

\n#include
\n#include
\n#include<\/p>\n

struct node {
\n\tint item;
\n\tstruct node *next;
\n};<\/p>\n

typedef struct node Listnode;
\ntypedef Listnode *ListNodePtr;<\/p>\n

int isEmpty(ListNodePtr sptr)
\n{
\n\treturn sptr==NULL;
\n}<\/p>\n

void insert(ListNodePtr *x, int value) {
\n\tListNodePtr newptr;
\n\tnewptr=malloc(sizeof(Listnode));
\n\tnewptr->item=value;
\n\tnewptr->next=*x;
\n\t*x=newptr;
\n}<\/p>\n

void printlist(ListNodePtr currptr)
\n{
\n\tif(currptr==NULL)
\n\t\tprintf(“List is emptyn”);
\n\telse {
\n\t\tprintf(“The list is: “);<\/p>\n

\t\twhile(currptr!=NULL) {
\n\t\t\tprintf(“%d –> “, currptr->item);
\n\t\t\tcurrptr=currptr->next;
\n\t\t}
\n\t\tprintf(“NULLn”);
\n\t}
\n}<\/p>\n

int del(ListNodePtr *x, int value) {
\n\tListNodePtr prevptr, currptr, tempptr;
\n\tif(value==(*x)->item) {
\n\t\ttempptr=*x;
\n\t\t*x=(*x)->next;
\n\t\tfree(tempptr);
\n\t\treturn value;
\n\t}
\n\telse {
\n\t\tprevptr=*x;
\n\t\tcurrptr=(*x)->next;<\/p>\n

\t\twhile(currptr!=NULL && currptr->item !=value) {
\n\t\t\tprevptr=currptr;
\n\t\t\tcurrptr=currptr=currptr->next;
\n\t\t}
\n\t\tif(currptr!=NULL) {
\n\t\t\ttempptr=currptr;
\n\t\t\tprevptr->next=currptr->next;
\n\t\t\tfree(tempptr);
\n\t\t\treturn value;
\n\t\t}
\n\t}
\n\treturn 0;
\n}<\/p>\n

int find(ListNodePtr *x, int value) {
\n\tint m=0;
\n\tListNodePtr prevptr, currptr, tempptr;<\/p>\n

\tif(value==(*x)->item) {
\n\t\ttempptr=*x;
\n\t\t*x=(*x)->next;
\n\t\treturn value;
\n\t}
\n\telse {
\n\t\tprevptr=*x;
\n\t\tcurrptr=(*x)->next;<\/p>\n

\t\twhile(currptr!=NULL && currptr->item !=value) {
\n\t\t\tprevptr=currptr;
\n\t\t\tcurrptr=currptr=currptr->next;
\n\t\t\tm++;
\n\t\t}
\n\t\tif(currptr!=NULL) {
\n\t\t\treturn value;
\n\t\t}
\n\t}
\n\treturn 0;
\n}<\/p>\n

int main() {
\n\tint choice, I, index;
\n\tListNodePtr head=NULL;<\/p>\n

\tdo {
\n\tprintf(“nMenun—-n1. Insert datan2. Delete datan3. Search datan4. Exitn”);
\n\tdo {
\n\t\tprintf(“Input: “);
\n\t\tscanf(“%d”, &choice);
\n\t}
\n while(choice<1||choice>4);<\/p>\n

\tswitch(choice) {
\n\tcase 1:
\n\t\tprintf(“Enter item: “);
\n\t\tscanf(“%d”, &I);
\n\t\tinsert(&head, I);
\n\t\tprintlist(head);
\n\t\tbreak;<\/p>\n

\tcase 2:
\n\t\tif(!isEmpty(head)) {
\n\t\t\tprintf(“Enter item number to be deleted: “);
\n\t\t\tscanf(“%d”, &I);<\/p>\n

\t\t\tif(del(&head, I)) {
\n\t\t\t\tprintf(“%d deletedn”, I);
\n\t\t\t\tprintlist(head);
\n\t\t\t}
\n\t\t\telse
\n\t\t\t\tprintf(“%d not foundn”, I);
\n\t\t}
\n\t\telse
\n\t\t\tprintf(“List is emptyn”);
\n\t\tbreak;<\/p>\n

\tcase 3:
\n\t\tif(!isEmpty(head)) {
\n\t\t\tprintf(“Enter item number as index: “);
\n\t\t\tscanf(“%d”, &I);
\n\t\t\tindex=find(&head, I);
\n\t\t\tif(index!=0)
\n\t\t\tprintf(“%d is in listn”, I);
\n\t\t\telse
\n\t\t\t\tprintf(“No record foundn”);
\n\t\t}
\n\t\telse
\n\t\t\tprintf(“List is emptyn”);
\n\t\tbreak;<\/p>\n

\tcase 4:
\n\t\tprintf(“n*** Thank you ***n”);
\n\t\tgetch();
\n\t\tbreak;<\/p>\n

\tdefault:
\n\t\tprintf(“n— Error —n”);
\n\t}
\n\t}
\n while(choice!=4);
\n}\n<\/p><\/div>\n

or…download the program here<\/a>. for those who has a question or assignment just like this, feel happy to use this. \":mrgreen:\"<\/p>\n","protected":false},"excerpt":{"rendered":"

this is an old stuff. anywhoo, i got this question for my final project: Menggunakan konsep baris gilir, bina program untuk operasi insert, delete, search nod dalam baris gilir tersebut. Gunakan kaedah pointer. This program was written using a C language. So, with the help of my friend, here is the answer…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3],"tags":[],"class_list":["post-209","post","type-post","status-publish","format-standard","hentry","category-programming"],"_links":{"self":[{"href":"https:\/\/azfar.my\/home\/wp-json\/wp\/v2\/posts\/209","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/azfar.my\/home\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/azfar.my\/home\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/azfar.my\/home\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/azfar.my\/home\/wp-json\/wp\/v2\/comments?post=209"}],"version-history":[{"count":0,"href":"https:\/\/azfar.my\/home\/wp-json\/wp\/v2\/posts\/209\/revisions"}],"wp:attachment":[{"href":"https:\/\/azfar.my\/home\/wp-json\/wp\/v2\/media?parent=209"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/azfar.my\/home\/wp-json\/wp\/v2\/categories?post=209"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/azfar.my\/home\/wp-json\/wp\/v2\/tags?post=209"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}