Quick Links

LMS Syllabus All Notes Class Library
Past Lesson Note

This note is from 9 months ago. You're viewing content from a previous lesson.

Daily Note for September 8, 2025 Past Lesson

We will be learning about data structures:

    1. B2.2.1 Compare static and dynamic data structures.
    2. B2.2.2 Construct programs that apply arrays and Lists.
      1. We didn't finish 2D lists, so we will reinforce this with an idea of how a computer process an image
  2.  
  3. image = [
        [1, 0, 0, 0, 0, 0, 1],
        [0, 1, 0, 0, 0, 1, 0],
        [0, 0, 1, 0, 1, 0, 0],
        [0, 0, 0, 1, 0, 0, 0],
        [0, 0, 1, 0, 1, 0, 0],
        [0, 1, 0, 0, 0, 1, 0],
        [1, 0, 0, 0, 0, 0, 1],
    ]
  4.  
    1. B2.2.3 Explain the concept of a stack as a “last in, first out” (LIFO) data structure.
    2. B2.2.4 Explain the concept of a queue as a “first in, first out” (FIFO) data structure.