Evan Benedict Zaluchu

(1306447360)
Akhdan Hilmy Taufiqurrahman (1306368500)
Sakti Naibaho
(1306412773)

Nomor 2 Antrian Konser

Begin
Antri:=0;
Readln(N) {Jumlah Antrian)
For I:=1 to N do {untuk input}
Begin
Writeln(masukkan nama ke, ,i);
Readln(d[i]);
Antri:=antri+1; {Memasukkan Antrian}
End;

Readln(b); {Nomor antrian yang ingin dibatalkan}

For I:= 1 to N do
Begin
if (b == i)
Temp:=d[i];
Antri:=antri-1; {Menghapus Antrian yang dibatalkan}
End;

For I:=1 to N do {untuk Output}

Begin

Temp:=d[i];
Antri:=antri-1; {Menghapus Antrian yang selesai dilayani}
End;
Writeln(hasil var temp=,temp); {lihat output di var temp setelah pengambilan }
Readln;
End.

Nomor 3 Membalik Huruf

#include<stdio.h>
#include<stdlib.h>
#include<string.h>

struct node {
struct node *ptr;
char info;
};

struct node *first,*ic;

struct node * insertn(int n,struct node * first)
{

struct node *temp,*cur;

temp=(struct node *)malloc(sizeof(struct node));

temp->info=n;
temp->ptr='\0';
if(first=='\0')
{

return temp;
}
else{
cur=first;
while(cur->ptr!='\0')
cur=cur->ptr;
cur->ptr=temp;
return first;
}
}
void disp( struct node *first)
{
printf(" here = ");
struct node *cur;
cur=first;
while(cur!='\0')
{
printf("%c",cur->info);
cur=cur->ptr;

}
}
void rev(struct node * p)
{

if(p->ptr=='\0')
{

first =p;
return;
}

rev(p->ptr);

struct node *q=p->ptr;

q->ptr=p;
p->ptr='\0';
}

main()
{
char n;
int i=0;

first='\0';
ic='\0';

while(i<7)
{

i++;
printf("Enter element(batas elemen 6 variabel):");
scanf("%c",&n);
first=insertn(n,first);

}
printf("ELEMENTS OF LIST BEFORE REV:");
disp(first);
rev(first);

printf("\n\nELEMENTS OF LIST AFTER REV:");

disp(first);