К содержимому
learnspaceYOUR NEXT CHAPTER
ПРОСТРАНСТВО ОБУЧЕНИЯ
ГлавнаяКаталог курсовМоё обучениеCoursera

Знания без границ

Учитесь у лучших университетов и компаний мира.

Открыть Coursera
Интеграция
Пространство университета
Моё пространствоСтраница курса
↵
ЯЛичный кабинетСтудент
© 2026 LearnSpaceКаждый день — возможность узнать больше.Помощь
Data Structures and Algorithms · LearnSpace
Назад в каталог
courseraПрограммирование

Data Structures and Algorithms

Курс от Birla Institute of Technology & Science, Pilani
Уровень не указан≈ 79.3 чАнглийский
О курсеНавыкиПрограммаПреподаватели

О курсе

Welcome to the Data Structures and Algorithms course! Dive into the essential principles and techniques that form the backbone of computer science and software development. This comprehensive course explores the efficient organization, storage, and manipulation of data using various data structures such as arrays, linked lists, stacks, queues, hash tables, trees, and graphs. You will learn how to implement these structures in your code, optimize their performance, and solve complex computational problems through algorithm design and analysis. Master key concepts including sorting algorithms like quicksort, mergesort, and insertion sort, graph algorithms including BFS and DFS for traversals, and shortest path calculations. Understand the intricacies of tree structures such as binary trees and AVL trees, and harness the power of hash tables for fast data access and storage. The course emphasizes real-world applications, memory management, and performance optimization, equipping you with problem-solving skills crucial for data science, software development, and IT roles. Designed for individuals who are new to data structures or those looking to enhance their computational skills, this course provides a robust foundation for advanced topics in computer science. By the end of this course, you will develop critical thinking, algorithmic problem-solving abilities, and a deeper understanding of data management, enabling you to translate complex computational problems into efficient algorithmic solutions.

Навыки, которые вы освоите

AlgorithmsMemory ManagementComputational ThinkingData ManagementC and C++Programming PrinciplesComplex Problem SolvingProblem SolvingData StoreSoftware Design

Программа курса

10 модулей · 422 учебных материалов

01Algorithmic Efficiency and Asymptotic Analysis37 материалов

Getting Started

Course OverviewЧтениеMeet Your Instructor: Dr. Jagat Sesh ChallaВидеоMeet Your Instructor: Dr. Sundaresan RamanВидео

Algorithmic Efficiency

Module Introduction: Algorithmic Efficiency and Asymptotic AnalysisВидео

Учитесь у экспертов

BITS Pilani Instructors Group

Преподаватель курса

Data Structures and Algorithms
В каталоге вашей программы

Инвестируйте в себя

Новые знания — в удобное для вас время.

Начать на Coursera

Обучение откроется на Coursera
в новой вкладке

Обучение на Coursera

≈ 79.3 ч

10 модулей

Язык: Английский

Часть программы вашего университета
Algorithms and Data StructuringВидео
Practice Quiz: Algorithms and Data StructuringЗадание
Algorithmic Efficiency: Experimental MeasurementВидео
Practice Quiz: Algorithmic Efficiency: Experimental MeasurementЗадание
Algorithmic Efficiency: Design Time MeasurementВидео
Practice Quiz: Algorithmic Efficiency: Design Time MeasurementЗадание
Counting Primitive OperationsВидео
Practice Quiz: Counting Primitive OperationsЗадание
Recommended Reading: Measuring Algorithmic EfficiencyЧтение

Asymptotic Analysis

Asymptotic Analysis and Big-Oh NotationВидеоPractice Quiz: Asymptotic Analysis and Big-Oh NotationЗаданиеRelatives of Big-OhВидеоPractice Quiz: Relatives of Big-OhЗаданиеAsymptotic Analysis of Prefix SumВидеоPractice Quiz: Asymptotic Analysis of Prefix SumЗаданиеImportance of AsymptoticsВидеоPractice Quiz: Importance of AsymptoticsЗаданиеRecommended Reading: Asymptotic Analysis and ExamplesЧтение

Revision of C Programming Fundamentals and Coursera Labs

