Загрузка страницы

Algorithms Lecture 1: Introduction (The Role of Algorithms)

California State University, Sacramento
Spring 2018

Algorithms
by Ghassan Shobaki

Text book: Introduction to Algorithms by Cormen, Leiserson, Rivest, and Stein, 3rd Edition, MIT Press, Cambridge (2009)

Видео Algorithms Lecture 1: Introduction (The Role of Algorithms) канала Ghassan Shobaki Computer Science Lectures
Показать
Комментарии отсутствуют
Введите заголовок:

Введите адрес ссылки:

Введите адрес видео с YouTube:

Зарегистрируйтесь или войдите с
Информация о видео
6 января 2019 г. 1:28:23
00:10:02
Другие видео канала
Operating Systems Lecture 70: File System Implementation (Part 1): Basic ConceptsOperating Systems Lecture 70: File System Implementation (Part 1): Basic ConceptsOperating Systems Lecture 47: Deadlocks (2): Characterization and the Resource Allocation GraphOperating Systems Lecture 47: Deadlocks (2): Characterization and the Resource Allocation GraphAlgorithms Lecture 28: Graph Algorithms,  Dijkstra's Alg (Part 1)Algorithms Lecture 28: Graph Algorithms, Dijkstra's Alg (Part 1)Theory of Computation Lecture 44: Decidability (5): The Halting ProblemTheory of Computation Lecture 44: Decidability (5): The Halting ProblemAlgorithms Lecture 14: Greedy Algorithms, Knapsack ProblemAlgorithms Lecture 14: Greedy Algorithms, Knapsack ProblemOperating Systems Lecture 65: Virtual Memory (Part 5): Frame AllocationOperating Systems Lecture 65: Virtual Memory (Part 5): Frame AllocationAlgorithms Lecture 6: Solving Recurrences Using the Recursion Tree MethodAlgorithms Lecture 6: Solving Recurrences Using the Recursion Tree MethodCompilers Lecture 28: Local Register Allocation (2)Compilers Lecture 28: Local Register Allocation (2)Theory of Computation Lecture 22: Context-Free Grammars (1): Definition and Main ConceptsTheory of Computation Lecture 22: Context-Free Grammars (1): Definition and Main ConceptsAlgorithms Lecture 27: Graph Algorithms, TopologicalSortAlgorithms Lecture 27: Graph Algorithms, TopologicalSortCompilers Lecture 18: Parsing (7): LR(1) Parsing, Part ICompilers Lecture 18: Parsing (7): LR(1) Parsing, Part IOperating Systems Lecture 7: OS ServicesOperating Systems Lecture 7: OS ServicesOperating Systems Lecture 32: Process Synch. (Part 10): The Dining-Philosophers Prob using SemaphoreOperating Systems Lecture 32: Process Synch. (Part 10): The Dining-Philosophers Prob using SemaphoreOperating Systems Lecture 62: Virtual Memory (Part 2): Page Fault HandlingOperating Systems Lecture 62: Virtual Memory (Part 2): Page Fault HandlingOperating Systems Lecture 18: Processes (Part 8): Other Inter-process Communication MethodsOperating Systems Lecture 18: Processes (Part 8): Other Inter-process Communication MethodsTheory of Computation Lecture 6: Non-Deterministic Finite Automata (NFAs) (2)Theory of Computation Lecture 6: Non-Deterministic Finite Automata (NFAs) (2)Operating Systems Lecture 60: Main Memory (6): Paging (2): Page Table, TLB and Effective Access TimeOperating Systems Lecture 60: Main Memory (6): Paging (2): Page Table, TLB and Effective Access TimeCompilers Lecture 9: Scanning (6): Converting an NFA into a DFA (The Subset Construction), Part IIICompilers Lecture 9: Scanning (6): Converting an NFA into a DFA (The Subset Construction), Part IIIOperating Systems Lecture 36: CPU Sched. (2): First-Come, First Served (FCFS) and Shortest-Job-FirstOperating Systems Lecture 36: CPU Sched. (2): First-Come, First Served (FCFS) and Shortest-Job-FirstOperating Systems Lecture 71: File System Implementation (Part 2): Allocation MethodsOperating Systems Lecture 71: File System Implementation (Part 2): Allocation MethodsOperating Systems Lecture 43: CPU Scheduling (9): Scheduling in LinuxOperating Systems Lecture 43: CPU Scheduling (9): Scheduling in Linux
Яндекс.Метрика