IB Comp Sci SL - December 9 2016 Lesson Notes

From Computer Science Wiki
Jump to navigation Jump to search

Class plan.png What are we going to learn today?[edit]

  1. We will review basic data types
  2. We will review abstract data structures
  3. We will review linked list
  4. We will review stacks
  5. We will review queues
  6. We will learn about trees
  7. We will learn about binary trees
  8. We will learn about tree traversal
  9. You will review our homework for the weekend



Homework.png What is our homework?[edit]

  1. This video provides a basic introduction to trees. It also summarizes, very nicely, other data structures. Please keep in mind the example at the beginning is not a binary tree, but binary trees are discussed later. Ignore the discussion about cousins and uncles. It's ridiculous. But the rest of the video is really good.


Target.png How am I being assessed today?[edit]

  1. You will be formatively assessed in class today

Ourstandards.png Standards we are covering today[edit]

  • Describe the characteristics and applications of a stack.
  • Construct algorithms using the access methods of a stack.
  • Describe the characteristics and applications of a queue.
  • Construct algorithms using the access methods of a queue.
  • Explain the use of arrays as static stacks and queues.
  • Click here for all our standards

Computer1.png As a computer scientist, you have:[edit]

  • Confidence in dealing with complexity
  • Persistence in working with difficult problems
  • Tolerance for ambiguity
  • The ability to deal with open-ended problems
  • The ability to communicate and work with others to achieve a common goal or solution

Credit.png Credits[edit]