Basic C Program with LoopsВидео Functions and ArraysВидеоStructures and Array of StructuresВидеоPointersВидеоPass by Value vs. Pass by ReferenceВидеоDynamic Memory Allocation: 1D ArraysВидеоMemory LeakВидеоDynamic Memory Allocation: Array of StructuresВидеоBasic C Program with File Handling: List of NumbersВидеоBasic C Program with File Handling: Tuple DataВидеоEssential Reading: Collection of Basic C ProgramsЧтение

Summary and Lab

Module Wrap-Up: Algorithmic Efficiency and Asymptotic AnalysisВидеоMastering Design-Time Algorithm Analysis: Theory Meets PracticeDIALOGUEPractice Lab: C FundamentalsЛабораторнаяLab Solutions: C FundamentalsЧтение
02Data Structuring for Algorithm Efficiency and ADTs56 материалов

Arrays and Linked Lists

Module Introduction: Data Structuring for Algorithm Efficiency and ADTsВидеоData Structuring and ModellingВидеоPractice Quiz: Data Structuring and ModellingЗаданиеArrays in MemoryВидеоPractice Quiz: Arrays in MemoryЗаданиеLinked Lists ВидеоPractice Quiz: Linked ListsЗаданиеLinked Lists: Operations IВидеоPractice Quiz: Linked Lists: Operations IЗаданиеLinked Lists: Operations IIВидеоPractice Quiz: Linked Lists: Operations IIЗаданиеEssential Reading: Arrays and Linked Lists ЧтениеLinked Lists: Implementation—Part IВидеоLinked Lists: Implementation—Part IIВидеоLinked Lists: Implementation—Part IIIВидеоLinked Lists: Implementation—Part IVВидеоLinked Lists: Implementation—Part VВидеоEssential Reading: Implementations of Linked ListsЧтениеCircular and Doubly Linked ListsВидеоPractice Quiz: Circular and Doubly Linked ListsЗаданиеCycle Detection in Linked ListsВидеоPractice Quiz: Cycle Detection in Linked ListsЗаданиеEssential Reading: Circular and Doubly Linked Lists and Cycle Detection in Linked ListsЧтениеPractice Lab: Linked Lists OperationsЛабораторная

ADT Stack

Abstract Data TypesВидеоPractice Quiz: Abstract Data TypesЗаданиеADT Stack ВидеоPractice Quiz: ADT Stack ЗаданиеADT Stack: ApplicationsВидеоPractice Quiz: ADT Stack: ApplicationsЗаданиеEssential Reading: Computing Spans Using ADT Stack

ADT Queue

ADT Queue and its ApplicationsВидеоPractice Quiz: ADT Queue and Its ApplicationsЗаданиеArray-Based QueueВидеоPractice Quiz: Array-Based QueueЗаданиеLinked-List-Based QueueВидеоPractice Quiz: Linked-List-Based QueueЗадание

Summary and Assessment

Module Wrap-Up: Data Structuring for Algorithm Efficiency and ADTsВидеоData Structuring for Algorithm Efficiency and ADTsОбсуждениеTest Yourself: Algorithmic EfficiencyЗадание
03Sorting and Searching53 материалов

Divide and Conquer

Module Introduction: Sorting and SearchingВидеоDivide and Conquer, and Recursion ВидеоPractice Quiz: Divide and Conquer, and RecursionЗаданиеRecursive arrayMaxВидеоPractice Quiz: Recursive arrayMaxЗаданиеRecursive arrayMax: Time ComplexityВидеоPractice Quiz: Recursive arrayMax: Time ComplexityЗаданиеRecommended Reading: Analyzing Recursive AlgorithmsЧтение

Insertion Sort

Insertion Sort: Recursive Version—Part IВидеоPractice Quiz: Insertion Sort: Recursive Version—Part IЗаданиеInsertion Sort: Recursive Version—Part IIВидеоPractice Quiz: Insertion Sort: Recursive Version—Part IIЗаданиеRecursive Insertion Sort: Time Complexity—Part IВидеоPractice Quiz: Recursive Insertion Sort: Time Complexity—Part IЗадание

Merge Sort

