Difference between revisions of "IB Comp Sci SL - December 9 2016 Lesson Notes"

From Computer Science Wiki
Jump to navigation Jump to search
 
(4 intermediate revisions by the same user not shown)
Line 6: Line 6:


# We will review basic data types
# We will review basic data types
# We will review [[abstract data types]]
# We will review [[abstract data structures]]
# We will review [[linked list]]
# We will review [[linked list]]
# We will review [[stack]]s
# We will review [[stack]]s
Line 12: Line 12:
# We will learn about [[tree]]s
# We will learn about [[tree]]s
# We will learn about [[binary tree]]s
# We will learn about [[binary tree]]s
# We will learn about tree traversal
# You will review our homework for the weekend




Line 22: Line 24:
==[[file:homework.png]] What is our homework? ==
==[[file:homework.png]] What is our homework? ==


# [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.
# Please complete your homework. This is due by our next class.  
 


</td>
</td>
Line 43: Line 44:


== [[File:ourstandards.png]] Standards we are covering today ==
== [[File:ourstandards.png]] Standards we are covering today ==
* Describe the characteristics and applications of a stack.
* Describe how trees operate logically (both binary and non-binary).
* Construct algorithms using the access methods of a stack.
* Define the terms: parent, left-child, right-child, subtree, root and leaf.
* Describe the characteristics and applications of a queue.
* State the result of inorder, postorder and preorder tree traversal.
* Construct algorithms using the access methods of a queue.
* Sketch binary trees.
* Explain the use of arrays as static stacks and queues.
* [[IB Computer Science SL standards | Click here for all our standards]]
* [[IB Computer Science HL standards | Click here for all our standards]]


</td>
</td>

Latest revision as of 11:32, 9 December 2016

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. Please complete your homework. This is due by our next class.

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 how trees operate logically (both binary and non-binary).
  • Define the terms: parent, left-child, right-child, subtree, root and leaf.
  • State the result of inorder, postorder and preorder tree traversal.
  • Sketch binary trees.
  • 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]