Berikan pendapatmu tentang dosen berkualitas di Universitas YARSI melalui https://layar.yarsi.ac.id/course/view.php?id=12871
After taking this course, you will understand how to formulate steps to solve a problem (ie, algorithm) and implement it in a particular programming language. The Java TM programming language will be used in this course, but with a procedural programming paradigm, instead of object-oriented. The programming concepts that will be discussed are recursive techniques, various sorting algorithms and their complexities, and various data structures.
Disclaimer: Unless otherwise stated, the materials, presentation sequence, animations, and questions in this lecture are the work of Andreas Febrian and are intentionally distributed under the Creative Common BY-NC-SA 4.0 International license ( https://creativecommons.org/licenses/by-nc-sa/4.0/ ).
Get the latest information regarding college in this forum! Make sure you keep subscribing to this forum to get notifications when there is new news.
Use this forum to discuss issues and challenges you encounter when interacting with learning resources and activities. God willing, instructors, assistants, or other fighters will answer your questions. Make sure there is no sensitive information in your writing because it will be read by all students. Don't forget to use Indonesian and online communication ethics.
Collect evidence of extracurricular activities that you participate in here, by creating a new discussion topic called "[Your Name]'s Activities" (eg, "Fulan's Activities"). Collect all evidence of your activities in the topic to make monitoring easier. In order to be recognized, your activities must have occurred in the 2020/2021 Even Semester, which starts on February 1, 2021. The collection of evidence of activities will be closed on May 30, 2021 at 23:59 WIB (ie, one day before the final exam week).
Do you feel like you have an idea or comment that could improve the quality of this lecture? Just submit it here! All criticism and suggestions will be recorded anonymously, so it will not affect your grade.
This time, you will be invited to get acquainted with the Array and ArrayList data structures.
This time, you will be invited to get acquainted with the LinkedList data structure.
Contains the collections framework, some internationalization support classes, a service loader, properties, random number generation, string parsing and scanning classes, base64 encoding and decoding, a bit array, and several miscellaneous utility classes. This package also contains legacy collection classes and legacy date and time classes.
Resizable-array implementation of the List interface. Implements all optional list operations, and permits all elements, including null. In addition to implementing the List interface, this class provides methods to manipulate the size of the array that is used internally to store the list.
Doubly-linked list implementation of the List and Deque interfaces. Implements all optional list operations, and permits all elements (including null). All of the operations perform as could be expected for a doubly-linked list. Operations that index into the list will traverse the list from the beginning or the end, whichever is closer to the specified index.
Please write down any questions or things you would like to know more about regarding this week's and previous week's topics. Your questions will be reviewed during the synchronous meeting.
Please write down any questions or things you would like to know more about regarding this week's and previous week's topics. Your questions will be reviewed during the synchronous meeting.
This page contains detailed tutorials on different data structures (DS) with topic-wise problems
An array is a collection of items stored at contiguous memory locations. The idea is to store multiple items of the same type together. This makes it easier to calculate the position of each element by simply adding an offset to a base value, i.e., the memory location of the first element of the array (generally denoted by the name of the array).
A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. The elements in a linked list are linked using pointers.