Merge Sort: IntuitionВидеоPractice Quiz: Merge Sort: IntuitionЗаданиеMerge Operation in Merge Sort: Part IВидеоPractice Quiz: Merge Operation in Merge Sort: Part IЗаданиеMerge Operation in Merge Sort: Part IIВидеоPractice Quiz: Merge Operation in Merge Sort: Part IIЗадание

Searching in an Array

Linear SearchВидеоPractice Quiz: Linear SearchЗаданиеBinary SearchВидеоPractice Quiz: Binary SearchЗаданиеRecursion vs. IterationВидеоPractice Quiz: Recursion vs. IterationЗаданиеEssential Reading: Linear and Binary Search Algorithms

Summary and Discussion

Module Wrap-Up: Sorting and SearchingВидеоSorting and SearchingОбсуждение
04More Sorting35 материалов

Quick Sort

Module Introduction: More SortingВидеоQuick Sort: IntuitionВидеоPractice Quiz: Quick Sort: IntuitionЗаданиеQuick Sort: AlgorithmВидеоPractice Quiz: Quick Sort: AlgorithmЗаданиеQuick Sort: Time Complexity—Part IВидеоPractice Quiz: Quick Sort: Time Complexity—Part IЗаданиеQuick Sort: Time Complexity—Part IIВидеоPractice Quiz: Quick Sort: Time Complexity—Part IIЗаданиеPivot Selection Techniques ВидеоPractice Quiz: Pivot Selection TechniquesЗаданиеRecommended Reading: Quick SortЧтениеQuick Sort ImplementationВидеоEssential Reading: Implementation of Quick SortЧтениеPractice Lab: Comparing Running Times of Comparison-Based Sorting AlgorithmsЛабораторная

Analysis of Comparison-Based Sorting Algorithms

Sorting Smaller ListsВидеоPractice Quiz: Sorting Smaller ListsЗаданиеComparing Comparison-Based Sorting AlgorithmsВидеоPractice Quiz: Comparing Comparison-Based Sorting AlgorithmsЗаданиеLower Bound on Comparison-Based SortingВидеоPractice Quiz: Lower Bound on Comparison-Based SortingЗадание

Other Sorting Algorithms

Bucket SortВидеоPractice Quiz: Bucket SortЗаданиеStability of SortingВидеоPractice Quiz: Stability of SortingЗаданиеRadix SortВидеоPractice Quiz: Radix SortЗаданиеRecommended Reading: Other Sorting Algorithms

Summary and Assessment

Module Wrap-Up: More SortingВидеоMore SortingОбсуждениеLab: SortingПрограммированиеTest Yourself: Sorting and SearchingЗадание
05Dictionaries, Hash Tables, and Binary Trees39 материалов

Dictionaries

Module Introduction: Dictionaries, Hash Tables, and Binary TreesВидеоDictionary ADTВидеоPractice Quiz: Dictionary ADTЗаданиеA Dictionary CaseВидеоPractice Quiz: A Dictionary CaseЗаданиеRecommended Reading: Dictionary ADTЧтение

Hash Tables with Linear Chaining

Hash Tables with Linear ChainingВидеоPractice Quiz: Hash Tables with Linear ChainingЗаданиеAnalysis of Hashing with Linear ChainingВидеоPractice Quiz: Analysis of Hashing with Linear ChainingЗаданиеHash Functions: Hash-Code MapsВидеоPractice Quiz: Hash Functions: Hash-Code MapsЗаданиеHash Functions: Compression MapsВидеоPractice Quiz: Hash Functions: Compression MapsЗаданиеRecommended Reading: Hash Tables and AnalysisЧтениеOpen Addressing with Linear ProbingВидеоPractice Quiz: Open Addressing with Linear ProbingЗаданиеDouble HashingВидеоPractice Quiz: Double HashingЗаданиеRecommended Reading: Open AddressingЧтениеPractice Lab: Hashing Large Files: Line Chaining and ProbingЛабораторная

Binary Trees

Trees: Definitions and ExamplesВидеоPractice Quiz: Trees: Definitions and ExamplesЗаданиеBinary Tree with ExamplesВидеоPractice Quiz: Binary Tree with ExamplesЗаданиеTypes and Properties of Binary TreesВидеоPractice Quiz: Types and Properties of Binary TreesЗадание

