diff --git a/src/data/roadmaps/computer-science/content/2-3-4-trees@IaPd_zuLbiOCwoSHQLoIG.md b/src/data/roadmaps/computer-science/content/2-3-4-trees@IaPd_zuLbiOCwoSHQLoIG.md new file mode 100644 index 000000000..41a4099fa --- /dev/null +++ b/src/data/roadmaps/computer-science/content/2-3-4-trees@IaPd_zuLbiOCwoSHQLoIG.md @@ -0,0 +1,9 @@ +# 2-3-4 Search Trees + +In practice: For every 2-4 tree, there are corresponding red–black trees with data elements in the same order. The insertion and deletion operations on 2-4 trees are also equivalent to color-flipping and rotations in red–black trees. This makes 2-4 trees an important tool for understanding the logic behind red–black trees, and this is why many introductory algorithm texts introduce 2-4 trees just before red–black trees, even though 2-4 trees are not often used in practice. + +Visit the following resources to learn more: + +- [@article@CS 61B Lecture 26: Balanced Search Trees](https://archive.org/details/ucberkeley_webcast_zqrqYXkth6Q) +- [@video@Bottom Up 234-Trees](https://www.youtube.com/watch?v=DQdMYevEyE4&index=4&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6) +- [@video@Top Down 234-Trees](https://www.youtube.com/watch?v=2679VQ26Fp4&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6&index=5) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/a-algorithm@Yrk2PLUa-_FAPlhCkMl3e.md b/src/data/roadmaps/computer-science/content/a-algorithm@Yrk2PLUa-_FAPlhCkMl3e.md index 22f530025..67047c05b 100644 --- a/src/data/roadmaps/computer-science/content/a-algorithm@Yrk2PLUa-_FAPlhCkMl3e.md +++ b/src/data/roadmaps/computer-science/content/a-algorithm@Yrk2PLUa-_FAPlhCkMl3e.md @@ -1,9 +1,9 @@ -# A\* Algorithm +# A* Algorithm A\* is a graph traversal algorithm that is used to find the shortest path between two nodes in a graph. It is a modified version of Dijkstra's algorithm that uses heuristics to find the shortest path. It is used in pathfinding and graph traversal. Visit the following resources to learn more: -- [@article@A\* Search Algorithm - Wikipedia](https://en.wikipedia.org/wiki/A*_search_algorithm) -- [@video@A\* Pathfinding (E01: algorithm explanation)](https://www.youtube.com/watch?v=-L-WgKMFuhE) -- [@feed@Explore top posts about Data Science](https://app.daily.dev/tags/data-science?ref=roadmapsh) +- [@article@A* Search Algorithm - Wikipedia](https://en.wikipedia.org/wiki/A*_search_algorithm) +- [@video@A* Pathfinding (E01: algorithm explanation)](https://www.youtube.com/watch?v=-L-WgKMFuhE) +- [@feed@Explore top posts about Data Science](https://app.daily.dev/tags/data-science?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/acid-model@W5B-v-BFcCRmuN0L1m6PI.md b/src/data/roadmaps/computer-science/content/acid-model@W5B-v-BFcCRmuN0L1m6PI.md index b1581e2cb..45925f162 100644 --- a/src/data/roadmaps/computer-science/content/acid-model@W5B-v-BFcCRmuN0L1m6PI.md +++ b/src/data/roadmaps/computer-science/content/acid-model@W5B-v-BFcCRmuN0L1m6PI.md @@ -6,4 +6,4 @@ Visit the following resources to learn more: - [@article@What is ACID Compliant Database?](https://retool.com/blog/whats-an-acid-compliant-database/) - [@article@What is ACID Compliance?: Atomicity, Consistency, Isolation](https://fauna.com/blog/what-is-acid-compliance-atomicity-consistency-isolation) -- [@video@ACID Explained: Atomic, Consistent, Isolated & Durable](https://www.youtube.com/watch?v=yaQ5YMWkxq4) +- [@video@ACID Explained: Atomic, Consistent, Isolated & Durable](https://www.youtube.com/watch?v=yaQ5YMWkxq4) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/activity-diagrams@ptfRNiU0mC0Q5SLA_FWZu.md b/src/data/roadmaps/computer-science/content/activity-diagrams@ptfRNiU0mC0Q5SLA_FWZu.md index 4491c6422..64b561873 100644 --- a/src/data/roadmaps/computer-science/content/activity-diagrams@ptfRNiU0mC0Q5SLA_FWZu.md +++ b/src/data/roadmaps/computer-science/content/activity-diagrams@ptfRNiU0mC0Q5SLA_FWZu.md @@ -5,4 +5,4 @@ Activity diagrams are used to model the flow of control in a system. They are us Visit the following resources to learn more: - [@article@UML Activity Diagram Tutorial](https://www.lucidchart.com/pages/uml-activity-diagram) -- [@article@What is Activity Diagram?](https://www.visual-paradigm.com/guide/uml-unified-modeling-language/what-is-activity-diagram/) +- [@article@What is Activity Diagram?](https://www.visual-paradigm.com/guide/uml-unified-modeling-language/what-is-activity-diagram/) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/adjacency-list@rTnKJcPniUtqvfOyC88N0.md b/src/data/roadmaps/computer-science/content/adjacency-list@rTnKJcPniUtqvfOyC88N0.md index f19a95d0a..3cee5789f 100644 --- a/src/data/roadmaps/computer-science/content/adjacency-list@rTnKJcPniUtqvfOyC88N0.md +++ b/src/data/roadmaps/computer-science/content/adjacency-list@rTnKJcPniUtqvfOyC88N0.md @@ -9,4 +9,4 @@ Adjacency list is an array of vectors. Size of the array is equal to the number Visit the following resources to learn more: - [@article@Adjacency Matrix - Graph Representation](https://www.programiz.com/dsa/graph-adjacency-matrix) -- [@article@Adjacency List - Graph Representation](https://www.programiz.com/dsa/graph-adjacency-list) +- [@article@Adjacency List - Graph Representation](https://www.programiz.com/dsa/graph-adjacency-list) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/architectural-patterns@BGhJNtszbYJtKyhqr2jax.md b/src/data/roadmaps/computer-science/content/architectural-patterns@BGhJNtszbYJtKyhqr2jax.md index 04af91a85..b09039f60 100644 --- a/src/data/roadmaps/computer-science/content/architectural-patterns@BGhJNtszbYJtKyhqr2jax.md +++ b/src/data/roadmaps/computer-science/content/architectural-patterns@BGhJNtszbYJtKyhqr2jax.md @@ -5,4 +5,4 @@ Architectural patterns are a high-level design pattern that focuses on the overa Visit the following resources to learn more: - [@article@10 Common Software Architectural Patterns in a nutshell](https://towardsdatascience.com/10-common-software-architectural-patterns-in-a-nutshell-a0b47a1e9013) -- [@article@Architectural Pattern - Wikipedia](https://en.wikipedia.org/wiki/Architectural_pattern) +- [@article@Architectural Pattern - Wikipedia](https://en.wikipedia.org/wiki/Architectural_pattern) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/architectural-styles@X1wv7xV69IEzepg8bF8oZ.md b/src/data/roadmaps/computer-science/content/architectural-styles@X1wv7xV69IEzepg8bF8oZ.md index 7f7499730..a09e71e59 100644 --- a/src/data/roadmaps/computer-science/content/architectural-styles@X1wv7xV69IEzepg8bF8oZ.md +++ b/src/data/roadmaps/computer-science/content/architectural-styles@X1wv7xV69IEzepg8bF8oZ.md @@ -4,4 +4,4 @@ Architectural patterns are the fundamental organization of a system, defining ho Visit the following resources to learn more: -- [@article@List of Software Architecture Styles and Patterns](https://en.wikipedia.org/wiki/List_of_software_architecture_styles_and_patterns) +- [@article@List of Software Architecture Styles and Patterns](https://en.wikipedia.org/wiki/List_of_software_architecture_styles_and_patterns) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/array@TwW6SO2IXqkxJXVjLzdwU.md b/src/data/roadmaps/computer-science/content/array@TwW6SO2IXqkxJXVjLzdwU.md index c7bd34938..fecf700ef 100644 --- a/src/data/roadmaps/computer-science/content/array@TwW6SO2IXqkxJXVjLzdwU.md +++ b/src/data/roadmaps/computer-science/content/array@TwW6SO2IXqkxJXVjLzdwU.md @@ -4,10 +4,10 @@ Arrays store elements in contiguous memory locations, resulting in easily calcul Visit the following resources to learn more: +- [@course@Array Data Structure - Coursera](https://www.coursera.org/lecture/data-structures/arrays-OsBSF) - [@article@What is Array in Data Structure? Types & Syntax](https://www.simplilearn.com/tutorials/data-structure-tutorial/arrays-in-data-structure) - [@video@Array Data Structure | Illustrated Data Structures](https://www.youtube.com/watch?v=QJNwK2uJyGs) - [@video@Jagged Arrays](https://www.youtube.com/watch?v=1jtrQqYpt7g) - [@video@Dynamic and Static Arrays](https://www.youtube.com/watch?v=PEnFFiQe1pM&list=PLDV1Zeh2NRsB6SWUrDFW2RmDotAfPbeHu&index=6) - [@video@Dynamic Array Code](https://www.youtube.com/watch?v=tvw4v7FEF1w&list=PLDV1Zeh2NRsB6SWUrDFW2RmDotAfPbeHu&index=5) -- [@video@UC Berkeley CS61B - Linear and Multi-Dim Arrays (Start watching from 15m 32s)](https://archive.org/details/ucberkeley_webcast_Wp8oiO_CZZE) -- [@course@Array Data Structure - Coursera](https://www.coursera.org/lecture/data-structures/arrays-OsBSF) +- [@video@UC Berkeley CS61B - Linear and Multi-Dim Arrays (Start watching from 15m 32s)](https://archive.org/details/ucberkeley_webcast_Wp8oiO_CZZE) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/ascii@hmwsNp60alS43kJg4A_Og.md b/src/data/roadmaps/computer-science/content/ascii@hmwsNp60alS43kJg4A_Og.md index c41df140d..d1e801af5 100644 --- a/src/data/roadmaps/computer-science/content/ascii@hmwsNp60alS43kJg4A_Og.md +++ b/src/data/roadmaps/computer-science/content/ascii@hmwsNp60alS43kJg4A_Og.md @@ -5,4 +5,4 @@ ASCII is a character encoding standard for electronic communication. It was deve Visit the following resources to learn more: - [@article@Must Know about Character Encodings](https://www.joelonsoftware.com/2003/10/08/the-absolute-minimum-every-software-developer-absolutely-positively-must-know-about-unicode-and-character-sets-no-excuses/) -- [@article@Character Encoding](https://cs.lmu.edu/~ray/notes/charenc/) +- [@article@Character Encoding](https://cs.lmu.edu/~ray/notes/charenc/) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/asymptotic-notation@UpBrpmrUwYUB9eesNxCq5.md b/src/data/roadmaps/computer-science/content/asymptotic-notation@UpBrpmrUwYUB9eesNxCq5.md index 34eca7e92..d24d667dd 100644 --- a/src/data/roadmaps/computer-science/content/asymptotic-notation@UpBrpmrUwYUB9eesNxCq5.md +++ b/src/data/roadmaps/computer-science/content/asymptotic-notation@UpBrpmrUwYUB9eesNxCq5.md @@ -9,9 +9,9 @@ The study of change in performance of the algorithm with the change in the order Visit the following resources to learn more: - [@article@Asymptotic Analysis: Big-O Notation and More](https://www.programiz.com/dsa/asymptotic-notations) +- [@article@Big-O Cheat Sheet](https://www.bigocheatsheet.com/) +- [@article@Big O Notation | Brilliant Math & Science Wiki](https://brilliant.org/wiki/big-o-notation/) - [@video@Big O Notation — Calculating Time Complexity](https://www.youtube.com/watch?v=Z0bH0cMY0E8) - [@video@Big O Notation in 5 Minutes](https://www.youtube.com/watch?v=__vX2sjlpXU) - [@video@Asymptotic Notation - CS50](https://www.youtube.com/watch?v=iOq5kSKqeR4) -- [@video@CS 61B Lecture 19: Asymptotic Analysis](https://archive.org/details/ucberkeley_webcast_VIS4YDpuP98) -- [@article@Big-O Cheat Sheet](https://www.bigocheatsheet.com/) -- [@article@Big O Notation | Brilliant Math & Science Wiki](https://brilliant.org/wiki/big-o-notation/) +- [@video@CS 61B Lecture 19: Asymptotic Analysis](https://archive.org/details/ucberkeley_webcast_VIS4YDpuP98) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/avl-trees@OUistS7H7hQQxVV-lOg39.md b/src/data/roadmaps/computer-science/content/avl-trees@OUistS7H7hQQxVV-lOg39.md index dd527b435..aed497290 100644 --- a/src/data/roadmaps/computer-science/content/avl-trees@OUistS7H7hQQxVV-lOg39.md +++ b/src/data/roadmaps/computer-science/content/avl-trees@OUistS7H7hQQxVV-lOg39.md @@ -6,8 +6,8 @@ In practice: From what I can tell, these aren't used much in practice, but I cou Visit the following resources to learn more: -- [@article@AVL Tree - Programiz](https://www.programiz.com/dsa/avl-tree) -- [@video@MIT AVL Trees / AVL Sort](https://www.youtube.com/watch?v=FNeL18KsWPc&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=6) - [@course@AVL Trees](https://www.coursera.org/learn/data-structures/lecture/Qq5E0/avl-trees) - [@course@AVL Tree Implementation](https://www.coursera.org/learn/data-structures/lecture/PKEBC/avl-tree-implementation) - [@course@Split And Merge](https://www.coursera.org/learn/data-structures/lecture/22BgE/split-and-merge) +- [@article@AVL Tree - Programiz](https://www.programiz.com/dsa/avl-tree) +- [@video@MIT AVL Trees / AVL Sort](https://www.youtube.com/watch?v=FNeL18KsWPc&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=6) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/b-tree@s0Pi6CemUUsmZSEu2j2gH.md b/src/data/roadmaps/computer-science/content/b-tree@s0Pi6CemUUsmZSEu2j2gH.md index 45e3dd912..b348867fd 100644 --- a/src/data/roadmaps/computer-science/content/b-tree@s0Pi6CemUUsmZSEu2j2gH.md +++ b/src/data/roadmaps/computer-science/content/b-tree@s0Pi6CemUUsmZSEu2j2gH.md @@ -11,4 +11,4 @@ Visit the following resources to learn more: - [@video@Introduction to B-Trees](https://www.youtube.com/watch?v=I22wEC1tTGo&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6&index=6) - [@video@B-Tree Definition and Insertion](https://www.youtube.com/watch?v=s3bCdZGrgpA&index=7&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6) - [@video@B-Tree Deletion](https://www.youtube.com/watch?v=svfnVhJOfMc&index=8&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6) -- [@video@B-Trees (playlist) in 26 minutes](https://www.youtube.com/playlist?list=PL9xmBV_5YoZNFPPv98DjTdD9X6UI9KMHz) +- [@video@B-Trees (playlist) in 26 minutes](https://www.youtube.com/playlist?list=PL9xmBV_5YoZNFPPv98DjTdD9X6UI9KMHz) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/balanced-search-trees@7DF3UhefOSqqTuccH8c8X.md b/src/data/roadmaps/computer-science/content/balanced-search-trees@7DF3UhefOSqqTuccH8c8X.md index a05329b4a..a58ec6c44 100644 --- a/src/data/roadmaps/computer-science/content/balanced-search-trees@7DF3UhefOSqqTuccH8c8X.md +++ b/src/data/roadmaps/computer-science/content/balanced-search-trees@7DF3UhefOSqqTuccH8c8X.md @@ -6,4 +6,4 @@ Visit the following resources to learn more: - [@article@Self-balancing Binary Search Tree - Wikipedia](https://en.wikipedia.org/wiki/Self-balancing_binary_search_tree) - [@video@Balanced Search Trees Operations and Applications 11 min](https://www.youtube.com/watch?v=IbNZ-x1I2IM) -- [@video@Balanced binary search tree rotations](https://www.youtube.com/watch?v=q4fnJZr8ztY) +- [@video@Balanced binary search tree rotations](https://www.youtube.com/watch?v=q4fnJZr8ztY) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/balanced-tree@ZaWGLvZyu4sIPn-zwVISN.md b/src/data/roadmaps/computer-science/content/balanced-tree@ZaWGLvZyu4sIPn-zwVISN.md index 63da28dcc..9cc6dea37 100644 --- a/src/data/roadmaps/computer-science/content/balanced-tree@ZaWGLvZyu4sIPn-zwVISN.md +++ b/src/data/roadmaps/computer-science/content/balanced-tree@ZaWGLvZyu4sIPn-zwVISN.md @@ -4,4 +4,4 @@ A balanced binary tree, also referred to as a height-balanced binary tree, is de Visit the following resources to learn more: -- [@article@Balanced Binary Tree](https://www.programiz.com/dsa/balanced-binary-tree) +- [@article@Balanced Binary Tree](https://www.programiz.com/dsa/balanced-binary-tree) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/base@q3nRhTYS5wg9tYnQe2sCF.md b/src/data/roadmaps/computer-science/content/base@q3nRhTYS5wg9tYnQe2sCF.md index 7f869e8b6..8e2685c63 100644 --- a/src/data/roadmaps/computer-science/content/base@q3nRhTYS5wg9tYnQe2sCF.md +++ b/src/data/roadmaps/computer-science/content/base@q3nRhTYS5wg9tYnQe2sCF.md @@ -2,9 +2,9 @@ The rise in popularity of NoSQL databases provided a flexible and fluidity with ease to manipulate data and as a result, a new database model was designed, reflecting these properties. The acronym BASE is slightly more confusing than ACID but however, the words behind it suggest ways in which the BASE model is different and acronym BASE stands for:- -- **B**asically **A**vailable -- **S**oft state -- **E**ventual consistency +* **B**asically **A**vailable +* **S**oft state +* **E**ventual consistency Visit the following resources to learn more: diff --git a/src/data/roadmaps/computer-science/content/basic-math-skills@cdNi0EYrQ5nsgNxFVnXL8.md b/src/data/roadmaps/computer-science/content/basic-math-skills@cdNi0EYrQ5nsgNxFVnXL8.md index 939460a7e..fc524919c 100644 --- a/src/data/roadmaps/computer-science/content/basic-math-skills@cdNi0EYrQ5nsgNxFVnXL8.md +++ b/src/data/roadmaps/computer-science/content/basic-math-skills@cdNi0EYrQ5nsgNxFVnXL8.md @@ -4,18 +4,18 @@ Math is a fundamental skill for computer science. Visit the following resources to learn more: -- [@video@Lec 1 | MIT 6.042J Mathematics for Computer Science, Fall 2010](https://www.youtube.com/watch?v=L3LMbpZIKhQ\&list=PLB7540DEDD482705B) -- [@video@Integer Arithmetic, Karatsuba Multiplication](https://www.youtube.com/watch?v=eCaXlAaN2uE\&index=11\&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) -- [@video@The Chinese Remainder Theorem (used in cryptography)](https://www.youtube.com/watch?v=ru7mWZJlRQg) - [@article@Computer Science 70, 001 - Spring 2015 - Discrete Mathematics and Probability Theory](http://www.infocobuild.com/education/audio-video-courses/computer-science/cs70-spring2015-berkeley.html) -- [@video@Discrete Mathematics by Shai Simonson (19 videos)](https://www.youtube.com/playlist?list=PLWX710qNZo_sNlSWRMVIh6kfTjolNaZ8t) - [@article@Discrete Mathematics By IIT Ropar NPTEL](https://nptel.ac.in/courses/106/106/106106183/) -- [@video@MIT 6.042J - Probability Introduction](https://www.youtube.com/watch?v=SmFwFdESMHI\&index=18\&list=PLB7540DEDD482705B) -- [@video@MIT 6.042J - Conditional Probability](https://www.youtube.com/watch?v=E6FbvM-FGZ8\&index=19\&list=PLB7540DEDD482705B) -- [@video@MIT 6.042J - Independence](https://www.youtube.com/watch?v=l1BCv3qqW4A\&index=20\&list=PLB7540DEDD482705B) -- [@video@MIT 6.042J - Random Variables](https://www.youtube.com/watch?v=MOfhhFaQdjw\&list=PLB7540DEDD482705B\&index=21) -- [@video@MIT 6.042J - Expectation I](https://www.youtube.com/watch?v=gGlMSe7uEkA\&index=22\&list=PLB7540DEDD482705B) -- [@video@MIT 6.042J - Expectation II](https://www.youtube.com/watch?v=oI9fMUqgfxY\&index=23\&list=PLB7540DEDD482705B) -- [@video@MIT 6.042J - Large Deviations](https://www.youtube.com/watch?v=q4mwO2qS2z4\&index=24\&list=PLB7540DEDD482705B) -- [@video@MIT 6.042J - Random Walks](https://www.youtube.com/watch?v=56iFMY8QW2k\&list=PLB7540DEDD482705B\&index=25) -- [@feed@Explore top posts about Math](https://app.daily.dev/tags/math?ref=roadmapsh) +- [@video@Lec 1 | MIT 6.042J Mathematics for Computer Science, Fall 2010](https://www.youtube.com/watch?v=L3LMbpZIKhQ&list=PLB7540DEDD482705B) +- [@video@Integer Arithmetic, Karatsuba Multiplication](https://www.youtube.com/watch?v=eCaXlAaN2uE&index=11&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) +- [@video@The Chinese Remainder Theorem (used in cryptography)](https://www.youtube.com/watch?v=ru7mWZJlRQg) +- [@video@Discrete Mathematics by Shai Simonson (19 videos)](https://www.youtube.com/playlist?list=PLWX710qNZo_sNlSWRMVIh6kfTjolNaZ8t) +- [@video@MIT 6.042J - Probability Introduction](https://www.youtube.com/watch?v=SmFwFdESMHI&index=18&list=PLB7540DEDD482705B) +- [@video@MIT 6.042J - Conditional Probability](https://www.youtube.com/watch?v=E6FbvM-FGZ8&index=19&list=PLB7540DEDD482705B) +- [@video@MIT 6.042J - Independence](https://www.youtube.com/watch?v=l1BCv3qqW4A&index=20&list=PLB7540DEDD482705B) +- [@video@MIT 6.042J - Random Variables](https://www.youtube.com/watch?v=MOfhhFaQdjw&list=PLB7540DEDD482705B&index=21) +- [@video@MIT 6.042J - Expectation I](https://www.youtube.com/watch?v=gGlMSe7uEkA&index=22&list=PLB7540DEDD482705B) +- [@video@MIT 6.042J - Expectation II](https://www.youtube.com/watch?v=oI9fMUqgfxY&index=23&list=PLB7540DEDD482705B) +- [@video@MIT 6.042J - Large Deviations](https://www.youtube.com/watch?v=q4mwO2qS2z4&index=24&list=PLB7540DEDD482705B) +- [@video@MIT 6.042J - Random Walks](https://www.youtube.com/watch?v=56iFMY8QW2k&list=PLB7540DEDD482705B&index=25) +- [@feed@Explore top posts about Math](https://app.daily.dev/tags/math?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/bellman-fords-algorithm@eY4nK2lPYsrR-a_8y2sao.md b/src/data/roadmaps/computer-science/content/bellman-fords-algorithm@eY4nK2lPYsrR-a_8y2sao.md index 9af13b9c6..1dfe34a46 100644 --- a/src/data/roadmaps/computer-science/content/bellman-fords-algorithm@eY4nK2lPYsrR-a_8y2sao.md +++ b/src/data/roadmaps/computer-science/content/bellman-fords-algorithm@eY4nK2lPYsrR-a_8y2sao.md @@ -4,6 +4,6 @@ Bellman ford's algorithm is a graph algorithm that finds the shortest path from Visit the following resources to learn more: -- [@video@Bellman-Ford - MIT](https://www.youtube.com/watch?v=f9cVS_URPc0\&ab_channel=MITOpenCourseWare) +- [@video@Bellman-Ford - MIT](https://www.youtube.com/watch?v=f9cVS_URPc0&ab_channel=MITOpenCourseWare) - [@video@Bellman-Ford in 4 Minutes](https://www.youtube.com/watch?v=9PHkk0UavIM) -- [@feed@Explore top posts about Data Science](https://app.daily.dev/tags/data-science?ref=roadmapsh) +- [@feed@Explore top posts about Data Science](https://app.daily.dev/tags/data-science?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/big-endian@U8AgY6I-62mN5Ohg9MsG6.md b/src/data/roadmaps/computer-science/content/big-endian@U8AgY6I-62mN5Ohg9MsG6.md index 99b3f1ee2..a024a16a8 100644 --- a/src/data/roadmaps/computer-science/content/big-endian@U8AgY6I-62mN5Ohg9MsG6.md +++ b/src/data/roadmaps/computer-science/content/big-endian@U8AgY6I-62mN5Ohg9MsG6.md @@ -4,4 +4,4 @@ Big endian is the most common type of endianness. In this type, the most signifi Visit the following resources to learn more: -- [@video@Lecture 22. Big Endian and Little Endian](https://www.youtube.com/watch?v=T1C9Kj_78ek) +- [@video@Lecture 22. Big Endian and Little Endian](https://www.youtube.com/watch?v=T1C9Kj_78ek) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/big-o@c-NrTtJuNihbHzyPEOKTW.md b/src/data/roadmaps/computer-science/content/big-o@c-NrTtJuNihbHzyPEOKTW.md index 4fa321a1c..11052a591 100644 --- a/src/data/roadmaps/computer-science/content/big-o@c-NrTtJuNihbHzyPEOKTW.md +++ b/src/data/roadmaps/computer-science/content/big-o@c-NrTtJuNihbHzyPEOKTW.md @@ -9,4 +9,4 @@ Visit the following resources to learn more: - [@article@Big O Notation | Brilliant Math & Science Wiki](https://brilliant.org/wiki/big-o-notation/) - [@video@Big O Notation — Calculating Time Complexity](https://www.youtube.com/watch?v=Z0bH0cMY0E8) - [@video@Big O Notations](https://www.youtube.com/watch?v=V6mKVRU1evU) -- [@video@Big Oh Notation (and Omega and Theta)](https://www.youtube.com/watch?v=ei-A_wy5Yxw&list=PL1BaGV1cIH4UhkL8a9bJGG356covJ76qN&index=3) +- [@video@Big Oh Notation (and Omega and Theta)](https://www.youtube.com/watch?v=ei-A_wy5Yxw&list=PL1BaGV1cIH4UhkL8a9bJGG356covJ76qN&index=3) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/big-omega@X33735aeAVSlJ6yv9GS-h.md b/src/data/roadmaps/computer-science/content/big-omega@X33735aeAVSlJ6yv9GS-h.md index b2bb367e5..75f74a907 100644 --- a/src/data/roadmaps/computer-science/content/big-omega@X33735aeAVSlJ6yv9GS-h.md +++ b/src/data/roadmaps/computer-science/content/big-omega@X33735aeAVSlJ6yv9GS-h.md @@ -4,6 +4,6 @@ The Big Omega notation is similar to the Big O notation. The only difference is Visit the following resources to learn more: -- [@video@Big Oh Notation (and Omega and Theta)](https://www.youtube.com/watch?v=ei-A_wy5Yxw&list=PL1BaGV1cIH4UhkL8a9bJGG356covJ76qN&index=3) -- [@video@Asymptotic Notation - CS50](https://www.youtube.com/watch?v=iOq5kSKqeR4) - [@article@Big O Notation | Brilliant Math & Science Wiki](https://brilliant.org/wiki/big-o-notation/) +- [@video@Big Oh Notation (and Omega and Theta)](https://www.youtube.com/watch?v=ei-A_wy5Yxw&list=PL1BaGV1cIH4UhkL8a9bJGG356covJ76qN&index=3) +- [@video@Asymptotic Notation - CS50](https://www.youtube.com/watch?v=iOq5kSKqeR4) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/big-theta@ThLpVZQIJ4diY5m0dik8m.md b/src/data/roadmaps/computer-science/content/big-theta@ThLpVZQIJ4diY5m0dik8m.md index 3dfbbc12d..53404f5d3 100644 --- a/src/data/roadmaps/computer-science/content/big-theta@ThLpVZQIJ4diY5m0dik8m.md +++ b/src/data/roadmaps/computer-science/content/big-theta@ThLpVZQIJ4diY5m0dik8m.md @@ -4,6 +4,6 @@ If a function has the same Big O and Big Omega, they also become the function's Visit the following resources to learn more: -- [@video@Big Oh Notation (and Omega and Theta)](https://www.youtube.com/watch?v=ei-A_wy5Yxw&list=PL1BaGV1cIH4UhkL8a9bJGG356covJ76qN&index=3) -- [@video@Asymptotic Notation - CS50](https://www.youtube.com/watch?v=iOq5kSKqeR4) - [@article@Big O Notation | Brilliant Math & Science Wiki](https://brilliant.org/wiki/big-o-notation/) +- [@video@Big Oh Notation (and Omega and Theta)](https://www.youtube.com/watch?v=ei-A_wy5Yxw&list=PL1BaGV1cIH4UhkL8a9bJGG356covJ76qN&index=3) +- [@video@Asymptotic Notation - CS50](https://www.youtube.com/watch?v=iOq5kSKqeR4) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/binary-search-tree@et7l85gnxjvzD2tDyHT_T.md b/src/data/roadmaps/computer-science/content/binary-search-tree@et7l85gnxjvzD2tDyHT_T.md index b8950f47f..21317953d 100644 --- a/src/data/roadmaps/computer-science/content/binary-search-tree@et7l85gnxjvzD2tDyHT_T.md +++ b/src/data/roadmaps/computer-science/content/binary-search-tree@et7l85gnxjvzD2tDyHT_T.md @@ -4,13 +4,13 @@ A binary search tree, also called an ordered or sorted binary tree, is a rooted Visit the following resources to learn more: -- [@video@Tree | Illustrated Data Structures](https://www.youtube.com/watch?v=S2W3SXGPVyU) - [@course@Binary Search Trees - Coursera](https://www.coursera.org/learn/data-structures/lecture/E7cXP/introduction) +- [@video@Tree | Illustrated Data Structures](https://www.youtube.com/watch?v=S2W3SXGPVyU) - [@video@Binary Search Trees - MIT](https://www.youtube.com/watch?v=76dhtgZt38A) -- [@video@Binary Search Tree Implementation in C++](https://www.youtube.com/watch?v=COZK7NATh4k\&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P\&index=29) -- [@video@BST implementation - memory allocation in stack and heap](https://www.youtube.com/watch?v=hWokyBoo0aI\&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P\&index=30) -- [@video@Find Min and Max Element in Binary Search Tree](https://www.youtube.com/watch?v=Ut90klNN264\&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P\&index=31) -- [@video@Check if Given Tree is Binary Search Tree or Not](https://www.youtube.com/watch?v=yEwSGhSsT0U\&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P\&index=36) -- [@video@Delete an Element from Binary Search Tree](https://www.youtube.com/watch?v=gcULXE7ViZw\&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P\&index=37) -- [@video@Inorder Successor in a binary search tree](https://www.youtube.com/watch?v=5cPbNCrdotA\&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P\&index=38) -- [@feed@Explore top posts about General Programming](https://app.daily.dev/tags/general-programming?ref=roadmapsh) +- [@video@Binary Search Tree Implementation in C++](https://www.youtube.com/watch?v=COZK7NATh4k&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=29) +- [@video@BST implementation - memory allocation in stack and heap](https://www.youtube.com/watch?v=hWokyBoo0aI&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=30) +- [@video@Find Min and Max Element in Binary Search Tree](https://www.youtube.com/watch?v=Ut90klNN264&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=31) +- [@video@Check if Given Tree is Binary Search Tree or Not](https://www.youtube.com/watch?v=yEwSGhSsT0U&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=36) +- [@video@Delete an Element from Binary Search Tree](https://www.youtube.com/watch?v=gcULXE7ViZw&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=37) +- [@video@Inorder Successor in a binary search tree](https://www.youtube.com/watch?v=5cPbNCrdotA&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=38) +- [@feed@Explore top posts about General Programming](https://app.daily.dev/tags/general-programming?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/binary-search@8kTg4O9MrTHRUrp6U-ctA.md b/src/data/roadmaps/computer-science/content/binary-search@8kTg4O9MrTHRUrp6U-ctA.md index 377ef44e0..eb336edae 100644 --- a/src/data/roadmaps/computer-science/content/binary-search@8kTg4O9MrTHRUrp6U-ctA.md +++ b/src/data/roadmaps/computer-science/content/binary-search@8kTg4O9MrTHRUrp6U-ctA.md @@ -6,6 +6,6 @@ Visit the following resources to learn more: - [@article@Binary Search - Khan Academy](https://www.khanacademy.org/computing/computer-science/algorithms/binary-search/a/binary-search) - [@article@Binary Search](https://www.topcoder.com/thrive/articles/Binary%20Search) -- [@video@Binary Search in 4 Minutes](https://www.youtube.com/watch?v=fDKIpRe8GW4\&feature=youtu.be) +- [@video@Binary Search in 4 Minutes](https://www.youtube.com/watch?v=fDKIpRe8GW4&feature=youtu.be) - [@video@Binary Search - CS50](https://www.youtube.com/watch?v=D5SrAga1pno) -- [@feed@Explore top posts about Binary Search](https://app.daily.dev/tags/binary-search?ref=roadmapsh) +- [@feed@Explore top posts about Binary Search](https://app.daily.dev/tags/binary-search?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/binary-tree@G9dnegZ6zNvxrCZ3O_b_z.md b/src/data/roadmaps/computer-science/content/binary-tree@G9dnegZ6zNvxrCZ3O_b_z.md index d2ae9c509..c859d0558 100644 --- a/src/data/roadmaps/computer-science/content/binary-tree@G9dnegZ6zNvxrCZ3O_b_z.md +++ b/src/data/roadmaps/computer-science/content/binary-tree@G9dnegZ6zNvxrCZ3O_b_z.md @@ -4,6 +4,6 @@ A binary tree is a tree data structure in which each node has at most two childr Visit the following resources to learn more: -- [@video@Binary Trees - Part 1](https://www.youtube.com/watch?v=76dhtgZt38A\&list=PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY\&index=9) -- [@video@Binary Trees - Part 2](https://www.youtube.com/watch?v=U1JYwHcFfso\&list=PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY\&index=10) -- [@feed@Explore top posts about Binary Tree](https://app.daily.dev/tags/binary-tree?ref=roadmapsh) +- [@video@Binary Trees - Part 1](https://www.youtube.com/watch?v=76dhtgZt38A&list=PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY&index=9) +- [@video@Binary Trees - Part 2](https://www.youtube.com/watch?v=U1JYwHcFfso&list=PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY&index=10) +- [@feed@Explore top posts about Binary Tree](https://app.daily.dev/tags/binary-tree?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/bitwise-operators@hTPLcuOW7eEE5oYhNfmOG.md b/src/data/roadmaps/computer-science/content/bitwise-operators@hTPLcuOW7eEE5oYhNfmOG.md index bd4b78f4f..67711bf52 100644 --- a/src/data/roadmaps/computer-science/content/bitwise-operators@hTPLcuOW7eEE5oYhNfmOG.md +++ b/src/data/roadmaps/computer-science/content/bitwise-operators@hTPLcuOW7eEE5oYhNfmOG.md @@ -6,4 +6,4 @@ Visit the following resources to learn more: - [@video@Bit Manipulation](https://www.youtube.com/watch?v=7jkIUgLC29I) - [@video@Binary: Plusses & Minuses (Why We Use Twos Complement) - Computerphile](https://www.youtube.com/watch?v=lKTsv6iVxV4) -- [@video@Algorithms: Bit Manipulation](https://www.youtube.com/watch?v=NLKQEOgBAnw) +- [@video@Algorithms: Bit Manipulation](https://www.youtube.com/watch?v=NLKQEOgBAnw) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/boyer-moore@p6qub32jcaGloHXUDUrlG.md b/src/data/roadmaps/computer-science/content/boyer-moore@p6qub32jcaGloHXUDUrlG.md index 491dcf49e..898dc4d8b 100644 --- a/src/data/roadmaps/computer-science/content/boyer-moore@p6qub32jcaGloHXUDUrlG.md +++ b/src/data/roadmaps/computer-science/content/boyer-moore@p6qub32jcaGloHXUDUrlG.md @@ -4,5 +4,5 @@ Boyer Moore algorithm is a string searching algorithm that is used to find the i Visit the following resources to learn more: -- [@article@Boyer-Moore String-search Algorithm](https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm) - [@course@Boyer Moore Algorithm](https://www.coursera.org/learn/algorithms-part2/lecture/CYxOT/boyer-moore) +- [@article@Boyer-Moore String-search Algorithm](https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/breadth-first-search@Ke_ch4fnuKIiGAXUM_LPP.md b/src/data/roadmaps/computer-science/content/breadth-first-search@Ke_ch4fnuKIiGAXUM_LPP.md index 004de0676..1f4f9dda3 100644 --- a/src/data/roadmaps/computer-science/content/breadth-first-search@Ke_ch4fnuKIiGAXUM_LPP.md +++ b/src/data/roadmaps/computer-science/content/breadth-first-search@Ke_ch4fnuKIiGAXUM_LPP.md @@ -4,6 +4,6 @@ Breadth first search is a graph traversal algorithm that starts at the root node Visit the following resources to learn more: -- [@video@BFS and DFS in a Binary Tree](https://www.youtube.com/watch?v=uWL6FJhq5fM) - [@article@Breadth-First Search (BFS) and Depth-First Search (DFS) for Binary Trees in Java](https://www.digitalocean.com/community/tutorials/breadth-first-search-depth-first-search-bfs-dfs) -- [@video@Breadth-first search in 4 minutes](https://www.youtube.com/watch?v=HZ5YTanv5QE) +- [@video@BFS and DFS in a Binary Tree](https://www.youtube.com/watch?v=uWL6FJhq5fM) +- [@video@Breadth-first search in 4 minutes](https://www.youtube.com/watch?v=HZ5YTanv5QE) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/breadth-first-search@vcV6TEM_PqXxtThdfMKGw.md b/src/data/roadmaps/computer-science/content/breadth-first-search@vcV6TEM_PqXxtThdfMKGw.md index 0180f9cb3..c81f7239e 100644 --- a/src/data/roadmaps/computer-science/content/breadth-first-search@vcV6TEM_PqXxtThdfMKGw.md +++ b/src/data/roadmaps/computer-science/content/breadth-first-search@vcV6TEM_PqXxtThdfMKGw.md @@ -5,4 +5,4 @@ Breadth first search for a graph is a way to traverse the graph. It starts at th Visit the following resources to learn more: - [@video@Graph Algorithms II - DFS, BFS, Kruskals Algorithm, Union Find Data Structure - Lecture 7](https://www.youtube.com/watch?v=ufj5_bppBsA&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=7) -- [@video@Breadth-first search in 4 minutes](https://www.youtube.com/watch?v=HZ5YTanv5QE) +- [@video@Breadth-first search in 4 minutes](https://www.youtube.com/watch?v=HZ5YTanv5QE) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/brute-force-search@g3b0kt1fCAjjYyS2WelWi.md b/src/data/roadmaps/computer-science/content/brute-force-search@g3b0kt1fCAjjYyS2WelWi.md index 08f786106..b81cca6bf 100644 --- a/src/data/roadmaps/computer-science/content/brute-force-search@g3b0kt1fCAjjYyS2WelWi.md +++ b/src/data/roadmaps/computer-science/content/brute-force-search@g3b0kt1fCAjjYyS2WelWi.md @@ -4,6 +4,6 @@ Brute force search is a simple algorithm that checks for a pattern in a string b Visit the following resources to learn more: -- [@article@A Beginner Guide to Brute Force Algorithm for Substring Search](https://nulpointerexception.com/2019/02/10/a-beginner-guide-to-brute-force-algorithm-for-substring-search/) -- [@article@Brute Force Algorithm in Cybersecurity and String Search](https://www.baeldung.com/cs/brute-force-cybersecurity-string-search) - [@course@Brute-Force Substring Search](https://www.coursera.org/learn/algorithms-part2/lecture/2Kn5i/brute-force-substring-search) +- [@article@A Beginner Guide to Brute Force Algorithm for Substring Search](https://nulpointerexception.com/2019/02/10/a-beginner-guide-to-brute-force-algorithm-for-substring-search/) +- [@article@Brute Force Algorithm in Cybersecurity and String Search](https://www.baeldung.com/cs/brute-force-cybersecurity-string-search) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/bubble-sort@4wGBYFZpcdTt97WTbSazx.md b/src/data/roadmaps/computer-science/content/bubble-sort@4wGBYFZpcdTt97WTbSazx.md index d8259aece..bdce8e2b0 100644 --- a/src/data/roadmaps/computer-science/content/bubble-sort@4wGBYFZpcdTt97WTbSazx.md +++ b/src/data/roadmaps/computer-science/content/bubble-sort@4wGBYFZpcdTt97WTbSazx.md @@ -6,4 +6,4 @@ Visit the following resources to learn more: - [@article@Bubble Sort Algorithm](https://www.programiz.com/dsa/bubble-sort) - [@video@Bubble Sort](https://www.youtube.com/watch?v=P00xJgWzz2c&index=1&list=PL89B61F78B552C1AB) -- [@video@Bubble sort in 2 minutes](https://youtu.be/xli_FI7CuzA) +- [@video@Bubble sort in 2 minutes](https://youtu.be/xli_FI7CuzA) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/c@1kQJs-3Aw8Bi7d_Xh67zS.md b/src/data/roadmaps/computer-science/content/c@1kQJs-3Aw8Bi7d_Xh67zS.md index 2379ca5c0..94a4cba00 100644 --- a/src/data/roadmaps/computer-science/content/c@1kQJs-3Aw8Bi7d_Xh67zS.md +++ b/src/data/roadmaps/computer-science/content/c@1kQJs-3Aw8Bi7d_Xh67zS.md @@ -9,4 +9,4 @@ Visit the following resources to learn more: - [@article@Cpp Reference](https://en.cppreference.com/) - [@article@CPlusPlus](https://cplusplus.com/) - [@article@C++ TutorialsPoint](https://www.tutorialspoint.com/cplusplus/index.htm) -- [@feed@Explore top posts about C++ Programming](https://app.daily.dev/tags/c++?ref=roadmapsh) +- [@feed@Explore top posts about C++ Programming](https://app.daily.dev/tags/c++?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/c@jHKCLfLml8oZyj4829gx0.md b/src/data/roadmaps/computer-science/content/c@jHKCLfLml8oZyj4829gx0.md index 9e3782e88..e8985f144 100644 --- a/src/data/roadmaps/computer-science/content/c@jHKCLfLml8oZyj4829gx0.md +++ b/src/data/roadmaps/computer-science/content/c@jHKCLfLml8oZyj4829gx0.md @@ -1,4 +1,4 @@ -# C\# +# C# C# (pronounced "C sharp") is a general purpose programming language made by Microsoft. It is used to perform different tasks and can be used to create web apps, games, mobile apps, etc. @@ -6,5 +6,5 @@ Visit the following resources to learn more: - [@article@C# Learning Path](https://docs.microsoft.com/en-us/learn/paths/csharp-first-steps/?WT.mc_id=dotnet-35129-website) - [@article@Introduction to C#](https://docs.microsoft.com/en-us/shows/CSharp-101/?WT.mc_id=Educationalcsharp-c9-scottha) -- [@video@C# tutorials](https://www.youtube.com/watch?v=gfkTfcpWqAY\&list=PLTjRvDozrdlz3_FPXwb6lX_HoGXa09Yef) -- [@feed@Explore top posts about C# Programming](https://app.daily.dev/tags/csharp?ref=roadmapsh) +- [@video@C# tutorials](https://www.youtube.com/watch?v=gfkTfcpWqAY&list=PLTjRvDozrdlz3_FPXwb6lX_HoGXa09Yef) +- [@feed@Explore top posts about C# Programming](https://app.daily.dev/tags/csharp?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/c@n4IsklfYJXFIyF1rGWuEa.md b/src/data/roadmaps/computer-science/content/c@n4IsklfYJXFIyF1rGWuEa.md index 0184e28ca..53c199d33 100644 --- a/src/data/roadmaps/computer-science/content/c@n4IsklfYJXFIyF1rGWuEa.md +++ b/src/data/roadmaps/computer-science/content/c@n4IsklfYJXFIyF1rGWuEa.md @@ -4,9 +4,9 @@ C is a general-purpose computer programming language. It was created in the 1970 Visit the following resources to learn more: +- [@book@Beej's Guide to C Programming](https://beej.us/guide/bgc/) - [@article@Learn C - Tutorials Point](https://www.tutorialspoint.com/cprogramming/index.htm) - [@video@C Programming Tutorial for Beginners](https://www.youtube.com/watch?v=KJgsSFOSQv0) - [@video@Learn C Programming with Dr. Chuck](https://www.youtube.com/watch?v=j-_s8f5K30I) - [@video@C Programming Full Course (Bro Code)](https://youtu.be/87SH2Cn0s9A) -- [@book@Beej's Guide to C Programming](https://beej.us/guide/bgc/) -- [@feed@Explore top posts about C Programming](https://app.daily.dev/tags/c?ref=roadmapsh) +- [@feed@Explore top posts about C Programming](https://app.daily.dev/tags/c?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/caching@4u5w9QCptLWuY9O7_UU8V.md b/src/data/roadmaps/computer-science/content/caching@4u5w9QCptLWuY9O7_UU8V.md index 5c60ddfbc..aec33bbaf 100644 --- a/src/data/roadmaps/computer-science/content/caching@4u5w9QCptLWuY9O7_UU8V.md +++ b/src/data/roadmaps/computer-science/content/caching@4u5w9QCptLWuY9O7_UU8V.md @@ -5,4 +5,4 @@ Caching is a way of storing data in a temporary storage to make future requests Visit the following resources to learn more: - [@article@System Design - Caching](https://dev.to/karanpratapsingh/system-design-the-complete-course-10fo#caching) -- [@video@What is Caching | System Design Basics](https://www.youtube.com/watch?v=joifNgoXXFk) +- [@video@What is Caching | System Design Basics](https://www.youtube.com/watch?v=joifNgoXXFk) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/cap-theorem@GZI8EsEqiMJX3fSbO_E-7.md b/src/data/roadmaps/computer-science/content/cap-theorem@GZI8EsEqiMJX3fSbO_E-7.md index fda63011c..318424390 100644 --- a/src/data/roadmaps/computer-science/content/cap-theorem@GZI8EsEqiMJX3fSbO_E-7.md +++ b/src/data/roadmaps/computer-science/content/cap-theorem@GZI8EsEqiMJX3fSbO_E-7.md @@ -5,4 +5,4 @@ The CAP theorem states that it is impossible for a distributed data store to sim Visit the following resources to learn more: - [@article@CAP Theorem](https://en.wikipedia.org/wiki/CAP_theorem) -- [@video@What is CAP Theorem?](https://www.youtube.com/watch?v=_RbsFXWRZ10) +- [@video@What is CAP Theorem?](https://www.youtube.com/watch?v=_RbsFXWRZ10) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/cap-theorem@uqfeiQ9K--QkGNwks4kjk.md b/src/data/roadmaps/computer-science/content/cap-theorem@uqfeiQ9K--QkGNwks4kjk.md index c106e9587..00cef2d06 100644 --- a/src/data/roadmaps/computer-science/content/cap-theorem@uqfeiQ9K--QkGNwks4kjk.md +++ b/src/data/roadmaps/computer-science/content/cap-theorem@uqfeiQ9K--QkGNwks4kjk.md @@ -8,4 +8,4 @@ Visit the following resources to learn more: - [@article@CAP Theorem - Wikipedia](https://en.wikipedia.org/wiki/CAP_theorem) - [@article@An Illustrated Proof of the CAP Theorem](https://mwhittaker.github.io/blog/an_illustrated_proof_of_the_cap_theorem/) - [@article@CAP Theorem and its applications in NoSQL Databases](https://www.ibm.com/uk-en/cloud/learn/cap-theorem) -- [@video@What is CAP Theorem?](https://www.youtube.com/watch?v=_RbsFXWRZ10) +- [@video@What is CAP Theorem?](https://www.youtube.com/watch?v=_RbsFXWRZ10) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/cdn@r8V9bZpc98SrLvXc070bZ.md b/src/data/roadmaps/computer-science/content/cdn@r8V9bZpc98SrLvXc070bZ.md index 993306e91..4f78139bc 100644 --- a/src/data/roadmaps/computer-science/content/cdn@r8V9bZpc98SrLvXc070bZ.md +++ b/src/data/roadmaps/computer-science/content/cdn@r8V9bZpc98SrLvXc070bZ.md @@ -6,4 +6,4 @@ Visit the following resources to learn more: - [@article@What is a CDN?](https://www.cloudflare.com/learning/cdn/what-is-a-cdn/) - [@article@Content Delivery Network (CDN) - System Design](https://dev.to/karanpratapsingh/system-design-the-complete-course-10fo#content-delivery-network-cdn) -- [@video@Content Delivery Networks](https://www.youtube.com/watch?v=6DXEPcXKQNY) +- [@video@Content Delivery Networks](https://www.youtube.com/watch?v=6DXEPcXKQNY) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/character-encodings@DtG9EJonWi4_2oQ4fWOKY.md b/src/data/roadmaps/computer-science/content/character-encodings@DtG9EJonWi4_2oQ4fWOKY.md index fcd186e1a..29068287c 100644 --- a/src/data/roadmaps/computer-science/content/character-encodings@DtG9EJonWi4_2oQ4fWOKY.md +++ b/src/data/roadmaps/computer-science/content/character-encodings@DtG9EJonWi4_2oQ4fWOKY.md @@ -5,4 +5,4 @@ Character encodings are a way of representing characters as numbers. They are us Visit the following resources to learn more: - [@article@Must Know about Character Encodings](https://www.joelonsoftware.com/2003/10/08/the-absolute-minimum-every-software-developer-absolutely-positively-must-know-about-unicode-and-character-sets-no-excuses/) -- [@article@Character Encoding](https://cs.lmu.edu/~ray/notes/charenc/) +- [@article@Character Encoding](https://cs.lmu.edu/~ray/notes/charenc/) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/class-diagrams@FZ8znJSz8PvQlnEyRLXmQ.md b/src/data/roadmaps/computer-science/content/class-diagrams@FZ8znJSz8PvQlnEyRLXmQ.md index 36d91cca3..074a587fe 100644 --- a/src/data/roadmaps/computer-science/content/class-diagrams@FZ8znJSz8PvQlnEyRLXmQ.md +++ b/src/data/roadmaps/computer-science/content/class-diagrams@FZ8znJSz8PvQlnEyRLXmQ.md @@ -5,4 +5,4 @@ Class Diagrams are used to model the static structure of a system. They are used Visit the following resources to learn more: - [@article@Class Diagrams](https://www.visual-paradigm.com/guide/uml-unified-modeling-language/uml-class-diagram-tutorial/) -- [@video@UML Class Diagram Tutorial](https://www.youtube.com/watch?v=UI6lqHOVHic) +- [@video@UML Class Diagram Tutorial](https://www.youtube.com/watch?v=UI6lqHOVHic) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/cloud-design-patterns@YMO9oD_sbzyDZPNU2xZwe.md b/src/data/roadmaps/computer-science/content/cloud-design-patterns@YMO9oD_sbzyDZPNU2xZwe.md index 537e7a2fb..4a515561c 100644 --- a/src/data/roadmaps/computer-science/content/cloud-design-patterns@YMO9oD_sbzyDZPNU2xZwe.md +++ b/src/data/roadmaps/computer-science/content/cloud-design-patterns@YMO9oD_sbzyDZPNU2xZwe.md @@ -7,4 +7,4 @@ The link below has cloud design patterns where each pattern describes the proble Visit the following resources to learn more: - [@article@Cloud Design Patterns](https://learn.microsoft.com/en-us/azure/architecture/patterns/) -- [@feed@Explore top posts about Cloud](https://app.daily.dev/tags/cloud?ref=roadmapsh) +- [@feed@Explore top posts about Cloud](https://app.daily.dev/tags/cloud?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/clustering@wAsZ-M5N9ERufQnBaXbAE.md b/src/data/roadmaps/computer-science/content/clustering@wAsZ-M5N9ERufQnBaXbAE.md index ca38fd6cd..bbd61e51c 100644 --- a/src/data/roadmaps/computer-science/content/clustering@wAsZ-M5N9ERufQnBaXbAE.md +++ b/src/data/roadmaps/computer-science/content/clustering@wAsZ-M5N9ERufQnBaXbAE.md @@ -4,4 +4,4 @@ At a high level, a computer cluster is a group of two or more computers, or node Visit the following resources to learn more: -- [@article@System Design: Clustering](https://dev.to/karanpratapsingh/system-design-clustering-3726) +- [@article@System Design: Clustering](https://dev.to/karanpratapsingh/system-design-clustering-3726) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/co-np@pLBfkzi0qfgVRqi_4AmMI.md b/src/data/roadmaps/computer-science/content/co-np@pLBfkzi0qfgVRqi_4AmMI.md index 4a5f04b31..42d2a6dac 100644 --- a/src/data/roadmaps/computer-science/content/co-np@pLBfkzi0qfgVRqi_4AmMI.md +++ b/src/data/roadmaps/computer-science/content/co-np@pLBfkzi0qfgVRqi_4AmMI.md @@ -9,4 +9,4 @@ Visit the following resources to learn more: - [@video@Complexity: Approximation Algorithms](https://www.youtube.com/watch?v=MEz1J9wY2iM&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=24) - [@video@Complexity: Fixed-Parameter Algorithms](https://www.youtube.com/watch?v=4q-jmGrmxKs&index=25&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) - [@video@Lecture 23: Computational Complexity](https://www.youtube.com/watch?v=moPtwq_cVH8&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=24) -- [@video@Greedy Algs. II & Intro to NP Completeness](https://youtu.be/qcGnJ47Smlo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=2939) +- [@video@Greedy Algs. II & Intro to NP Completeness](https://youtu.be/qcGnJ47Smlo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=2939) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/combinatorics@lWnAY0DgrUOmT6yqnxeBN.md b/src/data/roadmaps/computer-science/content/combinatorics@lWnAY0DgrUOmT6yqnxeBN.md index 3b11e505d..fb66f6d5f 100644 --- a/src/data/roadmaps/computer-science/content/combinatorics@lWnAY0DgrUOmT6yqnxeBN.md +++ b/src/data/roadmaps/computer-science/content/combinatorics@lWnAY0DgrUOmT6yqnxeBN.md @@ -7,4 +7,4 @@ Visit the following resources to learn more: - [@article@Probability and Combinatorics](https://www.khanacademy.org/math/probability/probability-and-combinatorics-topic) - [@video@Math Skills: How to find Factorial, Permutation and Combination](https://www.youtube.com/watch?v=8RRo6Ti9d0U) - [@video@Make School: Probability](https://www.youtube.com/watch?v=sZkAAk9Wwa4) -- [@video@Make School: More Probability and Markov Chains](https://www.youtube.com/watch?v=dNaJg-mLobQ) +- [@video@Make School: More Probability and Markov Chains](https://www.youtube.com/watch?v=dNaJg-mLobQ) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/common-algorithms@7a6-AnBI-3tAU1dkOvPkx.md b/src/data/roadmaps/computer-science/content/common-algorithms@7a6-AnBI-3tAU1dkOvPkx.md index aa5332da2..5637d60c0 100644 --- a/src/data/roadmaps/computer-science/content/common-algorithms@7a6-AnBI-3tAU1dkOvPkx.md +++ b/src/data/roadmaps/computer-science/content/common-algorithms@7a6-AnBI-3tAU1dkOvPkx.md @@ -2,18 +2,18 @@ Here are some common algorithms that you should know. You can find more information about them in the Algorithms section of the Computer Science course. -- Sorting -- Recursion -- Searching -- Cache Algorithms -- Tree Algorithms -- Graph Algorithms -- Greedy Algorithms -- Backtracking -- Substring Search -- Suffix Arrays -- Dynamic Programming +* Sorting +* Recursion +* Searching +* Cache Algorithms +* Tree Algorithms +* Graph Algorithms +* Greedy Algorithms +* Backtracking +* Substring Search +* Suffix Arrays +* Dynamic Programming Visit the following resources to learn more: -- [@article@Top Algorithms and Data Structures](https://medium.com/data-science/top-algorithms-and-data-structures-you-really-need-to-know-ab9a2a91c7b5) +- [@article@Top Algorithms and Data Structures](https://medium.com/data-science/top-algorithms-and-data-structures-you-really-need-to-know-ab9a2a91c7b5) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/common-uml-diagrams@DMuMsEowpevTCALtziwTB.md b/src/data/roadmaps/computer-science/content/common-uml-diagrams@DMuMsEowpevTCALtziwTB.md index 2dbe2015d..61ffc6680 100644 --- a/src/data/roadmaps/computer-science/content/common-uml-diagrams@DMuMsEowpevTCALtziwTB.md +++ b/src/data/roadmaps/computer-science/content/common-uml-diagrams@DMuMsEowpevTCALtziwTB.md @@ -5,4 +5,4 @@ UML is a standard way of visualizing a software system. It is a general-purpose, Visit the following resources to learn more: - [@article@Unified Modeling Language (UML) Description](https://www.uml-diagrams.org/) -- [@video@UML Diagrams Full Course (Unified Modeling Language)](https://www.youtube.com/watch?v=WnMQ8HlmeXc) +- [@video@UML Diagrams Full Course (Unified Modeling Language)](https://www.youtube.com/watch?v=WnMQ8HlmeXc) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/complexity-classes@YLCmZvoLkhOk9wlgYW2Ms.md b/src/data/roadmaps/computer-science/content/complexity-classes@YLCmZvoLkhOk9wlgYW2Ms.md index d13ce1107..a2b1ee2b9 100644 --- a/src/data/roadmaps/computer-science/content/complexity-classes@YLCmZvoLkhOk9wlgYW2Ms.md +++ b/src/data/roadmaps/computer-science/content/complexity-classes@YLCmZvoLkhOk9wlgYW2Ms.md @@ -9,4 +9,4 @@ Visit the following resources to learn more: - [@video@Complexity: Approximation Algorithms](https://www.youtube.com/watch?v=MEz1J9wY2iM&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=24) - [@video@Complexity: Fixed-Parameter Algorithms](https://www.youtube.com/watch?v=4q-jmGrmxKs&index=25&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) - [@video@Lecture 23: Computational Complexity](https://www.youtube.com/watch?v=moPtwq_cVH8&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=24) -- [@video@Greedy Algs. II & Intro to NP Completeness](https://youtu.be/qcGnJ47Smlo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=2939) +- [@video@Greedy Algs. II & Intro to NP Completeness](https://youtu.be/qcGnJ47Smlo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=2939) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/constant@3F_QBv_sU39ehOxpurF88.md b/src/data/roadmaps/computer-science/content/constant@3F_QBv_sU39ehOxpurF88.md index 02d6e4939..39d827332 100644 --- a/src/data/roadmaps/computer-science/content/constant@3F_QBv_sU39ehOxpurF88.md +++ b/src/data/roadmaps/computer-science/content/constant@3F_QBv_sU39ehOxpurF88.md @@ -5,4 +5,4 @@ Constant time algorithms are the simplest and most efficient algorithms. They ar Visit the following resources to learn more: - [@video@Big O Notation — Calculating Time Complexity](https://www.youtube.com/watch?v=Z0bH0cMY0E8) -- [@video@Big O Notations](https://www.youtube.com/watch?v=V6mKVRU1evU) +- [@video@Big O Notations](https://www.youtube.com/watch?v=V6mKVRU1evU) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/cpu-cache@DjTQjMbika4_yTzrBpcmB.md b/src/data/roadmaps/computer-science/content/cpu-cache@DjTQjMbika4_yTzrBpcmB.md index 3618fa85e..1adf6f32f 100644 --- a/src/data/roadmaps/computer-science/content/cpu-cache@DjTQjMbika4_yTzrBpcmB.md +++ b/src/data/roadmaps/computer-science/content/cpu-cache@DjTQjMbika4_yTzrBpcmB.md @@ -5,6 +5,6 @@ A CPU cache is a hardware cache used by the central processing unit of a compute Visit the following resources to learn more: - [@article@What is CPU Cache](https://www.howtogeek.com/854138/what-is-cpu-cache/) -- [@video@MIT 6.004 L15: The Memory Hierarchy](https://www.youtube.com/watch?v=vjYF_fAZI5E\&list=PLrRW1w6CGAcXbMtDFj205vALOGmiRc82-\&index=24) -- [@video@MIT 6.004 L16: Cache Issues](https://www.youtube.com/watch?v=ajgC3-pyGlk\&index=25\&list=PLrRW1w6CGAcXbMtDFj205vALOGmiRc82-) -- [@feed@Explore top posts about Computing](https://app.daily.dev/tags/computing?ref=roadmapsh) +- [@video@MIT 6.004 L15: The Memory Hierarchy](https://www.youtube.com/watch?v=vjYF_fAZI5E&list=PLrRW1w6CGAcXbMtDFj205vALOGmiRc82-&index=24) +- [@video@MIT 6.004 L16: Cache Issues](https://www.youtube.com/watch?v=ajgC3-pyGlk&index=25&list=PLrRW1w6CGAcXbMtDFj205vALOGmiRc82-) +- [@feed@Explore top posts about Computing](https://app.daily.dev/tags/computing?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/cpu-interrupts@cpQvB0qMDL3-NWret7oeA.md b/src/data/roadmaps/computer-science/content/cpu-interrupts@cpQvB0qMDL3-NWret7oeA.md index 1ec5f6fca..e5209264b 100644 --- a/src/data/roadmaps/computer-science/content/cpu-interrupts@cpQvB0qMDL3-NWret7oeA.md +++ b/src/data/roadmaps/computer-science/content/cpu-interrupts@cpQvB0qMDL3-NWret7oeA.md @@ -6,4 +6,4 @@ Visit the following resources to learn more: - [@article@System Interrupts 100% CPU](https://www.wikihow.com/System-Interrupts-100-Cpu) - [@video@Interrupts](https://youtu.be/iKlAWIKEyuw) -- [@feed@Explore top posts about Computing](https://app.daily.dev/tags/computing?ref=roadmapsh) +- [@feed@Explore top posts about Computing](https://app.daily.dev/tags/computing?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/data-structures@NM7q5REW1sJgMhxJhPpLT.md b/src/data/roadmaps/computer-science/content/data-structures@NM7q5REW1sJgMhxJhPpLT.md index 76b608db4..50d574fb5 100644 --- a/src/data/roadmaps/computer-science/content/data-structures@NM7q5REW1sJgMhxJhPpLT.md +++ b/src/data/roadmaps/computer-science/content/data-structures@NM7q5REW1sJgMhxJhPpLT.md @@ -6,6 +6,6 @@ Visit the following resources to learn more: - [@roadmap@Visit Dedicated DSA Roadmap](https://roadmap.sh/datastructures-and-algorithms) - [@course@Data Structures and Algorithms By Google](https://techdevguide.withgoogle.com/paths/data-structures-and-algorithms/) -- [@video@Data Structures Illustrated](https://www.youtube.com/watch?v=9rhT3P1MDHk\&list=PLkZYeFmDuaN2-KUIv-mvbjfKszIGJ4FaY) +- [@video@Data Structures Illustrated](https://www.youtube.com/watch?v=9rhT3P1MDHk&list=PLkZYeFmDuaN2-KUIv-mvbjfKszIGJ4FaY) - [@video@Data Structures playlist](https://youtube.com/playlist?list=PLDV1Zeh2NRsB6SWUrDFW2RmDotAfPbeHu&si=_EEf7x58G6lUcMGG) -- [@feed@Explore top posts about Data Structures](https://app.daily.dev/tags/data-structures?ref=roadmapsh) +- [@feed@Explore top posts about Data Structures](https://app.daily.dev/tags/data-structures?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/database-federation@3r21avMlo0xFB9i7PHccX.md b/src/data/roadmaps/computer-science/content/database-federation@3r21avMlo0xFB9i7PHccX.md index acbcd6f93..5e58c17ef 100644 --- a/src/data/roadmaps/computer-science/content/database-federation@3r21avMlo0xFB9i7PHccX.md +++ b/src/data/roadmaps/computer-science/content/database-federation@3r21avMlo0xFB9i7PHccX.md @@ -5,4 +5,4 @@ Federation (or functional partitioning) splits up databases by function. The fed Visit the following resources to learn more: - [@article@Database Federation](https://dev.to/karanpratapsingh/system-design-the-complete-course-10fo#database-federation) -- [@feed@Explore top posts about Database](https://app.daily.dev/tags/database?ref=roadmapsh) +- [@feed@Explore top posts about Database](https://app.daily.dev/tags/database?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/databases@zvlTQ0A-My4QDrslp_lru.md b/src/data/roadmaps/computer-science/content/databases@zvlTQ0A-My4QDrslp_lru.md index 39c109718..4541fd55d 100644 --- a/src/data/roadmaps/computer-science/content/databases@zvlTQ0A-My4QDrslp_lru.md +++ b/src/data/roadmaps/computer-science/content/databases@zvlTQ0A-My4QDrslp_lru.md @@ -6,5 +6,5 @@ Visit the following resources to learn more: - [@article@What is a Database?](https://www.oracle.com/database/what-is-database/) - [@article@What are Databases?](https://www.prisma.io/dataguide/intro/what-are-databases) -- [@video@DBMS by Stanford](https://www.youtube.com/watch?v=D-k-h0GuFmE\&list=PL9ysvtVnryGpnIj9rcIqNDxakUn6v72Hm) -- [@feed@Explore top posts about Backend Development](https://app.daily.dev/tags/backend?ref=roadmapsh) +- [@video@DBMS by Stanford](https://www.youtube.com/watch?v=D-k-h0GuFmE&list=PL9ysvtVnryGpnIj9rcIqNDxakUn6v72Hm) +- [@feed@Explore top posts about Backend Development](https://app.daily.dev/tags/backend?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/dependency-injection@J7DKRklMtJ94Y-18Jo50r.md b/src/data/roadmaps/computer-science/content/dependency-injection@J7DKRklMtJ94Y-18Jo50r.md index e127f804a..32f39a595 100644 --- a/src/data/roadmaps/computer-science/content/dependency-injection@J7DKRklMtJ94Y-18Jo50r.md +++ b/src/data/roadmaps/computer-science/content/dependency-injection@J7DKRklMtJ94Y-18Jo50r.md @@ -6,4 +6,4 @@ Visit the following resources to learn more: - [@article@Dependency Injection - StackOverflow](https://stackoverflow.com/questions/130794/what-is-dependency-injection) - [@video@What is Dependency Injection?](https://www.youtube.com/watch?v=0yc2UANSDiw) -- [@feed@Explore top posts about Dependency Injection](https://app.daily.dev/tags/dependency-injection?ref=roadmapsh) +- [@feed@Explore top posts about Dependency Injection](https://app.daily.dev/tags/dependency-injection?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/depth-first-search@Yf5gOIe7oiL19MjEVcpdw.md b/src/data/roadmaps/computer-science/content/depth-first-search@Yf5gOIe7oiL19MjEVcpdw.md index 08fd3150a..eb2f58ed3 100644 --- a/src/data/roadmaps/computer-science/content/depth-first-search@Yf5gOIe7oiL19MjEVcpdw.md +++ b/src/data/roadmaps/computer-science/content/depth-first-search@Yf5gOIe7oiL19MjEVcpdw.md @@ -4,4 +4,4 @@ Depth first search is a graph traversal algorithm that starts at a root node and Visit the following resources to learn more: -- [@wiki@Depth-first Search](https://en.wikipedia.org/wiki/Depth-first_search) \ No newline at end of file +- [@article@Depth-first Search](https://en.wikipedia.org/wiki/Depth-first_search) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/depth-first-search@chzP5_t2gMi6MstxEzCi5.md b/src/data/roadmaps/computer-science/content/depth-first-search@chzP5_t2gMi6MstxEzCi5.md index ddf02a411..58d3710a8 100644 --- a/src/data/roadmaps/computer-science/content/depth-first-search@chzP5_t2gMi6MstxEzCi5.md +++ b/src/data/roadmaps/computer-science/content/depth-first-search@chzP5_t2gMi6MstxEzCi5.md @@ -6,4 +6,4 @@ Visit the following resources to learn more: - [@article@Breadth-First Search (BFS) and Depth-First Search (DFS) for Binary Trees in Java](https://www.digitalocean.com/community/tutorials/breadth-first-search-depth-first-search-bfs-dfs) - [@video@BFS and DFS in a Binary Tree](https://www.youtube.com/watch?v=uWL6FJhq5fM) -- [@video@Depth First Search in 4 Minutes](https://www.youtube.com/watch?v=Urx87-NMm6c) +- [@video@Depth First Search in 4 Minutes](https://www.youtube.com/watch?v=Urx87-NMm6c) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/design-patterns@-De1hU2ONGwhQmUpsyrCO.md b/src/data/roadmaps/computer-science/content/design-patterns@-De1hU2ONGwhQmUpsyrCO.md index 922e39bd2..f51d6042d 100644 --- a/src/data/roadmaps/computer-science/content/design-patterns@-De1hU2ONGwhQmUpsyrCO.md +++ b/src/data/roadmaps/computer-science/content/design-patterns@-De1hU2ONGwhQmUpsyrCO.md @@ -4,7 +4,7 @@ Design patterns are solutions to common problems in software design. They are fo Visit the following resources to learn more: -- [@article@Design Patterns](https://en.wikipedia.org/wiki/Software_design_pattern) - [@opensource@Design Patterns for Humans](https://github.com/kamranahmedse/design-patterns-for-humans) +- [@article@Design Patterns](https://en.wikipedia.org/wiki/Software_design_pattern) - [@article@Refactoring Guru - Design Patterns](https://refactoring.guru/design-patterns/) -- [@feed@Explore top posts about Design Patterns](https://app.daily.dev/tags/design-patterns?ref=roadmapsh) +- [@feed@Explore top posts about Design Patterns](https://app.daily.dev/tags/design-patterns?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/dijkstras-algorithm@l3X9UrEYTWs5kBXI1NNCf.md b/src/data/roadmaps/computer-science/content/dijkstras-algorithm@l3X9UrEYTWs5kBXI1NNCf.md index f75505cf1..6de867945 100644 --- a/src/data/roadmaps/computer-science/content/dijkstras-algorithm@l3X9UrEYTWs5kBXI1NNCf.md +++ b/src/data/roadmaps/computer-science/content/dijkstras-algorithm@l3X9UrEYTWs5kBXI1NNCf.md @@ -5,6 +5,6 @@ Dijkstra's algorithm is a greedy algorithm that finds the shortest path between Visit the following resources to learn more: - [@video@Dijkstras Algorithm in 3 Minutes](https://www.youtube.com/watch?v=_lHSawdgXpI) -- [@video@Dijkstras Algorithm - MIT](https://www.youtube.com/watch?v=NSHizBK9JD8\&t=1731s\&ab_channel=MITOpenCourseWare) -- [@video@Speeding Up Dijkstras Algorithm - MIT](https://www.youtube.com/watch?v=CHvQ3q_gJ7E\&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb\&index=18) -- [@feed@Explore top posts about Data Science](https://app.daily.dev/tags/data-science?ref=roadmapsh) +- [@video@Dijkstras Algorithm - MIT](https://www.youtube.com/watch?v=NSHizBK9JD8&t=1731s&ab_channel=MITOpenCourseWare) +- [@video@Speeding Up Dijkstras Algorithm - MIT](https://www.youtube.com/watch?v=CHvQ3q_gJ7E&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=18) +- [@feed@Explore top posts about Data Science](https://app.daily.dev/tags/data-science?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/dijkstras-algorithm@oJstm-8c-4seWbIWcNgDv.md b/src/data/roadmaps/computer-science/content/dijkstras-algorithm@oJstm-8c-4seWbIWcNgDv.md index 49c4fd3a9..d73508ec4 100644 --- a/src/data/roadmaps/computer-science/content/dijkstras-algorithm@oJstm-8c-4seWbIWcNgDv.md +++ b/src/data/roadmaps/computer-science/content/dijkstras-algorithm@oJstm-8c-4seWbIWcNgDv.md @@ -4,6 +4,6 @@ Dijkstra's algorithm is a graph traversal algorithm that finds the shortest path Visit the following resources to learn more: -- [@video@Dijkstras Algorithm - MIT](https://www.youtube.com/watch?v=NSHizBK9JD8\&t=1731s\&ab_channel=MITOpenCourseWare) +- [@video@Dijkstras Algorithm - MIT](https://www.youtube.com/watch?v=NSHizBK9JD8&t=1731s&ab_channel=MITOpenCourseWare) - [@video@Dijkstras Algorithm in 3 Minutes](https://www.youtube.com/watch?v=_lHSawdgXpI) -- [@feed@Explore top posts about Data Science](https://app.daily.dev/tags/data-science?ref=roadmapsh) +- [@feed@Explore top posts about Data Science](https://app.daily.dev/tags/data-science?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/directed-graph@6Jy8SXHuYA08h9iLjKFWR.md b/src/data/roadmaps/computer-science/content/directed-graph@6Jy8SXHuYA08h9iLjKFWR.md index 253058876..1d8208202 100644 --- a/src/data/roadmaps/computer-science/content/directed-graph@6Jy8SXHuYA08h9iLjKFWR.md +++ b/src/data/roadmaps/computer-science/content/directed-graph@6Jy8SXHuYA08h9iLjKFWR.md @@ -4,4 +4,4 @@ A directed graph is graph, i.e., a set of objects (called vertices or nodes) tha Visit the following resources to learn more: -- [@article@Directed Graph](https://en.wikipedia.org/wiki/Directed_graph) +- [@article@Directed Graph](https://en.wikipedia.org/wiki/Directed_graph) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/dml@tcQSH-eAvJUZuePTDjAIb.md b/src/data/roadmaps/computer-science/content/dml@tcQSH-eAvJUZuePTDjAIb.md index a7052207b..f0c9cd001 100644 --- a/src/data/roadmaps/computer-science/content/dml@tcQSH-eAvJUZuePTDjAIb.md +++ b/src/data/roadmaps/computer-science/content/dml@tcQSH-eAvJUZuePTDjAIb.md @@ -5,4 +5,4 @@ The SQL commands that manipulate data in the database belong to DML, or Data Man Visit the following resources to learn more: - [@article@DML: Data Manipulation Language](https://satoricyber.com/glossary/dml-data-manipulation-language) -- [@article@Difference Between DDL and DML](https://appmaster.io/blog/difference-between-ddl-and-dml) +- [@article@Difference Between DDL and DML](https://appmaster.io/blog/difference-between-ddl-and-dml) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/dns@fYjoXB4rnkM5gg46sqVz5.md b/src/data/roadmaps/computer-science/content/dns@fYjoXB4rnkM5gg46sqVz5.md index 4b35c09ca..6df3dd1e6 100644 --- a/src/data/roadmaps/computer-science/content/dns@fYjoXB4rnkM5gg46sqVz5.md +++ b/src/data/roadmaps/computer-science/content/dns@fYjoXB4rnkM5gg46sqVz5.md @@ -1,6 +1,6 @@ # DNS -The Domain Name System (DNS) is the phonebook of the Internet. Humans access information online through domain names, like nytimes.com or espn.com. Web browsers interact through Internet Protocol (IP) addresses. DNS translates domain names to IP addresses so browsers can load Internet resources. +The Domain Name System (DNS) is the phonebook of the Internet. Humans access information online through domain names, like [nytimes.com](http://nytimes.com) or [espn.com](http://espn.com). Web browsers interact through Internet Protocol (IP) addresses. DNS translates domain names to IP addresses so browsers can load Internet resources. Visit the following resources to learn more: @@ -8,5 +8,5 @@ Visit the following resources to learn more: - [@article@How DNS works (comic)](https://howdns.works/) - [@video@DNS and How does it Work?](https://www.youtube.com/watch?v=Wj0od2ag5sk) - [@video@DNS Records](https://www.youtube.com/watch?v=7lxgpKh_fRY) -- [@video@Complete DNS mini-series](https://www.youtube.com/watch?v=zEmUuNFBgN8\&list=PLTk5ZYSbd9MhMmOiPhfRJNW7bhxHo4q-K) -- [@feed@Explore top posts about DNS](https://app.daily.dev/tags/dns?ref=roadmapsh) +- [@video@Complete DNS mini-series](https://www.youtube.com/watch?v=zEmUuNFBgN8&list=PLTk5ZYSbd9MhMmOiPhfRJNW7bhxHo4q-K) +- [@feed@Explore top posts about DNS](https://app.daily.dev/tags/dns?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/endianess@vjMqqFsTxSjaiYxmliwLi.md b/src/data/roadmaps/computer-science/content/endianess@vjMqqFsTxSjaiYxmliwLi.md index 10500e058..9be0340f0 100644 --- a/src/data/roadmaps/computer-science/content/endianess@vjMqqFsTxSjaiYxmliwLi.md +++ b/src/data/roadmaps/computer-science/content/endianess@vjMqqFsTxSjaiYxmliwLi.md @@ -7,4 +7,4 @@ Visit the following resources to learn more: - [@article@Endianness](https://developer.mozilla.org/en-US/docs/Glossary/Endianness) - [@article@Big-Endian vs Little-Endian Explained with Examples](https://www.freecodecamp.org/news/what-is-endianness-big-endian-vs-little-endian/) - [@video@Big Endian vs Little Endian.mp4](https://www.youtube.com/watch?v=JrNF0KRAlyo) -- [@video@Endianness Explained With an Egg - Computerphile](https://www.youtube.com/watch?v=NcaiHcBvDR4) +- [@video@Endianness Explained With an Egg - Computerphile](https://www.youtube.com/watch?v=NcaiHcBvDR4) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/entity-relationship-model@XnxxEmr2TyW2kOpB4gtR5.md b/src/data/roadmaps/computer-science/content/entity-relationship-model@XnxxEmr2TyW2kOpB4gtR5.md index 3c9999559..ead054535 100644 --- a/src/data/roadmaps/computer-science/content/entity-relationship-model@XnxxEmr2TyW2kOpB4gtR5.md +++ b/src/data/roadmaps/computer-science/content/entity-relationship-model@XnxxEmr2TyW2kOpB4gtR5.md @@ -5,4 +5,4 @@ Entity relationship model is a high-level data model that describes the logical Visit the following resources to learn more: - [@video@Entity Relationship Diagram (ERD) Tutorial - Part 1](https://www.youtube.com/watch?v=QpdhBUYk7Kk) -- [@video@Entity Relationship Diagram (ERD) Tutorial - Part 2](https://www.youtube.com/watch?v=-CuY5ADwn24) +- [@video@Entity Relationship Diagram (ERD) Tutorial - Part 2](https://www.youtube.com/watch?v=-CuY5ADwn24) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/exponential@5mMLr6tWbiSZuox1lx0_B.md b/src/data/roadmaps/computer-science/content/exponential@5mMLr6tWbiSZuox1lx0_B.md index 1c8d92ca6..1f3d4c1e3 100644 --- a/src/data/roadmaps/computer-science/content/exponential@5mMLr6tWbiSZuox1lx0_B.md +++ b/src/data/roadmaps/computer-science/content/exponential@5mMLr6tWbiSZuox1lx0_B.md @@ -2,16 +2,15 @@ Exponential algorithms are those that grow at a rate of 2^n. This means that for each additional input, the algorithm will take twice as long to run. The following function is an example of an exponential algorithm: -```python -def exponential(n): - if n == 0: - return 1 - return exponential(n - 1) + exponential(n - 1) -``` + def exponential(n): + if n == 0: + return 1 + return exponential(n - 1) + exponential(n - 1) + As you can see, the algorithm's runtime grows exponentially. For each additional input, the algorithm will take twice as long to run. Visit the following resources to learn more: - [@video@Big O Notation — Calculating Time Complexity](https://www.youtube.com/watch?v=Z0bH0cMY0E8) -- [@video@Big O Notations](https://www.youtube.com/watch?v=V6mKVRU1evU) +- [@video@Big O Notations](https://www.youtube.com/watch?v=V6mKVRU1evU) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/factorial@m0umGQNdvg95UiNpQZsQN.md b/src/data/roadmaps/computer-science/content/factorial@m0umGQNdvg95UiNpQZsQN.md index 16097522f..0854e4b50 100644 --- a/src/data/roadmaps/computer-science/content/factorial@m0umGQNdvg95UiNpQZsQN.md +++ b/src/data/roadmaps/computer-science/content/factorial@m0umGQNdvg95UiNpQZsQN.md @@ -2,30 +2,28 @@ Factorial complexity algorithms have a runtime of `O(n!)`. This is the worst case scenario for an algorithm. Factorial complexity algorithms are very inefficient and should be avoided. -```python -def generate_permutations(s): - # Base case: If the string length is 1, return a list containing the string - if len(s) == 1: - return [s] - - # Initialize the result list - permutations = [] - - # Recursively generate all permutations - for i in range(len(s)): - # Current character - current_char = s[i] - # Remaining characters - remaining_chars = s[:i] + s[i + 1 :] - # Generate all permutations of the remaining characters - for perm in generate_permutations(remaining_chars): - # Add the current character to the front of each generated permutation - permutations.append(current_char + perm) - - return permutations -``` + def generate_permutations(s): + # Base case: If the string length is 1, return a list containing the string + if len(s) == 1: + return [s] + + # Initialize the result list + permutations = [] + + # Recursively generate all permutations + for i in range(len(s)): + # Current character + current_char = s[i] + # Remaining characters + remaining_chars = s[:i] + s[i + 1 :] + # Generate all permutations of the remaining characters + for perm in generate_permutations(remaining_chars): + # Add the current character to the front of each generated permutation + permutations.append(current_char + perm) + + return permutations Visit the following resources to learn more: - [@article@Big O Cheat Sheet - Time Complexity Chart](https://www.freecodecamp.org/news/big-o-cheat-sheet-time-complexity-chart/) -- [@video@Factorial Explained](https://www.youtube.com/watch?v=pxh__ugRKz8) +- [@video@Factorial Explained](https://www.youtube.com/watch?v=pxh__ugRKz8) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/finding-hamiltonian-paths@aBjBHpq_OajgQjxdCobXD.md b/src/data/roadmaps/computer-science/content/finding-hamiltonian-paths@aBjBHpq_OajgQjxdCobXD.md index f44acecf9..d36f5964e 100644 --- a/src/data/roadmaps/computer-science/content/finding-hamiltonian-paths@aBjBHpq_OajgQjxdCobXD.md +++ b/src/data/roadmaps/computer-science/content/finding-hamiltonian-paths@aBjBHpq_OajgQjxdCobXD.md @@ -7,4 +7,4 @@ Visit the following resources to learn more: - [@article@Hamiltonian Cycles](https://en.wikipedia.org/wiki/Hamiltonian_cycle) - [@article@Hamiltonian Path](https://www.hackerearth.com/practice/algorithms/graphs/hamiltonian-path/tutorial/) - [@article@Hamiltonian Paths and Cycles](https://medium.com/stamatics-iit-kanpur/hamiltonian-paths-and-cycles-4f233bfbc53a) -- [@article@Hamiltonian Paths - Lecture 7](https://people.csail.mit.edu/virgi/6.s078/lecture17.pdf) +- [@article@Hamiltonian Paths - Lecture 7](https://people.csail.mit.edu/virgi/6.s078/lecture17.pdf) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/floating-point-math@-bawIWfrYuAxy8cP-AGFS.md b/src/data/roadmaps/computer-science/content/floating-point-math@-bawIWfrYuAxy8cP-AGFS.md index 3a79414ab..4ee9085bc 100644 --- a/src/data/roadmaps/computer-science/content/floating-point-math@-bawIWfrYuAxy8cP-AGFS.md +++ b/src/data/roadmaps/computer-science/content/floating-point-math@-bawIWfrYuAxy8cP-AGFS.md @@ -5,4 +5,4 @@ Floating point numbers are numbers that have a decimal point in them. They are u Visit the following resources to learn more: - [@video@Representation of Floating Point Numbers - 1](https://www.youtube.com/watch?v=ji3SfClm8TU) -- [@video@Why 0.1 + 0.2 != 0.3? | Floating Point Math](https://www.youtube.com/watch?v=RIiq4tTt6rI) +- [@video@Why 0.1 + 0.2 != 0.3? | Floating Point Math](https://www.youtube.com/watch?v=RIiq4tTt6rI) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/ford-fulkerson-algorithm@Hqw2eGtgfbVggqXBnIOdI.md b/src/data/roadmaps/computer-science/content/ford-fulkerson-algorithm@Hqw2eGtgfbVggqXBnIOdI.md index e53f63fc4..05156375b 100644 --- a/src/data/roadmaps/computer-science/content/ford-fulkerson-algorithm@Hqw2eGtgfbVggqXBnIOdI.md +++ b/src/data/roadmaps/computer-science/content/ford-fulkerson-algorithm@Hqw2eGtgfbVggqXBnIOdI.md @@ -6,4 +6,4 @@ Visit the following resources to learn more: - [@article@Ford-Fulkerson Algorithm](https://www.programiz.com/dsa/ford-fulkerson-algorithm) - [@video@Ford-Fulkerson in 5 minutes](https://www.youtube.com/watch?v=Tl90tNtKvxs) -- [@feed@Explore top posts about Data Science](https://app.daily.dev/tags/data-science?ref=roadmapsh) +- [@feed@Explore top posts about Data Science](https://app.daily.dev/tags/data-science?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/full-binary-tree@Q8ZJNeTbc22Q08Mra-McY.md b/src/data/roadmaps/computer-science/content/full-binary-tree@Q8ZJNeTbc22Q08Mra-McY.md index e15494ae3..5c2873981 100644 --- a/src/data/roadmaps/computer-science/content/full-binary-tree@Q8ZJNeTbc22Q08Mra-McY.md +++ b/src/data/roadmaps/computer-science/content/full-binary-tree@Q8ZJNeTbc22Q08Mra-McY.md @@ -4,4 +4,4 @@ A full Binary tree is a special type of binary tree in which every parent node/i Visit the following resources to learn more: -- [@article@Full Binary Tree](https://www.programiz.com/dsa/full-binary-tree) +- [@article@Full Binary Tree](https://www.programiz.com/dsa/full-binary-tree) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/go@mWW88VnkqWgDz02qw5zU-.md b/src/data/roadmaps/computer-science/content/go@mWW88VnkqWgDz02qw5zU-.md index dea15bdc2..3d4142005 100644 --- a/src/data/roadmaps/computer-science/content/go@mWW88VnkqWgDz02qw5zU-.md +++ b/src/data/roadmaps/computer-science/content/go@mWW88VnkqWgDz02qw5zU-.md @@ -10,4 +10,4 @@ Visit the following resources to learn more: - [@article@Go by Example - annotated example programs](https://gobyexample.com/) - [@article@Making a RESTful JSON API in Go](https://thenewstack.io/make-a-restful-json-api-go/) - [@article@Go, the Programming Language of the Cloud](https://thenewstack.io/go-the-programming-language-of-the-cloud/) -- [@feed@Explore top posts about Golang](https://app.daily.dev/tags/golang?ref=roadmapsh) +- [@feed@Explore top posts about Golang](https://app.daily.dev/tags/golang?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/gof-design-patterns@iPN9mSyFwYZER5HSkj6oL.md b/src/data/roadmaps/computer-science/content/gof-design-patterns@iPN9mSyFwYZER5HSkj6oL.md index 51fad2336..7ab2a818e 100644 --- a/src/data/roadmaps/computer-science/content/gof-design-patterns@iPN9mSyFwYZER5HSkj6oL.md +++ b/src/data/roadmaps/computer-science/content/gof-design-patterns@iPN9mSyFwYZER5HSkj6oL.md @@ -4,4 +4,4 @@ Gang of Four (GoF) design patterns are a set of 23 design patterns that were fir Visit the following resources to learn more: -- [@opensource@Design Patterns for Humans](https://github.com/kamranahmedse/design-patterns-for-humans) +- [@opensource@Design Patterns for Humans](https://github.com/kamranahmedse/design-patterns-for-humans) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/graph@vQm046o6ozcvLoqg9L6eL.md b/src/data/roadmaps/computer-science/content/graph@vQm046o6ozcvLoqg9L6eL.md index 0d9ea664d..017cb92da 100644 --- a/src/data/roadmaps/computer-science/content/graph@vQm046o6ozcvLoqg9L6eL.md +++ b/src/data/roadmaps/computer-science/content/graph@vQm046o6ozcvLoqg9L6eL.md @@ -12,4 +12,4 @@ Visit the following resources to learn more: - [@video@CSE373 2020 - Lecture 13 - Minimum Spanning Trees](https://www.youtube.com/watch?v=oolm2VnJUKw&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=13) - [@video@CSE373 2020 - Lecture 14 - Minimum Spanning Trees (cont)](https://www.youtube.com/watch?v=RktgPx0MarY&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=14) - [@video@CSE373 2020 - Lecture 15 - Graph Algorithms (cont 2)](https://www.youtube.com/watch?v=MUe5DXRhyAo&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=15) -- [@video@6.006 Single-Source Shortest Paths Problem](https://www.youtube.com/watch?v=Aa2sqUhIn-E&index=15&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) +- [@video@6.006 Single-Source Shortest Paths Problem](https://www.youtube.com/watch?v=Aa2sqUhIn-E&index=15&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/graphql@DeE_dZecLmKCjePovTfFS.md b/src/data/roadmaps/computer-science/content/graphql@DeE_dZecLmKCjePovTfFS.md index ac3186b68..c75b88b79 100644 --- a/src/data/roadmaps/computer-science/content/graphql@DeE_dZecLmKCjePovTfFS.md +++ b/src/data/roadmaps/computer-science/content/graphql@DeE_dZecLmKCjePovTfFS.md @@ -8,4 +8,4 @@ Visit the following resources to learn more: - [@official@GraphQL](https://graphql.org/) - [@official@GraphQL Documentation](https://graphql.org/learn/) - [@article@Apollo GraphQL Tutorials](https://www.apollographql.com/tutorials/) -- [@feed@Explore top posts about GraphQL](https://app.daily.dev/tags/graphql?ref=roadmapsh) +- [@feed@Explore top posts about GraphQL](https://app.daily.dev/tags/graphql?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/grpc@M4vdwAbjLPrLjWUsG_P1I.md b/src/data/roadmaps/computer-science/content/grpc@M4vdwAbjLPrLjWUsG_P1I.md index 7c419d92e..6ac415b96 100644 --- a/src/data/roadmaps/computer-science/content/grpc@M4vdwAbjLPrLjWUsG_P1I.md +++ b/src/data/roadmaps/computer-science/content/grpc@M4vdwAbjLPrLjWUsG_P1I.md @@ -12,4 +12,4 @@ Visit the following resources to learn more: - [@official@gRPC Introduction](https://grpc.io/docs/what-is-grpc/introduction/) - [@official@gRPC Core Concepts](https://grpc.io/docs/what-is-grpc/core-concepts/) - [@video@Stephane Maarek - gRPC Introduction](https://youtu.be/XRXTsQwyZSU) -- [@feed@Explore top posts about gRPC](https://app.daily.dev/tags/grpc?ref=roadmapsh) +- [@feed@Explore top posts about gRPC](https://app.daily.dev/tags/grpc?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/hash-table@G2dN2FO0SN_I-5AhO_EUk.md b/src/data/roadmaps/computer-science/content/hash-table@G2dN2FO0SN_I-5AhO_EUk.md index ad4f9593a..8d5cdbe28 100644 --- a/src/data/roadmaps/computer-science/content/hash-table@G2dN2FO0SN_I-5AhO_EUk.md +++ b/src/data/roadmaps/computer-science/content/hash-table@G2dN2FO0SN_I-5AhO_EUk.md @@ -9,4 +9,4 @@ Visit the following resources to learn more: - [@video@Hash Table in 4 Minutes](https://youtu.be/knV86FlSXJ8) - [@video@Hashing with Chaining](https://www.youtube.com/watch?v=0M_kIqhwbFo&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=9) - [@video@(Advanced) Randomization: Universal & Perfect Hashing](https://www.youtube.com/watch?v=z0lJ2k0sl1g&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=11) -- [@video@(Advanced) Perfect hashing](https://www.youtube.com/watch?v=N0COwN14gt0&list=PL2B4EEwhKD-NbwZ4ezj7gyc_3yNrojKM9&index=4) +- [@video@(Advanced) Perfect hashing](https://www.youtube.com/watch?v=N0COwN14gt0&list=PL2B4EEwhKD-NbwZ4ezj7gyc_3yNrojKM9&index=4) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/hashing--encryption--encoding@7r7o8pYhFHVAJIv0wNT6X.md b/src/data/roadmaps/computer-science/content/hashing--encryption--encoding@7r7o8pYhFHVAJIv0wNT6X.md index 84c5471b8..bae8302af 100644 --- a/src/data/roadmaps/computer-science/content/hashing--encryption--encoding@7r7o8pYhFHVAJIv0wNT6X.md +++ b/src/data/roadmaps/computer-science/content/hashing--encryption--encoding@7r7o8pYhFHVAJIv0wNT6X.md @@ -9,4 +9,4 @@ Encoding is a two-way function that takes an input and produces an output. The o Visit the following resources to learn more: - [@video@Encoding, Encryption and Hashing -- Whats the Difference?](https://www.youtube.com/watch?v=-bAnBzvMLig) -- [@feed@Explore top posts about Encryption](https://app.daily.dev/tags/encryption?ref=roadmapsh) +- [@feed@Explore top posts about Encryption](https://app.daily.dev/tags/encryption?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/hashing-algorithms@EX_e4B6G07zTb4JjJ7482.md b/src/data/roadmaps/computer-science/content/hashing-algorithms@EX_e4B6G07zTb4JjJ7482.md index afb1b8581..51ff0c7f3 100644 --- a/src/data/roadmaps/computer-science/content/hashing-algorithms@EX_e4B6G07zTb4JjJ7482.md +++ b/src/data/roadmaps/computer-science/content/hashing-algorithms@EX_e4B6G07zTb4JjJ7482.md @@ -8,4 +8,4 @@ Visit the following resources to learn more: - [@video@Hashing Algorithms and Security - Computerphile](https://www.youtube.com/watch?v=b4b8ktEV4Bg) - [@video@Top Hashing Algorithms In Cryptography | MD5 and SHA 256 Algorithms Expalined | Simplilearn](https://www.youtube.com/watch?v=Plp4F3ZfC7A) - [@video@SHA: Secure Hashing Algorithm - Computerphile](https://www.youtube.com/watch?v=DMtFhACPnTY) -- [@feed@Explore top posts about Algorithms](https://app.daily.dev/tags/algorithms?ref=roadmapsh) +- [@feed@Explore top posts about Algorithms](https://app.daily.dev/tags/algorithms?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/heap-sort@CovrRsBY-sYW_xSegcN6N.md b/src/data/roadmaps/computer-science/content/heap-sort@CovrRsBY-sYW_xSegcN6N.md index 26e127f2b..829d2d350 100644 --- a/src/data/roadmaps/computer-science/content/heap-sort@CovrRsBY-sYW_xSegcN6N.md +++ b/src/data/roadmaps/computer-science/content/heap-sort@CovrRsBY-sYW_xSegcN6N.md @@ -4,8 +4,8 @@ Heap sort is a comparison based sorting algorithm. It is similar to selection so Visit the following resources to learn more: +- [@course@Heap Sort Algorithm](https://www.coursera.org/lecture/data-structures/heap-sort-hSzMO) - [@article@Heap Sort Algorithm](https://www.programiz.com/dsa/heap-sort) - [@video@Heap Sort in 4 Minutes](https://www.youtube.com/watch?v=2DmK_H7IdTo) - [@video@Heap Sort Algorithm - MIT](https://www.youtube.com/watch?v=odNJmw5TOEE&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3291s) -- [@course@Heap Sort Algorithm](https://www.coursera.org/lecture/data-structures/heap-sort-hSzMO) -- [@video@Lecture 4 - Heaps and Heap Sort](https://www.youtube.com/watch?v=B7hVxCmfPtM&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=5) +- [@video@Lecture 4 - Heaps and Heap Sort](https://www.youtube.com/watch?v=B7hVxCmfPtM&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=5) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/heap@pw3ZCC3HKU7D5SQwte4vE.md b/src/data/roadmaps/computer-science/content/heap@pw3ZCC3HKU7D5SQwte4vE.md index f78a19961..c73fcd24b 100644 --- a/src/data/roadmaps/computer-science/content/heap@pw3ZCC3HKU7D5SQwte4vE.md +++ b/src/data/roadmaps/computer-science/content/heap@pw3ZCC3HKU7D5SQwte4vE.md @@ -4,8 +4,8 @@ Heap is a tree-based data structure that follows the properties of a complete bi Visit the following resources to learn more: +- [@course@Priority Queue - Introduction](https://www.coursera.org/lecture/data-structures/introduction-2OpTs) - [@article@Heap Data Structure](https://www.programiz.com/dsa/heap-data-structure) - [@article@CS 61B Lecture 24: Priority Queues](https://archive.org/details/ucberkeley_webcast_yIUFT6AKBGE) - [@video@Heap | Illustrated Data Structures](https://www.youtube.com/watch?v=F_r0sJ1RqWk) -- [@video@Heaps and Heap Sort](https://www.youtube.com/watch?v=B7hVxCmfPtM&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=5) -- [@course@Priority Queue - Introduction](https://www.coursera.org/lecture/data-structures/introduction-2OpTs) +- [@video@Heaps and Heap Sort](https://www.youtube.com/watch?v=B7hVxCmfPtM&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=5) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/horizontal-vs-vertical-scaling@-34WGppX6QC5fkCvfCghp.md b/src/data/roadmaps/computer-science/content/horizontal-vs-vertical-scaling@-34WGppX6QC5fkCvfCghp.md index 9e219610a..0455192ab 100644 --- a/src/data/roadmaps/computer-science/content/horizontal-vs-vertical-scaling@-34WGppX6QC5fkCvfCghp.md +++ b/src/data/roadmaps/computer-science/content/horizontal-vs-vertical-scaling@-34WGppX6QC5fkCvfCghp.md @@ -6,4 +6,4 @@ Visit the following resources to learn more: - [@article@Scaling Horizontally vs. Scaling Vertically](https://www.digitalocean.com/resources/article/horizontal-scaling-vs-vertical-scaling) - [@video@System Design Basics: Horizontal vs. Vertical Scaling](https://www.youtube.com/watch?v=xpDnVSmNFX0) -- [@video@Vertical vs. Horizontal Scaling for Database Servers](https://www.youtube.com/watch?v=R99R-SNbo9g) +- [@video@Vertical vs. Horizontal Scaling for Database Servers](https://www.youtube.com/watch?v=R99R-SNbo9g) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/how-computers-calculate@GDLKJkKgB-i7n0YcV2NDa.md b/src/data/roadmaps/computer-science/content/how-computers-calculate@GDLKJkKgB-i7n0YcV2NDa.md index 97b9a4990..f4031fca6 100644 --- a/src/data/roadmaps/computer-science/content/how-computers-calculate@GDLKJkKgB-i7n0YcV2NDa.md +++ b/src/data/roadmaps/computer-science/content/how-computers-calculate@GDLKJkKgB-i7n0YcV2NDa.md @@ -5,4 +5,4 @@ Computers calculate using the binary system, where all data is represented as 0s Visit the following resources to learn more: - [@article@How Does A Computer Calculate Numbers?](https://www.sciencing.com/computer-calculate-numbers-4705975/) -- [@video@How Computers Calculate - ALU](https://youtu.be/1I5ZMmrOfnA) +- [@video@How Computers Calculate - ALU](https://youtu.be/1I5ZMmrOfnA) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/how-computers-work@-emdKpD5uRNuvem5rbFXJ.md b/src/data/roadmaps/computer-science/content/how-computers-work@-emdKpD5uRNuvem5rbFXJ.md index ba1d52da9..fae5d5ce1 100644 --- a/src/data/roadmaps/computer-science/content/how-computers-work@-emdKpD5uRNuvem5rbFXJ.md +++ b/src/data/roadmaps/computer-science/content/how-computers-work@-emdKpD5uRNuvem5rbFXJ.md @@ -8,4 +8,4 @@ Visit the following resources to learn more: - [@video@How Computers Calculate - ALU](https://youtu.be/1I5ZMmrOfnA) - [@video@Registers and RAM](https://youtu.be/fpnE6UAfbtU) - [@video@The Central Processing Unit (CPU)](https://youtu.be/FZGugFqdr60) -- [@video@Instructions and Programs](https://youtu.be/zltgXvg6r3k) +- [@video@Instructions and Programs](https://youtu.be/zltgXvg6r3k) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/how-cpu-executes-programs@1eglba39q426Nh0E0qcdj.md b/src/data/roadmaps/computer-science/content/how-cpu-executes-programs@1eglba39q426Nh0E0qcdj.md index d4a960e2f..a451ac695 100644 --- a/src/data/roadmaps/computer-science/content/how-cpu-executes-programs@1eglba39q426Nh0E0qcdj.md +++ b/src/data/roadmaps/computer-science/content/how-cpu-executes-programs@1eglba39q426Nh0E0qcdj.md @@ -5,4 +5,4 @@ The CPU executes programs by repeatedly fetching instructions from memory, decod Visit the following resources to learn more: - [@video@How CPU Executes a Program](https://www.youtube.com/watch?v=XM4lGflQFvA) -- [@feed@Explore top posts about Computing](https://app.daily.dev/tags/computing?ref=roadmapsh) +- [@feed@Explore top posts about Computing](https://app.daily.dev/tags/computing?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/http@2tUwl-br-SRuwADSzmQag.md b/src/data/roadmaps/computer-science/content/http@2tUwl-br-SRuwADSzmQag.md index f7adafc52..3418fb613 100644 --- a/src/data/roadmaps/computer-science/content/http@2tUwl-br-SRuwADSzmQag.md +++ b/src/data/roadmaps/computer-science/content/http@2tUwl-br-SRuwADSzmQag.md @@ -9,4 +9,4 @@ Visit the following resources to learn more: - [@article@An overview of HTTP](https://developer.mozilla.org/en-US/docs/Web/HTTP/Overview) - [@article@HTTP/3 From A To Z: Core Concepts](https://www.smashingmagazine.com/2021/08/http3-core-concepts-part1/) - [@video@HTTP/1 to HTTP/2 to HTTP/3](https://www.youtube.com/watch?v=a-sBfyiXysI) -- [@video@HTTP Crash Course & Exploration](https://www.youtube.com/watch?v=iYM2zFP3Zn0) +- [@video@HTTP Crash Course & Exploration](https://www.youtube.com/watch?v=iYM2zFP3Zn0) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/huffman-coding@QrcijPiVT3bgqfkF-6ssi.md b/src/data/roadmaps/computer-science/content/huffman-coding@QrcijPiVT3bgqfkF-6ssi.md index 74a909043..81e0dcaee 100644 --- a/src/data/roadmaps/computer-science/content/huffman-coding@QrcijPiVT3bgqfkF-6ssi.md +++ b/src/data/roadmaps/computer-science/content/huffman-coding@QrcijPiVT3bgqfkF-6ssi.md @@ -5,4 +5,4 @@ Huffman coding is a lossless data compression algorithm. The idea is to assign v Visit the following resources to learn more: - [@article@Huffman Coding](https://www.programiz.com/dsa/huffman-coding) -- [@video@Huffman Coding - Greedy Method](https://www.youtube.com/watch?v=co4_ahEDCho) +- [@video@Huffman Coding - Greedy Method](https://www.youtube.com/watch?v=co4_ahEDCho) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/in-order-traversal@KTrgf14Q6rg2f0v4dqq2s.md b/src/data/roadmaps/computer-science/content/in-order-traversal@KTrgf14Q6rg2f0v4dqq2s.md index 6cd678114..df7b0a017 100644 --- a/src/data/roadmaps/computer-science/content/in-order-traversal@KTrgf14Q6rg2f0v4dqq2s.md +++ b/src/data/roadmaps/computer-science/content/in-order-traversal@KTrgf14Q6rg2f0v4dqq2s.md @@ -5,4 +5,4 @@ In-order traversal is a tree traversal algorithm that visits the left subtree, t Visit the following resources to learn more: - [@article@Tree Traversal Techniques](https://www.geeksforgeeks.org/tree-traversals-inorder-preorder-and-postorder/) -- [@video@Tree | Illustrated Data Structures](https://www.youtube.com/watch?v=S2W3SXGPVyU) +- [@video@Tree | Illustrated Data Structures](https://www.youtube.com/watch?v=S2W3SXGPVyU) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/insertion-sort@ujDCW6zZE8dV_fpNf-oIl.md b/src/data/roadmaps/computer-science/content/insertion-sort@ujDCW6zZE8dV_fpNf-oIl.md index 11c4b08a6..462e0b706 100644 --- a/src/data/roadmaps/computer-science/content/insertion-sort@ujDCW6zZE8dV_fpNf-oIl.md +++ b/src/data/roadmaps/computer-science/content/insertion-sort@ujDCW6zZE8dV_fpNf-oIl.md @@ -6,4 +6,4 @@ Visit the following resources to learn more: - [@article@Insertion Sort](https://www.programiz.com/dsa/insertion-sort) - [@video@Insertion Sort — MIT](https://www.youtube.com/watch?v=Kg4bqzAqRBM&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=4) -- [@video@Insertion Sort in 3 Minutes](https://www.youtube.com/watch?v=JU767SDMDvA) +- [@video@Insertion Sort in 3 Minutes](https://www.youtube.com/watch?v=JU767SDMDvA) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/instructions-and-programs@AxiGqbteK7ZSXEUt_zckH.md b/src/data/roadmaps/computer-science/content/instructions-and-programs@AxiGqbteK7ZSXEUt_zckH.md index b99e1d6fe..a5d1a2133 100644 --- a/src/data/roadmaps/computer-science/content/instructions-and-programs@AxiGqbteK7ZSXEUt_zckH.md +++ b/src/data/roadmaps/computer-science/content/instructions-and-programs@AxiGqbteK7ZSXEUt_zckH.md @@ -1,6 +1,6 @@ # Instructions and Programs -Instructions are the most basic commands a CPU can understand, directing it to perform specific actions like adding numbers or moving data. A program, on the other hand, is a collection of these instructions, organized in a sequence to accomplish a particular task. Think of instructions as individual words and a program as a complete sentence or story; the CPU executes these instructions one by one, following the program's logic, to achieve the desired outcome. +Instructions are the most basic commands a CPU can understand, directing it to perform specific actions like adding numbers or moving data. A program, on the other hand, is a collection of these instructions, organized in a sequence to accomplish a particular task. Think of instructions as individual words and a program as a complete sentence or story; the CPU executes these instructions one by one, following the program's logic, to achieve the desired outcome. Visit the following resources to learn more: diff --git a/src/data/roadmaps/computer-science/content/java@1lQSUFrrIGq19nUnM92-I.md b/src/data/roadmaps/computer-science/content/java@1lQSUFrrIGq19nUnM92-I.md index ce46948a6..e8d2bc169 100644 --- a/src/data/roadmaps/computer-science/content/java@1lQSUFrrIGq19nUnM92-I.md +++ b/src/data/roadmaps/computer-science/content/java@1lQSUFrrIGq19nUnM92-I.md @@ -1,11 +1,10 @@ # Java -Java is general-purpose language, primarily used for Internet-based applications. -It was created in 1995 by James Gosling at Sun Microsystems and is one of the most popular options for backend developers. +Java is general-purpose language, primarily used for Internet-based applications. It was created in 1995 by James Gosling at Sun Microsystems and is one of the most popular options for backend developers. Visit the following resources to learn more: - [@roadmap@Visit Dedicated Java Roadmap](https://roadmap.sh/java) - [@official@Java](https://www.java.com/) - [@video@Java Crash Course](https://www.youtube.com/watch?v=eIrMbAQSU34) -- [@feed@Explore top posts about Java](https://app.daily.dev/tags/java?ref=roadmapsh) +- [@feed@Explore top posts about Java](https://app.daily.dev/tags/java?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/k-ary--m-ary-tree@UOYeM-hqIKCrB9hGez4Q_.md b/src/data/roadmaps/computer-science/content/k-ary--m-ary-tree@UOYeM-hqIKCrB9hGez4Q_.md index bf64a3d6a..6748d5813 100644 --- a/src/data/roadmaps/computer-science/content/k-ary--m-ary-tree@UOYeM-hqIKCrB9hGez4Q_.md +++ b/src/data/roadmaps/computer-science/content/k-ary--m-ary-tree@UOYeM-hqIKCrB9hGez4Q_.md @@ -8,4 +8,4 @@ Binary trees are a 2-ary tree, with branching factor = 2 Visit the following resources to learn more: -- [@article@K-Ary Tree](https://en.wikipedia.org/wiki/K-ary_tree) +- [@article@K-Ary Tree](https://en.wikipedia.org/wiki/K-ary_tree) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/k-d-trees@C1eNsPjiQo8INbvL2Lt7L.md b/src/data/roadmaps/computer-science/content/k-d-trees@C1eNsPjiQo8INbvL2Lt7L.md index 810862f47..e71f12718 100644 --- a/src/data/roadmaps/computer-science/content/k-d-trees@C1eNsPjiQo8INbvL2Lt7L.md +++ b/src/data/roadmaps/computer-science/content/k-d-trees@C1eNsPjiQo8INbvL2Lt7L.md @@ -5,4 +5,4 @@ K-D Trees are a data structure that allow for fast nearest neighbor search in hi Visit the following resources to learn more: - [@video@K-D Tree Algorithm](https://www.youtube.com/watch?v=Y4ZgLlDfKDg) -- [@video@K-d Trees - Computerphile](https://www.youtube.com/watch?v=BK5x7IUTIyU) +- [@video@K-d Trees - Computerphile](https://www.youtube.com/watch?v=BK5x7IUTIyU) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/knapsack-problem@yHeCRPhfAOWiggZeUHPU9.md b/src/data/roadmaps/computer-science/content/knapsack-problem@yHeCRPhfAOWiggZeUHPU9.md index 6937a8ae1..e047ab458 100644 --- a/src/data/roadmaps/computer-science/content/knapsack-problem@yHeCRPhfAOWiggZeUHPU9.md +++ b/src/data/roadmaps/computer-science/content/knapsack-problem@yHeCRPhfAOWiggZeUHPU9.md @@ -5,4 +5,4 @@ KnapSack Problem is a classic problem in computer science. It is a problem in wh Visit the following resources to learn more: - [@article@How to solve the Knapsack Problem with dynamic programming](https://medium.com/@fabianterh/how-to-solve-the-knapsack-problem-with-dynamic-programming-eb88c706d3cf) -- [@video@3.1 Knapsack Problem - Greedy Method](https://www.youtube.com/watch?v=oTTzNMHM05I) +- [@video@3.1 Knapsack Problem - Greedy Method](https://www.youtube.com/watch?v=oTTzNMHM05I) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/knuth-morris-pratt@8abFKMfaV9H8F38I0DcMT.md b/src/data/roadmaps/computer-science/content/knuth-morris-pratt@8abFKMfaV9H8F38I0DcMT.md index dd4df5f11..2c6899246 100644 --- a/src/data/roadmaps/computer-science/content/knuth-morris-pratt@8abFKMfaV9H8F38I0DcMT.md +++ b/src/data/roadmaps/computer-science/content/knuth-morris-pratt@8abFKMfaV9H8F38I0DcMT.md @@ -2,12 +2,12 @@ Knuth morris pratt is a string searching algorithm that uses a precomputed array to find the substring in a string. This array is known as the prefix function. The prefix function is the longest prefix that is also a suffix of a substring. The prefix function is used to skip the characters that are already matched. The algorithm is as follows: -- Compute the prefix function of the substring. -- Traverse through the string and substring simultaneously. -- If the characters match, increment the index of both the string and substring. -- If the characters don't match, increment the index of the string by the value of the prefix function at the index of the substring. +* Compute the prefix function of the substring. +* Traverse through the string and substring simultaneously. +* If the characters match, increment the index of both the string and substring. +* If the characters don't match, increment the index of the string by the value of the prefix function at the index of the substring. Visit the following resources to learn more: -- [@video@9.1 Knuth-Morris-Pratt KMP String Matching Algorithm](https://www.youtube.com/watch?v=V5-7GzOfADQ) - [@course@Knuth-Morris Pratt](https://www.coursera.org/learn/algorithms-part2/lecture/TAtDr/knuth-morris-pratt) +- [@video@9.1 Knuth-Morris-Pratt KMP String Matching Algorithm](https://www.youtube.com/watch?v=V5-7GzOfADQ) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/kruskals-algorithm@Wqhg7E-lOz1oNcRXjUej8.md b/src/data/roadmaps/computer-science/content/kruskals-algorithm@Wqhg7E-lOz1oNcRXjUej8.md index cf3ec7b36..106e40495 100644 --- a/src/data/roadmaps/computer-science/content/kruskals-algorithm@Wqhg7E-lOz1oNcRXjUej8.md +++ b/src/data/roadmaps/computer-science/content/kruskals-algorithm@Wqhg7E-lOz1oNcRXjUej8.md @@ -5,5 +5,5 @@ Kruskal's algorithm is a greedy algorithm that finds a minimum spanning tree for Visit the following resources to learn more: - [@video@Kruskals Algorithm in 2 Minutes](https://www.youtube.com/watch?v=71UQH7Pr9kU) -- [@video@Graph Algorithms II - DFS, BFS, Kruskals Algorithm, Union Find Data Structure - Lecture 7](https://www.youtube.com/watch?v=ufj5_bppBsA\&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm\&index=8) -- [@feed@Explore top posts about Data Science](https://app.daily.dev/tags/data-science?ref=roadmapsh) +- [@video@Graph Algorithms II - DFS, BFS, Kruskals Algorithm, Union Find Data Structure - Lecture 7](https://www.youtube.com/watch?v=ufj5_bppBsA&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=8) +- [@feed@Explore top posts about Data Science](https://app.daily.dev/tags/data-science?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/lfu-cache@n11ujPI3of-52l2KW2CDQ.md b/src/data/roadmaps/computer-science/content/lfu-cache@n11ujPI3of-52l2KW2CDQ.md index ca17bb9ed..8aa7d50e3 100644 --- a/src/data/roadmaps/computer-science/content/lfu-cache@n11ujPI3of-52l2KW2CDQ.md +++ b/src/data/roadmaps/computer-science/content/lfu-cache@n11ujPI3of-52l2KW2CDQ.md @@ -5,4 +5,4 @@ LFU Cache is a data structure that stores key-value pairs. It has a fixed size a Visit the following resources to learn more: - [@article@Least Frequently Used (LFU) Cache Implementation](https://www.geeksforgeeks.org/least-frequently-used-lfu-cache-implementation/) -- [@article@1117. Data Structure - LFU Cache](https://jojozhuang.github.io/algorithm/data-structure-lfu-cache/) +- [@article@1117. Data Structure - LFU Cache](https://jojozhuang.github.io/algorithm/data-structure-lfu-cache/) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/linear@jymhjv8GiFALQpox6aZeu.md b/src/data/roadmaps/computer-science/content/linear@jymhjv8GiFALQpox6aZeu.md index d43646ff1..b368160be 100644 --- a/src/data/roadmaps/computer-science/content/linear@jymhjv8GiFALQpox6aZeu.md +++ b/src/data/roadmaps/computer-science/content/linear@jymhjv8GiFALQpox6aZeu.md @@ -6,4 +6,4 @@ Visit the following resources to learn more: - [@article@Linear Search Algorithm](https://www.geeksforgeeks.org/linear-search/) - [@video@Big O Notation — Calculating Time Complexity](https://www.youtube.com/watch?v=Z0bH0cMY0E8) -- [@video@Big O Notations](https://www.youtube.com/watch?v=V6mKVRU1evU) +- [@video@Big O Notations](https://www.youtube.com/watch?v=V6mKVRU1evU) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/linked-list@gr8BK6vq4AVwp_aUozZmf.md b/src/data/roadmaps/computer-science/content/linked-list@gr8BK6vq4AVwp_aUozZmf.md index 0ff1dcb92..0fb8e9bf6 100644 --- a/src/data/roadmaps/computer-science/content/linked-list@gr8BK6vq4AVwp_aUozZmf.md +++ b/src/data/roadmaps/computer-science/content/linked-list@gr8BK6vq4AVwp_aUozZmf.md @@ -4,12 +4,12 @@ Arrays store elements in contiguous memory locations, resulting in easily calcul Visit the following resources to learn more: -- [@video@Linked List Data Structure | Illustrated Data Structures](https://www.youtube.com/watch?v=odW9FU8jPRQ) -- [@video@Linked Lists in 4 minutes](https://www.youtube.com/watch?v=F8AbOfQwl1c) - [@course@Singly Linked Lists](https://www.coursera.org/lecture/data-structures/singly-linked-lists-kHhgK) -- [@video@CS 61B Lecture 7: Linked Lists I](https://archive.org/details/ucberkeley_webcast_htzJdKoEmO0) -- [@video@CS 61B Lecture 7: Linked Lists II](https://archive.org/details/ucberkeley_webcast_-c4I3gFYe3w) - [@course@Core: Linked Lists vs Arrays](https://www.coursera.org/lecture/data-structures-optimizing-performance/core-linked-lists-vs-arrays-rjBs9) - [@course@In the Real World: Linked Lists vs Arrays](https://www.coursera.org/lecture/data-structures-optimizing-performance/in-the-real-world-lists-vs-arrays-QUaUd) -- [@video@Why you should avoid Linked Lists?](https://www.youtube.com/watch?v=YQs6IC-vgmo) - [@course@Doubly Linked Lists](https://www.coursera.org/lecture/data-structures/doubly-linked-lists-jpGKD) +- [@video@Linked List Data Structure | Illustrated Data Structures](https://www.youtube.com/watch?v=odW9FU8jPRQ) +- [@video@Linked Lists in 4 minutes](https://www.youtube.com/watch?v=F8AbOfQwl1c) +- [@video@CS 61B Lecture 7: Linked Lists I](https://archive.org/details/ucberkeley_webcast_htzJdKoEmO0) +- [@video@CS 61B Lecture 7: Linked Lists II](https://archive.org/details/ucberkeley_webcast_-c4I3gFYe3w) +- [@video@Why you should avoid Linked Lists?](https://www.youtube.com/watch?v=YQs6IC-vgmo) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/little-endian@rD_5n5bjiNMVC0cPhEVyG.md b/src/data/roadmaps/computer-science/content/little-endian@rD_5n5bjiNMVC0cPhEVyG.md index f6fef937e..7e533f3b3 100644 --- a/src/data/roadmaps/computer-science/content/little-endian@rD_5n5bjiNMVC0cPhEVyG.md +++ b/src/data/roadmaps/computer-science/content/little-endian@rD_5n5bjiNMVC0cPhEVyG.md @@ -5,4 +5,4 @@ Little Endian is a way of storing data in memory. It is the opposite of Big Endi Visit the following resources to learn more: - [@video@Big Endian vs Little Endian](https://www.youtube.com/watch?v=JrNF0KRAlyo) -- [@video@Endianness Explained With an Egg - Computerphile](https://www.youtube.com/watch?v=NcaiHcBvDR4) +- [@video@Endianness Explained With an Egg - Computerphile](https://www.youtube.com/watch?v=NcaiHcBvDR4) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/load-balancing@xDiS0HmrEoPjkQg9x2O3o.md b/src/data/roadmaps/computer-science/content/load-balancing@xDiS0HmrEoPjkQg9x2O3o.md index 0d38adaeb..0b8676404 100644 --- a/src/data/roadmaps/computer-science/content/load-balancing@xDiS0HmrEoPjkQg9x2O3o.md +++ b/src/data/roadmaps/computer-science/content/load-balancing@xDiS0HmrEoPjkQg9x2O3o.md @@ -6,4 +6,4 @@ Visit the following resources to learn more: - [@article@What is Load Balancing? | How load balancers work](https://www.cloudflare.com/learning/performance/what-is-load-balancing/) - [@video@Load Balancers 101](https://www.youtube.com/watch?v=galcDRNd5Ow) -- [@video@What is Load Balancing?](https://www.youtube.com/watch?v=gGLophKzJs8) +- [@video@What is Load Balancing?](https://www.youtube.com/watch?v=gGLophKzJs8) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/lock--mutex--semaphore@O6-vG3FuoYet4D0hbiyrv.md b/src/data/roadmaps/computer-science/content/lock--mutex--semaphore@O6-vG3FuoYet4D0hbiyrv.md index bd3f60e04..e04867a02 100644 --- a/src/data/roadmaps/computer-science/content/lock--mutex--semaphore@O6-vG3FuoYet4D0hbiyrv.md +++ b/src/data/roadmaps/computer-science/content/lock--mutex--semaphore@O6-vG3FuoYet4D0hbiyrv.md @@ -9,4 +9,4 @@ A semaphore does the same as a mutex but allows x number of threads to enter, th Visit the following resources to learn more: - [@article@What is the difference between lock, mutex and semaphore?](https://stackoverflow.com/questions/2332765/what-is-the-difference-between-lock-mutex-and-semaphore) -- [@article@What is a Semaphore](https://stackoverflow.com/questions/34519/what-is-a-semaphore/40238#40238) +- [@article@What is a Semaphore](https://stackoverflow.com/questions/34519/what-is-a-semaphore/40238#40238) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/locking@_sm63rZNKoibVndeNgOpW.md b/src/data/roadmaps/computer-science/content/locking@_sm63rZNKoibVndeNgOpW.md index 4692eab5d..87722ad56 100644 --- a/src/data/roadmaps/computer-science/content/locking@_sm63rZNKoibVndeNgOpW.md +++ b/src/data/roadmaps/computer-science/content/locking@_sm63rZNKoibVndeNgOpW.md @@ -6,4 +6,4 @@ Visit the following resources to learn more: - [@article@Locking in Databases and Isolation Mechanisms](https://medium.com/inspiredbrilliance/what-are-database-locks-1aff9117c290) - [@article@Understanding Database Lock Timeouts and Deadlocks](https://www.dbta.com/Columns/DBA-Corner/Understanding-Database-Lock-Timeouts-and-Deadlocks-148659.aspx) -- [@video@Row-Level Database Locks Explained - (Read vs Exclusive)](https://www.youtube.com/watch?v=nuBi2XbHH18) +- [@video@Row-Level Database Locks Explained - (Read vs Exclusive)](https://www.youtube.com/watch?v=nuBi2XbHH18) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/logarithmic@nnlMNkQn1HU4U9yPbV9kQ.md b/src/data/roadmaps/computer-science/content/logarithmic@nnlMNkQn1HU4U9yPbV9kQ.md index 85ec66899..29140cdbe 100644 --- a/src/data/roadmaps/computer-science/content/logarithmic@nnlMNkQn1HU4U9yPbV9kQ.md +++ b/src/data/roadmaps/computer-science/content/logarithmic@nnlMNkQn1HU4U9yPbV9kQ.md @@ -5,4 +5,4 @@ Logarithmic complexity algorithms are the second fastest algorithms. They are fa Visit the following resources to learn more: - [@video@Big O Notation — Calculating Time Complexity](https://www.youtube.com/watch?v=Z0bH0cMY0E8) -- [@video@Big O Notations](https://www.youtube.com/watch?v=V6mKVRU1evU) +- [@video@Big O Notations](https://www.youtube.com/watch?v=V6mKVRU1evU) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/long-polling@XeJi6TwpI5Uaszj00Uv_2.md b/src/data/roadmaps/computer-science/content/long-polling@XeJi6TwpI5Uaszj00Uv_2.md index aecb5b955..3ff0fced7 100644 --- a/src/data/roadmaps/computer-science/content/long-polling@XeJi6TwpI5Uaszj00Uv_2.md +++ b/src/data/roadmaps/computer-science/content/long-polling@XeJi6TwpI5Uaszj00Uv_2.md @@ -5,4 +5,4 @@ Long polling is a technique used to implement server push functionality over HTT Visit the following resources to learn more: - [@article@Long Polling](https://javascript.info/long-polling) -- [@article@What are Long-Polling, Websockets, Server-Sent Events (SSE) and Comet?](https://stackoverflow.com/questions/11077857/what-are-long-polling-websockets-server-sent-events-sse-and-comet) +- [@article@What are Long-Polling, Websockets, Server-Sent Events (SSE) and Comet?](https://stackoverflow.com/questions/11077857/what-are-long-polling-websockets-server-sent-events-sse-and-comet) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/longest-path-problem@4QVVYjDODMWsjnrE-4UBs.md b/src/data/roadmaps/computer-science/content/longest-path-problem@4QVVYjDODMWsjnrE-4UBs.md index dc97ef816..4803cde58 100644 --- a/src/data/roadmaps/computer-science/content/longest-path-problem@4QVVYjDODMWsjnrE-4UBs.md +++ b/src/data/roadmaps/computer-science/content/longest-path-problem@4QVVYjDODMWsjnrE-4UBs.md @@ -5,4 +5,4 @@ Longest path problem is a problem that asks us to find the longest path in a gra Visit the following resources to learn more: - [@video@Shortest/Longest path on a Directed Acyclic Graph (DAG) | Graph Theory](https://www.youtube.com/watch?v=TXkDpqjDMHA) -- [@video@Longest Simple Path - Intro to Algorithms](https://www.youtube.com/watch?v=lRH0tax5dFA) +- [@video@Longest Simple Path - Intro to Algorithms](https://www.youtube.com/watch?v=lRH0tax5dFA) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/lru-cache@cEsboPT8nLvo0Zt0_oBq6.md b/src/data/roadmaps/computer-science/content/lru-cache@cEsboPT8nLvo0Zt0_oBq6.md index f5daec8cf..dfcf2f8ec 100644 --- a/src/data/roadmaps/computer-science/content/lru-cache@cEsboPT8nLvo0Zt0_oBq6.md +++ b/src/data/roadmaps/computer-science/content/lru-cache@cEsboPT8nLvo0Zt0_oBq6.md @@ -6,4 +6,4 @@ Visit the following resources to learn more: - [@video@The Magic of LRU Cache (100 Days of Google Dev)](https://www.youtube.com/watch?v=R5ON3iwx78M) - [@video@Implementing LRU - Udacity](https://www.youtube.com/watch?v=bq6N7Ym81iI) -- [@video@LeetCode | 146 LRU Cache | C++ | Explanation](https://www.youtube.com/watch?v=8-FZRAjR7qU) +- [@video@LeetCode | 146 LRU Cache | C++ | Explanation](https://www.youtube.com/watch?v=8-FZRAjR7qU) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/maze-solving-problem@nODFT-i2YsxUVsgwWkIWn.md b/src/data/roadmaps/computer-science/content/maze-solving-problem@nODFT-i2YsxUVsgwWkIWn.md index 0d83955ff..68315a4d9 100644 --- a/src/data/roadmaps/computer-science/content/maze-solving-problem@nODFT-i2YsxUVsgwWkIWn.md +++ b/src/data/roadmaps/computer-science/content/maze-solving-problem@nODFT-i2YsxUVsgwWkIWn.md @@ -7,4 +7,4 @@ Visit the following resources to learn more: - [@opensource@Maze Solving Algorithms](https://github.com/john-science/mazelib/blob/main/docs/MAZE_SOLVE_ALGOS.md) - [@article@Maze Solving Algorithms](https://kidscodecs.com/maze-solving-algorithms/) - [@video@Maze Solving - Computerphile](https://www.youtube.com/watch?v=rop0W4QDOUI) -- [@video@Python Maze Solving Tutorial (Using Recursion)](https://www.youtube.com/watch?v=XP94WC_XnZc) +- [@video@Python Maze Solving Tutorial (Using Recursion)](https://www.youtube.com/watch?v=XP94WC_XnZc) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/memory-management@jVsZFTzyrYEDyR8LiBQL0.md b/src/data/roadmaps/computer-science/content/memory-management@jVsZFTzyrYEDyR8LiBQL0.md index df4b2355b..cbfa724e5 100644 --- a/src/data/roadmaps/computer-science/content/memory-management@jVsZFTzyrYEDyR8LiBQL0.md +++ b/src/data/roadmaps/computer-science/content/memory-management@jVsZFTzyrYEDyR8LiBQL0.md @@ -5,4 +5,4 @@ Memory management is the process of allocating and deallocating memory. It is a Visit the following resources to learn more: - [@video@MIT 6.004 L15: The Memory Hierarchy](https://www.youtube.com/watch?v=vjYF_fAZI5E&list=PLrRW1w6CGAcXbMtDFj205vALOGmiRc82-&index=24) -- [@video@MIT 6.004 L16: Cache Issues](https://www.youtube.com/watch?v=ajgC3-pyGlk&index=25&list=PLrRW1w6CGAcXbMtDFj205vALOGmiRc82-) +- [@video@MIT 6.004 L16: Cache Issues](https://www.youtube.com/watch?v=ajgC3-pyGlk&index=25&list=PLrRW1w6CGAcXbMtDFj205vALOGmiRc82-) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/merge-sort@Bh-whDbcCjl3m6mRm9w02.md b/src/data/roadmaps/computer-science/content/merge-sort@Bh-whDbcCjl3m6mRm9w02.md index d8f33ec8c..e1e480e2c 100644 --- a/src/data/roadmaps/computer-science/content/merge-sort@Bh-whDbcCjl3m6mRm9w02.md +++ b/src/data/roadmaps/computer-science/content/merge-sort@Bh-whDbcCjl3m6mRm9w02.md @@ -5,4 +5,4 @@ Merge sort is a divide and conquer algorithm. It divides the input array into tw Visit the following resources to learn more: - [@article@Merge Sort Algorithm](https://www.programiz.com/dsa/merge-sort) -- [@video@Merge Sort in 3 Minutes](https://www.youtube.com/watch?v=4VqmGXwpLqc) +- [@video@Merge Sort in 3 Minutes](https://www.youtube.com/watch?v=4VqmGXwpLqc) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/mfu-cache@hna0HLu0l4NTNNpyGqlW5.md b/src/data/roadmaps/computer-science/content/mfu-cache@hna0HLu0l4NTNNpyGqlW5.md index 30a55d9c7..926bce494 100644 --- a/src/data/roadmaps/computer-science/content/mfu-cache@hna0HLu0l4NTNNpyGqlW5.md +++ b/src/data/roadmaps/computer-science/content/mfu-cache@hna0HLu0l4NTNNpyGqlW5.md @@ -5,4 +5,4 @@ MFU Cache is another cache algorithm. The difference is that instead of deleting Visit the following resources to learn more: - [@article@Comparison of MFU and LRU page replacement algorithms](https://stackoverflow.com/questions/13597246/comparison-of-mfu-and-lru-page-replacement-algorithms) -- [@article@Why does cache use Most Recently Used (MRU) algorithm as evict policy?](https://stackoverflow.com/questions/5088128/why-does-cache-use-most-recently-used-mru-algorithm-as-evict-policy) +- [@article@Why does cache use Most Recently Used (MRU) algorithm as evict policy?](https://stackoverflow.com/questions/5088128/why-does-cache-use-most-recently-used-mru-algorithm-as-evict-policy) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/networking@zG5t3HqbZnh9CGRqp1Sb-.md b/src/data/roadmaps/computer-science/content/networking@zG5t3HqbZnh9CGRqp1Sb-.md index 0b0b032df..c78249c32 100644 --- a/src/data/roadmaps/computer-science/content/networking@zG5t3HqbZnh9CGRqp1Sb-.md +++ b/src/data/roadmaps/computer-science/content/networking@zG5t3HqbZnh9CGRqp1Sb-.md @@ -6,7 +6,7 @@ If you have networking experience or want to be a reliability engineer or operat Visit the following resources to learn more: -- [@video@Computer Networking Course - Network Engineering](https://www.youtube.com/watch?v=qiQR5rTSshw) - [@article@Khan Academy - Networking](https://www.khanacademy.org/computing/code-org/computers-and-the-internet) +- [@video@Computer Networking Course - Network Engineering](https://www.youtube.com/watch?v=qiQR5rTSshw) - [@video@Networking Video Series (21 videos)](https://www.youtube.com/playlist?list=PLEbnTDJUr_IegfoqO4iPnPYQui46QqT0j) -- [@feed@Explore top posts about Networking](https://app.daily.dev/tags/networking?ref=roadmapsh) +- [@feed@Explore top posts about Networking](https://app.daily.dev/tags/networking?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/non-tail-recursion@iLEOuQgUgU5Jc38iXDpp5.md b/src/data/roadmaps/computer-science/content/non-tail-recursion@iLEOuQgUgU5Jc38iXDpp5.md index b9ae9c656..75125984b 100644 --- a/src/data/roadmaps/computer-science/content/non-tail-recursion@iLEOuQgUgU5Jc38iXDpp5.md +++ b/src/data/roadmaps/computer-science/content/non-tail-recursion@iLEOuQgUgU5Jc38iXDpp5.md @@ -10,4 +10,4 @@ Visit the following resources to learn more: - [@article@Tail vs Non-Tail Recursion](https://www.baeldung.com/cs/tail-vs-non-tail-recursion) - [@video@Recursion (Solved Problem 1)](https://www.youtube.com/watch?v=IVLUGb_gDDE) - [@video@Types of Recursion (Part 2) | Tail & Non-tail Recursion](https://www.youtube.com/watch?v=HIt_GPuD7wk) -- [@feed@Explore top posts about Recursion](https://app.daily.dev/tags/recursion?ref=roadmapsh) +- [@feed@Explore top posts about Recursion](https://app.daily.dev/tags/recursion?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/normalization--denormalization@Rw7QjLC8hLtXSwmU_9kHC.md b/src/data/roadmaps/computer-science/content/normalization--denormalization@Rw7QjLC8hLtXSwmU_9kHC.md index 554d589cf..cfc546442 100644 --- a/src/data/roadmaps/computer-science/content/normalization--denormalization@Rw7QjLC8hLtXSwmU_9kHC.md +++ b/src/data/roadmaps/computer-science/content/normalization--denormalization@Rw7QjLC8hLtXSwmU_9kHC.md @@ -7,4 +7,4 @@ Denormalization is the opposite of normalization. It is the process of adding re Visit the following resources to learn more: - [@video@Normalization vs. Denormalization | Events and Event Streaming](https://www.youtube.com/watch?v=sDU94hraq8g) -- [@video@Normalization - 1NF, 2NF, 3NF and 4NF](https://www.youtube.com/watch?v=UrYLYV7WSHM) +- [@video@Normalization - 1NF, 2NF, 3NF and 4NF](https://www.youtube.com/watch?v=UrYLYV7WSHM) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/np-complete@Lwkz7qozXRlVNA20zJbSw.md b/src/data/roadmaps/computer-science/content/np-complete@Lwkz7qozXRlVNA20zJbSw.md index 0f4bc832d..ad673dc4e 100644 --- a/src/data/roadmaps/computer-science/content/np-complete@Lwkz7qozXRlVNA20zJbSw.md +++ b/src/data/roadmaps/computer-science/content/np-complete@Lwkz7qozXRlVNA20zJbSw.md @@ -10,4 +10,4 @@ Visit the following resources to learn more: - [@video@Greedy Algs. II & Intro to NP Completeness](https://youtu.be/qcGnJ47Smlo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=2939) - [@video@NP Completeness II & Reductions](https://www.youtube.com/watch?v=e0tGC6ZQdQE&index=16&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm) - [@video@NP Completeness III](https://www.youtube.com/watch?v=fCX1BGT3wjE&index=17&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm) -- [@video@NP Completeness IV](https://www.youtube.com/watch?v=NKLDp3Rch3M&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=18) +- [@video@NP Completeness IV](https://www.youtube.com/watch?v=NKLDp3Rch3M&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=18) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/np-hard@mJJ8DGUpBuHEJ7I6UTy1T.md b/src/data/roadmaps/computer-science/content/np-hard@mJJ8DGUpBuHEJ7I6UTy1T.md index 92ecf051a..e9ea4b280 100644 --- a/src/data/roadmaps/computer-science/content/np-hard@mJJ8DGUpBuHEJ7I6UTy1T.md +++ b/src/data/roadmaps/computer-science/content/np-hard@mJJ8DGUpBuHEJ7I6UTy1T.md @@ -12,4 +12,4 @@ Visit the following resources to learn more: - [@video@Greedy Algs. II & Intro to NP Completeness](https://youtu.be/qcGnJ47Smlo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=2939) - [@video@NP Completeness II & Reductions](https://www.youtube.com/watch?v=e0tGC6ZQdQE&index=16&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm) - [@video@NP Completeness III](https://www.youtube.com/watch?v=fCX1BGT3wjE&index=17&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm) -- [@video@NP Completeness IV](https://www.youtube.com/watch?v=NKLDp3Rch3M&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=18) +- [@video@NP Completeness IV](https://www.youtube.com/watch?v=NKLDp3Rch3M&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=18) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/np@ewXUHpOnjm8YrLhce1dAQ.md b/src/data/roadmaps/computer-science/content/np@ewXUHpOnjm8YrLhce1dAQ.md index b602b7028..4678c1d57 100644 --- a/src/data/roadmaps/computer-science/content/np@ewXUHpOnjm8YrLhce1dAQ.md +++ b/src/data/roadmaps/computer-science/content/np@ewXUHpOnjm8YrLhce1dAQ.md @@ -12,4 +12,4 @@ Visit the following resources to learn more: - [@video@Greedy Algs. II & Intro to NP Completeness](https://youtu.be/qcGnJ47Smlo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=2939) - [@video@NP Completeness II & Reductions](https://www.youtube.com/watch?v=e0tGC6ZQdQE&index=16&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm) - [@video@NP Completeness III](https://www.youtube.com/watch?v=fCX1BGT3wjE&index=17&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm) -- [@video@NP Completeness IV](https://www.youtube.com/watch?v=NKLDp3Rch3M&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=18) +- [@video@NP Completeness IV](https://www.youtube.com/watch?v=NKLDp3Rch3M&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=18) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/null-object-pattern@PpFQ0zmObZLvmBvqhTEMz.md b/src/data/roadmaps/computer-science/content/null-object-pattern@PpFQ0zmObZLvmBvqhTEMz.md index fe9730feb..2ddff823c 100644 --- a/src/data/roadmaps/computer-science/content/null-object-pattern@PpFQ0zmObZLvmBvqhTEMz.md +++ b/src/data/roadmaps/computer-science/content/null-object-pattern@PpFQ0zmObZLvmBvqhTEMz.md @@ -4,4 +4,4 @@ Null object pattern is a design pattern that is used to represent a null value w Visit the following resources to learn more: -- [@article@Design Patterns - Null Object Pattern](https://www.tutorialspoint.com/design_pattern/null_object_pattern.htm) +- [@article@Design Patterns - Null Object Pattern](https://www.tutorialspoint.com/design_pattern/null_object_pattern.htm) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/osi-model@pZ5x_zDYGzW9VxYycyXtN.md b/src/data/roadmaps/computer-science/content/osi-model@pZ5x_zDYGzW9VxYycyXtN.md index e379d5ae9..b4498bda4 100644 --- a/src/data/roadmaps/computer-science/content/osi-model@pZ5x_zDYGzW9VxYycyXtN.md +++ b/src/data/roadmaps/computer-science/content/osi-model@pZ5x_zDYGzW9VxYycyXtN.md @@ -5,4 +5,4 @@ The OSI and TCP/IP model is used to help the developer to design their system fo Visit the following resources to learn more: - [@article@Cloudflare - What is the OSI model](https://www.cloudflare.com/learning/ddos/glossary/open-systems-interconnection-model-osi/) -- [@video@TCP/IP and the OSI Model Explained!](https://www.youtube.com/watch?v=e5DEVa9eSN0) +- [@video@TCP/IP and the OSI Model Explained!](https://www.youtube.com/watch?v=e5DEVa9eSN0) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/owasp-top-10@3rPSp135TdSCyvXzEzn4p.md b/src/data/roadmaps/computer-science/content/owasp-top-10@3rPSp135TdSCyvXzEzn4p.md index 81154919d..4e44a1541 100644 --- a/src/data/roadmaps/computer-science/content/owasp-top-10@3rPSp135TdSCyvXzEzn4p.md +++ b/src/data/roadmaps/computer-science/content/owasp-top-10@3rPSp135TdSCyvXzEzn4p.md @@ -5,7 +5,7 @@ OWASP or Open Web Application Security Project is an online community that produ Visit the following resources to learn more: - [@official@OWASP](https://owasp.org/) -- [@article@OWASP - Wiki](https://en.wikipedia.org/wiki/OWASP) - [@opensource@OWASP Web Application Security Testing Checklist](https://github.com/0xRadi/OWASP-Web-Checklist) +- [@article@OWASP - Wiki](https://en.wikipedia.org/wiki/OWASP) - [@article@OWASP Top 10 Security Risks](https://sucuri.net/guides/owasp-top-10-security-vulnerabilities-2021/) -- [@article@OWASP Cheatsheets](https://cheatsheetseries.owasp.org/cheatsheets/AJAX_Security_Cheat_Sheet.html) +- [@article@OWASP Cheatsheets](https://cheatsheetseries.owasp.org/cheatsheets/AJAX_Security_Cheat_Sheet.html) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/p--np@0btHNkzWL1w_-pUgU_k2y.md b/src/data/roadmaps/computer-science/content/p--np@0btHNkzWL1w_-pUgU_k2y.md index 274b0a158..cc6ff3690 100644 --- a/src/data/roadmaps/computer-science/content/p--np@0btHNkzWL1w_-pUgU_k2y.md +++ b/src/data/roadmaps/computer-science/content/p--np@0btHNkzWL1w_-pUgU_k2y.md @@ -10,4 +10,4 @@ So far, we don't know whether P = NP or P ≠ NP. Visit the following resources to learn more: -- [@article@Whats P=NP?, and why is it such a famous question?](https://stackoverflow.com/questions/111307/whats-p-np-and-why-is-it-such-a-famous-question) +- [@article@Whats P=NP?, and why is it such a famous question?](https://stackoverflow.com/questions/111307/whats-p-np-and-why-is-it-such-a-famous-question) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/p@3aM17dPKNi8tRJsW8lesI.md b/src/data/roadmaps/computer-science/content/p@3aM17dPKNi8tRJsW8lesI.md index 65f895aa8..052cdc746 100644 --- a/src/data/roadmaps/computer-science/content/p@3aM17dPKNi8tRJsW8lesI.md +++ b/src/data/roadmaps/computer-science/content/p@3aM17dPKNi8tRJsW8lesI.md @@ -9,4 +9,4 @@ Visit the following resources to learn more: - [@video@Complexity: Approximation Algorithms](https://www.youtube.com/watch?v=MEz1J9wY2iM&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=24) - [@video@Complexity: Fixed-Parameter Algorithms](https://www.youtube.com/watch?v=4q-jmGrmxKs&index=25&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) - [@video@Lecture 23: Computational Complexity](https://www.youtube.com/watch?v=moPtwq_cVH8&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=24) -- [@video@Greedy Algs. II & Intro to NP Completeness](https://youtu.be/qcGnJ47Smlo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=2939) +- [@video@Greedy Algs. II & Intro to NP Completeness](https://youtu.be/qcGnJ47Smlo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=2939) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/pacelc@g6HeyLptaAYx9QBKuHQyM.md b/src/data/roadmaps/computer-science/content/pacelc@g6HeyLptaAYx9QBKuHQyM.md index 96bac5091..ccda48c3c 100644 --- a/src/data/roadmaps/computer-science/content/pacelc@g6HeyLptaAYx9QBKuHQyM.md +++ b/src/data/roadmaps/computer-science/content/pacelc@g6HeyLptaAYx9QBKuHQyM.md @@ -4,4 +4,4 @@ The PACELC Theorem is an extension of the CAP Theorem. One of the questions that Visit the following resources to learn more: -- [@article@PACELC Theorem](https://www.scylladb.com/glossary/pacelc-theorem/) +- [@article@PACELC Theorem](https://www.scylladb.com/glossary/pacelc-theorem/) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/pick-a-language@tU4Umtnfu01t9gLlnlK6b.md b/src/data/roadmaps/computer-science/content/pick-a-language@tU4Umtnfu01t9gLlnlK6b.md index 747b999d9..4c6f3cdc8 100644 --- a/src/data/roadmaps/computer-science/content/pick-a-language@tU4Umtnfu01t9gLlnlK6b.md +++ b/src/data/roadmaps/computer-science/content/pick-a-language@tU4Umtnfu01t9gLlnlK6b.md @@ -2,8 +2,8 @@ You need to pick a programming language to learn the Computer Science concepts. My personal recommendation would be to pick C++ or C and the reason for that is: -- They allow you to deal with pointers and memory allocation/deallocation, so you feel the data structures and algorithms in your bones. In higher level languages like Python or Java, these are hidden from you. In day to day work, that's terrific, but when you're learning how these low-level data structures are built, it's great to feel close to the metal. -- You will be able to find a lot of resources for the topics listed in this roadmap using C or C++. You can find a lot of resources for Python and Java, but they are not as abundant as C++ and C. +* They allow you to deal with pointers and memory allocation/deallocation, so you feel the data structures and algorithms in your bones. In higher level languages like Python or Java, these are hidden from you. In day to day work, that's terrific, but when you're learning how these low-level data structures are built, it's great to feel close to the metal. +* You will be able to find a lot of resources for the topics listed in this roadmap using C or C++. You can find a lot of resources for Python and Java, but they are not as abundant as C++ and C. Given below is the list of resources; pick ones relevant to the language of your choice. @@ -11,8 +11,8 @@ Visit the following resources to learn more: - [@roadmap@Visit Dedicated C++ Roadmap](https://roadmap.sh/cpp) - [@article@Learn C++ - Tutorials Point](https://www.tutorialspoint.com/cplusplus/index.htm) +- [@article@Learn C - Tutorials Point](https://www.tutorialspoint.com/cprogramming/index.htm) - [@video@C++ Programming Course - Beginner to Advanced](https://www.youtube.com/watch?v=8jLOx1hD3_o) - [@video@C++ Tutorial for Beginners - Full Course](https://www.youtube.com/watch?v=vLnPwxZdW4Y) -- [@article@Learn C - Tutorials Point](https://www.tutorialspoint.com/cprogramming/index.htm) - [@video@C Programming Tutorial for Beginners](https://www.youtube.com/watch?v=KJgsSFOSQv0) -- [@video@Learn C Programming with Dr. Chuck](https://www.youtube.com/watch?v=j-_s8f5K30I) +- [@video@Learn C Programming with Dr. Chuck](https://www.youtube.com/watch?v=j-_s8f5K30I) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/polynomial@sVFvpsAO1_ZH9aliEj9aF.md b/src/data/roadmaps/computer-science/content/polynomial@sVFvpsAO1_ZH9aliEj9aF.md index 60f8fa2e9..54381eb36 100644 --- a/src/data/roadmaps/computer-science/content/polynomial@sVFvpsAO1_ZH9aliEj9aF.md +++ b/src/data/roadmaps/computer-science/content/polynomial@sVFvpsAO1_ZH9aliEj9aF.md @@ -2,14 +2,12 @@ Polynomial algorithms are algorithms that have a runtime that is a polynomial function of the input size. This means that the runtime is a function of the form `n^k` where `k` is a constant. For example, the runtime of the following algorithm is `n^2`: -```python -def polynomial_algorithm(n): - for i in range(n): - for j in range(n): - print(i, j) -``` + def polynomial_algorithm(n): + for i in range(n): + for j in range(n): + print(i, j) Visit the following resources to learn more: - [@video@Big O Notation — Calculating Time Complexity](https://www.youtube.com/watch?v=Z0bH0cMY0E8) -- [@video@Big O Notations](https://www.youtube.com/watch?v=V6mKVRU1evU) +- [@video@Big O Notations](https://www.youtube.com/watch?v=V6mKVRU1evU) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/post-order-traversal@4_oGXwjzSY5cX9n7L4iAA.md b/src/data/roadmaps/computer-science/content/post-order-traversal@4_oGXwjzSY5cX9n7L4iAA.md index 267335c03..921330220 100644 --- a/src/data/roadmaps/computer-science/content/post-order-traversal@4_oGXwjzSY5cX9n7L4iAA.md +++ b/src/data/roadmaps/computer-science/content/post-order-traversal@4_oGXwjzSY5cX9n7L4iAA.md @@ -5,4 +5,4 @@ Post-order traversal is a type of tree traversal that visits the left subtree, t Visit the following resources to learn more: - [@article@Postorder Traversal of Binary Tree](https://www.geeksforgeeks.org/postorder-traversal-of-binary-tree/) -- [@video@Tree | Illustrated Data Structures](https://www.youtube.com/watch?v=S2W3SXGPVyU) +- [@video@Tree | Illustrated Data Structures](https://www.youtube.com/watch?v=S2W3SXGPVyU) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/pre-order-traversal@psTN5N66xoFHFopgd5faW.md b/src/data/roadmaps/computer-science/content/pre-order-traversal@psTN5N66xoFHFopgd5faW.md index b4a39e52d..81c785c14 100644 --- a/src/data/roadmaps/computer-science/content/pre-order-traversal@psTN5N66xoFHFopgd5faW.md +++ b/src/data/roadmaps/computer-science/content/pre-order-traversal@psTN5N66xoFHFopgd5faW.md @@ -1,8 +1,8 @@ # Pre-Order Traversal -Pre-order traversal is a tree traversal algorithm that visits the root node first, then recursively traverses the left subtree, followed by the right subtree. +Pre-order traversal is a way to visit every node in a tree data structure. It follows a specific order: first, the current node is processed (or visited). Then, the left subtree of the current node is traversed using pre-order. Finally, the right subtree of the current node is traversed using pre-order. This "node-left-right" sequence ensures each node is visited exactly once. Visit the following resources to learn more: - [@video@Tree | Illustrated Data Structures](https://www.youtube.com/watch?v=S2W3SXGPVyU) -- [@video@Pre-order tree traversal in 3 minutes](https://www.youtube.com/watch?v=1WxLM2hwL-U) +- [@video@Pre-order tree traversal in 3 minutes](https://www.youtube.com/watch?v=1WxLM2hwL-U) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/prims-algorithm@znpFIKwMJlepKJ8dH3kvC.md b/src/data/roadmaps/computer-science/content/prims-algorithm@znpFIKwMJlepKJ8dH3kvC.md index 1f23e09ec..4ec2f70b2 100644 --- a/src/data/roadmaps/computer-science/content/prims-algorithm@znpFIKwMJlepKJ8dH3kvC.md +++ b/src/data/roadmaps/computer-science/content/prims-algorithm@znpFIKwMJlepKJ8dH3kvC.md @@ -4,6 +4,6 @@ Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a Visit the following resources to learn more: -- [@video@Graph Algorithms I - Topological Sorting, Prims Algorithm - Lecture 6](https://www.youtube.com/watch?v=i_AQT_XfvD8\&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm\&index=7) - [@article@Prims Algorithm](https://www.programiz.com/dsa/prim-algorithm) -- [@feed@Explore top posts about Data Science](https://app.daily.dev/tags/data-science?ref=roadmapsh) +- [@video@Graph Algorithms I - Topological Sorting, Prims Algorithm - Lecture 6](https://www.youtube.com/watch?v=i_AQT_XfvD8&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=7) +- [@feed@Explore top posts about Data Science](https://app.daily.dev/tags/data-science?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/probability@HZ3_xyphbjhBPwwQo_rHH.md b/src/data/roadmaps/computer-science/content/probability@HZ3_xyphbjhBPwwQo_rHH.md index b9f854ab0..cc562b3c5 100644 --- a/src/data/roadmaps/computer-science/content/probability@HZ3_xyphbjhBPwwQo_rHH.md +++ b/src/data/roadmaps/computer-science/content/probability@HZ3_xyphbjhBPwwQo_rHH.md @@ -4,12 +4,12 @@ Probability is the study of how likely an event is to occur. It is a measure of Visit the following resources to learn more: -- [@video@MIT 6.042J - Probability Introduction](https://www.youtube.com/watch?v=SmFwFdESMHI\&index=18\&list=PLB7540DEDD482705B) -- [@video@MIT 6.042J - Conditional Probability](https://www.youtube.com/watch?v=E6FbvM-FGZ8\&index=19\&list=PLB7540DEDD482705B) -- [@video@MIT 6.042J - Independence](https://www.youtube.com/watch?v=l1BCv3qqW4A\&index=20\&list=PLB7540DEDD482705B) -- [@video@MIT 6.042J - Random Variables](https://www.youtube.com/watch?v=MOfhhFaQdjw\&list=PLB7540DEDD482705B\&index=21) -- [@video@MIT 6.042J - Expectation I](https://www.youtube.com/watch?v=gGlMSe7uEkA\&index=22\&list=PLB7540DEDD482705B) -- [@video@MIT 6.042J - Expectation II](https://www.youtube.com/watch?v=oI9fMUqgfxY\&index=23\&list=PLB7540DEDD482705B) -- [@video@MIT 6.042J - Large Deviations](https://www.youtube.com/watch?v=q4mwO2qS2z4\&index=24\&list=PLB7540DEDD482705B) -- [@video@MIT 6.042J - Random Walks](https://www.youtube.com/watch?v=56iFMY8QW2k\&list=PLB7540DEDD482705B\&index=25) -- [@feed@Explore top posts about Statistics](https://app.daily.dev/tags/statistics?ref=roadmapsh) +- [@video@MIT 6.042J - Probability Introduction](https://www.youtube.com/watch?v=SmFwFdESMHI&index=18&list=PLB7540DEDD482705B) +- [@video@MIT 6.042J - Conditional Probability](https://www.youtube.com/watch?v=E6FbvM-FGZ8&index=19&list=PLB7540DEDD482705B) +- [@video@MIT 6.042J - Independence](https://www.youtube.com/watch?v=l1BCv3qqW4A&index=20&list=PLB7540DEDD482705B) +- [@video@MIT 6.042J - Random Variables](https://www.youtube.com/watch?v=MOfhhFaQdjw&list=PLB7540DEDD482705B&index=21) +- [@video@MIT 6.042J - Expectation I](https://www.youtube.com/watch?v=gGlMSe7uEkA&index=22&list=PLB7540DEDD482705B) +- [@video@MIT 6.042J - Expectation II](https://www.youtube.com/watch?v=oI9fMUqgfxY&index=23&list=PLB7540DEDD482705B) +- [@video@MIT 6.042J - Large Deviations](https://www.youtube.com/watch?v=q4mwO2qS2z4&index=24&list=PLB7540DEDD482705B) +- [@video@MIT 6.042J - Random Walks](https://www.youtube.com/watch?v=56iFMY8QW2k&list=PLB7540DEDD482705B&index=25) +- [@feed@Explore top posts about Statistics](https://app.daily.dev/tags/statistics?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/process-forking@RbdT5MOE4L-E7PPWKRITX.md b/src/data/roadmaps/computer-science/content/process-forking@RbdT5MOE4L-E7PPWKRITX.md index f5e2577d2..b1f76b72b 100644 --- a/src/data/roadmaps/computer-science/content/process-forking@RbdT5MOE4L-E7PPWKRITX.md +++ b/src/data/roadmaps/computer-science/content/process-forking@RbdT5MOE4L-E7PPWKRITX.md @@ -7,4 +7,4 @@ Visit the following resources to learn more: - [@article@Fork System Call in Operating System](https://www.geeksforgeeks.org/fork-system-call-in-operating-system/) - [@video@Understanding fork() system call for new process creation](https://www.youtube.com/watch?v=PwxTbksJ2fo) - [@video@fork() and exec() System Calls](https://www.youtube.com/watch?v=IFEFVXvjiHY) -- [@video@The fork() function in C](https://www.youtube.com/watch?v=cex9XrZCU14) +- [@video@The fork() function in C](https://www.youtube.com/watch?v=cex9XrZCU14) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/processes-and-threads@ETEUA7jaEGyOEX8tAVNWs.md b/src/data/roadmaps/computer-science/content/processes-and-threads@ETEUA7jaEGyOEX8tAVNWs.md index 5e79fe2ec..1d65c337b 100644 --- a/src/data/roadmaps/computer-science/content/processes-and-threads@ETEUA7jaEGyOEX8tAVNWs.md +++ b/src/data/roadmaps/computer-science/content/processes-and-threads@ETEUA7jaEGyOEX8tAVNWs.md @@ -6,4 +6,4 @@ Visit the following resources to learn more: - [@article@Whats the difference between Process and a Thread?](https://www.quora.com/What-is-the-difference-between-a-process-and-a-thread) - [@article@Operating Systems and System Programming](https://archive.org/details/ucberkeley-webcast-PL-XXv-cvA_iBDyz-ba4yDskqMDY6A1w_c) -- [@video@25 hour Operating Systems Course - freecodecamp](https://youtu.be/yK1uBHPdp30?si=gGPdK7cM4KlP6Qq0) +- [@video@25 hour Operating Systems Course - freecodecamp](https://youtu.be/yK1uBHPdp30?si=gGPdK7cM4KlP6Qq0) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/processes-vs-threads@IEX6v_MYpE5Ylk_28K2ZU.md b/src/data/roadmaps/computer-science/content/processes-vs-threads@IEX6v_MYpE5Ylk_28K2ZU.md index 29b2157d6..a4f81562d 100644 --- a/src/data/roadmaps/computer-science/content/processes-vs-threads@IEX6v_MYpE5Ylk_28K2ZU.md +++ b/src/data/roadmaps/computer-science/content/processes-vs-threads@IEX6v_MYpE5Ylk_28K2ZU.md @@ -5,4 +5,4 @@ Processes and threads are the basic building blocks of a computer program. They Visit the following resources to learn more: - [@article@Whats the difference between Process and a Thread?](https://www.quora.com/What-is-the-difference-between-a-process-and-a-thread) -- [@article@Operating Systems and System Programming](https://archive.org/details/ucberkeley-webcast-PL-XXv-cvA_iBDyz-ba4yDskqMDY6A1w_c) +- [@article@Operating Systems and System Programming](https://archive.org/details/ucberkeley-webcast-PL-XXv-cvA_iBDyz-ba4yDskqMDY6A1w_c) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/proxy@qLLJ_ehC8tSRfXsorYMQz.md b/src/data/roadmaps/computer-science/content/proxy@qLLJ_ehC8tSRfXsorYMQz.md index c97708919..db4c08e60 100644 --- a/src/data/roadmaps/computer-science/content/proxy@qLLJ_ehC8tSRfXsorYMQz.md +++ b/src/data/roadmaps/computer-science/content/proxy@qLLJ_ehC8tSRfXsorYMQz.md @@ -4,5 +4,5 @@ A proxy server is an intermediary piece of hardware/software sitting between the Visit the following resources to learn more: -- [@roadmap.sh@Proxy Servers](https://roadmap.sh/guides/proxy-servers) -- [@article@Proxy - System Design](https://dev.to/karanpratapsingh/system-design-the-complete-course-10fo#proxy) +- [@article@Proxy Servers](https://roadmap.sh/guides/proxy-servers) +- [@article@Proxy - System Design](https://dev.to/karanpratapsingh/system-design-the-complete-course-10fo#proxy) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/public-key-cryptography@bDZ34BPm3lX06ERSE10cY.md b/src/data/roadmaps/computer-science/content/public-key-cryptography@bDZ34BPm3lX06ERSE10cY.md index d4cbb024b..5cc3b89b6 100644 --- a/src/data/roadmaps/computer-science/content/public-key-cryptography@bDZ34BPm3lX06ERSE10cY.md +++ b/src/data/roadmaps/computer-science/content/public-key-cryptography@bDZ34BPm3lX06ERSE10cY.md @@ -7,4 +7,4 @@ Visit the following resources to learn more: - [@article@Public-key Cryptography](https://en.wikipedia.org/wiki/Public-key_cryptography) - [@video@Public Key Cryptography - Computerphile](https://www.youtube.com/watch?v=GSIDS_lvRv4) - [@video@Public Key Cryptography: RSA Encryption Algorithm](https://www.youtube.com/watch?v=wXB-V_Keiu8) -- [@feed@Explore top posts about Cryptography](https://app.daily.dev/tags/cryptography?ref=roadmapsh) +- [@feed@Explore top posts about Cryptography](https://app.daily.dev/tags/cryptography?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/python@RlKZzs44biQPgxD0tK1qx.md b/src/data/roadmaps/computer-science/content/python@RlKZzs44biQPgxD0tK1qx.md index 99548d287..3bf2dde62 100644 --- a/src/data/roadmaps/computer-science/content/python@RlKZzs44biQPgxD0tK1qx.md +++ b/src/data/roadmaps/computer-science/content/python@RlKZzs44biQPgxD0tK1qx.md @@ -12,4 +12,4 @@ Visit the following resources to learn more: - [@article@Python Crash Course](https://ehmatthes.github.io/pcc/) - [@article@An Introduction to Python for Non-Programmers](https://thenewstack.io/an-introduction-to-python-for-non-programmers/) - [@article@Getting Started with Python and InfluxDB](https://thenewstack.io/getting-started-with-python-and-influxdb/) -- [@feed@Explore top posts about Python](https://app.daily.dev/tags/python?ref=roadmapsh) +- [@feed@Explore top posts about Python](https://app.daily.dev/tags/python?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/queue@JI990pDX2jjNe6IH_Y_t0.md b/src/data/roadmaps/computer-science/content/queue@JI990pDX2jjNe6IH_Y_t0.md index 21f38545e..fa0fcddfe 100644 --- a/src/data/roadmaps/computer-science/content/queue@JI990pDX2jjNe6IH_Y_t0.md +++ b/src/data/roadmaps/computer-science/content/queue@JI990pDX2jjNe6IH_Y_t0.md @@ -4,7 +4,7 @@ Queue is a linear collection of items where items are inserted and removed in a Visit the following resources to learn more: +- [@course@Queues - Coursera](https://www.coursera.org/lecture/data-structures/queues-EShpq) - [@article@Circular Buffer - Wikipedia](https://en.wikipedia.org/wiki/Circular_buffer) - [@video@Queue Data Structure | Illustrated Data Structures](https://www.youtube.com/watch?v=mDCi1lXd9hc) -- [@video@Queue in 3 Minutes](https://www.youtube.com/watch?v=D6gu-_tmEpQ) -- [@course@Queues - Coursera](https://www.coursera.org/lecture/data-structures/queues-EShpq) +- [@video@Queue in 3 Minutes](https://www.youtube.com/watch?v=D6gu-_tmEpQ) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/queues@LCPEzpyAuHY3ggN3nYrNN.md b/src/data/roadmaps/computer-science/content/queues@LCPEzpyAuHY3ggN3nYrNN.md index 8f675fb7b..356b639c8 100644 --- a/src/data/roadmaps/computer-science/content/queues@LCPEzpyAuHY3ggN3nYrNN.md +++ b/src/data/roadmaps/computer-science/content/queues@LCPEzpyAuHY3ggN3nYrNN.md @@ -6,4 +6,4 @@ Visit the following resources to learn more: - [@article@Message Queues - System Design](https://dev.to/karanpratapsingh/system-design-the-complete-course-10fo#message-queues) - [@video@What is a Message Queue?](https://www.youtube.com/watch?v=xErwDaOc-Gs) -- [@video@What is a Message Queue and Where is it used?](https://www.youtube.com/watch?v=oUJbuFMyBDk) +- [@video@What is a Message Queue and Where is it used?](https://www.youtube.com/watch?v=oUJbuFMyBDk) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/quick-sort@be0Q8GW9ZX1JbPrBvbMji.md b/src/data/roadmaps/computer-science/content/quick-sort@be0Q8GW9ZX1JbPrBvbMji.md index 8528882d5..7a30d172e 100644 --- a/src/data/roadmaps/computer-science/content/quick-sort@be0Q8GW9ZX1JbPrBvbMji.md +++ b/src/data/roadmaps/computer-science/content/quick-sort@be0Q8GW9ZX1JbPrBvbMji.md @@ -4,7 +4,7 @@ Quick Sort is a divide and conquer algorithm. It picks an element as pivot and p Visit the following resources to learn more: -- [@article@Quick Sort Algorithm](https://www.programiz.com/dsa/quick-sort) -- [@video@Quick Sort in 4 Minutes](https://www.youtube.com/watch?v=Hoixgm4-P4M&feature=youtu.be) -- [@article@Quick Sort Implementation in C](http://www.cs.yale.edu/homes/aspnes/classes/223/examples/randomization/quick.c) - [@opensource@Quick Sort Implementation in Python](https://github.com/jwasham/practice-python/blob/master/quick_sort/quick_sort.py) +- [@article@Quick Sort Algorithm](https://www.programiz.com/dsa/quick-sort) +- [@article@Quick Sort Implementation in C](http://www.cs.yale.edu/homes/aspnes/classes/223/examples/randomization/quick.c) +- [@video@Quick Sort in 4 Minutes](https://www.youtube.com/watch?v=Hoixgm4-P4M&feature=youtu.be) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/rabin-karp-algorithm@l5--4opvZoc_seVn__5R3.md b/src/data/roadmaps/computer-science/content/rabin-karp-algorithm@l5--4opvZoc_seVn__5R3.md index b736560cf..e013fbf0f 100644 --- a/src/data/roadmaps/computer-science/content/rabin-karp-algorithm@l5--4opvZoc_seVn__5R3.md +++ b/src/data/roadmaps/computer-science/content/rabin-karp-algorithm@l5--4opvZoc_seVn__5R3.md @@ -7,6 +7,6 @@ Visit the following resources to learn more: - [@course@Rabin Karps Algorithm](https://www.coursera.org/lecture/data-structures/rabin-karps-algorithm-c0Qkw) - [@course@Optimization: Precomputation](https://www.coursera.org/learn/data-structures/lecture/nYrc8/optimization-precomputation) - [@course@Optimization: Implementation and Analysis](https://www.coursera.org/learn/data-structures/lecture/h4ZLc/optimization-implementation-and-analysis) -- [@video@Lecture 9: Table Doubling, Karp-Rabin](https://www.youtube.com/watch?v=BRO7mVIFt08\&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb\&index=9) -- [@video@Rolling Hashes, Amortized Analysis](https://www.youtube.com/watch?v=w6nuXg0BISo\&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb\&index=33) -- [@feed@Explore top posts about Data Science](https://app.daily.dev/tags/data-science?ref=roadmapsh) +- [@video@Lecture 9: Table Doubling, Karp-Rabin](https://www.youtube.com/watch?v=BRO7mVIFt08&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=9) +- [@video@Rolling Hashes, Amortized Analysis](https://www.youtube.com/watch?v=w6nuXg0BISo&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=33) +- [@feed@Explore top posts about Data Science](https://app.daily.dev/tags/data-science?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/red--black-trees@eOL0_SzxBn7_xhNcBDi2D.md b/src/data/roadmaps/computer-science/content/red--black-trees@eOL0_SzxBn7_xhNcBDi2D.md index 5c77aa428..aeb46d606 100644 --- a/src/data/roadmaps/computer-science/content/red--black-trees@eOL0_SzxBn7_xhNcBDi2D.md +++ b/src/data/roadmaps/computer-science/content/red--black-trees@eOL0_SzxBn7_xhNcBDi2D.md @@ -12,4 +12,4 @@ Visit the following resources to learn more: - [@article@An Introduction To Binary Search And Red Black Tree](https://www.topcoder.com/thrive/articles/An%20Introduction%20to%20Binary%20Search%20and%20Red-Black%20Trees) - [@video@Red-Black Trees (playlist) in 30 minutes](https://www.youtube.com/playlist?list=PL9xmBV_5YoZNqDI8qfOZgzbqahCUmUEin) - [@video@Aduni - Algorithms - Lecture 4 (link jumps to starting point)](https://youtu.be/1W3x0f_RmUo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3871) -- [@video@Aduni - Algorithms - Lecture 5](https://www.youtube.com/watch?v=hm2GHwyKF1o&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=5) +- [@video@Aduni - Algorithms - Lecture 5](https://www.youtube.com/watch?v=hm2GHwyKF1o&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=5) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/registers-and-ram@U3379F4AO1KSmGtVmPr27.md b/src/data/roadmaps/computer-science/content/registers-and-ram@U3379F4AO1KSmGtVmPr27.md index 8d17e9ac7..1de9edf33 100644 --- a/src/data/roadmaps/computer-science/content/registers-and-ram@U3379F4AO1KSmGtVmPr27.md +++ b/src/data/roadmaps/computer-science/content/registers-and-ram@U3379F4AO1KSmGtVmPr27.md @@ -9,4 +9,4 @@ Registers are the high-speed accessible storage elements. The processor accesses Visit the following resources to learn more: - [@article@RAM vs. Registers - What's the Difference?](https://thisvsthat.io/ram-vs-registers) -- [@video@Registers and RAM](https://youtu.be/fpnE6UAfbtU) +- [@video@Registers and RAM](https://youtu.be/fpnE6UAfbtU) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/replication@WUEmEtlszbISSIWDKpvg6.md b/src/data/roadmaps/computer-science/content/replication@WUEmEtlszbISSIWDKpvg6.md index d9d9447ba..ce2319598 100644 --- a/src/data/roadmaps/computer-science/content/replication@WUEmEtlszbISSIWDKpvg6.md +++ b/src/data/roadmaps/computer-science/content/replication@WUEmEtlszbISSIWDKpvg6.md @@ -5,4 +5,4 @@ Replication is a process that involves sharing information to ensure consistency Visit the following resources to learn more: - [@article@Database Replication](https://dev.to/karanpratapsingh/system-design-the-complete-course-10fo#database-replication) -- [@article@Replication (computing)](https://en.wikipedia.org/wiki/Replication_(computing)) +- [@article@Replication (computing)](https://en.wikipedia.org/wiki/Replication_(computing)) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/rest@Kvz3Sn7L8CxP5ZXO1hlcU.md b/src/data/roadmaps/computer-science/content/rest@Kvz3Sn7L8CxP5ZXO1hlcU.md index dca72fdc7..f9cf9e688 100644 --- a/src/data/roadmaps/computer-science/content/rest@Kvz3Sn7L8CxP5ZXO1hlcU.md +++ b/src/data/roadmaps/computer-science/content/rest@Kvz3Sn7L8CxP5ZXO1hlcU.md @@ -7,4 +7,4 @@ Visit the following resources to learn more: - [@article@What is a REST API?](https://www.redhat.com/en/topics/api/what-is-a-rest-api) - [@article@Roy Fieldings dissertation chapter, Representational State Transfer (REST)](https://www.ics.uci.edu/~fielding/pubs/dissertation/rest_arch_style.htm) - [@article@Learn REST: A RESTful Tutorial](https://restapitutorial.com/) -- [@feed@Explore top posts about REST API](https://app.daily.dev/tags/rest-api?ref=roadmapsh) +- [@feed@Explore top posts about REST API](https://app.daily.dev/tags/rest-api?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/robin-karp@Km5LvcJpyntrW2iA8h5e3.md b/src/data/roadmaps/computer-science/content/robin-karp@Km5LvcJpyntrW2iA8h5e3.md index 060088f1e..6c042a062 100644 --- a/src/data/roadmaps/computer-science/content/robin-karp@Km5LvcJpyntrW2iA8h5e3.md +++ b/src/data/roadmaps/computer-science/content/robin-karp@Km5LvcJpyntrW2iA8h5e3.md @@ -8,4 +8,4 @@ Visit the following resources to learn more: - [@course@Optimization: Precomputation](https://www.coursera.org/learn/data-structures/lecture/nYrc8/optimization-precomputation) - [@course@Optimization: Implementation and Analysis](https://www.coursera.org/learn/data-structures/lecture/h4ZLc/optimization-implementation-and-analysis) - [@video@Lecture 9: Table Doubling, Karp-Rabin](https://www.youtube.com/watch?v=BRO7mVIFt08&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=9) -- [@video@Rolling Hashes, Amortized Analysis](https://www.youtube.com/watch?v=w6nuXg0BISo&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=33) +- [@video@Rolling Hashes, Amortized Analysis](https://www.youtube.com/watch?v=w6nuXg0BISo&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=33) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/rust@1bDjg-KBDKRmE6f1MWY8l.md b/src/data/roadmaps/computer-science/content/rust@1bDjg-KBDKRmE6f1MWY8l.md index df733f8ad..4ce3917c2 100644 --- a/src/data/roadmaps/computer-science/content/rust@1bDjg-KBDKRmE6f1MWY8l.md +++ b/src/data/roadmaps/computer-science/content/rust@1bDjg-KBDKRmE6f1MWY8l.md @@ -9,4 +9,4 @@ Visit the following resources to learn more: - [@official@Rust by Example - collection of runnable examples](https://doc.rust-lang.org/stable/rust-by-example/index.html) - [@article@Rust vs. Go: Why They’re Better Together](https://thenewstack.io/rust-vs-go-why-theyre-better-together/) - [@article@Rust by the Numbers: The Rust Programming Language in 2021](https://thenewstack.io/rust-by-the-numbers-the-rust-programming-language-in-2021/) -- [@feed@Explore top posts about Rust](https://app.daily.dev/tags/rust?ref=roadmapsh) +- [@feed@Explore top posts about Rust](https://app.daily.dev/tags/rust?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/scheduling-algorithms@Ge2nagN86ofa2y-yYR1lv.md b/src/data/roadmaps/computer-science/content/scheduling-algorithms@Ge2nagN86ofa2y-yYR1lv.md index 82e991ebf..8385dec15 100644 --- a/src/data/roadmaps/computer-science/content/scheduling-algorithms@Ge2nagN86ofa2y-yYR1lv.md +++ b/src/data/roadmaps/computer-science/content/scheduling-algorithms@Ge2nagN86ofa2y-yYR1lv.md @@ -4,15 +4,15 @@ CPU Scheduling is the process of selecting a process from the ready queue and al Here is the list of some of the most commonly used scheduling algorithms: -- **First Come First Serve (FCFS):** The process that arrives first is allocated the CPU first. It is a non-preemptive algorithm. -- **Shortest Job First (SJF):** The process with the smallest execution time is allocated the CPU first. It is a non-preemptive algorithm. -- **Shortest Remaining Time First (SRTF):** The process with the smallest remaining execution time is allocated the CPU first. It is a preemptive algorithm. -- **Round Robin (RR):** The process is allocated the CPU for a fixed time slice. The time slice is usually 10 milliseconds. It is a preemptive algorithm. -- **Priority Scheduling:** The process with the highest priority is allocated the CPU first. It is a preemptive algorithm. -- **Multi-level Queue Scheduling:** The processes are divided into different queues based on their priority. The process with the highest priority is allocated the CPU first. It is a preemptive algorithm. -- **Multi-level Feedback Queue Scheduling:** The processes are divided into different queues based on their priority. The process with the highest priority is allocated the CPU first. If a process is preempted, it is moved to the next queue. It is a preemptive algorithm. -- **Highest Response Ratio Next(HRRN):** CPU is allotted to the next process which has the highest response ratio and not to the process having less burst time. It is a Non-Preemptive algorithm. -- **Lottery Scheduling:** The process is allocated the CPU based on a lottery system. It is a preemptive algorithm. +* **First Come First Serve (FCFS):** The process that arrives first is allocated the CPU first. It is a non-preemptive algorithm. +* **Shortest Job First (SJF):** The process with the smallest execution time is allocated the CPU first. It is a non-preemptive algorithm. +* **Shortest Remaining Time First (SRTF):** The process with the smallest remaining execution time is allocated the CPU first. It is a preemptive algorithm. +* **Round Robin (RR):** The process is allocated the CPU for a fixed time slice. The time slice is usually 10 milliseconds. It is a preemptive algorithm. +* **Priority Scheduling:** The process with the highest priority is allocated the CPU first. It is a preemptive algorithm. +* **Multi-level Queue Scheduling:** The processes are divided into different queues based on their priority. The process with the highest priority is allocated the CPU first. It is a preemptive algorithm. +* **Multi-level Feedback Queue Scheduling:** The processes are divided into different queues based on their priority. The process with the highest priority is allocated the CPU first. If a process is preempted, it is moved to the next queue. It is a preemptive algorithm. +* **Highest Response Ratio Next(HRRN):** CPU is allotted to the next process which has the highest response ratio and not to the process having less burst time. It is a Non-Preemptive algorithm. +* **Lottery Scheduling:** The process is allocated the CPU based on a lottery system. It is a preemptive algorithm. Visit the following resources to learn more: diff --git a/src/data/roadmaps/computer-science/content/search-pattern-in-text@L4M5yFRKKR2axKXGcIA7d.md b/src/data/roadmaps/computer-science/content/search-pattern-in-text@L4M5yFRKKR2axKXGcIA7d.md index 52687f2c9..386a15f21 100644 --- a/src/data/roadmaps/computer-science/content/search-pattern-in-text@L4M5yFRKKR2axKXGcIA7d.md +++ b/src/data/roadmaps/computer-science/content/search-pattern-in-text@L4M5yFRKKR2axKXGcIA7d.md @@ -4,5 +4,5 @@ Searching pattern in text is a very common task in computer science. It is used Visit the following resources to learn more: -- [@article@Pattern Searching](https://www.geeksforgeeks.org/pattern-searching/) - [@course@Search Pattern in Text](https://www.coursera.org/learn/data-structures/lecture/tAfHI/search-pattern-in-text) +- [@article@Pattern Searching](https://www.geeksforgeeks.org/pattern-searching/) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/security@JnJbJtsqKbVETY2vdLqCO.md b/src/data/roadmaps/computer-science/content/security@JnJbJtsqKbVETY2vdLqCO.md index 20c3302fe..006366416 100644 --- a/src/data/roadmaps/computer-science/content/security@JnJbJtsqKbVETY2vdLqCO.md +++ b/src/data/roadmaps/computer-science/content/security@JnJbJtsqKbVETY2vdLqCO.md @@ -4,11 +4,11 @@ Web security refers to the protective measures taken by the developers to protec Visit the following resources to learn more: -- [@video@MIT 6.858 Computer Systems Security, Fall 2014](https://www.youtube.com/playlist?list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh) +- [@opensource@OWASP Web Application Security Testing Checklist](https://github.com/0xRadi/OWASP-Web-Checklist) - [@article@Why HTTPS Matters](https://developers.google.com/web/fundamentals/security/encrypt-in-transit/why-https) - [@article@Wikipedia - OWASP](https://en.wikipedia.org/wiki/OWASP) -- [@opensource@OWASP Web Application Security Testing Checklist](https://github.com/0xRadi/OWASP-Web-Checklist) - [@article@OWASP Top 10 Security Risks](https://sucuri.net/guides/owasp-top-10-security-vulnerabilities-2021/) - [@article@OWASP Cheatsheets](https://cheatsheetseries.owasp.org/cheatsheets/AJAX_Security_Cheat_Sheet.html) - [@article@Content Security Policy (CSP)](https://developer.mozilla.org/en-US/docs/Web/HTTP/CSP) -- [@feed@Explore top posts about Security](https://app.daily.dev/tags/security?ref=roadmapsh) +- [@video@MIT 6.858 Computer Systems Security, Fall 2014](https://www.youtube.com/playlist?list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh) +- [@feed@Explore top posts about Security](https://app.daily.dev/tags/security?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/selection-sort@rOsHFXQm5jNz0RyZQ5ZGs.md b/src/data/roadmaps/computer-science/content/selection-sort@rOsHFXQm5jNz0RyZQ5ZGs.md index 1fd353bf3..61fb2d06e 100644 --- a/src/data/roadmaps/computer-science/content/selection-sort@rOsHFXQm5jNz0RyZQ5ZGs.md +++ b/src/data/roadmaps/computer-science/content/selection-sort@rOsHFXQm5jNz0RyZQ5ZGs.md @@ -4,6 +4,6 @@ Selection sort is a sorting algorithm that selects the smallest unsorted item in Visit the following resources to learn more: -- [@article@Selection Sort](https://en.wikipedia.org/wiki/Selection_sort) -- [@video@Selection Sort in 3 Minutes](https://www.youtube.com/watch?v=g-PGLbMth_g) - [@course@Selection Sort](https://www.coursera.org/lecture/algorithms-part1/selection-UQxFT) +- [@article@Selection Sort](https://en.wikipedia.org/wiki/Selection_sort) +- [@video@Selection Sort in 3 Minutes](https://www.youtube.com/watch?v=g-PGLbMth_g) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/sequence-diagrams@gaUT5K2xS-WQMrIA0Bkb_.md b/src/data/roadmaps/computer-science/content/sequence-diagrams@gaUT5K2xS-WQMrIA0Bkb_.md index 1396dbb6a..aa7f29dae 100644 --- a/src/data/roadmaps/computer-science/content/sequence-diagrams@gaUT5K2xS-WQMrIA0Bkb_.md +++ b/src/data/roadmaps/computer-science/content/sequence-diagrams@gaUT5K2xS-WQMrIA0Bkb_.md @@ -5,4 +5,4 @@ Sequence diagrams are a way to show how objects or systems interact with each ot Visit the following resources to learn more: - [@video@How to Make a UML Sequence Diagram](https://www.youtube.com/watch?v=pCK6prSq8aw) -- [@video@Sequence Diagrams Tutorial](https://www.youtube.com/watch?v=cxG-qWthxt4&list=PLfoY2ARMh0hBthB9VqsQzogSouTjzkMHe&index=2) +- [@video@Sequence Diagrams Tutorial](https://www.youtube.com/watch?v=cxG-qWthxt4&list=PLfoY2ARMh0hBthB9VqsQzogSouTjzkMHe&index=2) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/sharding@3K65efPag2076dy-MeTg4.md b/src/data/roadmaps/computer-science/content/sharding@3K65efPag2076dy-MeTg4.md index 207ec4c3e..4d45b2951 100644 --- a/src/data/roadmaps/computer-science/content/sharding@3K65efPag2076dy-MeTg4.md +++ b/src/data/roadmaps/computer-science/content/sharding@3K65efPag2076dy-MeTg4.md @@ -8,4 +8,4 @@ Visit the following resources to learn more: - [@video@Sharding & Database Partitioning | System Design Basics](https://www.youtube.com/watch?v=RynPj8C0BXA) - [@video@Database Sharding - Watch](https://www.youtube.com/watch?v=hdxdhCpgYo8) - [@video@Database Sharding in 5 minutes](https://www.youtube.com/watch?v=kSH4bt8ypOQ) -- [@feed@Explore top posts about Backend Development](https://app.daily.dev/tags/backend?ref=roadmapsh) +- [@feed@Explore top posts about Backend Development](https://app.daily.dev/tags/backend?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/short-polling@gGmNJ8dK28iqrlQHPz6md.md b/src/data/roadmaps/computer-science/content/short-polling@gGmNJ8dK28iqrlQHPz6md.md index 16a3190c7..c8019330c 100644 --- a/src/data/roadmaps/computer-science/content/short-polling@gGmNJ8dK28iqrlQHPz6md.md +++ b/src/data/roadmaps/computer-science/content/short-polling@gGmNJ8dK28iqrlQHPz6md.md @@ -4,4 +4,4 @@ In short polling, the client requests information from the server. The server pr Visit the following resources to learn more: -- [@article@What are Long-Polling, Websockets, Server-Sent Events (SSE) and Comet?](https://stackoverflow.com/questions/11077857/what-are-long-polling-websockets-server-sent-events-sse-and-comet) +- [@article@What are Long-Polling, Websockets, Server-Sent Events (SSE) and Comet?](https://stackoverflow.com/questions/11077857/what-are-long-polling-websockets-server-sent-events-sse-and-comet) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/skip-lists@K96ggeWqd5OwoNnkL04pc.md b/src/data/roadmaps/computer-science/content/skip-lists@K96ggeWqd5OwoNnkL04pc.md index 4e88ed43a..08474b34c 100644 --- a/src/data/roadmaps/computer-science/content/skip-lists@K96ggeWqd5OwoNnkL04pc.md +++ b/src/data/roadmaps/computer-science/content/skip-lists@K96ggeWqd5OwoNnkL04pc.md @@ -5,4 +5,4 @@ Skip lists are a data structure that allows you to perform operations on a sorte Visit the following resources to learn more: - [@article@Skip Lists](https://en.wikipedia.org/wiki/Skip_list) -- [@video@Randomization: Skip Lists](https://www.youtube.com/watch?v=2g9OSRKJuzM&index=10&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) +- [@video@Randomization: Skip Lists](https://www.youtube.com/watch?v=2g9OSRKJuzM&index=10&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/sockets@u-c-UFegRb7xqsmvj9gVb.md b/src/data/roadmaps/computer-science/content/sockets@u-c-UFegRb7xqsmvj9gVb.md index 7aeb128d4..e54b732c1 100644 --- a/src/data/roadmaps/computer-science/content/sockets@u-c-UFegRb7xqsmvj9gVb.md +++ b/src/data/roadmaps/computer-science/content/sockets@u-c-UFegRb7xqsmvj9gVb.md @@ -5,4 +5,4 @@ A socket is an interface for network communication. It is a way for two programs Visit the following resources to learn more: - [@video@A Beginners Guide to WebSockets](https://www.youtube.com/watch?v=8ARodQ4Wlf4) -- [@video@WebSockets in 100 Seconds & Beyond with Socket.io](https://www.youtube.com/watch?v=1BfCnjr_Vjg) +- [@video@WebSockets in 100 Seconds & Beyond with Socket.io](https://www.youtube.com/watch?v=1BfCnjr_Vjg) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/solving-n-queen-problem@HlAmTY1udqDT2mTfBU9P-.md b/src/data/roadmaps/computer-science/content/solving-n-queen-problem@HlAmTY1udqDT2mTfBU9P-.md index 5a6a3da5b..44929a0c1 100644 --- a/src/data/roadmaps/computer-science/content/solving-n-queen-problem@HlAmTY1udqDT2mTfBU9P-.md +++ b/src/data/roadmaps/computer-science/content/solving-n-queen-problem@HlAmTY1udqDT2mTfBU9P-.md @@ -5,4 +5,4 @@ N Queen Problem is a famous problem in Computer Science. It is a problem of plac Visit the following resources to learn more: - [@article@N-Queens problem using backtracking in Java/C++](https://www.digitalocean.com/community/tutorials/n-queens-problem-java-c-plus-plus) -- [@video@6.1 N Queens Problem using Backtracking](https://www.youtube.com/watch?v=xFv_Hl4B83A) +- [@video@6.1 N Queens Problem using Backtracking](https://www.youtube.com/watch?v=xFv_Hl4B83A) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/spanning-tree@L4xtWOdqGUf4SbJkoOsNM.md b/src/data/roadmaps/computer-science/content/spanning-tree@L4xtWOdqGUf4SbJkoOsNM.md index ab6103835..4ffe6f809 100644 --- a/src/data/roadmaps/computer-science/content/spanning-tree@L4xtWOdqGUf4SbJkoOsNM.md +++ b/src/data/roadmaps/computer-science/content/spanning-tree@L4xtWOdqGUf4SbJkoOsNM.md @@ -7,4 +7,4 @@ Visit the following resources to learn more: - [@article@Spanning Tree](https://www.tutorialspoint.com/data_structures_algorithms/spanning_tree.htm) - [@video@CSE373 2020 - Lecture 13 - Minimum Spanning Trees](https://www.youtube.com/watch?v=oolm2VnJUKw&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=13) - [@video@CSE373 2020 - Lecture 14 - Minimum Spanning Trees (cont)](https://www.youtube.com/watch?v=RktgPx0MarY&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=14) -- [@video@Greedy Algorithms: Minimum Spanning Tree](https://www.youtube.com/watch?v=tKwnms5iRBU&index=16&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) +- [@video@Greedy Algorithms: Minimum Spanning Tree](https://www.youtube.com/watch?v=tKwnms5iRBU&index=16&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/sql-vs-nosql-databases@nprZscHdC_RdRIcGeGyVk.md b/src/data/roadmaps/computer-science/content/sql-vs-nosql-databases@nprZscHdC_RdRIcGeGyVk.md index 15ab6bdc0..231a46c5e 100644 --- a/src/data/roadmaps/computer-science/content/sql-vs-nosql-databases@nprZscHdC_RdRIcGeGyVk.md +++ b/src/data/roadmaps/computer-science/content/sql-vs-nosql-databases@nprZscHdC_RdRIcGeGyVk.md @@ -7,6 +7,6 @@ NoSQL stands for Not Only SQL. It's used for non-relational databases. A NoSQL d Visit the following resources to learn more: - [@video@SQL vs. NoSQL: Whats the difference?](https://www.youtube.com/watch?v=Q5aTUc7c4jg) -- [@video@Database Design Tips | Choosing the Best Database in a System Design Interview](https://www.youtube.com/watch?v=cODCpXtPHbQ\&t=22s) +- [@video@Database Design Tips | Choosing the Best Database in a System Design Interview](https://www.youtube.com/watch?v=cODCpXtPHbQ&t=22s) - [@video@NoSQL vs SQL – Which Type of Database Should You Use?](https://www.youtube.com/watch?v=FzlpwoeSrE0) -- [@feed@Explore top posts about NoSQL](https://app.daily.dev/tags/nosql?ref=roadmapsh) +- [@feed@Explore top posts about NoSQL](https://app.daily.dev/tags/nosql?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/sse@JckRqZA8C6IqQLPpTCgf4.md b/src/data/roadmaps/computer-science/content/sse@JckRqZA8C6IqQLPpTCgf4.md index 0c28db75e..c4d2616b7 100644 --- a/src/data/roadmaps/computer-science/content/sse@JckRqZA8C6IqQLPpTCgf4.md +++ b/src/data/roadmaps/computer-science/content/sse@JckRqZA8C6IqQLPpTCgf4.md @@ -6,4 +6,4 @@ Visit the following resources to learn more: - [@article@What is Server-Sent Events (SSE) and how to implement it?](https://medium.com/yemeksepeti-teknoloji/what-is-server-sent-events-sse-and-how-to-implement-it-904938bffd73) - [@article@Using server-sent events](https://developer.mozilla.org/en-US/docs/Web/API/Server-sent_events/Using_server-sent_events) -- [@feed@Explore top posts about Cryptography](https://app.daily.dev/tags/cryptography?ref=roadmapsh) +- [@feed@Explore top posts about Cryptography](https://app.daily.dev/tags/cryptography?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/stack@hJB5gO9tosRlC4UmdSNzl.md b/src/data/roadmaps/computer-science/content/stack@hJB5gO9tosRlC4UmdSNzl.md index eed530972..97965b9cf 100644 --- a/src/data/roadmaps/computer-science/content/stack@hJB5gO9tosRlC4UmdSNzl.md +++ b/src/data/roadmaps/computer-science/content/stack@hJB5gO9tosRlC4UmdSNzl.md @@ -4,6 +4,6 @@ Stack is a linear collection of items where items are inserted and removed in a Visit the following resources to learn more: -- [@video@Stack Data Structure | Illustrated Data Structures](https://www.youtube.com/watch?v=I5lq6sCuABE) -- [@video@Stack in 3 minutes](https://www.youtube.com/watch?v=KcT3aVgrrpU) - [@course@Stack Data Structure](https://www.coursera.org/lecture/data-structures/stacks-UdKzQ) +- [@video@Stack Data Structure | Illustrated Data Structures](https://www.youtube.com/watch?v=I5lq6sCuABE) +- [@video@Stack in 3 minutes](https://www.youtube.com/watch?v=KcT3aVgrrpU) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/statemachine-diagrams@X0CKM9LaJUrgI5gIdqFvU.md b/src/data/roadmaps/computer-science/content/statemachine-diagrams@X0CKM9LaJUrgI5gIdqFvU.md index ded7838e5..6e5b7bf71 100644 --- a/src/data/roadmaps/computer-science/content/statemachine-diagrams@X0CKM9LaJUrgI5gIdqFvU.md +++ b/src/data/roadmaps/computer-science/content/statemachine-diagrams@X0CKM9LaJUrgI5gIdqFvU.md @@ -6,4 +6,4 @@ Visit the following resources to learn more: - [@article@What is State Machine Diagram?](https://www.visual-paradigm.com/guide/uml-unified-modeling-language/what-is-state-machine-diagram/) - [@article@State Machine Diagram Tutorial](https://www.lucidchart.com/pages/uml-state-machine-diagram) -- [@article@State Machine Diagram](https://www.sciencedirect.com/topics/computer-science/state-machine-diagram) +- [@article@State Machine Diagram](https://www.sciencedirect.com/topics/computer-science/state-machine-diagram) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/stored-procedures@FjhZGhzJjYyDn0PShKmpX.md b/src/data/roadmaps/computer-science/content/stored-procedures@FjhZGhzJjYyDn0PShKmpX.md index 5196dd046..1a3dd2968 100644 --- a/src/data/roadmaps/computer-science/content/stored-procedures@FjhZGhzJjYyDn0PShKmpX.md +++ b/src/data/roadmaps/computer-science/content/stored-procedures@FjhZGhzJjYyDn0PShKmpX.md @@ -4,4 +4,4 @@ Stored Procedures are created to perform one or more DML operations on Database. Visit the following resources to learn more: -- [@article@SQL Stored Procedures](https://www.programiz.com/sql/stored-procedures) +- [@article@SQL Stored Procedures](https://www.programiz.com/sql/stored-procedures) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/string-search--manipulations@NUWk-7IXmMU-4TT-oS8fF.md b/src/data/roadmaps/computer-science/content/string-search--manipulations@NUWk-7IXmMU-4TT-oS8fF.md index 531d5ab74..f75ae590b 100644 --- a/src/data/roadmaps/computer-science/content/string-search--manipulations@NUWk-7IXmMU-4TT-oS8fF.md +++ b/src/data/roadmaps/computer-science/content/string-search--manipulations@NUWk-7IXmMU-4TT-oS8fF.md @@ -4,4 +4,4 @@ String search and manipulation is a very important topic in computer science. It Visit the following resources to learn more: -- [@article@String-searching Algorithm](https://en.wikipedia.org/wiki/String-searching_algorithm) +- [@article@String-searching Algorithm](https://en.wikipedia.org/wiki/String-searching_algorithm) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/substring-search@E9hf1ux1KKGHvvAShm67w.md b/src/data/roadmaps/computer-science/content/substring-search@E9hf1ux1KKGHvvAShm67w.md index 326c521c0..bdb9039f0 100644 --- a/src/data/roadmaps/computer-science/content/substring-search@E9hf1ux1KKGHvvAShm67w.md +++ b/src/data/roadmaps/computer-science/content/substring-search@E9hf1ux1KKGHvvAShm67w.md @@ -6,4 +6,4 @@ Visit the following resources to learn more: - [@course@Introduction to Substring Search](https://www.coursera.org/lecture/algorithms-part2/introduction-to-substring-search-n3ZpG) - [@article@What is the fastest substring search algorithm?](https://stackoverflow.com/questions/3183582/what-is-the-fastest-substring-search-algorithm) -- [@article@Substring Search - Exercises](https://algs4.cs.princeton.edu/53substring/) +- [@article@Substring Search - Exercises](https://algs4.cs.princeton.edu/53substring/) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/suffix-arrays@Ld1TUNS8713coMNvwhNIJ.md b/src/data/roadmaps/computer-science/content/suffix-arrays@Ld1TUNS8713coMNvwhNIJ.md index f4eddd96c..407f640a1 100644 --- a/src/data/roadmaps/computer-science/content/suffix-arrays@Ld1TUNS8713coMNvwhNIJ.md +++ b/src/data/roadmaps/computer-science/content/suffix-arrays@Ld1TUNS8713coMNvwhNIJ.md @@ -4,8 +4,8 @@ Suffix arrays are a data structure that allows us to quickly find all the suffix Visit the following resources to learn more: +- [@course@Suffix Arrays - Coursera](https://www.coursera.org/learn/algorithms-part2/lecture/TH18W/suffix-arrays) - [@article@Suffix Arrays - Princeton University](https://algs4.cs.princeton.edu/63suffix/) - [@video@Suffix Array Introduction](https://www.youtube.com/watch?v=zqKlL3ZpTqs) - [@video@Advanced Data Structures: Suffix Arrays](https://www.youtube.com/watch?v=IzMxbboPcqQ) -- [@video@Suffix Arrays: building](https://www.youtube.com/watch?v=ZWlbhBjjwyA) -- [@course@Suffix Arrays - Coursera](https://www.coursera.org/learn/algorithms-part2/lecture/TH18W/suffix-arrays) +- [@video@Suffix Arrays: building](https://www.youtube.com/watch?v=ZWlbhBjjwyA) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/system-design@w-fvEiSJysywR3AOAB0ve.md b/src/data/roadmaps/computer-science/content/system-design@w-fvEiSJysywR3AOAB0ve.md index 51110c2a4..a2fc7f981 100644 --- a/src/data/roadmaps/computer-science/content/system-design@w-fvEiSJysywR3AOAB0ve.md +++ b/src/data/roadmaps/computer-science/content/system-design@w-fvEiSJysywR3AOAB0ve.md @@ -9,4 +9,4 @@ Visit the following resources to learn more: - [@video@System Design 101](https://www.youtube.com/watch?v=Y-Gl4HEyeUQ) - [@video@Scaling the Unscalable](https://www.youtube.com/watch?v=a2rcgzludDU) - [@video@System Design interview: Scale to 1 million users](https://www.youtube.com/watch?v=YkGHxOg9d3M) -- [@feed@Explore top posts about Career](https://app.daily.dev/tags/career?ref=roadmapsh) +- [@feed@Explore top posts about Career](https://app.daily.dev/tags/career?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/tail-recursion@0_qNhprnXU3i8koW3XTdD.md b/src/data/roadmaps/computer-science/content/tail-recursion@0_qNhprnXU3i8koW3XTdD.md index de6375f22..ef0bdbcd5 100644 --- a/src/data/roadmaps/computer-science/content/tail-recursion@0_qNhprnXU3i8koW3XTdD.md +++ b/src/data/roadmaps/computer-science/content/tail-recursion@0_qNhprnXU3i8koW3XTdD.md @@ -4,6 +4,6 @@ Tail recursion is a special kind of recursion where the recursive call is the ve Visit the following resources to learn more: -- [@article@What is tail recursion? Why is it so bad?](https://www.quora.com/What-is-tail-recursion-Why-is-it-so-bad) - [@course@Tail Recursion](https://www.coursera.org/lecture/programming-languages/tail-recursion-YZic1) -- [@feed@Explore top posts about Recursion](https://app.daily.dev/tags/recursion?ref=roadmapsh) +- [@article@What is tail recursion? Why is it so bad?](https://www.quora.com/What-is-tail-recursion-Why-is-it-so-bad) +- [@feed@Explore top posts about Recursion](https://app.daily.dev/tags/recursion?ref=roadmapsh) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/tcpip-model@Fed5y1D95WPpqoVg7kmob.md b/src/data/roadmaps/computer-science/content/tcpip-model@Fed5y1D95WPpqoVg7kmob.md index e379d5ae9..b4498bda4 100644 --- a/src/data/roadmaps/computer-science/content/tcpip-model@Fed5y1D95WPpqoVg7kmob.md +++ b/src/data/roadmaps/computer-science/content/tcpip-model@Fed5y1D95WPpqoVg7kmob.md @@ -5,4 +5,4 @@ The OSI and TCP/IP model is used to help the developer to design their system fo Visit the following resources to learn more: - [@article@Cloudflare - What is the OSI model](https://www.cloudflare.com/learning/ddos/glossary/open-systems-interconnection-model-osi/) -- [@video@TCP/IP and the OSI Model Explained!](https://www.youtube.com/watch?v=e5DEVa9eSN0) +- [@video@TCP/IP and the OSI Model Explained!](https://www.youtube.com/watch?v=e5DEVa9eSN0) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/the-knights-tour-problem@NcKW_3vJWL_rVlDBB_Qjs.md b/src/data/roadmaps/computer-science/content/the-knights-tour-problem@NcKW_3vJWL_rVlDBB_Qjs.md index 9d4bf08f5..1155de761 100644 --- a/src/data/roadmaps/computer-science/content/the-knights-tour-problem@NcKW_3vJWL_rVlDBB_Qjs.md +++ b/src/data/roadmaps/computer-science/content/the-knights-tour-problem@NcKW_3vJWL_rVlDBB_Qjs.md @@ -6,4 +6,4 @@ Visit the following resources to learn more: - [@article@Knights Tour](https://bradfieldcs.com/algos/graphs/knights-tour/) - [@article@Knights Tour Problem](https://www.codesdope.com/course/algorithms-knights-tour-problem/) -- [@article@Backtracking: The Knight’s Tour Problem](https://www.codingninjas.com/codestudio/library/backtracking-the-knights-tour-problem) +- [@article@Backtracking: The Knight’s Tour Problem](https://www.codingninjas.com/codestudio/library/backtracking-the-knights-tour-problem) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/tls--https@3pu2bGhoCLFIs6kNanwtz.md b/src/data/roadmaps/computer-science/content/tls--https@3pu2bGhoCLFIs6kNanwtz.md index 9d5f3cdcf..252b411fe 100644 --- a/src/data/roadmaps/computer-science/content/tls--https@3pu2bGhoCLFIs6kNanwtz.md +++ b/src/data/roadmaps/computer-science/content/tls--https@3pu2bGhoCLFIs6kNanwtz.md @@ -7,4 +7,4 @@ Visit the following resources to learn more: - [@article@What is TLS & How Does it Work? - Internet Society](https://www.internetsociety.org/deploy360/tls/basics/) - [@article@What is TLS (Transport Layer Security)? - Cloudflare](https://www.cloudflare.com/learning/ssl/transport-layer-security-tls/) - [@video@SSL and HTTPS](https://www.youtube.com/watch?v=S2iBR2ZlZf0) -- [@video@SSL/TLS - Cristina Formaini](https://www.youtube.com/watch?v=Rp3iZUvXWlM) +- [@video@SSL/TLS - Cristina Formaini](https://www.youtube.com/watch?v=Rp3iZUvXWlM) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/travelling-salesman-problem@ZG-hWjVoS3p9XfrtBL0sD.md b/src/data/roadmaps/computer-science/content/travelling-salesman-problem@ZG-hWjVoS3p9XfrtBL0sD.md index 1534aef62..0d9e10ed4 100644 --- a/src/data/roadmaps/computer-science/content/travelling-salesman-problem@ZG-hWjVoS3p9XfrtBL0sD.md +++ b/src/data/roadmaps/computer-science/content/travelling-salesman-problem@ZG-hWjVoS3p9XfrtBL0sD.md @@ -7,4 +7,4 @@ Visit the following resources to learn more: - [@article@Traveling Salesman Problem](https://en.wikipedia.org/wiki/Travelling_salesman_problem) - [@video@What is the Traveling Salesman Problem?](https://www.youtube.com/watch?v=1pmBjIZ20pE) - [@video@4.7 Traveling Salesperson Problem - Dynamic Programming](https://www.youtube.com/watch?v=XaXsJJh-Q5Y) -- [@video@Traveling Salesman Problem | Dynamic Programming | Graph Theory](https://www.youtube.com/watch?v=cY4HiiFHO1o) +- [@video@Traveling Salesman Problem | Dynamic Programming | Graph Theory](https://www.youtube.com/watch?v=cY4HiiFHO1o) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/tree@_eWqiWUmOj0zUo_Ix3j1O.md b/src/data/roadmaps/computer-science/content/tree@_eWqiWUmOj0zUo_Ix3j1O.md index 8684a4809..557ef1b57 100644 --- a/src/data/roadmaps/computer-science/content/tree@_eWqiWUmOj0zUo_Ix3j1O.md +++ b/src/data/roadmaps/computer-science/content/tree@_eWqiWUmOj0zUo_Ix3j1O.md @@ -5,4 +5,4 @@ A tree is non-linear and a hierarchical data structure consisting of a collectio Visit the following resources to learn more: - [@article@Tree Data Structure](https://www.programiz.com/dsa/trees) -- [@video@Tree | Illustrated Data Structures](https://www.youtube.com/watch?v=S2W3SXGPVyU) +- [@video@Tree | Illustrated Data Structures](https://www.youtube.com/watch?v=S2W3SXGPVyU) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/tries@4qUVacMEz3XFiL_dMre6P.md b/src/data/roadmaps/computer-science/content/tries@4qUVacMEz3XFiL_dMre6P.md index 1d52bdee4..09a92a704 100644 --- a/src/data/roadmaps/computer-science/content/tries@4qUVacMEz3XFiL_dMre6P.md +++ b/src/data/roadmaps/computer-science/content/tries@4qUVacMEz3XFiL_dMre6P.md @@ -4,12 +4,12 @@ Tries are a data structure that can be used to store strings. The idea is to sto Visit the following resources to learn more: -- [@article@Tries - DataStructure Notes](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Tries) -- [@article@The Trie: A Neglected Data Structure](https://www.toptal.com/java/the-trie-a-neglected-data-structure) -- [@article@TopCoder - Using Tries](https://www.topcoder.com/thrive/articles/Using%20Tries) -- [@video@Stanford Lecture (real world use case)](https://www.youtube.com/watch?v=TJ8SkcUSdbU) -- [@video@MIT, Advanced Data Structures, Strings (can get pretty obscure about halfway through)](https://www.youtube.com/watch?v=NinWEPPrkDQ&index=16&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf) - [@course@0. Tries - Coursera](https://www.coursera.org/learn/algorithms-part2/home/week/4) - [@course@1. R Way Tries](https://www.coursera.org/learn/algorithms-part2/lecture/CPVdr/r-way-tries) - [@course@2. Ternary Search Tries](https://www.coursera.org/learn/algorithms-part2/lecture/yQM8K/ternary-search-tries) - [@course@3. Character Based Operations](https://www.coursera.org/learn/algorithms-part2/lecture/jwNmV/character-based-operations) +- [@article@Tries - DataStructure Notes](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Tries) +- [@article@The Trie: A Neglected Data Structure](https://www.toptal.com/java/the-trie-a-neglected-data-structure) +- [@article@TopCoder - Using Tries](https://www.topcoder.com/thrive/articles/Using%20Tries) +- [@video@Stanford Lecture (real world use case)](https://www.youtube.com/watch?v=TJ8SkcUSdbU) +- [@video@MIT, Advanced Data Structures, Strings (can get pretty obscure about halfway through)](https://www.youtube.com/watch?v=NinWEPPrkDQ&index=16&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/type-object-pattern@_2Jddpz_cdwyeIgrg5qt_.md b/src/data/roadmaps/computer-science/content/type-object-pattern@_2Jddpz_cdwyeIgrg5qt_.md index 348865911..83e65c783 100644 --- a/src/data/roadmaps/computer-science/content/type-object-pattern@_2Jddpz_cdwyeIgrg5qt_.md +++ b/src/data/roadmaps/computer-science/content/type-object-pattern@_2Jddpz_cdwyeIgrg5qt_.md @@ -4,4 +4,4 @@ Type object pattern is a creational design pattern that allows us to create a ne Visit the following resources to learn more: -- [@article@Type Object Pattern](https://gameprogrammingpatterns.com/type-object.html) +- [@article@Type Object Pattern](https://gameprogrammingpatterns.com/type-object.html) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/unbalanced-tree@w4sxmZR1BjX6wlrZmuOlf.md b/src/data/roadmaps/computer-science/content/unbalanced-tree@w4sxmZR1BjX6wlrZmuOlf.md index 29c888f55..32e52567c 100644 --- a/src/data/roadmaps/computer-science/content/unbalanced-tree@w4sxmZR1BjX6wlrZmuOlf.md +++ b/src/data/roadmaps/computer-science/content/unbalanced-tree@w4sxmZR1BjX6wlrZmuOlf.md @@ -5,4 +5,4 @@ An unbalanced binary tree is one that is not balanced. Visit the following resources to learn more: - [@article@Balanced vs Unbalanced Binary Tree](https://stackoverflow.com/questions/59206128/balanced-vs-unbalanced-binary-tree-clarification-needed) -- [@article@Unbalanced Binary Tree](https://eng.libretexts.org/Bookshelves/Computer_Science/Databases_and_Data_Structures/Open_Data_Structures_-_An_Introduction_(Morin)/06%3A_Binary_Trees/6.02%3A_BinarySearchTree_-_An_Unbalanced_Binary_Search_Treee) +- [@article@Unbalanced Binary Tree](https://eng.libretexts.org/Bookshelves/Computer_Science/Databases_and_Data_Structures/Open_Data_Structures_-_An_Introduction_(Morin)/06%3A_Binary_Trees/6.02%3A_BinarySearchTree_-_An_Unbalanced_Binary_Search_Treee) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/undirected-graph@QGx8it2N_85PiPVjpTGK_.md b/src/data/roadmaps/computer-science/content/undirected-graph@QGx8it2N_85PiPVjpTGK_.md index 7005e3b00..d3daa801f 100644 --- a/src/data/roadmaps/computer-science/content/undirected-graph@QGx8it2N_85PiPVjpTGK_.md +++ b/src/data/roadmaps/computer-science/content/undirected-graph@QGx8it2N_85PiPVjpTGK_.md @@ -4,4 +4,4 @@ An undirected graph is graph, i.e., a set of objects (called vertices or nodes) Visit the following resources to learn more: -- [@article@Undirected Graph](https://mathinsight.org/definition/undirected_graph) +- [@article@Undirected Graph](https://mathinsight.org/definition/undirected_graph) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/unicode@04hpfxI2x958tQI-0clsp.md b/src/data/roadmaps/computer-science/content/unicode@04hpfxI2x958tQI-0clsp.md index efe26a01b..3137b6959 100644 --- a/src/data/roadmaps/computer-science/content/unicode@04hpfxI2x958tQI-0clsp.md +++ b/src/data/roadmaps/computer-science/content/unicode@04hpfxI2x958tQI-0clsp.md @@ -5,4 +5,4 @@ Unicode is a standard for encoding characters. It is a superset of ASCII, which Visit the following resources to learn more: - [@article@How Unicode Works: What Every Developer Needs to Know About Strings and 🦄](https://deliciousbrains.com/how-unicode-works/) -- [@video@Characters, Symbols and the Unicode Miracle - Computerphile](https://www.youtube.com/watch?v=MijmeoH9LT4) +- [@video@Characters, Symbols and the Unicode Miracle - Computerphile](https://www.youtube.com/watch?v=MijmeoH9LT4) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/usecase-diagrams@dVvYbrcaxHLpvtX6HbS7g.md b/src/data/roadmaps/computer-science/content/usecase-diagrams@dVvYbrcaxHLpvtX6HbS7g.md index fc1bbc4db..3e466b69e 100644 --- a/src/data/roadmaps/computer-science/content/usecase-diagrams@dVvYbrcaxHLpvtX6HbS7g.md +++ b/src/data/roadmaps/computer-science/content/usecase-diagrams@dVvYbrcaxHLpvtX6HbS7g.md @@ -12,4 +12,4 @@ Visit the following resources to learn more: - [@article@UML Use Case Diagram Tutorial](https://www.lucidchart.com/pages/uml-use-case-diagram) - [@article@What is Use Case Diagram?](https://www.visual-paradigm.com/guide/uml-unified-modeling-language/what-is-use-case-diagram/) -- [@video@UML Use Case Diagram Tutorial](https://www.youtube.com/watch?v=zid-MVo7M-E) +- [@video@UML Use Case Diagram Tutorial](https://www.youtube.com/watch?v=zid-MVo7M-E) \ No newline at end of file diff --git a/src/data/roadmaps/computer-science/content/views@lOj_ReWI1kQ3WajJZYOWU.md b/src/data/roadmaps/computer-science/content/views@lOj_ReWI1kQ3WajJZYOWU.md index 5870d5e26..541f9a26a 100644 --- a/src/data/roadmaps/computer-science/content/views@lOj_ReWI1kQ3WajJZYOWU.md +++ b/src/data/roadmaps/computer-science/content/views@lOj_ReWI1kQ3WajJZYOWU.md @@ -5,4 +5,4 @@ Views in SQL are kind of virtual tables. A view also has rows and columns as the Visit the following resources to learn more: - [@article@Database Views](https://www.ibm.com/docs/en/eamfoc/7.6.0?topic=structure-views) -- [@article@SQL Views - Wikipedia](https://en.wikipedia.org/wiki/View_(SQL)) +- [@article@SQL Views - Wikipedia](https://en.wikipedia.org/wiki/View_(SQL)) \ No newline at end of file