Breadth-first search is an algorithm used to search a tree data structure for a node that satisfies a given property. It uses extra memory, usually a queue, to keep track of the child nodes encountered but not yet explored. It is guaranteed to find a solution node if one exists, unlike depth-first search which may get lost in an infinite branch.
University of Washington
Summer 2022
This course focuses on common data structures and algorithms. It integrates theoretical understanding with practical exercises, preparing students for software-related roles and industry technical interviews. Programming projects, unit testing, and source control techniques are emphasized.
No concepts data
+ 27 more conceptsStanford University
Winter 2023
This course provides an in-depth exploration of algorithm analysis and design. It covers various sorting, searching, and selection algorithms, data structures, and fundamental graph algorithms. It emphasizes the understanding of worst and average case analysis, recurrences, and asymptotics.
No concepts data
+ 30 more conceptsStanford University
Autumn 2022-2023
Stanford's CS 221 course teaches foundational principles and practical implementation of AI systems. It covers machine learning, game playing, constraint satisfaction, graphical models, and logic. A rigorous course requiring solid foundational skills in programming, math, and probability.
No concepts data
+ 88 more concepts