Summary and Discussion

Module Wrap-Up: Dictionaries, Hash Tables, and Binary TreesВидеоDictionaries, Hash Tables, and Binary TreesОбсуждение
06Binary Search Trees and AVL Trees47 материалов

Binary Search Trees

Module Introduction: Binary Search Trees and AVL TreesВидеоBinary Search Trees: Intuition and SearchВидеоPractice Quiz: Binary Search Trees: Intuition and SearchЗаданиеMin, Max, Successor and Predecessor in BSTsВидеоPractice Quiz: Min, Max, Successor and Predecessor in BSTsЗаданиеBST InsertionВидеоPractice Quiz: BST InsertionЗаданиеBST DeletionВидеоPractice Quiz: BST DeletionЗаданиеBST SortВидеоPractice Quiz: BST SortЗаданиеBST: Summary of Time ComplexitiesВидеоPractice Quiz: BST: Summary of Time ComplexitiesЗаданиеRecommended Reading: Binary Search TreesЧтениеBST Implementation: Part IВидеоBST Implementation: Part IIВидеоBST Implementation: Part IIIВидеоEssential Reading: Implementation of BSTЧтениеPractice Lab: BST Delete and BST Sort ЛабораторнаяLab Solution: Binary Search TreesЧтение

AVL Trees

AVL Trees: Motivation, Intuition, and ExamplesВидеоPractice Quiz: AVL Trees: Motivation, Intuition, and ExamplesЗаданиеAVL Tree: StructureВидеоPractice Quiz: AVL Tree: StructureЗаданиеAVL Tree: Insertion—Part IВидеоPractice Quiz: AVL Tree: Insertion—Part IЗадание

Summary and Assessment

Module Wrap-Up: Binary Search Trees and AVL TreesВидеоBinary Search Trees and AVL TreesОбсуждениеTest Yourself: Dictionaries, Hash Tables, and Binary TreesЗадание
07Priority Queues and Tries45 материалов

Priority Queues

Module Introduction: Priority Queues and TriesВидеоPriority Queues: MotivationВидеоPractice Quiz: Priority Queues: MotivationЗаданиеHeap as a Priority QueueВидеоPractice Quiz: Heap as a Priority QueueЗаданиеImplementing a HeapВидеоPractice Quiz: Implementing a HeapЗаданиеInsertion in a HeapВидеоPractice Quiz: Insertion in a HeapЗаданиеRecommended Reading: Priority Queues and HeapsЧтениеDelete Min, Heapify in a HeapВидеоPractice Quiz: Delete Min, Heapify in a HeapЗаданиеBuilding Heap and Time Complexity of Heap OperationsВидеоPractice Quiz: Building Heap and Time Complexity of Heap OperationsЗаданиеHeap SortВидеоPractice Quiz: Heap SortЗаданиеRecommended Reading: More on HeapsЧтениеImplementing Heaps: Part IВидеоImplementing Heaps: Part IIВидеоImplementing Heaps: Part IIIВидеоEssential Reading: Implementation of HeapsЧтениеPractice Lab: Heap Operations and ApplicationsЛабораторная

Tries

Standard Tries ВидеоPractice Quiz: Standard Tries ЗаданиеCompressed TriesВидеоPractice Quiz: Compressed TriesЗаданиеApplications of TriesВидеоPractice Quiz: Applications of TriesЗаданиеSuffix Trees

Summary and Assessment

Module Wrap-Up: Priority Queues and Tries ВидеоPriority Queues and Tries ОбсуждениеGraded Lab: Priority Queues and TriesПрограммирование
08Graphs and Graph Traversals37 материалов

Graphs: Introduction

Module Introduction: Graphs and Graph TraversalsВидеоGraphs and ApplicationsВидеоPractice Quiz: Graphs and ApplicationsЗаданиеGraph Terminologies: Part IВидеоPractice Quiz: Graph Terminologies: Part IЗаданиеGraph Terminologies: Part IIВидеоPractice Quiz: Graph Terminologies: Part IIЗаданиеGraph ADTВидеоPractice Quiz: Graph ADTЗаданиеData Structures for Graph, Edge ListВидеоPractice Quiz: Data Structures for Graph, Edge ListЗаданиеAdjacency List and Adjacency MatrixВидеоPractice Quiz: Adjacency List and Adjacency MatrixЗаданиеComparing Graph RepresentationsВидеоPractice Quiz: Comparing Graph RepresentationsЗаданиеRecommended Reading: Graph ADT and RepresentationsЧтение

