These are all of my Computer Science students’ IA plan Wida: Cyber Net Cafe Allycia: POS Restaurant Peter: Payroll Management System Patrick: Arcade Game Wisaka: Educational Software Winson: eCommerce Amel: Dressed Up Game
Posts Categorized / IB Computer Science
Faktorial Rekursif/Non Rekursif
function faktorialfunc(n:longint):longint; var f,k:longint; begin f:=1; for k:=1 to n do f:=f*k; faktorialfunc:=f; end; procedure faktorialproc(n:longint;var hasil:longint); var f,k:longint; begin f:=1; for k:=1 to n do f:=f*k;
Rekursif vs Non Rekursif
Contoh Program Sederhana Non rekursif Dengan prosedur Procedure KALI_BIASA_P(a,b : integer; var hasil : longint); var i : integer; begin hasil := 0; for i:= 1 to b do hasil := hasil + a; end; Dengan fungsi Function KALI_BIASA_F(a,b:integer):longint; var hasil : longint; i: integer; begin hasil := 0; for i:= 1 to b do
Binary Search Tree
Binary Search Tree adalah Binary Tree yang mempunyai sifat bahwa semua left child harus lebih kecil dari right child dan parentnya. Juga semua right child harus lebih besar dari left child dan parentnya. Binary Search Tree dibuat untuk mengatasi kelemahan Binary Tree biasa, yaitu kesulitan dalam searching atau pencarian node tertentu dalam binary tree Coba
Operasi Binary Tree
Membuat deklarasi struktur data B-Tree di PASCAL Type Tree = ^node; Node = record Isi: Integer; Left, Right: Tree; End; Create: membentuk binary tree yang masih kosong Clear: mengosongkan binary tree yang sudah ada Empty: function untuk memeriksa apakah binary tree masih kosong Insert: memasukkan sebuah node ke dalam tree, dengan tiga pilihan: sebagai root,
Binary Tree
Binary Tree atau B-Tree adalah tree dengan syarat tiap node hanya boleh memiliki maksimal dua subtree dan kedua subtree tersebut harus terpisah. Sesuai dengan definisi tersebut, maka tiap node dalam binary tree hanya boleh memiliki paling banyak dua child. Jenis2 B-Tree: Full Binary Tree yaitu Binary Tree yang tiap nodenya (kecuali leaf) memiliki dua child
Tree
Tree adalah salah satu bentuk struktur data tidak linear yang menggambarkan hubungan yang bersifat hirarkis (one to many) antara elemen2. Tree bisa didefinisikan sebagai kumpulan simpul/node dengan satu elemen khusus yang disebut Root dan node lainnya terbagi menjadi himpunan yang saling tak berhubungan satu sama lain (SubTree) Istilah2 dalam Tree: Predecessor: node yang berada di
Diagram Tree
Ancestor (F) = C, A Descendant (C) = F, G Parent (D) = B Child (A) = B, C Sibling (F) = G Size = 7 Height = 3 Root = A Leaf = D, E, F, G Degree (C) = 2
Student’s Response – Wisaka
2.b. The game starts with the introduction of the main character, which is the young girl Rosetta. The girl only have one grandpa as her family. She doesn’t have anybody else. The beginning of the game, grandpa tells her that she is actually not his grand child. She was adopted when she was a little
Student’s Response – Patrick Handojo
Quest of Rosetta, focuses on a young girl named Rosetta. Which one day, is given a task by his grandfather to destroy the evil wizard named Satana, Akylla and the last boss wizard named Ahimsa. Rosetta received a magic book and a small amount of money (25 credits). During her travel to Camiria, the path
Quest of Rosetta for Computer Science
HL+SL 1. Download file Rosetta.Rar and extract on your windows (working on Windows only for this version) 2. a. Run QBasic.exe and press SHIFT+F5 to play the game until finish. b. Write at least 200 words for the storyline of the game! 3. Identify all of the stakeholders of Quest of Rosetta logic game! 4.
Looping
The output will be 1 2 4 8 16
Computer Science: Looping & Branching
Read the instructions carefully! 1. Construct a program that can have an output like this: (Notes: you have to use at least one looping) 1 2 4 8 16 2. Predict the output of the following Pascal program: (Notes: do not use the computer for this question) uses crt; var i,j,k:integer; begin for i:=1 to
Pre Test Computer Science: Looping & Branching
PRE TEST COMPUTER SCIENCE TOPIC: ALGORITHM & PROGRAMMING SUB TOPIC: LOOPING & BRANCHING Instruction: In this Pre Test, you MAY use a computer to test and debug your program. Please submit your program via e-mail: contact@wahyukurniawan.info 1. Construct a program that can have an output like this: 1 2 3 4 5 2. Construct a
Computer Science Quiz I (Markscheme)
1.a. 1111 b. 10110 c. 1000000 2.a. 15 b. 27 c. 41 3.a. 1111 b. 101100 c. 11010 4.a. 111101 b. 10100 c. 110 5. clear enough 6. Using Boolean Expression, we can simplify the circuit diagram so that we can reduce the usage of the logic gate. We can also change the circuit diagram,
Computer Science Quiz I
1. Convert the following decimal numbers into binary numbers! a. 15 b. 22 c. 64 2. Convert the following octal numbers into decimal numbers! a. 17 b. 33 c. 51 3. Convert the following hexadecimal numbers into binary numbers! a. F b. 2C c. 1A 4. Convert the following octal numbers into binary numbers! a.
TEOREMA ALJABAR BOOLEAN
T1. COMMUTATIVE LAW : a. A + B = B + A b. A . B = B . A T2. ASSOCIATIVE LAW : a. ( A + B ) + C = A + ( B + C ) b. ( A . B) . C = A . ( B . C )
Predict the output
<?php $a=1; $b=3; while ($a<=5) { $b=$b+$a; $a++; } echo $b; ?> <?php $a=5; $b=1; for ($c=1;$c<=4;$c++) { $a=$a+$c; $b=$b+$a; } echo $b; ?> <?php $a=1; $b=2; $c=3; while ($a<=3) { if ($b<5) { $b=$b+$c; } else { $b=$b-$c; $a++; } } echo $b; ?> <?php $a=1; $b=2; $c=3; while($a<=2) { for ($d=1;$d<=2;$d++) { if