Unit 02: Data Structures #

This unit introduces Data Structures

B2.2.2 Construct programs that apply arrays and Lists.
B2.2.3 Explain the concept of a stack as a “last in, first out” (LIFO) data structure.
B2.2.4 Explain the concept of a queue as a “first in, first out” (FIFO) data structure.
B2.4.2 Construct and trace algorithms to implement a linear search and a binary search for data retrieval.
B2.4.3 Construct and trace algorithms to implement bubble sort and selection sort, evaluating their time and space complexities.

You can find the Data Structures slides HERE.

The Big O Notation slides are HERE.

B2.4.4 Explain the fundamental concept of recursion and its applications in programming.
B2.4.5 Construct and trace recursive algorithms in a programming language.

You can find the Recursion slides HERE.