Breadth-First Search

Breadth-First Search: Intuition with an ExampleВидеоPractice Quiz: Breadth-First Search: Intuition with an ExampleЗаданиеBFS Algorithm and Running TimeВидеоPractice Quiz: BFS Algorithm and Running TimeЗаданиеBFS TreeВидеоPractice Quiz: BFS TreeЗадание

Summary and Assessment

Module Wrap-Up: Graphs and Graph TraversalsВидеоGraphs and Graph TraversalsОбсуждениеTest Yourself: Priority Queues, Tries, Graphs and Graph TraversalsЗадание
09Depth-First Search and MST in Weighted Graphs42 материалов

Depth-First Search

Module Introduction: Depth-First Search and MST in Weighted GraphsВидеоDepth First Search: Intuition and ApplicationsВидеоPractice Quiz: Depth First Search: Intuition and ApplicationsЗаданиеDFS Examples and Predecessor SubgraphВидеоPractice Quiz: DFS Examples and Predecessor SubgraphЗаданиеDFS Algorithm and ComplexityВидеоPractice Quiz: DFS Algorithm and ComplexityЗаданиеBiconnectivityВидеоPractice Quiz: BiconnectivityЗаданиеRecommended Reading: Depth First Search and Its ApplicationsЧтениеDFS in a Directed GraphВидеоPractice Quiz: DFS in a Directed GraphЗаданиеDetecting Cycles in a Directed GraphВидеоPractice Quiz: Detecting Cycles in a Directed GraphЗаданиеTopological OrderingВидеоPractice Quiz: Topological OrderingЗаданиеStrongly Connected Components in a Directed GraphВидеоPractice Quiz: Strongly Connected Components in a Directed GraphЗаданиеRecommended Reading: Depth First Search in a Directed Graph and Its ApplicationsЧтениеIterative DFS Implementation Using Adjacency ListВидеоRecursive DFS Implementation Using Adjacency ListВидеоEssential Reading: DFS Implementation using Adjacency ListЧтениеPractice Lab: DFS Implementation using Adjacency MatrixЛабораторнаяLab Solutions: DFS Implementation using Adjacency MatrixЧтение

Kruskal’s MST Algorithm

Minimum Spanning Tree: Intuition and ApplicationsВидеоPractice Quiz: Minimum Spanning Tree: Intuition and ApplicationsЗаданиеMinimum Spanning Tree: PropertiesВидеоPractice Quiz: Minimum Spanning Tree: PropertiesЗаданиеKruskal’s MST Algorithm: IllustrationВидеоPractice Quiz: Kruskal’s MST Algorithm: IllustrationЗадание

Summary and Discussion

Module Wrap-Up: Depth-First Search and MST in Weighted GraphsВидеоDepth-First Search and MST in Weighted GraphsОбсуждение
10Prim’s MST Algorithm and Single-Source Shortest Paths31 материалов

Prim’s MST Algorithm

Module Introduction: Prim’s MST Algorithm and Single Source Shortest PathsВидеоPrim’s MST Algorithm: IllustrationВидеоPractice Quiz: Prim’s MST Algorithm: IllustrationЗаданиеPrim’s MST Algorithm: Pseudo-Code and Time ComplexityВидеоPractice Quiz: Prim’s MST Algorithm: Pseudo-Code and Time ComplexityЗаданиеRecommended Reading: Prim’s MST AlgorithmЧтение

Single Source Shortest Paths

Shortest Paths in a Weighted Graph: Intuition and Properties ВидеоPractice Quiz: Shortest Paths in a Weighted Graph: Intuition and Properties ЗаданиеSingle Source Shortest Paths: Brute Force ApproachВидеоSingle Source Shortest Paths: Brute Force ApproachЗаданиеDijkstra’s SSSP Algorithm: Intuition and IllustrationВидеоPractice Quiz: Dijkstra’s SSSP Algorithm: Intuition and IllustrationЗадание

