PENUGASAN 1 -- Pengenalan Java

Nama: Adelia Hasna Surya Putri

Kelas: Struktur Data F

NRP : 5025201200


Tugas 1 -- Membuat Biodata Diri

Source code:


Output:



Tugas 2 -- Kalkulator Sederhana

Source code:



Output:




Adelia Hasna Surya Putri
17/03/2021


Comments

Post a Comment

Popular posts from this blog

PENUGASAN 7 -- REKURSI

Image
 Implementasi Program Tower Of Hanoi Tower of Hanoi adalah program tentang teka-teki matematika dimana terdapat tiga batang dan N piringan. Program ini bertujuan untuk memindahkan seluruh tumpukan ke batang lain. Terdapat beberapa peraturan dalam Tower of Hanoi: 1. Hanya satu piringan yang dapat dipindahkan pada satu waktu 2. Setiap gerakan terdiri dari step mengambil piringan dan meletakkannya di atas tumpukan lain. Piringan hanya dapat dipindahkan jika berada di tumpukan paling atas. 3. Tidak ada piringan yang diletakkan di atas piringan yang nilainya lebih kecil. Source // JAVA recursive function to // solve tower of hanoi puzzle import java.util.* ; import java.io.* ; import java.math.* ; /** * Write a description of class TowerOfHanoi here. * * @author Adelia Hasna Surya Putri * @version 06/06/2021 */ public class TowerOfHanoi { static void TowerOfHanoi ( int n , char from_rod , char to_rod , char aux_rod ) { if ( n =...
Read more

ETS SEM 2 -- STRUKTUR DATA F

Image
ETS STRUKTUR DATA Anggota kelompok: 1. Sarah Alissa Putri (5025201272) 2. Nabila Zakiyah Khansa’ Machrus (5025201139) 3. Adelia Hasna Surya Putri (5025201200) Perbedaan Struktur Data Primif dan Non Primitif 1. Struktur Data Primitif Struktur data primitif adalah tipe data yang telah terdefinisi(supported) di suatu bahasa pemrograman. Contohnya pada java adalah byte, short, int, long, char, float , double dan boolean. Source /** * Write a description of class PrimitifType here. * * @author Adelia Hasna Surya Putri * @version 05/05/2021 */ public class PrimitifType { public static void main ( String [] args ) { double b = 123.43555 ; char c = 'e' ; boolean d = true ; System . out . println ( "Double: " + b ); System . out . println ( "Character: " + c ); System . out . println ( "Boolean: " + d ); } } Output 2. Struktur Data Non Primitif Non primitive...
Read more

PENUGASAN 8 -- BST

Image
 Implementasi Program BST (Binary Search Tree) A Binary search tree (referred to as BST hereafter) is a type of binary tree. It can also be defined as a node-based binary tree. BST is also referred to as ‘Ordered Binary Tree’. In BST, all the nodes in the left subtree have values that are less than the value of the root node. Similarly, all the nodes of the right subtree of the BST have values that are greater than the value of the root node. This ordering of nodes has to be true for respective subtrees as well. Method in BST 1. Insert  : Add an element to the BST by not violating the BST properties. 2. Delete : Remove a given node from the BST. The node can be the root node, non leaf, o leaf node 3. Search : Search the location of the given element in the BST. This operation checks if the tree contains the specified key. Source class BST_Class { class Node { int key ; Node left , right ; public Node ( int data ){ k...
Read more