Update Additional Learning Indonesian translation
This commit is contained in:
hexatester
parent
8904c067ef
commit
a98cd9081e
@ -92,12 +92,8 @@ Jika Anda ingin menjadi teknisi ketahanan sistem atau teknisi sistem, lebih bany
|
|||||||
---------------- Semua dibawah ini bersifat opsional ----------------
|
---------------- Semua dibawah ini bersifat opsional ----------------
|
||||||
|
|
||||||
- [Buku Tambahan](#buku-tambahan)
|
- [Buku Tambahan](#buku-tambahan)
|
||||||
- [Materi Tambahan](#materi-tambahan)
|
- [Pembelajaran Tambahan](#pembelajaran-tambahan)
|
||||||
- [Pemrograman Dinamis](#pemrograman-dinamis)
|
|
||||||
- [Kompilator](#kompilator)
|
- [Kompilator](#kompilator)
|
||||||
- [Angka Titik Mengambang](#angka-titik-mengambang)
|
|
||||||
- [Unicode](#unicode)
|
|
||||||
- [Endianness](#endianness)
|
|
||||||
- [Emacs and vi(m)](#emacs-and-vim)
|
- [Emacs and vi(m)](#emacs-and-vim)
|
||||||
- [Unix command line tools](#unix-command-line-tools)
|
- [Unix command line tools](#unix-command-line-tools)
|
||||||
- [Teori Informasi](#teori-informasi-video)
|
- [Teori Informasi](#teori-informasi-video)
|
||||||
@ -107,11 +103,11 @@ Jika Anda ingin menjadi teknisi ketahanan sistem atau teknisi sistem, lebih bany
|
|||||||
- [Kompresi](#kompresi)
|
- [Kompresi](#kompresi)
|
||||||
- [Jaringan](#jaringan) (bersiaplah mendapatkan pertanyaan jaringan apabila anda ingin menjadi system engineer)
|
- [Jaringan](#jaringan) (bersiaplah mendapatkan pertanyaan jaringan apabila anda ingin menjadi system engineer)
|
||||||
- [Keamanan komputer](#keamanan-komputer)
|
- [Keamanan komputer](#keamanan-komputer)
|
||||||
- [Garbage collection](#garbage-collection)
|
- [Pengumpulan sampah (Garbage collection)](#pengumpulan-sampah)
|
||||||
- [Pemrograman Paralel](#pemrograman-paralel)
|
- [Pemrograman Paralel](#pemrograman-paralel)
|
||||||
- [Pengiriman Pesan, Serialisasi, dan Sistem Queueing](#pengiriman-pesan-serialisasi-dan-sistem-queueing)
|
- [Pengiriman Pesan, Serialisasi, dan Sistem Queueing](#pengiriman-pesan-serialisasi-dan-sistem-queueing)
|
||||||
- [A*](#a)
|
- [A*](#a)
|
||||||
- [Fast Fourier Transform](#fast-fourier-transform)
|
- [Transformasi Fourier Cepat](#transformasi-fourier-cepat)
|
||||||
- [Bloom Filter](#bloom-filter)
|
- [Bloom Filter](#bloom-filter)
|
||||||
- [HyperLogLog](#hyperloglog)
|
- [HyperLogLog](#hyperloglog)
|
||||||
- [Locality-Sensitive Hashing](#locality-sensitive-hashing)
|
- [Locality-Sensitive Hashing](#locality-sensitive-hashing)
|
||||||
@ -129,15 +125,14 @@ Jika Anda ingin menjadi teknisi ketahanan sistem atau teknisi sistem, lebih bany
|
|||||||
- B-Trees
|
- B-Trees
|
||||||
- [k-D Trees](#k-d-trees)
|
- [k-D Trees](#k-d-trees)
|
||||||
- [Skip lists](#skip-lists)
|
- [Skip lists](#skip-lists)
|
||||||
- [Network Flows](#network-flows)
|
- [Aliran Jaringan](#aliran-jaringan)
|
||||||
- [Disjoint Sets & Union Find](#disjoint-sets--union-find)
|
- [Disjoint Sets & Union Find](#disjoint-sets--union-find)
|
||||||
- [Matematika untuk Pemrosesan Cepat](#matematika-untuk-pemrosesan-cepat)
|
- [Matematika untuk Pemrosesan Cepat](#matematika-untuk-pemrosesan-cepat)
|
||||||
- [Treap](#treap)
|
- [Treap](#treap)
|
||||||
- [Pemrograman Linear](#pemrograman-linear)
|
- [Pemrograman Linear](#pemrograman-linear-video)
|
||||||
- [Geometri, Convex hull](#geometri-convex-hull)
|
- [Geometri, Convex hull](#geometri-convex-hull-video)
|
||||||
- [Matematika Diskrit](#matematika-diskrit)
|
- [Matematika Diskrit](#matematika-diskrit)
|
||||||
- [Pembelajaran Mesin](#pembelajaran-mesin)
|
- [Pembelajaran Mesin](#pembelajaran-mesin-machine-learning)
|
||||||
- [Go](#go)
|
|
||||||
- [Detail Tambahan tentang Beberapa Subjek](#detail-tambahan-tentang-beberapa-subjek)
|
- [Detail Tambahan tentang Beberapa Subjek](#detail-tambahan-tentang-beberapa-subjek)
|
||||||
- [Seri Video](#seri-video)
|
- [Seri Video](#seri-video)
|
||||||
- [Kursus Ilmu Komputer](#kursus-ilmu-komputer)
|
- [Kursus Ilmu Komputer](#kursus-ilmu-komputer)
|
||||||
@ -1437,409 +1432,327 @@ You're never really done.
|
|||||||
- [Site Reliability Engineering: How Google Runs Production Systems](https://landing.google.com/sre/)
|
- [Site Reliability Engineering: How Google Runs Production Systems](https://landing.google.com/sre/)
|
||||||
- [ ] [UNIX and Linux System Administration Handbook, 4th Edition](https://www.amazon.com/UNIX-Linux-System-Administration-Handbook/dp/0131480057/)
|
- [ ] [UNIX and Linux System Administration Handbook, 4th Edition](https://www.amazon.com/UNIX-Linux-System-Administration-Handbook/dp/0131480057/)
|
||||||
|
|
||||||
## Materi Tambahan
|
## Pembelajaran Tambahan
|
||||||
|
|
||||||
- ### Pemrograman Dinamis
|
Saya menambahkannya untuk membantu Anda menjadi insinyur perangkat lunak yang berpengetahuan luas,
|
||||||
- Subjek ini bisa jadi sangat sulit, karena setiap masalah yang dapat diselesaikan dalam Pemrograman Dinamis harus didefinisikan sebagai relasi rekursi, dan menyelesaikannya bisa rumit.
|
dan untuk mengetahui teknologi dan algoritme tertentu, sehingga Anda akan memiliki kotak peralatan yang lebih besar.
|
||||||
- Saya sarankan untuk melihat banyak contoh masalah Pemrograman Dinamis sampai Anda memiliki pemahaman yang kuat tentang pola yang terlibat.
|
|
||||||
- [ ] Videos:
|
|
||||||
- the Skiena videos can be hard to follow since he sometimes uses the whiteboard, which is too small to see
|
|
||||||
- [ ] [Skiena: CSE373 2012 - Lecture 19 - Introduction to Dynamic Programming (video)](https://youtu.be/Qc2ieXRgR0k?list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&t=1718)
|
|
||||||
- [ ] [Skiena: CSE373 2012 - Lecture 20 - Edit Distance (video)](https://youtu.be/IsmMhMdyeGY?list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&t=2749)
|
|
||||||
- [ ] [Skiena: CSE373 2012 - Lecture 21 - Dynamic Programming Examples (video)](https://youtu.be/o0V9eYF4UI8?list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&t=406)
|
|
||||||
- [ ] [Skiena: CSE373 2012 - Lecture 22 - Applications of Dynamic Programming (video)](https://www.youtube.com/watch?v=dRbMC1Ltl3A&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&index=22)
|
|
||||||
- [ ] [Simonson: Dynamic Programming 0 (starts at 59:18) (video)](https://youtu.be/J5aJEcOr6Eo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3558)
|
|
||||||
- [ ] [Simonson: Dynamic Programming I - Lecture 11 (video)](https://www.youtube.com/watch?v=0EzHjQ_SOeU&index=11&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm)
|
|
||||||
- [ ] [Simonson: Dynamic programming II - Lecture 12 (video)](https://www.youtube.com/watch?v=v1qiRwuJU7g&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=12)
|
|
||||||
- [ ] List of individual DP problems (each is short):
|
|
||||||
[Dynamic Programming (video)](https://www.youtube.com/playlist?list=PLrmLmBdmIlpsHaNTPP_jHHDx_os9ItYXr)
|
|
||||||
- [ ] Yale Lecture notes:
|
|
||||||
- [ ] [Dynamic Programming](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#dynamicProgramming)
|
|
||||||
- [ ] Coursera:
|
|
||||||
- [ ] [The RNA secondary structure problem (video)](https://www.coursera.org/learn/algorithmic-thinking-2/lecture/80RrW/the-rna-secondary-structure-problem)
|
|
||||||
- [ ] [A dynamic programming algorithm (video)](https://www.coursera.org/learn/algorithmic-thinking-2/lecture/PSonq/a-dynamic-programming-algorithm)
|
|
||||||
- [ ] [Illustrating the DP algorithm (video)](https://www.coursera.org/learn/algorithmic-thinking-2/lecture/oUEK2/illustrating-the-dp-algorithm)
|
|
||||||
- [ ] [Running time of the DP algorithm (video)](https://www.coursera.org/learn/algorithmic-thinking-2/lecture/nfK2r/running-time-of-the-dp-algorithm)
|
|
||||||
- [ ] [DP vs. recursive implementation (video)](https://www.coursera.org/learn/algorithmic-thinking-2/lecture/M999a/dp-vs-recursive-implementation)
|
|
||||||
- [ ] [Global pairwise sequence alignment (video)](https://www.coursera.org/learn/algorithmic-thinking-2/lecture/UZ7o6/global-pairwise-sequence-alignment)
|
|
||||||
- [ ] [Local pairwise sequence alignment (video)](https://www.coursera.org/learn/algorithmic-thinking-2/lecture/WnNau/local-pairwise-sequence-alignment)
|
|
||||||
|
|
||||||
- ### Compilers
|
- ### Kompilator
|
||||||
- [ ] [How a Compiler Works in ~1 minute (video)](https://www.youtube.com/watch?v=IhC7sdYe-Jg)
|
- [How a Compiler Works in ~1 minute (video)](https://www.youtube.com/watch?v=IhC7sdYe-Jg)
|
||||||
- [ ] [Harvard CS50 - Compilers (video)](https://www.youtube.com/watch?v=CSZLNYF4Klo)
|
- [Harvard CS50 - Compilers (video)](https://www.youtube.com/watch?v=CSZLNYF4Klo)
|
||||||
- [ ] [C++ (video)](https://www.youtube.com/watch?v=twodd1KFfGk)
|
- [C++ (video)](https://www.youtube.com/watch?v=twodd1KFfGk)
|
||||||
- [ ] [Understanding Compiler Optimization (C++) (video)](https://www.youtube.com/watch?v=FnGCDLhaxKU)
|
- [Understanding Compiler Optimization (C++) (video)](https://www.youtube.com/watch?v=FnGCDLhaxKU)
|
||||||
|
|
||||||
- ### Angka Titik Mengambang
|
|
||||||
- [ ] simple 8-bit: [Representation of Floating Point Numbers - 1 (video - there is an error in calculations - see video description)](https://www.youtube.com/watch?v=ji3SfClm8TU)
|
|
||||||
- [ ] 32 bit: [IEEE754 32-bit floating point binary (video)](https://www.youtube.com/watch?v=50ZYcZebIec)
|
|
||||||
|
|
||||||
- ### Unicode
|
|
||||||
- [ ] [The Absolute Minimum Every Software Developer Absolutely, Positively Must Know About Unicode and Character Sets]( http://www.joelonsoftware.com/articles/Unicode.html)
|
|
||||||
- [ ] [What Every Programmer Absolutely, Positively Needs To Know About Encodings And Character Sets To Work With Text](http://kunststube.net/encoding/)
|
|
||||||
|
|
||||||
- ### Endianness
|
|
||||||
- [ ] [Big And Little Endian](https://www.cs.umd.edu/class/sum2003/cmsc311/Notes/Data/endian.html)
|
|
||||||
- [ ] [Big Endian Vs Little Endian (video)](https://www.youtube.com/watch?v=JrNF0KRAlyo)
|
|
||||||
- [ ] [Big And Little Endian Inside/Out (video)](https://www.youtube.com/watch?v=oBSuXP-1Tc0)
|
|
||||||
- Very technical talk for kernel devs. Don't worry if most is over your head.
|
|
||||||
- The first half is enough.
|
|
||||||
|
|
||||||
- ### Emacs and vi(m)
|
- ### Emacs and vi(m)
|
||||||
- suggested by Yegge, from an old Amazon recruiting post: Familiarize yourself with a unix-based code editor
|
- Biasakan diri Anda dengan editor kode berbasis unix
|
||||||
- vi(m):
|
- vi(m):
|
||||||
- [Editing With vim 01 - Installation, Setup, and The Modes (video)](https://www.youtube.com/watch?v=5givLEMcINQ&index=1&list=PL13bz4SHGmRxlZVmWQ9DvXo1fEg4UdGkr)
|
- [Mengedit Dengan vim 01 - Instalasi, Setup, dan The Modes (video)](https://www.youtube.com/watch?v=5givLEMcINQ&index=1&list=PL13bz4SHGmRxlZVmWQ9DvXo1fEg4UdGkr)
|
||||||
- [VIM Adventures](http://vim-adventures.com/)
|
- [Petualangan VIM](http://vim-adventures.com/)
|
||||||
- set of 4 videos:
|
- set of 4 videos:
|
||||||
- [The vi/vim editor - Lesson 1](https://www.youtube.com/watch?v=SI8TeVMX8pk)
|
- [Editor vi / vim - Pelajaran 1](https://www.youtube.com/watch?v=SI8TeVMX8pk)
|
||||||
- [The vi/vim editor - Lesson 2](https://www.youtube.com/watch?v=F3OO7ZIOaJE)
|
- [Editor vi / vim - Pelajaran 2](https://www.youtube.com/watch?v=F3OO7ZIOaJE)
|
||||||
- [The vi/vim editor - Lesson 3](https://www.youtube.com/watch?v=ZYEccA_nMaI)
|
- [Editor vi / vim - Pelajaran 3](https://www.youtube.com/watch?v=ZYEccA_nMaI)
|
||||||
- [The vi/vim editor - Lesson 4](https://www.youtube.com/watch?v=1lYD5gwgZIA)
|
- [Editor vi / vim - Pelajaran 4](https://www.youtube.com/watch?v=1lYD5gwgZIA)
|
||||||
- [Using Vi Instead of Emacs](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Using_Vi_instead_of_Emacs)
|
- [Menggunakan Vi, bukan Emacs](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Using_Vi_instead_of_Emacs)
|
||||||
- emacs:
|
- emacs:
|
||||||
- [Basics Emacs Tutorial (video)](https://www.youtube.com/watch?v=hbmV1bnQ-i0)
|
- [Tutorial Dasar Emacs (video)](https://www.youtube.com/watch?v=hbmV1bnQ-i0)
|
||||||
- set of 3 (videos):
|
- set of 3 (videos):
|
||||||
- [Emacs Tutorial (Beginners) -Part 1- File commands, cut/copy/paste, cursor commands](https://www.youtube.com/watch?v=ujODL7MD04Q)
|
- [Tutorial Emacs (Pemula) -Bagian 1- Perintah file, potong / salin / tempel, perintah kursor](https://www.youtube.com/watch?v=ujODL7MD04Q)
|
||||||
- [Emacs Tutorial (Beginners) -Part 2- Buffer management, search, M-x grep and rgrep modes](https://www.youtube.com/watch?v=XWpsRupJ4II)
|
- [Tutorial Emacs (Pemula) -Bagian 2- Manajemen buffer, pencarian, mode M-x grep dan rgrep](https://www.youtube.com/watch?v=XWpsRupJ4II)
|
||||||
- [Emacs Tutorial (Beginners) -Part 3- Expressions, Statements, ~/.emacs file and packages](https://www.youtube.com/watch?v=paSgzPso-yc)
|
- [Tutorial Emacs (Pemula) -Bagian 3- Ekspresi, Pernyataan, ~ / .emacs file dan paket](https://www.youtube.com/watch?v=paSgzPso-yc)
|
||||||
- [Evil Mode: Or, How I Learned to Stop Worrying and Love Emacs (video)](https://www.youtube.com/watch?v=JWD1Fpdd4Pc)
|
- [Mode Jahat: Atau, Bagaimana Saya Belajar untuk Berhenti Khawatir dan Cinta Emacs (video)](https://www.youtube.com/watch?v=JWD1Fpdd4Pc)
|
||||||
- [Writing C Programs With Emacs](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Writing_C_programs_with_Emacs)
|
- [Menulis Program C Dengan Emacs](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Writing_C_programs_with_Emacs)
|
||||||
- [(maybe) Org Mode In Depth: Managing Structure (video)](https://www.youtube.com/watch?v=nsGYet02bEk)
|
- [(mungkin) Mode Organisasi Secara Mendalam: Mengelola Struktur (video)](https://www.youtube.com/watch?v=nsGYet02bEk)
|
||||||
|
|
||||||
- ### Unix command line tools
|
- ### Unix command line tools
|
||||||
- suggested by Yegge, from an old Amazon recruiting post. I filled in the list below from good tools.
|
- Saya mengisi daftar di bawah ini dari alat yang bagus.
|
||||||
- [ ] bash
|
- bash
|
||||||
- [ ] cat
|
- cat
|
||||||
- [ ] grep
|
- grep
|
||||||
- [ ] sed
|
- sed
|
||||||
- [ ] awk
|
- awk
|
||||||
- [ ] curl or wget
|
- curl or wget
|
||||||
- [ ] sort
|
- sort
|
||||||
- [ ] tr
|
- tr
|
||||||
- [ ] uniq
|
- uniq
|
||||||
- [ ] [strace](https://en.wikipedia.org/wiki/Strace)
|
- [strace](https://en.wikipedia.org/wiki/Strace)
|
||||||
- [ ] [tcpdump](https://danielmiessler.com/study/tcpdump/)
|
- [tcpdump](https://danielmiessler.com/study/tcpdump/)
|
||||||
|
|
||||||
- ### Teori informasi (video)
|
- ### Teori Informasi (video)
|
||||||
- [ ] [Khan Academy](https://www.khanacademy.org/computing/computer-science/informationtheory)
|
- [Khan Academy](https://www.khanacademy.org/computing/computer-science/informationtheory)
|
||||||
- [ ] more about Markov processes:
|
- Lebih lanjut tentang proses Markov:
|
||||||
- [ ] [Core Markov Text Generation](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/waxgx/core-markov-text-generation)
|
- [Pembuatan Teks Markov Inti](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/waxgx/core-markov-text-generation)
|
||||||
- [ ] [Core Implementing Markov Text Generation](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/gZhiC/core-implementing-markov-text-generation)
|
- [Inti Penerapan Pembuatan Teks Markov](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/gZhiC/core-implementing-markov-text-generation)
|
||||||
- [ ] [Project = Markov Text Generation Walk Through](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/EUjrq/project-markov-text-generation-walk-through)
|
- [Proyek = Panduan Pembuatan Teks Markov](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/EUjrq/project-markov-text-generation-walk-through)
|
||||||
- See more in MIT 6.050J Information and Entropy series below.
|
- Lihat lebih lanjut dalam seri Informasi dan Entropi MIT 6.050J di bawah ini
|
||||||
|
|
||||||
- ### Pariti & Kode Hamming
|
- ### Pariti & Kode Hamming
|
||||||
- [ ] [Intro](https://www.youtube.com/watch?v=q-3BctoUpHE)
|
- [Intro](https://www.youtube.com/watch?v=q-3BctoUpHE)
|
||||||
- [ ] [Parity](https://www.youtube.com/watch?v=DdMcAUlxh1M)
|
- [Keseimbangan (Parity)](https://www.youtube.com/watch?v=DdMcAUlxh1M)
|
||||||
- [ ] Hamming Code:
|
- Hamming Code:
|
||||||
- [Error detection](https://www.youtube.com/watch?v=1A_NcXxdoCc)
|
- [Deteksi kesalahan](https://www.youtube.com/watch?v=1A_NcXxdoCc)
|
||||||
- [Error correction](https://www.youtube.com/watch?v=JAMLuxdHH8o)
|
- [Koreksi kesalahan](https://www.youtube.com/watch?v=JAMLuxdHH8o)
|
||||||
- [ ] [Error Checking](https://www.youtube.com/watch?v=wbH2VxzmoZk)
|
- [Error Checking](https://www.youtube.com/watch?v=wbH2VxzmoZk)
|
||||||
|
|
||||||
- ### Entropi
|
- ### Entropy
|
||||||
- lihat juga video di bawah ini
|
- Lihat juga video di bawah ini
|
||||||
- pastikan untuk menonton video teori informasi terlebih dahulu
|
- Pastikan untuk menonton video teori informasi terlebih dahulu
|
||||||
- [ ] [Information Theory, Claude Shannon, Entropy, Redundancy, Data Compression & Bits (video)](https://youtu.be/JnJq3Py0dyM?t=176)
|
- [Teori Informasi, Claude Shannon, Entropi, Redundansi, Kompresi Data & Bit (video)](https://youtu.be/JnJq3Py0dyM?t=176)
|
||||||
|
|
||||||
- ### Kriptografi
|
- ### Kriptografi
|
||||||
- lihat juga video di bawah ini
|
- Lihat juga video di bawah ini
|
||||||
- pastikan untuk menonton video teori informasi terlebih dahulu
|
- Pastikan untuk menonton video teori informasi terlebih dahulu
|
||||||
- [ ] [Khan Academy Series](https://www.khanacademy.org/computing/computer-science/cryptography)
|
- [Khan Academy Series](https://www.khanacademy.org/computing/computer-science/cryptography)
|
||||||
- [ ] [Cryptography: Hash Functions](https://www.youtube.com/watch?v=KqqOXndnvic&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=30)
|
- [Kriptografi: Funsgi Hash](https://www.youtube.com/watch?v=KqqOXndnvic&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=30)
|
||||||
- [ ] [Cryptography: Encryption](https://www.youtube.com/watch?v=9TNI2wHmaeI&index=31&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp)
|
- [Kriptografi: Enkripsi](https://www.youtube.com/watch?v=9TNI2wHmaeI&index=31&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp)
|
||||||
|
|
||||||
- ### Kompresi
|
- ### Kompresi
|
||||||
- pastikan untuk menonton video teori informasi terlebih dahulu
|
- Pastikan untuk menonton video teori informasi terlebih dahulu
|
||||||
- [ ] Computerphile (videos):
|
- Computerphile (video):
|
||||||
- [ ] [Compression](https://www.youtube.com/watch?v=Lto-ajuqW3w)
|
- [Kompresi](https://www.youtube.com/watch?v=Lto-ajuqW3w)
|
||||||
- [ ] [Entropy in Compression](https://www.youtube.com/watch?v=M5c_RFKVkko)
|
- [Entropi dalam Kompresi](https://www.youtube.com/watch?v=M5c_RFKVkko)
|
||||||
- [ ] [Upside Down Trees (Huffman Trees)](https://www.youtube.com/watch?v=umTbivyJoiI)
|
- [Pohon Terbalik (Pohon Huffman)](https://www.youtube.com/watch?v=umTbivyJoiI)
|
||||||
- [ ] [EXTRA BITS/TRITS - Huffman Trees](https://www.youtube.com/watch?v=DV8efuB3h2g)
|
- [EXTRA BITS / TRITS - Pohon Huffman](https://www.youtube.com/watch?v=DV8efuB3h2g)
|
||||||
- [ ] [Elegant Compression in Text (The LZ 77 Method)](https://www.youtube.com/watch?v=goOa3DGezUA)
|
- [Kompresi Elegan dalam Teks (Metode LZ 77)](https://www.youtube.com/watch?v=goOa3DGezUA)
|
||||||
- [ ] [Text Compression Meets Probabilities](https://www.youtube.com/watch?v=cCDCfoHTsaU)
|
- [Kompresi Teks Memenuhi Probabilitas](https://www.youtube.com/watch?v=cCDCfoHTsaU)
|
||||||
- [ ] [Compressor Head videos](https://www.youtube.com/playlist?list=PLOU2XLYxmsIJGErt5rrCqaSGTMyyqNt2H)
|
- [Video Kepala Kompresor](https://www.youtube.com/playlist?list=PLOU2XLYxmsIJGErt5rrCqaSGTMyyqNt2H)
|
||||||
- [ ] [(optional) Google Developers Live: GZIP is not enough!](https://www.youtube.com/watch?v=whGwm0Lky2s)
|
- [(opsional) Google Developers Live: GZIP saja tidak cukup!](https://www.youtube.com/watch?v=whGwm0Lky2s)
|
||||||
|
|
||||||
- ### Jaringan
|
- ### Keamanan komputer
|
||||||
- **jika Anda memiliki pengalaman jaringan atau ingin menjadi insinyur sistem, tunggu pertanyaan**
|
- [MIT (23 video)](https://www.youtube.com/playlist?list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh)
|
||||||
- otherwise, this is just good to know
|
- [Introduction, Threat Models](https://www.youtube.com/watch?v=GqmQg-cszw4&index=1&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh)
|
||||||
- [ ] [Khan Academy](https://www.khanacademy.org/computing/computer-science/internet-intro)
|
- [Control Hijacking Attacks](https://www.youtube.com/watch?v=6bwzNg5qQ0o&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh&index=2)
|
||||||
- [ ] [UDP and TCP: Comparison of Transport Protocols](https://www.youtube.com/watch?v=Vdc8TCESIg8)
|
- [Buffer Overflow Exploits and Defenses](https://www.youtube.com/watch?v=drQyrzRoRiA&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh&index=3)
|
||||||
- [ ] [TCP/IP and the OSI Model Explained!](https://www.youtube.com/watch?v=e5DEVa9eSN0)
|
- [Privilege Separation](https://www.youtube.com/watch?v=6SIJmoE9L9g&index=4&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh)
|
||||||
- [ ] [Packet Transmission across the Internet. Networking & TCP/IP tutorial.](https://www.youtube.com/watch?v=nomyRJehhnM)
|
- [Capabilities](https://www.youtube.com/watch?v=8VqTSY-11F4&index=5&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh)
|
||||||
- [ ] [HTTP](https://www.youtube.com/watch?v=WGJrLqtX7As)
|
- [Sandboxing Native Code](https://www.youtube.com/watch?v=VEV74hwASeU&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh&index=6)
|
||||||
- [ ] [SSL and HTTPS](https://www.youtube.com/watch?v=S2iBR2ZlZf0)
|
- [Web Security Model](https://www.youtube.com/watch?v=chkFBigodIw&index=7&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh)
|
||||||
- [ ] [SSL/TLS](https://www.youtube.com/watch?v=Rp3iZUvXWlM)
|
- [Securing Web Applications](https://www.youtube.com/watch?v=EBQIGy1ROLY&index=8&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh)
|
||||||
- [ ] [HTTP 2.0](https://www.youtube.com/watch?v=E9FxNzv1Tr8)
|
- [Symbolic Execution](https://www.youtube.com/watch?v=yRVZPvHYHzw&index=9&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh)
|
||||||
- [ ] [Video Series (21 videos)](https://www.youtube.com/playlist?list=PLEbnTDJUr_IegfoqO4iPnPYQui46QqT0j)
|
- [Network Security](https://www.youtube.com/watch?v=SIEVvk3NVuk&index=11&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh)
|
||||||
- [ ] [Subnetting Demystified - Part 5 CIDR Notation](https://www.youtube.com/watch?v=t5xYI0jzOf4)
|
- [Network Protocols](https://www.youtube.com/watch?v=QOtA76ga_fY&index=12&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh)
|
||||||
|
- [Side-Channel Attacks](https://www.youtube.com/watch?v=PuVMkSEcPiI&index=15&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh)
|
||||||
|
|
||||||
- ###
|
- ### Pengumpulan sampah
|
||||||
- [MIT (23 videos)](https://www.youtube.com/playlist?list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh)
|
- [GC dalam Python (video)](https://www.youtube.com/watch?v=iHVs_HkjdmI)
|
||||||
- [ ] [Introduction, Threat Models](https://www.youtube.com/watch?v=GqmQg-cszw4&index=1&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh)
|
- [Deep Dive Java: Pengumpulan Sampah itu Baik!](https://www.infoq.com/presentations/garbage-collection-benefits)
|
||||||
- [ ] [Control Hijacking Attacks](https://www.youtube.com/watch?v=6bwzNg5qQ0o&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh&index=2)
|
- [Deep Dive Python: Pengumpulan Sampah di CPython (video)](https://www.youtube.com/watch?v=P-8Z0-MhdQs&list=PLdzf4Clw0VbOEWOS_sLhT_9zaiQDrS5AR&index=3)
|
||||||
- [ ] [Buffer Overflow Exploits and Defenses](https://www.youtube.com/watch?v=drQyrzRoRiA&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh&index=3)
|
|
||||||
- [ ] [Privilege Separation](https://www.youtube.com/watch?v=6SIJmoE9L9g&index=4&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh)
|
|
||||||
- [ ] [Capabilities](https://www.youtube.com/watch?v=8VqTSY-11F4&index=5&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh)
|
|
||||||
- [ ] [Sandboxing Native Code](https://www.youtube.com/watch?v=VEV74hwASeU&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh&index=6)
|
|
||||||
- [ ] [Web Security Model](https://www.youtube.com/watch?v=chkFBigodIw&index=7&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh)
|
|
||||||
- [ ] [Securing Web Applications](https://www.youtube.com/watch?v=EBQIGy1ROLY&index=8&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh)
|
|
||||||
- [ ] [Symbolic Execution](https://www.youtube.com/watch?v=yRVZPvHYHzw&index=9&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh)
|
|
||||||
- [ ] [Network Security](https://www.youtube.com/watch?v=SIEVvk3NVuk&index=11&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh)
|
|
||||||
- [ ] [Network Protocols](https://www.youtube.com/watch?v=QOtA76ga_fY&index=12&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh)
|
|
||||||
- [ ] [Side-Channel Attacks](https://www.youtube.com/watch?v=PuVMkSEcPiI&index=15&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh)
|
|
||||||
|
|
||||||
- ### Garbage collection
|
|
||||||
- [ ] [Compilers (video)](https://www.youtube.com/playlist?list=PLO9y7hOkmmSGTy5z6HZ-W4k2y8WXF7Bff)
|
|
||||||
- [ ] [GC in Python (video)](https://www.youtube.com/watch?v=iHVs_HkjdmI)
|
|
||||||
- [ ] [Deep Dive Java: Garbage Collection is Good!](https://www.infoq.com/presentations/garbage-collection-benefits)
|
|
||||||
- [ ] [Deep Dive Python: Garbage Collection in CPython (video)](https://www.youtube.com/watch?v=P-8Z0-MhdQs&list=PLdzf4Clw0VbOEWOS_sLhT_9zaiQDrS5AR&index=3)
|
|
||||||
|
|
||||||
- ### Pemrograman Paralel
|
- ### Pemrograman Paralel
|
||||||
- [ ] [Coursera (Scala)](https://www.coursera.org/learn/parprog1/home/week/1)
|
- [Coursera (Scala)](https://www.coursera.org/learn/parprog1/home/week/1)
|
||||||
- [ ] [Efficient Python for High Performance Parallel Computing (video)](https://www.youtube.com/watch?v=uY85GkaYzBk)
|
- [Python Efisien untuk Komputasi Paralel Berkinerja Tinggi (video)](https://www.youtube.com/watch?v=uY85GkaYzBk)
|
||||||
|
|
||||||
- ### Pengiriman Pesan, Serialisasi, dan Sistem Queueing
|
- ### Pengiriman Pesan, Serialisasi, dan Sistem Queueing
|
||||||
- [ ] [Thrift](https://thrift.apache.org/)
|
- [Thrift](https://thrift.apache.org/)
|
||||||
- [Tutorial](http://thrift-tutorial.readthedocs.io/en/latest/intro.html)
|
- [Tutorial](http://thrift-tutorial.readthedocs.io/en/latest/intro.html)
|
||||||
- [ ] [Protocol Buffers](https://developers.google.com/protocol-buffers/)
|
- [Protocol Buffers](https://developers.google.com/protocol-buffers/)
|
||||||
- [Tutorials](https://developers.google.com/protocol-buffers/docs/tutorials)
|
- [Tutorials](https://developers.google.com/protocol-buffers/docs/tutorials)
|
||||||
- [ ] [gRPC](http://www.grpc.io/)
|
- [gRPC](http://www.grpc.io/)
|
||||||
- [gRPC 101 for Java Developers (video)](https://www.youtube.com/watch?v=5tmPvSe7xXQ&list=PLcTqM9n_dieN0k1nSeN36Z_ppKnvMJoly&index=1)
|
- [gRPC 101 untuk Pengembang Java (video)](https://www.youtube.com/watch?v=5tmPvSe7xXQ&list=PLcTqM9n_dieN0k1nSeN36Z_ppKnvMJoly&index=1)
|
||||||
- [ ] [Redis](http://redis.io/)
|
- [Redis](http://redis.io/)
|
||||||
- [Tutorial](http://try.redis.io/)
|
- [Tutorial](http://try.redis.io/)
|
||||||
- [ ] [Amazon SQS (queue)](https://aws.amazon.com/sqs/)
|
- [Amazon SQS (queue)](https://aws.amazon.com/sqs/)
|
||||||
- [ ] [Amazon SNS (pub-sub)](https://aws.amazon.com/sns/)
|
- [Amazon SNS (pub-sub)](https://aws.amazon.com/sns/)
|
||||||
- [ ] [RabbitMQ](https://www.rabbitmq.com/)
|
- [RabbitMQ](https://www.rabbitmq.com/)
|
||||||
- [Get Started](https://www.rabbitmq.com/getstarted.html)
|
- [Memulai](https://www.rabbitmq.com/getstarted.html)
|
||||||
- [ ] [Celery](http://www.celeryproject.org/)
|
- [Celery](http://www.celeryproject.org/)
|
||||||
- [First Steps With Celery](http://docs.celeryproject.org/en/latest/getting-started/first-steps-with-celery.html)
|
- [Langkah Awal dengan Celery](http://docs.celeryproject.org/en/latest/getting-started/first-steps-with-celery.html)
|
||||||
- [ ] [ZeroMQ](http://zeromq.org/)
|
- [ZeroMQ](http://zeromq.org/)
|
||||||
- [Intro - Read The Manual](http://zeromq.org/intro:read-the-manual)
|
- [Intro - Baca Manual](http://zeromq.org/intro:read-the-manual)
|
||||||
- [ ] [ActiveMQ](http://activemq.apache.org/)
|
- [ActiveMQ](http://activemq.apache.org/)
|
||||||
- [ ] [Kafka](http://kafka.apache.org/documentation.html#introduction)
|
- [Kafka](http://kafka.apache.org/documentation.html#introduction)
|
||||||
- [ ] [MessagePack](http://msgpack.org/index.html)
|
- [MessagePack](http://msgpack.org/index.html)
|
||||||
- [ ] [Avro](https://avro.apache.org/)
|
- [Avro](https://avro.apache.org/)
|
||||||
|
|
||||||
- ### Fast Fourier Transform
|
- ### A*
|
||||||
- [ ] [An Interactive Guide To The Fourier Transform](https://betterexplained.com/articles/an-interactive-guide-to-the-fourier-transform/)
|
- [Algoritma Pencarian](https://en.wikipedia.org/wiki/A*_search_algorithm)
|
||||||
- [ ] [What is a Fourier transform? What is it used for?](http://www.askamathematician.com/2012/09/q-what-is-a-fourier-transform-what-is-it-used-for/)
|
- [A * Tutorial Pathfinding (video)](https://www.youtube.com/watch?v=KNXfSOx4eEE)
|
||||||
- [ ] [What is the Fourier Transform? (video)](https://www.youtube.com/watch?v=Xxut2PN-V8Q)
|
- [A * Pathfinding (E01: penjelasan algoritma) (video)](https://www.youtube.com/watch?v=-L-WgKMFuhE)
|
||||||
- [ ] [Divide & Conquer: FFT (video)](https://www.youtube.com/watch?v=iTMn0Kt18tg&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=4)
|
|
||||||
- [ ] [Understanding The FFT](http://jakevdp.github.io/blog/2013/08/28/understanding-the-fft/)
|
- ### Transformasi Fourier Cepat
|
||||||
|
- [Panduan Interaktif Untuk Transformasi Fourier](https://betterexplained.com/articles/an-interactive-guide-to-the-fourier-transform/)
|
||||||
|
- [Apa itu Transformasi Fourier? Untuk apa itu digunakan?](http://www.askamathematician.com/2012/09/q-what-is-a-fourier-transform-what-is-it-used-for/)
|
||||||
|
- [Apa itu Transformasi Fourier? (video)](https://www.youtube.com/watch?v=Xxut2PN-V8Q)
|
||||||
|
- [Bagilah & Taklukkan: FFT (video)](https://www.youtube.com/watch?v=iTMn0Kt18tg&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=4)
|
||||||
|
- [Memahami FFT](http://jakevdp.github.io/blog/2013/08/28/understanding-the-fft/)
|
||||||
|
|
||||||
- ### Bloom Filter
|
- ### Bloom Filter
|
||||||
- Given a Bloom filter with m bits and k hashing functions, both insertion and membership testing are O(k)
|
- Given a Bloom filter with m bits and k hashing functions, both insertion and membership testing are O(k)
|
||||||
- [Bloom Filters](https://www.youtube.com/watch?v=-SuTGoFYjZs)
|
- [Filter Bloom (video)](https://www.youtube.com/watch?v=-SuTGoFYjZs)
|
||||||
- [Bloom Filters | Mining of Massive Datasets | Stanford University](https://www.youtube.com/watch?v=qBTdukbzc78)
|
- [Filter Bloom | Penambangan Kumpulan Data Besar-besaran | Universitas Stanford (video)](https://www.youtube.com/watch?v=qBTdukbzc78)
|
||||||
- [Tutorial](http://billmill.org/bloomfilter-tutorial/)
|
- [Tutorial](http://billmill.org/bloomfilter-tutorial/)
|
||||||
- [How To Write A Bloom Filter App](http://blog.michaelschmatz.com/2016/04/11/how-to-write-a-bloom-filter-cpp/)
|
- [Cara Menulis Aplikasi Bloom Filter](http://blog.michaelschmatz.com/2016/04/11/how-to-write-a-bloom-filter-cpp/)
|
||||||
|
|
||||||
- ### HyperLogLog
|
- ### HyperLogLog
|
||||||
- [How To Count A Billion Distinct Objects Using Only 1.5KB Of Memory](http://highscalability.com/blog/2012/4/5/big-data-counting-how-to-count-a-billion-distinct-objects-us.html)
|
- [Cara Menghitung Miliaran Objek Berbeda Hanya Menggunakan Memori 1.5KB](http://highscalability.com/blog/2012/4/5/big-data-counting-how-to-count-a-billion-distinct-objects-us.html)
|
||||||
|
|
||||||
- ### Locality-Sensitive Hashing
|
- ### Locality-Sensitive Hashing
|
||||||
- used to determine the similarity of documents
|
- Digunakan untuk menentukan kesamaan dokumen
|
||||||
- the opposite of MD5 or SHA which are used to determine if 2 documents/strings are exactly the same.
|
- Kebalikan dari MD5 atau SHA yang digunakan untuk menentukan apakah 2 dokumen / string sama persis
|
||||||
- [Simhashing (hopefully) made simple](http://ferd.ca/simhashing-hopefully-made-simple.html)
|
- [Simhashing (semoga) menjadi sederhana](http://ferd.ca/simhashing-hopefully-made-simple.html)
|
||||||
|
|
||||||
- ### van Emde Boas Trees
|
- ### van Emde Boas Trees
|
||||||
- [ ] [Divide & Conquer: van Emde Boas Trees (video)](https://www.youtube.com/watch?v=hmReJCupbNU&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=6)
|
- [Bagilah & Taklukkan: Pohon van Emde Boas (video)](https://www.youtube.com/watch?v=hmReJCupbNU&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=6)
|
||||||
- [ ] [MIT Lecture Notes](https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-and-analysis-of-algorithms-spring-2012/lecture-notes/MIT6_046JS12_lec15.pdf)
|
- [Catatan Kuliah MIT](https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-and-analysis-of-algorithms-spring-2012/lecture-notes/MIT6_046JS12_lec15.pdf)
|
||||||
|
|
||||||
- ### Augmented Data Structures
|
- ### Augmented Data Structures
|
||||||
- [ ] [CS 61B Lecture 39: Augmenting Data Structures](https://youtu.be/zksIj9O8_jc?list=PL4BBB74C7D2A1049C&t=950)
|
- [CS 61B Kuliah 39: Augmented Data Structures](https://archive.org/details/ucberkeley_webcast_zksIj9O8_jc)
|
||||||
|
|
||||||
- ### Tries
|
|
||||||
- Note there are different kinds of tries. Some have prefixes, some don't, and some use string instead of bits
|
|
||||||
to track the path.
|
|
||||||
- I read through code, but will not implement.
|
|
||||||
- [ ] [Sedgewick - Tries (3 videos)](https://www.youtube.com/playlist?list=PLe-ggMe31CTe9IyG9MB8vt5xUJeYgOYRQ)
|
|
||||||
- [ ] [1. R Way Tries](https://www.youtube.com/watch?v=buq2bn8x3Vo&index=3&list=PLe-ggMe31CTe9IyG9MB8vt5xUJeYgOYRQ)
|
|
||||||
- [ ] [2. Ternary Search Tries](https://www.youtube.com/watch?v=LelV-kkYMIg&index=2&list=PLe-ggMe31CTe9IyG9MB8vt5xUJeYgOYRQ)
|
|
||||||
- [ ] [3. Character Based Operations](https://www.youtube.com/watch?v=00YaFPcC65g&list=PLe-ggMe31CTe9IyG9MB8vt5xUJeYgOYRQ&index=1)
|
|
||||||
- [ ] [Notes on Data Structures and Programming Techniques](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Tries)
|
|
||||||
- [ ] Short course videos:
|
|
||||||
- [ ] [Introduction To Tries (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/08Xyf/core-introduction-to-tries)
|
|
||||||
- [ ] [Performance Of Tries (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/PvlZW/core-performance-of-tries)
|
|
||||||
- [ ] [Implementing A Trie (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/DFvd3/core-implementing-a-trie)
|
|
||||||
- [ ] [The Trie: A Neglected Data Structure](https://www.toptal.com/java/the-trie-a-neglected-data-structure)
|
|
||||||
- [ ] [TopCoder - Using Tries](https://www.topcoder.com/community/data-science/data-science-tutorials/using-tries/)
|
|
||||||
- [ ] [Stanford Lecture (real world use case) (video)](https://www.youtube.com/watch?v=TJ8SkcUSdbU)
|
|
||||||
- [ ] [MIT, Advanced Data Structures, Strings (can get pretty obscure about halfway through)](https://www.youtube.com/watch?v=NinWEPPrkDQ&index=16&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf)
|
|
||||||
|
|
||||||
- ### Balanced search trees
|
- ### Balanced search trees
|
||||||
- Know least one type of balanced binary tree (and know how it's implemented):
|
- Ketahui setidaknya satu jenis pohon biner yang seimbang (dan ketahui bagaimana implementasinya):
|
||||||
- "Among balanced search trees, AVL and 2/3 trees are now passé, and red-black trees seem to be more popular.
|
- "Di antara pohon pencarian seimbang, AVL dan 2/3 trees sekarang sudah ketinggalan zaman, dan red-black trees tampaknya lebih populer. Struktur data pengorganisasian mandiri yang sangat menarik adalah splay trees, yang menggunakan rotasi untuk memindahkan kunci apa pun yang diakses ke root." - Skiena
|
||||||
A particularly interesting self-organizing data structure is the splay tree, which uses rotations
|
- Dari jumlah tersebut, saya memilih untuk menerapkan splay tree.
|
||||||
to move any accessed key to the root." - Skiena
|
Dari apa yang saya baca, Anda tidak akan menerapkan pohon pencarian seimbang (balanced search tree) dalam wawancara Anda.
|
||||||
- Of these, I chose to implement a splay tree. From what I've read, you won't implement a
|
Tapi saya ingin eksposur ke pengkodean satu dan hadapi saja, splay trees adalah lutut lebah.
|
||||||
balanced search tree in your interview. But I wanted exposure to coding one up
|
Saya memang membaca banyak kode red-black tree code
|
||||||
and let's face it, splay trees are the bee's knees. I did read a lot of red-black tree code.
|
- Splay tree: menyisipkan, mencari, menghapus fungsi
|
||||||
- splay tree: insert, search, delete functions
|
Jika Anda akhirnya menerapkan pohon merah / hitam coba ini saja:
|
||||||
If you end up implementing red/black tree try just these:
|
- Fungsi pencarian dan penyisipan, melewatkan penghapusan
|
||||||
- search and insertion functions, skipping delete
|
- Saya ingin mempelajari lebih lanjut tentang B-Tree karena digunakan secara luas dengan kumpulan data yang sangat besar
|
||||||
- I want to learn more about B-Tree since it's used so widely with very large data sets.
|
- [Self-balancing binary search tree](https://en.wikipedia.org/wiki/Self-balancing_binary_search_tree)
|
||||||
- [ ] [Self-balancing binary search tree](https://en.wikipedia.org/wiki/Self-balancing_binary_search_tree)
|
|
||||||
|
|
||||||
- [ ] **AVL trees**
|
- **AVL trees**
|
||||||
- In practice:
|
- Dalam praktek:
|
||||||
From what I can tell, these aren't used much in practice, but I could see where they would be:
|
Dari apa yang saya tahu, ini tidak banyak digunakan dalam praktiknya, tetapi saya bisa melihat di mana mereka akan berada:
|
||||||
The AVL tree is another structure supporting O(log n) search, insertion, and removal. It is more rigidly
|
AVL trees (Pohon AVL) adalah struktur lain yang mendukung pencarian, penyisipan, dan penghapusan O(log n).
|
||||||
balanced than red–black trees, leading to slower insertion and removal but faster retrieval. This makes it
|
Ini lebih seimbang daripada red-black trees, menyebabkan penyisipan dan pemindahan lebih lambat tetapi pengambilan lebih cepat.
|
||||||
attractive for data structures that may be built once and loaded without reconstruction, such as language
|
Ini membuatnya menarik untuk struktur data yang dapat dibangun sekali dan dimuat tanpa rekonstruksi, seperti kamus bahasa (atau kamus program, seperti opcode assembler atau interpreter)
|
||||||
dictionaries (or program dictionaries, such as the opcodes of an assembler or interpreter).
|
- [MIT AVL Trees / AVL Sort (video)](https://www.youtube.com/watch?v=FNeL18KsWPc&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=6)
|
||||||
- [ ] [MIT AVL Trees / AVL Sort (video)](https://www.youtube.com/watch?v=FNeL18KsWPc&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=6)
|
- [AVL Trees (video)](https://www.coursera.org/learn/data-structures/lecture/Qq5E0/avl-trees)
|
||||||
- [ ] [AVL Trees (video)](https://www.coursera.org/learn/data-structures/lecture/Qq5E0/avl-trees)
|
- [Implementasi AVL Tree (video)](https://www.coursera.org/learn/data-structures/lecture/PKEBC/avl-tree-implementation)
|
||||||
- [ ] [AVL Tree Implementation (video)](https://www.coursera.org/learn/data-structures/lecture/PKEBC/avl-tree-implementation)
|
- [Split Dan Merge](https://www.coursera.org/learn/data-structures/lecture/22BgE/split-and-merge)
|
||||||
- [ ] [Split And Merge](https://www.coursera.org/learn/data-structures/lecture/22BgE/split-and-merge)
|
|
||||||
|
|
||||||
- [ ] **Splay trees**
|
- **Splay trees**
|
||||||
- In practice:
|
- Dalam praktek:
|
||||||
Splay trees are typically used in the implementation of caches, memory allocators, routers, garbage collectors,
|
Splay trees (pohon bentang) biasanya digunakan dalam implementasi cache, pengalokasi memori, router, pengumpul sampah, kompresi data, tali (pengganti string yang digunakan untuk string teks panjang), di Windows NT (dalam memori virtual, jaringan, dan kode sistem file) dll.
|
||||||
data compression, ropes (replacement of string used for long text strings), in Windows NT (in the virtual memory,
|
- [CS 61B: Splay Trees (video)](https://archive.org/details/ucberkeley_webcast_G5QIXywcJlY)
|
||||||
networking and file system code) etc.
|
- Kuliah MIT: Splay Trees:
|
||||||
- [ ] [CS 61B: Splay Trees (video)](https://www.youtube.com/watch?v=Najzh1rYQTo&index=23&list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd)
|
- Menjadi sangat matematis, tetapi perhatikan 10 menit terakhir dengan pasti.
|
||||||
- [ ] MIT Lecture: Splay Trees:
|
|
||||||
- Gets very mathy, but watch the last 10 minutes for sure.
|
|
||||||
- [Video](https://www.youtube.com/watch?v=QnPl_Y6EqMo)
|
- [Video](https://www.youtube.com/watch?v=QnPl_Y6EqMo)
|
||||||
|
|
||||||
- [ ] **Red/black trees**
|
- **Red/black trees**
|
||||||
- these are a translation of a 2-3 tree (see below)
|
- Ini adalah terjemahan dari sebuah 2-3 tree (lihat dibawah).
|
||||||
- In practice:
|
- Dalam praktek:
|
||||||
Red–black trees offer worst-case guarantees for insertion time, deletion time, and search time.
|
Red/black trees (Pohon merah / hitam) menawarkan jaminan kasus terburuk untuk waktu penyisipan, waktu penghapusan, dan waktu pencarian.
|
||||||
Not only does this make them valuable in time-sensitive applications such as real-time applications,
|
Hal ini tidak hanya membuatnya berharga dalam aplikasi yang sensitif terhadap waktu seperti aplikasi waktu nyata, tetapi juga menjadikannya sebagai blok bangunan yang berharga dalam struktur data lain yang memberikan jaminan kasus terburuk;
|
||||||
but it makes them valuable building blocks in other data structures which provide worst-case guarantees;
|
sebagai contoh, banyak struktur data yang digunakan dalam geometri komputasi dapat didasarkan pada red/black trees, dan Penjadwal yang Benar-Benar Adil yang digunakan dalam kernel Linux saat ini menggunakan red/black trees.
|
||||||
for example, many data structures used in computational geometry can be based on red–black trees, and
|
Di Java versi 8, Collection HashMap telah dimodifikasi sedemikian rupa sehingga alih-alih menggunakan LinkedList untuk menyimpan elemen identik dengan kode hash yang buruk, red/black trees digunakan
|
||||||
the Completely Fair Scheduler used in current Linux kernels uses red–black trees. In the version 8 of Java,
|
- [Aduni - Algoritma - Kuliah 4 (link lompat ke titik awal) (video)](https://youtu.be/1W3x0f_RmUo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3871)
|
||||||
the Collection HashMap has been modified such that instead of using a LinkedList to store identical elements with poor
|
- [Aduni - Algoritma - Kuliah 5 (video)](https://www.youtube.com/watch?v=hm2GHwyKF1o&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=5)
|
||||||
hashcodes, a Red-Black tree is used.
|
- [Red-Black Tree](https://en.wikipedia.org/wiki/Red%E2%80%93black_tree)
|
||||||
- [ ] [Aduni - Algorithms - Lecture 4 (link jumps to starting point) (video)](https://youtu.be/1W3x0f_RmUo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3871)
|
- [Pengantar Pencarian Biner Dan Red-Black Tree](https://www.topcoder.com/community/competitive-programming/tutorials/an-introduction-to-binary-search-and-red-black-trees/)
|
||||||
- [ ] [Aduni - Algorithms - Lecture 5 (video)](https://www.youtube.com/watch?v=hm2GHwyKF1o&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=5)
|
|
||||||
- [ ] [Black Tree](https://en.wikipedia.org/wiki/Red%E2%80%93black_tree)
|
|
||||||
- [ ] [An Introduction To Binary Search And Red Black Tree](https://www.topcoder.com/community/data-science/data-science-tutorials/an-introduction-to-binary-search-and-red-black-trees/)
|
|
||||||
|
|
||||||
- [ ] **2-3 search trees**
|
- **2-3 search trees**
|
||||||
- In practice:
|
- Dalam praktek:
|
||||||
2-3 trees have faster inserts at the expense of slower searches (since height is more compared to AVL trees).
|
2-3 trees memiliki penyisipan yang lebih cepat dengan mengorbankan pencarian yang lebih lambat (karena ketinggian lebih banyak dibandingkan dengan AVL trees).
|
||||||
- You would use 2-3 tree very rarely because its implementation involves different types of nodes. Instead, people use Red Black trees.
|
- Anda akan sangat jarang menggunakan 2-3 trees karena implementasinya melibatkan berbagai jenis node. Sebaliknya, orang menggunakan red–black trees.
|
||||||
- [ ] [23-Tree Intuition and Definition (video)](https://www.youtube.com/watch?v=C3SsdUqasD4&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6&index=2)
|
- [Intuisi dan Definisi 23-Trees (video)](https://www.youtube.com/watch?v=C3SsdUqasD4&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6&index=2)
|
||||||
- [ ] [Binary View of 23-Tree](https://www.youtube.com/watch?v=iYvBtGKsqSg&index=3&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6)
|
- [Tampilan Biner dari 23-Trees](https://www.youtube.com/watch?v=iYvBtGKsqSg&index=3&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6)
|
||||||
- [ ] [2-3 Trees (student recitation) (video)](https://www.youtube.com/watch?v=TOb1tuEZ2X4&index=5&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp)
|
- [2-3 Trees (pengajian siswa) (video)](https://www.youtube.com/watch?v=TOb1tuEZ2X4&index=5&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp)
|
||||||
|
|
||||||
- [ ] **2-3-4 Trees (aka 2-4 trees)**
|
- **2-3-4 Trees (aka 2-4 trees)**
|
||||||
- In practice:
|
- Dalam praktek:
|
||||||
For every 2-4 tree, there are corresponding red–black trees with data elements in the same order. The insertion and deletion
|
Untuk setiap 2-4 trees, ada red–black trees yang sesuai dengan elemen data dalam urutan yang sama.
|
||||||
operations on 2-4 trees are also equivalent to color-flipping and rotations in red–black trees. This makes 2-4 trees an
|
Operasi penyisipan dan penghapusan pada 2-4 trees juga setara dengan pembalikan warna dan rotasi pada red–black trees.
|
||||||
important tool for understanding the logic behind red–black trees, and this is why many introductory algorithm texts introduce
|
Hal ini membuat 2-4 trees menjadi alat penting untuk memahami logika di balik red–black trees, dan inilah mengapa banyak teks algoritme pengantar memperkenalkan 2-4 trees tepat sebelum red–black trees, meskipun **2-4 trees tidak sering digunakan dalam praktik**.
|
||||||
2-4 trees just before red–black trees, even though **2-4 trees are not often used in practice**.
|
- [CS 61B Kuliah 26: Pohon Pencarian Seimbang (video)](https://archive.org/details/ucberkeley_webcast_zqrqYXkth6Q)
|
||||||
- [ ] [CS 61B Lecture 26: Balanced Search Trees (video)](https://www.youtube.com/watch?v=zqrqYXkth6Q&index=26&list=PL4BBB74C7D2A1049C)
|
- [Bawah Atas 234-Trees (video)](https://www.youtube.com/watch?v=DQdMYevEyE4&index=4&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6)
|
||||||
- [ ] [Bottom Up 234-Trees (video)](https://www.youtube.com/watch?v=DQdMYevEyE4&index=4&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6)
|
- [Atas Bawah 234-Trees (video)](https://www.youtube.com/watch?v=2679VQ26Fp4&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6&index=5)
|
||||||
- [ ] [Top Down 234-Trees (video)](https://www.youtube.com/watch?v=2679VQ26Fp4&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6&index=5)
|
|
||||||
|
|
||||||
- [ ] **N-ary (K-ary, M-ary) trees**
|
- **N-ary (K-ary, M-ary) trees**
|
||||||
- note: the N or K is the branching factor (max branches)
|
- catatan: N atau K adalah faktor percabangan (cabang maks)
|
||||||
- binary trees are a 2-ary tree, with branching factor = 2
|
- pohon biner adalah pohon 2-ary, dengan faktor percabangan = 2
|
||||||
- 2-3 trees are 3-ary
|
- 2-3 pohon adalah 3-ary
|
||||||
- [ ] [K-Ary Tree](https://en.wikipedia.org/wiki/K-ary_tree)
|
- [K-Ary Tree](https://en.wikipedia.org/wiki/K-ary_tree)
|
||||||
|
|
||||||
- [ ] **B-Trees**
|
- **B-Trees**
|
||||||
- fun fact: it's a mystery, but the B could stand for Boeing, Balanced, or Bayer (co-inventor)
|
- Fakta menyenangkan: ini adalah misteri, tetapi B bisa berarti Boeing, Balanced, atau Bayer (co-inventor).
|
||||||
- In Practice:
|
- Dalam praktek:
|
||||||
B-Trees are widely used in databases. Most modern filesystems use B-trees (or Variants). In addition to
|
B-Trees banyak digunakan dalam database. Kebanyakan filesystem modern menggunakan B-tree (atau Variants). Sebagai tambahannya
|
||||||
its use in databases, the B-tree is also used in filesystems to allow quick random access to an arbitrary
|
penggunaannya dalam database, B-tree juga digunakan dalam sistem file untuk memungkinkan akses acak cepat ke sembarang
|
||||||
block in a particular file. The basic problem is turning the file block i address into a disk block
|
blokir di file tertentu. Masalah dasarnya adalah mengubah alamat file blok i menjadi blok disk
|
||||||
(or perhaps to a cylinder-head-sector) address.
|
(atau mungkin ke alamat sektor kepala silinder)
|
||||||
- [ ] [B-Tree](https://en.wikipedia.org/wiki/B-tree)
|
- [B-Tree](https://en.wikipedia.org/wiki/B-tree)
|
||||||
- [ ] [Introduction to B-Trees (video)](https://www.youtube.com/watch?v=I22wEC1tTGo&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6&index=6)
|
- [Struktur Data B-Tree](http://btechsmartclass.com/data_structures/b-trees.html)
|
||||||
- [ ] [B-Tree Definition and Insertion (video)](https://www.youtube.com/watch?v=s3bCdZGrgpA&index=7&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6)
|
- [Pengantar B-Trees (video)](https://www.youtube.com/watch?v=I22wEC1tTGo&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6&index=6)
|
||||||
- [ ] [B-Tree Deletion (video)](https://www.youtube.com/watch?v=svfnVhJOfMc&index=8&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6)
|
- [Definisi dan Penyisipan B-Tree (video)](https://www.youtube.com/watch?v=s3bCdZGrgpA&index=7&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6)
|
||||||
- [ ] [MIT 6.851 - Memory Hierarchy Models (video)](https://www.youtube.com/watch?v=V3omVLzI0WE&index=7&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf)
|
- [Penghapusan B-Tree (video)](https://www.youtube.com/watch?v=svfnVhJOfMc&index=8&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6)
|
||||||
|
- [MIT 6.851 - Model Hirarki Memori (video)](https://www.youtube.com/watch?v=V3omVLzI0WE&index=7&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf)
|
||||||
- covers cache-oblivious B-Trees, very interesting data structures
|
- covers cache-oblivious B-Trees, very interesting data structures
|
||||||
- the first 37 minutes are very technical, may be skipped (B is block size, cache line size)
|
- the first 37 minutes are very technical, may be skipped (B is block size, cache line size)
|
||||||
|
|
||||||
|
|
||||||
- ### k-D Trees
|
- ### k-D Trees
|
||||||
- great for finding number of points in a rectangle or higher dimension object
|
- Bagus untuk menemukan jumlah titik dalam persegi panjang atau objek berdimensi lebih tinggi
|
||||||
- a good fit for k-nearest neighbors
|
- Cocok untuk tetangga terdekat
|
||||||
- [ ] [Kd Trees (video)](https://www.youtube.com/watch?v=W94M9D_yXKk)
|
- [Kd Trees (video)](https://www.youtube.com/watch?v=W94M9D_yXKk)
|
||||||
- [ ] [kNN K-d tree algorithm (video)](https://www.youtube.com/watch?v=Y4ZgLlDfKDg)
|
- [Algoritma kNN K-d tree (video)](https://www.youtube.com/watch?v=Y4ZgLlDfKDg)
|
||||||
|
|
||||||
- ### Skip lists
|
- ### Skip lists
|
||||||
- "These are somewhat of a cult data structure" - Skiena
|
-"Ini adalah semacam struktur data kultus" - Skiena
|
||||||
- [ ] [Randomization: Skip Lists (video)](https://www.youtube.com/watch?v=2g9OSRKJuzM&index=10&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp)
|
- [Pengacakan: Skip lists (video)](https://www.youtube.com/watch?v=2g9OSRKJuzM&index=10&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp)
|
||||||
- [ ] [For animations and a little more detail](https://en.wikipedia.org/wiki/Skip_list)
|
- [Untuk animasi dan sedikit lebih detail](https://en.wikipedia.org/wiki/Skip_list)
|
||||||
|
|
||||||
- ### Network Flows
|
- ### Aliran Jaringan
|
||||||
- [ ] [Ford-Fulkerson in 5 minutes (video)](https://www.youtube.com/watch?v=v1VgJmkEJW0)
|
- [Ford-Fulkerson dalam 5 menit - Contoh langkah demi langkah (video)](https://www.youtube.com/watch?v=Tl90tNtKvxs)
|
||||||
- [ ] [Ford-Fulkerson Algorithm (video)](https://www.youtube.com/watch?v=v1VgJmkEJW0)
|
- [Algoritma Ford-Fulkerson (video)](https://www.youtube.com/watch?v=v1VgJmkEJW0)
|
||||||
- [ ] [Network Flows (video)](https://www.youtube.com/watch?v=2vhN4Ice5jI)
|
- [Aliran Jaringan (video)](https://www.youtube.com/watch?v=2vhN4Ice5jI)
|
||||||
|
|
||||||
- ### Disjoint Sets & Union Find
|
- ### Disjoint Sets & Union Find
|
||||||
- [ ] [UCB 61B - Disjoint Sets; Sorting & selection (video)](https://www.youtube.com/watch?v=MAEGXTwmUsI&list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd&index=21)
|
- [UCB 61B - Set Pemutusan; Penyortiran & pemilihan (video)](https://archive.org/details/ucberkeley_webcast_MAEGXTwmUsI)
|
||||||
- [ ] [Sedgewick Algorithms - Union-Find (6 videos)](https://www.youtube.com/watch?v=8mYfZeHtdNc&list=PLe-ggMe31CTexoNYnMhbHaWhQ0dvcy43t)
|
- [Algoritma Sedgewick - Union-Find (6 video)](https://www.coursera.org/learn/algorithms-part1/home/week/1)
|
||||||
|
|
||||||
- ### Math for Fast Processing
|
- ### Matematika untuk Pemrosesan Cepat
|
||||||
- [ ] [Integer Arithmetic, Karatsuba Multiplication (video)](https://www.youtube.com/watch?v=eCaXlAaN2uE&index=11&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
|
- [Aritmatika Integer, Perkalian Karatsuba (video)](https://www.youtube.com/watch?v=eCaXlAaN2uE&index=11&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
|
||||||
- [ ] [The Chinese Remainder Theorem (used in cryptography) (video)](https://www.youtube.com/watch?v=ru7mWZJlRQg)
|
- [Teorema Sisa Cina (digunakan dalam kriptografi) (video)](https://www.youtube.com/watch?v=ru7mWZJlRQg)
|
||||||
|
|
||||||
- ### Treap
|
- ### Treap
|
||||||
- Combination of a binary search tree and a heap
|
- Combination of a binary search tree and a heap
|
||||||
- [ ] [Treap](https://en.wikipedia.org/wiki/Treap)
|
- [Treap](https://en.wikipedia.org/wiki/Treap)
|
||||||
- [ ] [Data Structures: Treaps explained (video)](https://www.youtube.com/watch?v=6podLUYinH8)
|
- [Struktur Data: Penjelasan hierarki (video)](https://www.youtube.com/watch?v=6podLUYinH8)
|
||||||
- [ ] [Applications in set operations](https://www.cs.cmu.edu/~scandal/papers/treaps-spaa98.pdf)
|
- [Aplikasi dalam operasi set](https://www.cs.cmu.edu/~scandal/papers/treaps-spaa98.pdf)
|
||||||
|
|
||||||
- ### Linear Programming (videos)
|
- ### Pemrograman Linear (video)
|
||||||
- [ ] [Linear Programming](https://www.youtube.com/watch?v=M4K6HYLHREQ)
|
- [Pemrograman Linear](https://www.youtube.com/watch?v=M4K6HYLHREQ)
|
||||||
- [ ] [Finding minimum cost](https://www.youtube.com/watch?v=2ACJ9ewUC6U)
|
- [Menemukan biaya minimum](https://www.youtube.com/watch?v=2ACJ9ewUC6U)
|
||||||
- [ ] [Finding maximum value](https://www.youtube.com/watch?v=8AA_81xI3ik)
|
- [Menemukan nilai maksimum](https://www.youtube.com/watch?v=8AA_81xI3ik)
|
||||||
- [ ] [Solve Linear Equations with Python - Simplex Algorithm](https://www.youtube.com/watch?v=44pAWI7v5Zk)
|
- [Memecahkan Persamaan Linear dengan Python - Algoritma Simpleks](https://www.youtube.com/watch?v=44pAWI7v5Zk)
|
||||||
|
|
||||||
- ### Geometry, Convex hull (videos)
|
- ### Geometry, Convex hull (video)
|
||||||
- [ ] [Graph Alg. IV: Intro to geometric algorithms - Lecture 9](https://youtu.be/XIAQRlNkJAw?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3164)
|
- [Grafik Alg. IV: Pengantar algoritma geometris - Kuliah 9](https://youtu.be/XIAQRlNkJAw?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3164)
|
||||||
- [ ] [Geometric Algorithms: Graham & Jarvis - Lecture 10](https://www.youtube.com/watch?v=J5aJEcOr6Eo&index=10&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm)
|
- [Algoritma Geometris: Graham & Jarvis - Kuliah 10](https://www.youtube.com/watch?v=J5aJEcOr6Eo&index=10&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm)
|
||||||
- [ ] [Divide & Conquer: Convex Hull, Median Finding](https://www.youtube.com/watch?v=EzeYI7p9MjU&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=2)
|
- [Bagilah & Taklukkan: Convex Hull, Median Finding](https://www.youtube.com/watch?v=EzeYI7p9MjU&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=2)
|
||||||
|
|
||||||
- ### Discrete math
|
- ### Matematika diskrit
|
||||||
- see videos below
|
- lihat video di bawah ini
|
||||||
|
|
||||||
- ### Machine Learning
|
- ### Pembelajaran Mesin (Machine Learning)
|
||||||
- [ ] Why ML?
|
- Kenapa ML?
|
||||||
- [ ] [How Google Is Remaking Itself As A Machine Learning First Company](https://backchannel.com/how-google-is-remaking-itself-as-a-machine-learning-first-company-ada63defcb70)
|
- [Bagaimana Google Mengubah Dirinya Sebagai Perusahaan Machine Learning First](https://backchannel.com/how-google-is-remaking-itself-as-a-machine-learning-first-company-ada63defcb70)
|
||||||
- [ ] [Large-Scale Deep Learning for Intelligent Computer Systems (video)](https://www.youtube.com/watch?v=QSaZGT4-6EY)
|
- [Pembelajaran Mendalam Skala Besar untuk Sistem Komputer Cerdas (video)](https://www.youtube.com/watch?v=QSaZGT4-6EY)
|
||||||
- [ ] [Deep Learning and Understandability versus Software Engineering and Verification by Peter Norvig](https://www.youtube.com/watch?v=X769cyzBNVw)
|
- [Pembelajaran Mendalam dan Dapat Dipahami versus Rekayasa Perangkat Lunak dan Verifikasi oleh Peter Norvig](https://www.youtube.com/watch?v=X769cyzBNVw)
|
||||||
- [ ] [Google's Cloud Machine learning tools (video)](https://www.youtube.com/watch?v=Ja2hxBAwG_0)
|
- [Alat pembelajaran Mesin Cloud Google (video)](https://www.youtube.com/watch?v=Ja2hxBAwG_0)
|
||||||
- [ ] [Google Developers' Machine Learning Recipes (Scikit Learn & Tensorflow) (video)](https://www.youtube.com/playlist?list=PLOU2XLYxmsIIuiBfYad6rFYQU_jL2ryal)
|
- [Resep Pembelajaran Mesin Google Developers (Scikit Learn & Tensorflow) (video)](https://www.youtube.com/playlist?list=PLOU2XLYxmsIIuiBfYad6rFYQU_jL2ryal)
|
||||||
- [ ] [Tensorflow (video)](https://www.youtube.com/watch?v=oZikw5k_2FM)
|
- [Tensorflow (video)](https://www.youtube.com/watch?v=oZikw5k_2FM)
|
||||||
- [ ] [Tensorflow Tutorials](https://www.tensorflow.org/versions/r0.11/tutorials/index.html)
|
- [Tutorial Tensorflow](https://www.tensorflow.org/versions/r0.11/tutorials/index.html)
|
||||||
- [ ] [Practical Guide to implementing Neural Networks in Python (using Theano)](http://www.analyticsvidhya.com/blog/2016/04/neural-networks-python-theano/)
|
- [Panduan Praktis untuk mengimplementasikan Jaringan Neural dengan Python (menggunakan Theano)](http://www.analyticsvidhya.com/blog/2016/04/neural-networks-python-theano/)
|
||||||
- Courses:
|
- Kursus:
|
||||||
- [Great starter course: Machine Learning](https://www.coursera.org/learn/machine-learning)
|
- [Kursus pemula yang bagus: Pembelajaran Mesin](https://www.coursera.org/learn/machine-learning)
|
||||||
- [videos only](https://www.youtube.com/playlist?list=PLZ9qNFMHZ-A4rycgrgOYma6zxF4BZGGPW)
|
- [video saja](https://www.youtube.com/playlist?list=PLZ9qNFMHZ-A4rycgrgOYma6zxF4BZGGPW)
|
||||||
- see videos 12-18 for a review of linear algebra (14 and 15 are duplicates)
|
- lihat video 12-18 untuk review aljabar linier (14 dan 15 adalah duplikat)
|
||||||
- [Neural Networks for Machine Learning](https://www.coursera.org/learn/neural-networks)
|
- [Jaringan Neural untuk Pembelajaran Mesin](https://www.coursera.org/learn/neural-networks)
|
||||||
- [Google's Deep Learning Nanodegree](https://www.udacity.com/course/deep-learning--ud730)
|
- [Nanodegree Deep Learning Google](https://www.udacity.com/course/deep-learning--ud730)
|
||||||
- [Google/Kaggle Machine Learning Engineer Nanodegree](https://www.udacity.com/course/machine-learning-engineer-nanodegree-by-google--nd009)
|
- [Nanodegree Machine Learning Engineer Google / Kaggle](https://www.udacity.com/course/machine-learning-engineer-nanodegree-by-google--nd009)
|
||||||
- [Self-Driving Car Engineer Nanodegree](https://www.udacity.com/drive)
|
- [Nanodegree, Insinyur Mobil Mengemudi Mandiri](https://www.udacity.com/drive)
|
||||||
- [Metis Online Course ($99 for 2 months)](http://www.thisismetis.com/explore-data-science)
|
- [Kursus Online Metis ($99 selama 2 bulan)](http://www.thisismetis.com/explore-data-science)
|
||||||
- Resources:
|
- Sumber:
|
||||||
- Books:
|
- Buku:
|
||||||
- [Python Machine Learning](https://www.amazon.com/Python-Machine-Learning-Sebastian-Raschka/dp/1783555130/)
|
- [Pembelajaran Mesin Python](https://www.amazon.com/Python-Machine-Learning-Sebastian-Raschka/dp/1783555130/)
|
||||||
- [Data Science from Scratch: First Principles with Python](https://www.amazon.com/Data-Science-Scratch-Principles-Python/dp/149190142X)
|
- [Ilmu Data dari Awal: Prinsip Pertama dengan Python](https://www.amazon.com/Data-Science-Scratch-Principles-Python/dp/149190142X)
|
||||||
- [Introduction to Machine Learning with Python](https://www.amazon.com/Introduction-Machine-Learning-Python-Scientists/dp/1449369413/)
|
- [Pengantar Machine Learning dengan Python](https://www.amazon.com/Introduction-Machine-Learning-Python-Scientists/dp/1449369413/)
|
||||||
- [Machine Learning for Software Engineers](https://github.com/ZuzooVn/machine-learning-for-software-engineers)
|
- [Pembelajaran Mesin untuk Insinyur Perangkat Lunak](https://github.com/ZuzooVn/machine-learning-for-software-engineers)
|
||||||
- Data School: http://www.dataschool.io/
|
- Data School: http://www.dataschool.io/
|
||||||
|
|
||||||
- ### Go
|
|
||||||
- [ ] Videos:
|
|
||||||
- [ ] [Why Learn Go?](https://www.youtube.com/watch?v=FTl0tl9BGdc)
|
|
||||||
- [ ] [Go Programming](https://www.youtube.com/watch?v=CF9S4QZuV30)
|
|
||||||
- [ ] [A Tour of Go](https://www.youtube.com/watch?v=ytEkHepK08c)
|
|
||||||
- [ ] Books:
|
|
||||||
- [ ] [An Introduction to Programming in Go (read free online)](https://www.golang-book.com/books/intro)
|
|
||||||
- [ ] [The Go Programming Language (Donovan & Kernighan)](https://www.amazon.com/Programming-Language-Addison-Wesley-Professional-Computing/dp/0134190440)
|
|
||||||
- [ ] [Bootcamp](https://www.golang-book.com/guides/bootcamp)
|
|
||||||
|
|
||||||
--
|
--
|
||||||
|
|
||||||
## Detail Tambahan tentang Beberapa Subjek
|
## Detail Tambahan tentang Beberapa Subjek
|
||||||
|
|||||||
Loading…
x
Reference in New Issue
Block a user