Skip to content
Computer Science Notes
Chapter 1 Introduction
Initializing search
walkccc/CS
Preface
Parallel and Concurrent Programming
OS
ML
JavaScript DSA
Computer Science Notes
walkccc/CS
Preface
Parallel and Concurrent Programming
Parallel and Concurrent Programming
Preface
Part 1
Part 1
2. Threads and Processes
3. Mutual Exclusion
4. Locks
5. Liveness
Part 2
Part 2
1. Synchronization
2. Barriers
3. Asynchronous
OS
OS
Preface
PART ONE | OVERVIEW
PART ONE | OVERVIEW
Chapter 1 Introduction
Chapter 2 Operating-System Structures
PART TWO | PROCESS MANAGEMENT
PART TWO | PROCESS MANAGEMENT
Chapter 3 Processes
Chapter 4 Threads
Chapter 5 Process Synchronization
Chapter 6 CPU Scheduling
Chapter 7 Deadlocks
PART THREE | MEMORY MANAGEMENT
PART THREE | MEMORY MANAGEMENT
Chapter 8 Main Memory
Chapter 9 Virtual Memory
Previous Exams
Previous Exams
Midterm
Final
ML
ML
Preface
Lec 1 - Regression - Case Study
Lec 2 - Where does the error com from?
Lec 3 - Gradient Descent
Lec 4 - Classification
Lec 5 - Logistic Regression
Lec 6 - Deep Learning
Lec 7 - Backpropagation
Lec 8 - "Hello world" of Deep Learning
Lec 9 - Tips for Deep Learning
JavaScript DSA
JavaScript DSA
Preface
01 - Problem Solving Patterns
01 - Problem Solving Patterns
Frequency Counters
Multiple Pointers
Sliding Window
Divide and Conquer
02 - Recursion Problem Set
02 - Recursion Problem Set
Recursion Problem Set (easy)
Recursion Problem Set (hard)
03 - Sorting Algorithms
03 - Sorting Algorithms
Bubble Sort
Selection Sort
Insertion Sort
Merge Sort
Quick Sort
04 - Data Structures
04 - Data Structures
Singly Linked List
Doubly Linked List
Binary Search Tree
Max Binary Heap
Max Priority Queue
05 - Graphs
05 - Graphs
Graph
Dijkstra Algorithm
Chapter 1 Introduction
¶