mirror of
https://github.com/kamranahmedse/developer-roadmap.git
synced 2026-09-24 15:00:31 +08:00
refractor all topics. (#8168)
This commit is contained in:
+7
-1
@@ -1 +1,7 @@
|
||||
# Adjacency Matrix
|
||||
# Adjacency Matrix
|
||||
|
||||
An adjacency matrix is a square matrix used to represent a finite graph. It is used to represent the connections between vertices in a graph. The matrix is filled with 0s and 1s, where a 1 represents a connection between two vertices and a 0 represents no connection.
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@article@Adjacency Matrix](https://en.wikipedia.org/wiki/Adjacency_matrix)
|
||||
@@ -11,5 +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@MIT 6.851 - Memory Hierarchy Models](https://www.youtube.com/watch?v=V3omVLzI0WE&index=7&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf)
|
||||
- [@video@B-Trees (playlist) in 26 minutes](https://www.youtube.com/playlist?list=PL9xmBV_5YoZNFPPv98DjTdD9X6UI9KMHz)
|
||||
|
||||
@@ -8,3 +8,4 @@ The rise in popularity of NoSQL databases provided a flexible and fluidity with
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@article@BASE Model vs. ACID Model](https://www.geeksforgeeks.org/acid-model-vs-base-model-for-database/)
|
||||
@@ -4,6 +4,6 @@ Bubble sort is a simple sorting algorithm that repeatedly steps through the list
|
||||
|
||||
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@Analyzing Bubble Sort](https://www.youtube.com/watch?v=ni_zk257Nqo&index=7&list=PL89B61F78B552C1AB)
|
||||
- [@video@Bubble sort in 2 minutes](https://youtu.be/xli_FI7CuzA)
|
||||
|
||||
@@ -4,10 +4,10 @@ C++ is a powerful general-purpose programming language. It can be used to develo
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@roadmap@C++ Roadmap](https://roadmap.sh/cpp)
|
||||
- [@article@Learn C++](https://learncpp.com/)
|
||||
- [@article@Cpp Reference](https://en.cppreference.com/)
|
||||
- [@article@CPlusPlus](https://cplusplus.com/)
|
||||
- [@article@C++ TutorialsPoint](https://www.tutorialspoint.com/cplusplus/index.htm)
|
||||
- [@article@W3Schools C++](https://www.w3schools.com/cpp/default.asp)
|
||||
- [@roadmap.sh@C++ Roadmap](https://roadmap.sh/cpp)
|
||||
- [@feed@Explore top posts about C++ Programming](https://app.daily.dev/tags/c++?ref=roadmapsh)
|
||||
|
||||
@@ -4,5 +4,6 @@ A CDN is a network of servers that are distributed geographically. The servers a
|
||||
|
||||
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)
|
||||
|
||||
@@ -4,5 +4,5 @@ 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=3cmzqZzwNDM&list=PLfoY2ARMh0hC2FcJKP5voAKCpk6PZXSd5&index=2)
|
||||
|
||||
@@ -13,7 +13,3 @@ Visit the following resources to learn more:
|
||||
- [@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@CSE373 2020 - Lecture 23 - NP-Completeness](https://www.youtube.com/watch?v=ItHp5laE1VE&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=23)
|
||||
- [@video@CSE373 2020 - Lecture 24 - Satisfiability](https://www.youtube.com/watch?v=inaFJeCzGxU&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=24)
|
||||
- [@video@CSE373 2020 - Lecture 25 - More NP-Completeness](https://www.youtube.com/watch?v=B-bhKxjZLlc&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=25)
|
||||
- [@video@CSE373 2020 - Lecture 26 - NP-Completeness Challenge](https://www.youtube.com/watch?v=_EzetTkG_Cc&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=26)
|
||||
|
||||
+5
-1
@@ -1,6 +1,6 @@
|
||||
# Common Algorithms
|
||||
|
||||
Here are some common algorithms that you should know. You can find more information about them in the [Algorithms](https://www.khanacademy.org/computing/computer-science/algorithms) section of the Computer Science course.
|
||||
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
|
||||
@@ -13,3 +13,7 @@ Here are some common algorithms that you should know. You can find more informat
|
||||
- Substring Search
|
||||
- Suffix Arrays
|
||||
- Dynamic Programming
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@article@Top Algorithms and Data Structures](https://towardsdatascience.com/top-algorithms-and-data-structures-you-really-need-to-know-ab9a2a91c7b5)
|
||||
|
||||
+1
@@ -5,3 +5,4 @@ A complete binary tree is a special type of binary tree where all the levels of
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@article@Complete Binary Tree - Programiz](https://www.programiz.com/dsa/complete-binary-tree)
|
||||
- [@article@Complete Binary Trees](https://www.wscubetech.com/resources/dsa/complete-binary-tree)
|
||||
@@ -13,7 +13,3 @@ Visit the following resources to learn more:
|
||||
- [@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@CSE373 2020 - Lecture 23 - NP-Completeness](https://www.youtube.com/watch?v=ItHp5laE1VE&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=23)
|
||||
- [@video@CSE373 2020 - Lecture 24 - Satisfiability](https://www.youtube.com/watch?v=inaFJeCzGxU&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=24)
|
||||
- [@video@CSE373 2020 - Lecture 25 - More NP-Completeness](https://www.youtube.com/watch?v=B-bhKxjZLlc&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=25)
|
||||
- [@video@CSE373 2020 - Lecture 26 - NP-Completeness Challenge](https://www.youtube.com/watch?v=_EzetTkG_Cc&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=26)
|
||||
|
||||
+4
-1
@@ -1,6 +1,9 @@
|
||||
# Concurrency in Multiple Cores
|
||||
|
||||
Concurrency or Parallelism is simultaneous execution of processes on a multiple cores per CPU or multiple CPUs (on a single motherboard). Concurrency is when Parallelism is achieved on a single core/CPU by using scheduling algorithms that divides the CPU's time (time-slice).
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@article@What is the difference between multicore and concurrent programming?](https://stackoverflow.com/questions/5372861/what-is-the-difference-between-multicore-and-concurrent-programming)
|
||||
- [@article@Difference between Multi-core and concurrent Programming?](https://stackoverflow.com/questions/5372861/what-is-the-difference-between-multicore-and-concurrent-programming)
|
||||
- [@article@Concurrency in Multicore systems](https://cs.stackexchange.com/questions/140793/concurrency-in-multiple-core)
|
||||
- [@article@Mastering Concurrency](https://www.harrisonclarke.com/blog/mastering-concurrency-a-guide-for-software-engineers)
|
||||
@@ -1,7 +1,10 @@
|
||||
# CPU Cache
|
||||
|
||||
A CPU cache is a hardware cache used by the central processing unit of a computer to reduce the average cost to access data from the main memory. A cache is a smaller, faster memory, located closer to a processor core, which stores copies of the data from frequently used main memory locations.
|
||||
|
||||
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)
|
||||
|
||||
@@ -4,5 +4,5 @@ CPU Interrupts are a way for the CPU to communicate with the rest of the compute
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@video@Video on Interrupts](https://youtu.be/iKlAWIKEyuw)
|
||||
- [@video@Interrupts](https://youtu.be/iKlAWIKEyuw)
|
||||
- [@feed@Explore top posts about Computing](https://app.daily.dev/tags/computing?ref=roadmapsh)
|
||||
|
||||
@@ -4,6 +4,7 @@ As the name indicates itself, a **Data Structure** is a way of organizing the da
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@roadmap@Visit Dedicated DSA Roadmap](https://roadmap.sh/datastructures-and-algorithms)
|
||||
- [@article@Data Structures and Algorithms](https://www.javatpoint.com/data-structure-tutorial)
|
||||
- [@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)
|
||||
|
||||
@@ -4,7 +4,7 @@ A database is a collection of useful data of one or more related organizations s
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@article@Oracle: What is a Database?](https://www.oracle.com/database/what-is-database/)
|
||||
- [@article@Prisma.io: What are Databases?](https://www.prisma.io/dataguide/intro/what-are-databases)
|
||||
- [@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)
|
||||
|
||||
@@ -1,6 +1,8 @@
|
||||
# DCL (Data Control Language):
|
||||
# DCL (Data Control Language)
|
||||
|
||||
DCL includes commands such as GRANT and REVOKE which mainly deal with the rights, permissions, and other controls of the database system.
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@article@DCL](https://en.wikipedia.org/wiki/Data_Control_Language)
|
||||
- [@article@DCL Commands](https://www.geeksforgeeks.org/sql-ddl-dql-dml-dcl-tcl-commands/)
|
||||
@@ -4,3 +4,4 @@ DDL or Data Definition Language actually consists of the SQL commands that can b
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@article@DDL](https://en.wikipedia.org/wiki/Data_definition_language)
|
||||
@@ -4,3 +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)
|
||||
@@ -4,3 +4,4 @@ DQL statements are used for performing queries on the data within schema objects
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@article@Data Query Language](https://en.wikipedia.org/wiki/Data_query_language)
|
||||
+2
-1
@@ -1,9 +1,10 @@
|
||||
# Finding Hamiltonian Paths
|
||||
|
||||
Hamiltonian paths are paths that visit every node in a graph exactly once. They are named after the famous mathematician [Hamilton](https://en.wikipedia.org/wiki/William_Rowan_Hamilton). Hamiltonian paths are a special case of [Hamiltonian cycles](https://en.wikipedia.org/wiki/Hamiltonian_cycle), which are cycles that visit every node in a graph exactly once.
|
||||
Hamiltonian paths are paths that visit every node in a graph exactly once. They are named after the famous mathematician Hamilton. Hamiltonian paths are a special case of Hamiltonian cycles, which are cycles that visit every node in a graph exactly once.
|
||||
|
||||
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)
|
||||
|
||||
@@ -4,5 +4,6 @@ GraphQL is a query language for APIs and a runtime for fulfilling those queries
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@roadmap@Visit Dedicated GraphQL Roadmap](https://roadmap.sh/graphql)
|
||||
- [@article@Apollo GraphQL Tutorials](https://www.apollographql.com/tutorials/)
|
||||
- [@feed@Explore top posts about GraphQL](https://app.daily.dev/tags/graphql?ref=roadmapsh)
|
||||
|
||||
+3
-1
@@ -1,6 +1,8 @@
|
||||
# How CPU Executes Programs?
|
||||
|
||||
The CPU executes programs by repeatedly fetching instructions from memory, decoding them to understand the operation, and then executing those operations. This cycle, called the fetch-decode-execute cycle, continues for each instruction in the program, with the CPU using registers for temporary storage and a program counter to keep track of the next instruction. Modern CPUs use techniques like pipelining and caches to speed up this process, enabling them to execute complex programs efficiently.
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@video@How CPU executes a program](https://www.youtube.com/watch?v=XM4lGflQFvA)
|
||||
- [@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)
|
||||
|
||||
+4
-1
@@ -1,5 +1,8 @@
|
||||
# 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.
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@video@Instructions and Programs](https://youtu.be/zltgXvg6r3k)
|
||||
- [@article@Instruction and Programs](https://nerdfighteria.info/v/zltgXvg6r3k/)
|
||||
- [@video@Instructions and Programs](https://youtu.be/zltgXvg6r3k)
|
||||
@@ -4,3 +4,4 @@ Linear search is a very simple algorithm that is used to search for a value in a
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@article@Linear Search](https://www.programiz.com/dsa/linear-search)
|
||||
@@ -4,5 +4,5 @@ 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@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)
|
||||
|
||||
@@ -14,7 +14,3 @@ Visit the following resources to learn more:
|
||||
- [@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@CSE373 2020 - Lecture 23 - NP-Completeness](https://www.youtube.com/watch?v=ItHp5laE1VE&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=23)
|
||||
- [@video@CSE373 2020 - Lecture 24 - Satisfiability](https://www.youtube.com/watch?v=inaFJeCzGxU&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=24)
|
||||
- [@video@CSE373 2020 - Lecture 25 - More NP-Completeness](https://www.youtube.com/watch?v=B-bhKxjZLlc&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=25)
|
||||
- [@video@CSE373 2020 - Lecture 26 - NP-Completeness Challenge](https://www.youtube.com/watch?v=_EzetTkG_Cc&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=26)
|
||||
|
||||
@@ -13,7 +13,3 @@ Visit the following resources to learn more:
|
||||
- [@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@CSE373 2020 - Lecture 23 - NP-Completeness](https://www.youtube.com/watch?v=ItHp5laE1VE&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=23)
|
||||
- [@video@CSE373 2020 - Lecture 24 - Satisfiability](https://www.youtube.com/watch?v=inaFJeCzGxU&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=24)
|
||||
- [@video@CSE373 2020 - Lecture 25 - More NP-Completeness](https://www.youtube.com/watch?v=B-bhKxjZLlc&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=25)
|
||||
- [@video@CSE373 2020 - Lecture 26 - NP-Completeness Challenge](https://www.youtube.com/watch?v=_EzetTkG_Cc&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=26)
|
||||
|
||||
@@ -13,7 +13,3 @@ Visit the following resources to learn more:
|
||||
- [@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@CSE373 2020 - Lecture 23 - NP-Completeness](https://www.youtube.com/watch?v=ItHp5laE1VE&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=23)
|
||||
- [@video@CSE373 2020 - Lecture 24 - Satisfiability](https://www.youtube.com/watch?v=inaFJeCzGxU&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=24)
|
||||
- [@video@CSE373 2020 - Lecture 25 - More NP-Completeness](https://www.youtube.com/watch?v=B-bhKxjZLlc&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=25)
|
||||
- [@video@CSE373 2020 - Lecture 26 - NP-Completeness Challenge](https://www.youtube.com/watch?v=_EzetTkG_Cc&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=26)
|
||||
|
||||
@@ -4,7 +4,8 @@ OWASP or Open Web Application Security Project is an online community that produ
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@article@Wikipedia - OWASP](https://en.wikipedia.org/wiki/OWASP)
|
||||
- [@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 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)
|
||||
|
||||
@@ -13,7 +13,3 @@ Visit the following resources to learn more:
|
||||
- [@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@CSE373 2020 - Lecture 23 - NP-Completeness](https://www.youtube.com/watch?v=ItHp5laE1VE&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=23)
|
||||
- [@video@CSE373 2020 - Lecture 24 - Satisfiability](https://www.youtube.com/watch?v=inaFJeCzGxU&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=24)
|
||||
- [@video@CSE373 2020 - Lecture 25 - More NP-Completeness](https://www.youtube.com/watch?v=B-bhKxjZLlc&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=25)
|
||||
- [@video@CSE373 2020 - Lecture 26 - NP-Completeness Challenge](https://www.youtube.com/watch?v=_EzetTkG_Cc&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=26)
|
||||
|
||||
+1
-1
@@ -4,7 +4,7 @@ Public-key cryptography, or asymmetric cryptography, is the field of cryptograph
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@article@Public-key cryptography - Wikipedia](https://en.wikipedia.org/wiki/Public-key_cryptography)
|
||||
- [@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)
|
||||
|
||||
@@ -5,8 +5,8 @@ Python is a well known programming language which is both a strongly typed and a
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@roadmap@Visit Dedicated Python Roadmap](https://roadmap.sh/python)
|
||||
- [@official@Python Website](https://www.python.org/)
|
||||
- [@official@Python Getting Started](https://www.python.org/about/gettingstarted/)
|
||||
- [@official@Python](https://www.python.org/)
|
||||
- [@official@Getting Started with Python](https://www.python.org/about/gettingstarted/)
|
||||
- [@article@Automate the Boring Stuff](https://automatetheboringstuff.com/)
|
||||
- [@article@Python principles - Python basics](https://pythonprinciples.com/)
|
||||
- [@article@W3Schools - Python Tutorial ](https://www.w3schools.com/python/)
|
||||
|
||||
@@ -4,6 +4,7 @@ Rust is a modern systems programming language focusing on safety, speed, and con
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@roadmap@Visit Dedicated Rust Roadmap](https://roadmap.sh/rust)
|
||||
- [@article@The Rust Programming Language - online book](https://doc.rust-lang.org/book/)
|
||||
- [@article@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/)
|
||||
|
||||
+2
-1
@@ -14,7 +14,8 @@ Here is the list of some of the most commonly used scheduling algorithms:
|
||||
- **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 :
|
||||
Visit the following resources to learn more
|
||||
|
||||
- [@video@Introduction to CPU Scheduling](https://youtu.be/EWkQl0n0w5M?si=Lb-PxN_t-rDfn4JL)
|
||||
- [@article@CPU Scheduling in Operating Systems - geeksforgeeks](https://www.geeksforgeeks.org/cpu-scheduling-in-operating-systems/)
|
||||
- [@article@Lottery Scheduling for Operating Systems - geeksforgeeks](https://www.geeksforgeeks.org/lottery-process-scheduling-in-operating-system/)
|
||||
|
||||
@@ -4,3 +4,5 @@ Web sockets are a bidirectional communication protocol between a client and a se
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@article@WebSockets](https://en.wikipedia.org/wiki/WebSocket)
|
||||
- [@article@Web Sockets API](https://developer.mozilla.org/en-US/docs/Web/API/WebSockets_API)
|
||||
Reference in New Issue
Block a user