Chapter 6PASCAL English ver.A. Mult

Chapter 6
PASCAL English ver.
A. Multiple choice
1. Rekursif adalah …
a) Algoritma untuk memuat ulang suatu fungsi / prosedur
b) Algoritma untuk mengulang suatu fungsi / prosedur
c) Algoritma untuk pemanggilan fungsi / prosedur lain
d) Algoritma untuk pemanggilan dirinya sendiri
e) Semua benar

2. Pemanggilan diri sendiri dalam rekursif disebut dengan …
a) Rekurens
b) Basis
c) Rekursif
d) Sekuensial
e) Sekursio

3. Keadaan yang terdefinisi untuk menghentikan proses rekursif disebut dengan …
a) Rekurens
b) Basis
c) Rekursif
d) Sekuensial
e) Sekursio

Perhatikan program di bawah ini!
Program di bawah ini untuk soal no. 4 – 6!
Program rekursif;
Uses crt;
Var n : integer;
Function nFaktorial1 (n : integer) 2 : integer;
Begin
If (n0) then
nFaktorial3 := n * nFaktorial (n-1) 4;
else
nFaktorial := 1;
end;
Begin
Write(‘berapa faktorial : ’); readln(n);
Writeln(nFaktorial(n) 5);
End.

4. Pada program di atas, yang merupakan basis adalah …
a) Function nFaktorial
b) (n: integer)
c) nFaktorial
d) (n-1)
e) nFaktorial(n)

5. Pada program di atas, yang merupakan rekurens adalah …
a) Function nFaktorial
b) (n: integer)
c) nFaktorial
d) (n-1)
e) nFaktorial(n)

6. Jika pada program di atas diinputkan n:= 5, maka output dari program itu adalah ...
a) 5
b) 60
c) 120
d) 240
e) 360

Perhatikan program di bawah ini!
Program di bawah ini untuk soal no. 7 – 9!
Program rekursif;
Uses crt;
Type mhs = record
nama,nim : string;
end;
Var
m : mhs;
n : integer;
Procedure input(var n: integer) 1;
Begin
If (n > 0) 2 then begin
Write(‘Masukkan nama : ’); readln(m.nama);
Write(‘Masukkan nim : ’); readln(m.nim);
n:= n – 13;
input(n) 4; end; end;
Begin
Write(‘Masukkan banyak mahasiswa : ’); readln(n);
input(n);
End. 5

7. Pada program di atas, yang merupakan basis adalah …
a) Input(var n: integer)
b) (n > 0)
c) n:= n – 1
d) input(n)
e) end.

8. Pada program di atas, yang merupakan rekurens adalah …
a) Input(var n: integer)
b) (n > 0)
c) n:= n – 1
d) input(n)
e) end.

9. Jika diinputkan n:= 5, maka akan terjadi perulangan sebanyak …
a) 1 kali
b) 2 kali
c) 3 kali
d) 4 kali
e) 5 kali

10. Jika ‘n:= n – 1’ diganti dengan ‘n:= n – 3’ dan diinputkan n:= 5, maka aka terjadi perulang sebanyak ...
a) 1 kali
b) 2 kali
c) 3 kali
d) 4 kali
e) 5 kali

B. Essay
1. Jelaskan yang dimaksud dengan rekursif!
Jawaban :
Metode didalam pemrograman yang mana dalam sebuah fungsi terdapat intruksi yang memanggil fungsi itu sendri, atau lebih sering disebut memanggil dirinya sendiri

2. Jelaskan yang dimaksud dengan basis!
Jawaban :
Basis merupakan keadaan untuk menghentikan proses berjalannya rekursif

3. Jelaskan yang dimaksud dengan rekurens!
Jawaban :
Rekurens merupakan keadaan saat suatu fungsi / prosedur memanggil dirinya sendiri.

4. Sebutkan kelebihan dari rekursif!
Jawaban :
• Sangat mudah untuk melakukan perulangan dengan batasan yang luas dalam artian melakukan perulangan dalam skala yang besar.
• Dapat melakukan perulangan dengan batasan fungsi.

5. Sebutkan kekurangan dari rekursif!
Jawaban :
• Pada rekursif, tidak dapat menjalankan algoritma nested loop atau looping bersarang.
• Biasanya, membuat fungsi sulit untuk dipahami.
• Hanya cocok untuk persoalan tertentu saja.
• Trace error sulit.
• Memerlukan stack yang lebih besar, sebab setiap kali fungsi dipanggil, variabel lokal dan parameter formal akan ditempatkan ke stack dan ada kalanya akan menyebabkan stack tak cukup lagi (Stack Overrun).
• Proses agak berbelit-belit karena terdapat pemangilan fungsi yang berulang-ulang dan pemanggilan data yang ditumpuk.

