IB Comp Sci HL - December 7 2016 Lesson Notes: Difference between revisions

From Computer Science Wiki
(Created page with " __NOTOC__ <table cellspacing="10" style="width:100%;"> <tr> <td style="width:50%; margin:0; margin-top:10px; margin-right:10px; border:1px solid #dfdfdf; padding:0 1em 1em 1...")
 
Line 20: Line 20:
==[[file:homework.png]] What is our homework? ==
==[[file:homework.png]] What is our homework? ==


# Please review our disucssion about [[linked list]].  
# [https://www.youtube.com/watch?v=qH6yxkw0u78  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.





Revision as of 13:26, 7 December 2016

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

  1. Today we will review our homework
  2. We will review basic data types
  3. We will review linked list
  4. We will learn about stacks
  5. We will learn about queues



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]

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]