IB Comp Sci HL - December 7 2016 Lesson Notes: Difference between revisions
Mr. MacKenty (talk | contribs) (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...") |
Mr. MacKenty (talk | contribs) |
||
(One intermediate revision by the same user not shown) | |||
Line 20: | Line 20: | ||
==[[file:homework.png]] What is our homework? == | ==[[file:homework.png]] What is our homework? == | ||
# Please | # [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. | ||
Line 41: | Line 41: | ||
== [[File:ourstandards.png]] Standards we are covering today == | == [[File:ourstandards.png]] Standards we are covering today == | ||
* Describe | * 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. | |||
* [[IB Computer Science HL standards | Click here for all our standards]] | * [[IB Computer Science HL standards | Click here for all our standards]] | ||
Latest revision as of 14:29, 7 December 2016
|
|
|
|
||
|
|
|
|