C. Jurnal
1. Buatlah program biodata dengan rekursif!
Program rekursif;
Uses crt;
Type mhs = record
nama,nim : string;
end;
Var
m : mhs;
n : integer;
Procedure input(var n: integer);
Begin
If (n > 0) then begin
Write(‘Masukkan nama : ’); readln(m.nama);
Write(‘Masukkan nim : ’); readln(m.nim);
n:= n – 1;
input(n); end; end;
Begin
Write(‘Masukkan banyak mahasiswa : ’); readln(n);
input(n);
End.


2. Buatlah program untuk mencari nilai faktorial!
Program rekursif;
Uses crt;
Var n : integer;
Function nFaktorial (n : integer) : integer;
Begin
If (n0) then
nFaktorial := n * nFaktorial (n-1);
else
nFaktorial := 1;
end;
Begin
Write(‘berapa faktorial : ’); readln(n);
Writeln(nFaktorial(n));
End.

Results (English) 1:

Chapter 6PASCAL English ver.A. Multiple choice1. Recursive is. ..a) algorithm to reload a function/procedureb) Algorithm to loop a function/procedurec) algorithms for function calls/other proceduresd) algorithm for calling himselfe) all true2. Calling oneself in recursive called ...a) Rekurensb) Basec) Recursived) Sequentiale) Sekursio 3. A State which is defined to stop recursive process called ...a) Rekurens b) Basec) Recursived) Sequentiale) SekursioNote the programs below!The program below to question No. 4 – 6!Recursive programs;Uses crt;Var n: integer;Function nFaktorial1 (n: integer): integer 2;Begin If (n <> 0) then nFaktorial3: = nFaktorial n * (n-1) 4; else nFaktorial: = 1; end;Begin Write (' how the factorial: '); readln (n); Printf (nFaktorial (n) 5);End.4. in the above program, which is the base is ...a) Function nFaktorialb) (n: integer)c) nFaktoriald) (n-1)e) nFaktorial (n)5. in the above program, which is rekurens is ... a) Function nFaktorialb) (n: integer)c) nFaktoriald) (n-1)e) nFaktorial (n)6. If on the above program inputed n: = 5, then the output from the program is ...a) 5b) 60c) 120d) 240e) 360Note the programs below!The program below to question No. 7 – 9!Recursive programs;Uses crt;Mhs type = record name, nim: string; end;Var m: mhs; n: integer;Procedure of input (var n: integer) 1;Begin If (n > 0) 2 then begin Write (' enter your name: '); readln (m. name); Write (' enter the nim: '); readln (URm.nim); n: = n – 13; input (n) 4; end; end;Begin Write (' enter a lot of students: '); readln (n);input (n);End. 5 7. in the above program, which is the base is ...a) Input (var n: integer)b) (n > 0)c) n: = n – 1 d) input (n)e) end.8. in the above program, which is rekurens is ...a) Input (var n: integer)b) (n > 0)c) n: = n – 1 d) input (n)e) end.9. If the inputed n: = 5, then it will happen as much looping ... a) 1 timeb) 2 timesc) 3 timesd) 4 timese) 5 times10. If ' n: = n – 1 ' is replaced with ' n: = n – 3 ' and inputed n: = 5, then it happens as much perulang aka ... a) 1 timeb) 2 timesc) 3 timesd) 4 timese) 5 timesB. Essay1. Explain what is meant by recursive!Answer:The programming method in which there is a function in the function that called it sendri, or more commonly called calling himself2. Explain what is meant by the base!Answer:The base is the State to stop the process recursive passes3. Explain what is meant by rekurens!Answer:Rekurens is the current state of a function/procedure calling itself.4. State the advantages of recursive!Answer:• It is very easy to do the looping with broad restrictions in terms of looping in a large scale.• Able to perform looping limit function.5. the Mentioned lack of recursive!Answer:• On recursive, cannot run the nested-loop algorithm or nested looping.• Typically, functions are difficult to understand. • Only suitable for certain issues.• Trace error difficult.• Requires a larger stack, because every time the function is called, the formal parameters and local variables will be placed onto the stack and at times will cause insufficient stack (Stack Overrun).• The process is somewhat convoluted because there is a pemangilan function that calls the data over and over and stacked.C. Journal1. make a BIOS program with recursive!Recursive programs;Uses crt;Mhs type = record name, nim: string; end;Var m: mhs; n: integer;Procedure of input (var n: integer);Begin If (n > 0) then begin Write (' enter your name: '); readln (m. name); Write (' enter the nim: '); readln (URm.nim); n: = n-1; input (n); end; end;Begin Write (' enter a lot of students: '); readln (n);input (n);End. 2. make a program to find the factorial value!Recursive programs;Uses crt;Var n: integer;Function nFaktorial (n: integer): integer;Begin If (n <> 0) then nFaktorial: = nFaktorial n * (n-1); else nFaktorial: = 1; end;Begin Write (' how the factorial: '); readln (n); Printf (nFaktorial (n));End.

