Bright Night of The Sky

 Laporan Projek Mata Kuliah Computer Graphic Kelas LB01 LAPORAN PROYEK COMPUTER GRAPHICS Disusun Oleh :     Ryani Yuan Jie Lee                           2301952773 Chalifa Sophie Anggit Andamari    2301952672 Khrisna Handoko                             2301944525 Rizky Fachurahman                         2301941901 Faldian Pratama Wijaya                 2301891746     JURUSAN COMPUTER SCIENCE SCHOOL OF COMPUTER SCIENCE 202 2 BAB I PENDAHULUAN 1.1. Latar Belakang Kami membuat dua buah objek yang dapat disat...

LAPORAN PROYEK  DATA VISUALIZATION Disusun Oleh : Billy Yong 2301858313 Chalifa Sophie Anggit Andamari 2301952672 Ryani Yuan Jie Lee 2301952773 Muhammad Adhia Rafif 2301897144 JURUSAN COMPUTER SCIENCE SCHOOL OF COMPUTER SCIENCE  2021

Below this is my code for Assignment Double Linked List with Menu

Summary of Data Structure Even Semester 2020 Introduction to Data Structure Data structure ® a particular way of organizing data in a computer so that it can be used effectively. Purpose: to reduce the space and time complexities of different tasks. Types of Data Structure: ·          Array ·          Linked Lists ·          Stack ·          Queue ·          Binary Tree ·          Binary Search Tree ·          Heap ·          Hashing Data Structure ·          Matrix ·          Trie

Binary Search Tree  is a node-based binary tree data structure which has the following properties: The left subtree of a node contains only nodes with keys lesser than the node’s key. The right subtree of a node contains only nodes with keys greater than the node’s key. The left and right subtree each must also be a binary search tree The above properties of Binary Search Tree provide an ordering among keys so that the operations like search, minimum and maximum can be done fast. If there is no ordering, then we may have to compare every key to search a given key.

Hashing Suppose we want to design a system for storing employee records keyed using phone numbers. And we want following queries to be performed efficiently:          Insert a phone number and corresponding information.         Search a phone number and fetch the information.        Delete a phone number and related information. We can think of using the following data structures to maintain information about different phone numbers.        Array of phone numbers and records.        Linked List of phone numbers and records.        Balanced binary search tree with phone numbers as keys.         Direct Access Table. Hashing is an improvement over Direct Access Table. The idea is to use hash function that converts a given phone number or any other key to a smaller number and uses the small number as index in a ...

Note: The following article is in English Stack Stack is a linear data structure which follows a particular order in which the operations are performed. The order may be LIFO (Last In First Out) or FILO(First In Last Out). Mainly the following three basic operations are performed in the stack: ·          Push: Adds an item in the stack. If the stack is full, then it is said to be an Overflow condition. ·          Pop: Removes an item from the stack. The items are popped in the reversed order in which they are pushed. If the stack is empty, then it is said to be an Underflow condition. ·          Peek or Top: Returns top element of stack. ·          isEmpty: Returns true if stack is empty, else false.