IB Comp Sci HL - December 7 2016 Lesson Notes

What are we going to learn today? Today we will review our homework We will review basic data types We will review linked list We will learn about stacks We will learn about queues	What is our homework? 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.
How am I being assessed today? You will be formatively assessed in class today
Standards we are covering today 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	As a computer scientist, you have: 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
Credits Icons used with tremendous gratitude by Freepik from flaticon

Give a detailed account or picture of a situation, event, pattern or process.

Develop information in a diagrammatic or logical form.

Give a detailed account including reasons or causes.