Algorithms are important because they define the steps to solve problems efficiently and effectively.

Algorithms are just a form of documentation for code.

Algorithms are only useful for sorting data.

Algorithms are irrelevant in modern programming languages.

Dictionaries

Sets

Matrices

Arrays, Linked Lists, Stacks, Queues, Trees, Graphs

An array is a single value that cannot hold multiple elements.

An array is a type of function that performs calculations on data.

An array is an unordered collection of elements accessed by their values.

An array is an ordered collection of elements that can hold multiple values, accessed by indices.

A linked list is a type of array that allows for random access of elements.

A linked list is a fixed-size data structure that stores elements in a single block of memory.

A linked list is a dynamic data structure with nodes linked together, differing from an array which is a static, contiguous block of memory.

An array is a dynamic data structure that can grow and shrink in size as needed.

Stacks are used in various applications such as function call management in programming (call stack), undo mechanisms in software applications, and parsing expressions in compilers.

Stacks are primarily used for database management and storage.

Stacks are mainly utilized for network communication protocols.

Stacks are a type of queue used for data retrieval.

A queue is a data structure that operates on a FIFO basis, allowing elements to be added at the back and removed from the front.

A queue is a data structure that operates on a LIFO basis.

A queue allows elements to be removed from the back and added to the front.

A queue is a type of sorting algorithm used for organizing data.

Pseudocode is a simplified, human-readable representation of an algorithm used for planning and communication.

Pseudocode is a type of markup language for web design.

Pseudocode is a programming language used for software development.

Pseudocode is a graphical representation of data flow in a program.

Use complex programming syntax

Define the program's purpose, identify inputs/outputs, break tasks down, use clear language, organize logically, and refine.

Focus only on outputs

Ignore task breakdowns

A flowchart is a written description of an algorithm.

A flowchart uses only text to represent steps in an algorithm.

A flowchart is a visual tool that represents an algorithm through symbols and arrows, illustrating the sequence of steps and decisions.

A flowchart is a type of computer program that executes algorithms.

Hexagon (subprocess)

Common flowchart symbols include Oval (start/end), Rectangle (process), Diamond (decision), Parallelogram (input/output), and Arrows (flow direction).

Circle (loop)

Triangle (conditional)

Flowcharts only represent data structures, not algorithms.

Flowcharts eliminate the need for algorithms entirely.

Flowcharts help in understanding algorithms by providing a visual representation of the steps and decision points involved.

Flowcharts are only useful for programming languages, not algorithms.