Shortest Paths in Graphs with Negative Edge Weights

Limitations of Dijkstra’s SSSP AlgorithmВидеоPractice Quiz: Limitations of Dijkstra’s SSSP AlgorithmЗаданиеBellman-Ford's SSSP AlgorithmВидеоPractice Quiz: Bellman-Ford's SSSP AlgorithmЗаданиеRecommended Reading: Bellman-Ford SSSP AlgorithmЧтение

Summary and Assessment

Module Wrap-Up: Prim’s MST Algorithm and Single Source Shortest PathsВидео Course Summary Slides ЧтениеAlgorithm Selection in Real-World Graph ProblemsDIALOGUETest Yourself: Depth-First Search, MST in Weighted Graphs and Single-Source Shortest PathsЗадание
Чтение
Array-Based StackВидео
Practice Quiz: Array-based StackЗадание
Array-Based Stack: Implementation—Part IВидео
Array-Based Stack: Implementation—Part IIВидео
Linked-List-Based StackВидео
Practice Quiz: Linked-List-based StackЗадание
Linked-List-Based Stack: Implementation—Part IВидео
Linked-List-Based Stack: Implementation—Part IIВидео
Essential Reading: Implementations of StackЧтение
Principles of ADTs Summarized Видео
Practice Quiz: Principles of ADTs Summarized Задание
Essential Reading: StacksЧтение
Practice Lab: Stack OperationsЛабораторная
Essential Reading: QueuesЧтение
Practice Lab: Queue OperationsЛабораторная
Lab Solutions: Data Structuring for Algorithm Efficiency and ADTsЧтение
Recursive Insertion Sort: Time Complexity—Part IIВидео
Practice Quiz: Recursive Insertion Sort: Time Complexity—Part IIЗадание
Implementing Recursive Insertion Sort in C and Its Running Time: Part IВидео
Implementing Recursive Insertion Sort in C and Its Running Time: Part IIВидео
Essential Reading: Implementation of Recursive Insertion SortЧтение
Insertion Sort: Iterative VersionВидео
Practice Quiz: Insertion Sort: Iterative VersionЗадание
Essential Reading: Time Complexity of Iterative Insertion SortЧтение
Recommended Reading: Insertion Sort and AnalysisЧтение
Practice Lab: Iterative Insertion Sort and its Running TimeЛабораторная
Merge Sort: Time ComplexityВидео
Practice Quiz: Merge Sort: Time ComplexityЗадание
Space Complexities of Merge and Insertion Sort: Part IВидео
Practice Quiz: Space Complexities of Merge and Insertion Sort: Part IЗадание
Space Complexities of Merge and Insertion Sort: Part IIВидео
Practice Quiz: Space Complexities of Merge and Insertion Sort: Part IIЗадание
Merge vs. Insertion SortВидео
Practice Quiz: Merge vs. Insertion SortЗадание
Recommended Reading: Merge SortЧтение
Merge Sort Implementation and Its Running TimeВидео
Essential Reading: Implementation of Recursive Merge SortЧтение
Practice Lab: Insertion Sort vs. Merge Sort: Running TimeЛабораторная
Чтение
Practice Lab: Linear Search vs. Binary Search (Iterative) - Running TimeЛабораторная
Lab Solutions: Sorting and SearchingЧтение
Recommended Reading: Analysis of Comparison-Based Sorting AlgorithmsЧтение
Чтение
Practice Lab: Bucket and Radix Sort on Numerical DataЛабораторная
Lab Solutions: SortingЧтение
Tree ADTВидео
Practice Quiz: Tree ADTЗадание
Tree TraversalsВидео
Practice Quiz: Tree TraversalsЗадание
Building Binary Trees from Tree TraversalsВидео
Practice Quiz: Building Binary Trees from Tree TraversalsЗадание
Essential Reading: Binary Tree ImplementationЧтение
Recommended Reading: Trees and Tree TraversalsЧтение
Practice Lab: Tree TraversalsЛабораторная
Lab Solutions: Dictionaries, Hash Tables, and Binary TreesЧтение
AVL Tree: Insertion—Part IIВидео
Practice Quiz: AVL Tree: Insertion—Part IIЗадание
AVL Tree: Insertion—Part IIIВидео
Practice Quiz: AVL Tree: Insertion—Part IIIЗадание
AVL Tree: Insertion—Part IVВидео
Practice Quiz: AVL Tree: Insertion—Part IVЗадание
AVL Tree: Deletion—Part IВидео
Practice Quiz: AVL Tree: Deletion—Part IЗадание
AVL Tree: Deletion—Part IIВидео
Practice Quiz: AVL Tree: Deletion—Part IIЗадание
AVL Tree: Deletion—Part IIIВидео
Practice Quiz: AVL Tree: Deletion—Part IIIЗадание
Time Complexities of AVL TreeВидео
Practice Quiz: Time Complexities of AVL TreeЗадание
Benefits of AVL Tree: SummaryВидео
Practice Quiz: Benefits of AVL Tree: SummaryЗадание
Recommended Reading: AVL TreesЧтение
Essential Reading: Implementation of AVL TreesЧтение
Видео
Practice Quiz: Suffix TriesЗадание
Suffix Trees ApplicationsВидео
Practice Quiz: Suffix Tries ApplicationsЗадание
Recommended Reading: Tries and Suffix TreesЧтение
File Compression with an Encoding TrieВидео
Practice Quiz: File Compression with an Encoding TrieЗадание
Optimal Compression with Huffman Encoding TrieВидео
Practice Quiz: Optimal Compression with Huffman Encoding TrieЗадание
Using Priority Queues to Implement Huffman Encoding TriesВидео
Practice Quiz: Using Priority Queues to Implement Huffman Encoding TriesЗадание
Recommended Reading: Huffman Encoding TriesЧтение
Practice Lab: Huffman Encoding Trie with a Priority QueueЛабораторная
Lab Solutions: Priority Queues and TriesЧтение
BFS Applications: Connected ComponentsВидео
Practice Quiz: BFS Applications: Connected ComponentsЗадание
Checking for a Bipartite Graph: Part IВидео
Practice Quiz: Checking for a Bipartite Graph: Part IЗадание
Checking for a Bipartite Graph: Part IIВидео
Practice Quiz: Checking for a Bipartite Graph: Part IIЗадание
Recommended Reading: Breadth-First SearchЧтение
BFS Implementation Using Adjacency List: Part IВидео
BFS Implementation using Adjacency List: Part IIВидео
Essential Reading: BFS Implementation Using an Adjacency ListЧтение
Practice Lab: BFS Implementation Using Adjacency MatrixЛабораторная
Lab Solution: Graphs and Graph TraversalsЧтение
Kruskal’s MST Algorithm: Pseudo-CodeВидео
Practice Quiz: Kruskal’s MST Algorithm: PseudocodeЗадание
Kruskal’s MST Algorithm: Time ComplexityВидео
Practice Quiz: Kruskal’s MST Algorithm: Time ComplexityЗадание
Union-Find Data StructureВидео
Practice Quiz: Union-Find Data StructureЗадание
Improved Time Complexity of Kruskal’s AlgorithmВидео
Practice Quiz: Improved Time Complexity of Kruskal’s AlgorithmЗадание
Recommended Reading 3: Kruskal’s MST Algorithm Чтение
Recommended Reading: Disjoint-Set Data StructureЧтение
Dijkstra’s SSSP Algorithm: Pseudo-Code and ComplexityВидео
Practice Quiz: Dijkstra’s SSSP Algorithm: Pseudo-Code and ComplexityЗадание
Recommended Reading: Dijkstra’s SSSP AlgorithmЧтение
Implementing Dijkstra’s SSSP Algorithm: Part IВидео
Implementing Dijkstra’s SSSP Algorithm: Part IIВидео
Implementing Dijkstra’s SSSP Algorithm: Part IIIВидео
Implementing Dijkstra’s SSSP Algorithm: Part IVВидео
Essential Reading: Implementation of Dijkstra’s AlgorithmЧтение
Practice Lab: Implementation of Prim’s MST AlgorithmЛабораторная
Lab Solution: Implementation of Prim’s MST AlgorithmЧтение