Results (English) 2:

Chapter 6
PASCAL English ver.
A. Multiple choice
1. Recursive is ...
a) algorithm to reload a function / procedure
b) algorithm to repeat a function / procedure
c) The algorithm for a function call / other procedures
d) Algorithms for calling himself
e) All of the above 2. Callings yourself in a recursive referred to ... a) recurrent b) Basis c) Recursive d) Sequential e) Sekursio 3. Defined circumstances to stop the recursive process is called ... a) recurrent b) Basis c) Recursive d) Sequential e) Sekursio Consider the program below! Program below to question no. 4-6! Program recursive; Uses crt; Var n: integer; Function nFaktorial1 (n: integer) 2: integer; Begin If (n <> 0) then nFaktorial3: = n * nFaktorial (n-1) 4; else nFaktorial : = 1; end; Begin Write ( 'how factorial:'); Readln (n); Writeln (nFaktorial (n) 5); End. 4. In the above program, which is the base is ... a) Function nFaktorial b) (n: integer) c) nFaktorial d) (n-1) e) nFaktorial (n) 5. In the above program, which is recurrent is ... a) Function nFaktorial b) (n: integer) c) nFaktorial d) (n-1) e) nFaktorial (n) 6. If the above program is entered n = 5, then the output of that program is ... a) 5 b) 60 c) 120 d) 240 e) 360 Consider the program below! Program below to question no. 7-9! Program recursive; Uses crt; Type MHS = record name, nim: string; end; Var m: MHS; n: integer; Procedure input (var n: integer) 1; Begin If (n> 0) 2 then begin Write ( 'Enter the name:'); Readln (m.nama); Write ( 'Enter nim:'); Readln (m.nim); n: = n - 13; input (n) 4; end; end; Begin Write ( 'Enter many students:'); Readln (n); input (n); End. 5 7. In the above program, which is the base is ... a) Input (var n: integer) b) (n> 0) c) n: = n - 1 d) input (n) e) end. 8. In the above program, which is recurrent is ... a) Input (var n: integer) b) (n> 0) c) n: = n - 1 d) input (n) e) end. 9. If input n = 5, there will be a loop as much as ... a) 1 time b) 2 times c) 3 times d) 4 times e) 5 times 10. If 'n: = n - 1' is replaced with 'n: = n - 3' and entered n = 5, then there will occur perulang much as ... a) 1 time b) 2 times c) 3 times d) 4 times e) 5 times B. Essay 1. Explain what is meant by recursive! Answer: The method in which the programming instructions contained in a function that calls the function it sendri, or more commonly referred calls itself 2. Explain what is meant by base! Answer: Base is a condition for stopping the running recursive 3. Explain what is meant by recurrent! Answer: recurrent is the current state of a function / procedure calls itself. 4. Mention the advantages of recursive! Answer: • It is easy to do looping with extensive limitations in terms of looping in a large scale. • Can looping the function limitation. 5. Mention shortage of recursive! Answer: • At recursive, it can not run the algorithm nested loop or loop nest. • Normally, makes the function difficult to understand. • Only suitable for certain issues only. • Trace error is difficult. • Requires stack larger, because every time a function is called, the local variables and formal parameters will be placed onto the stack, and at times will cause the stack is not enough anymore (stack Overrun). • the process is rather complicated because there are pemangilan function that repeatedly and calling the data are stacked. C , Journal 1. Create program biographical data with a recursive! Program recursive; Uses crt; Type MHS = record name, nim: string; end; Var m: MHS; n: integer; Procedure input (var n: integer); Begin If (n> 0) then begin Write ( 'Enter the name:'); Readln (m.nama); Write ( 'Enter nim:'); Readln (m.nim); n: = n - 1; input (n); end; end; Begin Write ( 'Enter many students:'); Readln (n); input (n); End. 2. Create a program to find the value of factorial! Program recursive; Uses crt; Var n: integer; Function nFaktorial (n: integer): integer; Begin If (n <> 0) then nFaktorial: = n * nFaktorial (n-1); else nFaktorial: = 1; end; Begin Write ( 'how factorial:'); Readln (n); Writeln (nFaktorial (n)); End.