Courses from 1000+ universities
$7.2 billion in combined revenue since 2020. $8 billion in lost market value. This merger marks the end of an era in online education.
600 Free Google Certifications
Computer Science
Information Technology
Data Analysis
The Science of Gastronomy
Transforming Digital Learning: Learning Design Meets Service Design
Intelligenza Artificiale
Organize and share your learning with Class Central Lists.
View our Lists Showcase
Explore Dijkstra's algorithm for finding the shortest path in graphs. Learn its implementation, applications, and role in greedy methods for efficient problem-solving.
Learn to solve the 0/1 Knapsack problem using dynamic programming. Master this classic algorithm optimization technique for efficient decision-making in resource allocation scenarios.
Explore the Traveling Salesman Problem using dynamic programming, with practical examples to understand this classic optimization challenge in computer science.
Explore the Traveling Salesman Problem using dynamic programming for directed graphs. Learn efficient solution techniques and practical applications in algorithm design and analysis.
Explore dynamic programming with multistage graphs, focusing on the forward approach. Learn efficient problem-solving techniques for complex algorithmic challenges.
Learn to calculate time complexity with practical examples, focusing on analyzing algorithms efficiently for better problem-solving and optimization in computer science.
Comprehensive exploration of CPU scheduling algorithms: FCFS, SJF, Priority, and Round Robin. Learn implementation, advantages, and practical applications in operating systems.
Explore the Sum of Subset problem using backtracking, with practical examples. Learn efficient algorithm design and analysis techniques for solving complex computational challenges.
Learn to solve the N-Queens problem using backtracking, focusing on the 4-Queens case. Explore algorithmic techniques for efficient placement of queens on a chessboard without conflicts.
Master backtracking algorithms through practical examples. Enhance problem-solving skills and optimize algorithmic design for efficient solutions in computer science and programming.
Master the Greedy Method in algorithm design through practical examples. Enhance problem-solving skills and optimize solutions for efficient computational processes.
Master divide and conquer algorithms through practical examples. Enhance problem-solving skills and optimize algorithmic design for efficient solutions in computer science and programming.
Explore optimal binary search tree construction using dynamic programming for successful searches. Learn to minimize expected search time based on access frequencies.
Explore syntax directed definitions, attribute types, and SDD variations in compiler design. Master key concepts for effective language processing and translation.
Master the fundamentals of hashing in data structures, including hash functions, tables, keys, and values. Learn efficient data storage and retrieval techniques for optimized programming solutions.
Get personalized course recommendations, track subjects and courses with reminders, and more.