Mr. Rogers' IB Computer Science - 3rd Quarter Objectives
Syllabus
 Syllabus Android Project 1st Quarter 2nd Quarter 3rd Quarter 4th  Quarter
 Latin/Greek Root Words arch--------->ancient, example: archtype;         chrono------>time, example: chronology;             -dom----------->quantity/state, example: freedom               fer-------->carry, example: transfer;               gen--------->birth, example: generate;                 luc-------->light, example lucid;                 neo--------->new, example: neonatologist;                olig--------->few, example: oligarchy;              omni--------->all, omniscient;            sym--------->together, symbol; (Comp Sci connection)

 Essential Question: Can data be retrieved faster than with a binary search?

Chapter 24: Lookup Tables and Hashing

(IV Standard Data Structures, V Standard Algorithms)

Name a way to retrieve data faster than a binary search. a lookup or hash table

1. Explain how lookup tables work.
• implements a map
• the key is converted either directly or through some simple formula to an integer
• the integer is used as the index of an array

1. List the properties of a good hash table
• easy to calculate
• map all values into a range that is not too large
• cover the range uniformly and avoid collisions

1. State the 2 principle ways of avoiding collisions with a hash table.
• chaining--implementing a bucket using a chining technique such as a binary search tree
• probing-- using a function to sort the the colliding value into a different spot on the table.

1. Name a disadvantage of a hash table over a binary search tree or sorted list. It's difficult to quickly travese the table in ascending order of keys.
2. Correctly use java .util's HashSet and HashMap classes.

Homefun: Read Chapter 18; Exercises  5, 6, 7

Programming Assignments: Lab 24.3 Cryptogram Solver, Lab 24.6 Search Engine

 Complete Personal Project

Test: Chap 24

 Essential Question: What's the difference between a heap and a binary search tree?

Chapter 25: Heaps and Priority Queues

(IV Standard Data Structures, V Standard Algorithms)

1. Define the following terms
• full binary tree
• complete binary tree
• heap.
• min-heap
• max-heap.

1. Correctly implement a heap.
2. Correctly implement a heap as a priority queue.
3. Correctly use Heapsort.

Homefun: Read Chapter 18; Exercises 1, 2, 3

Programming Assignments: Lab 25.4 A Do-It-Your-Self Priority Queue, Lab 25.5 Heapsort

Test: Chap 18 Objectives 1-5

Special Topics

Imbedded Processors

Assignment:

1.      Program the Javalin stamp so that it blinks the LED.

2.      Add a transceiver so that the Javalin stamp sends a request to blink the LSD across the room wirelessly

Mr

SAM Team--Southside High School's STEM and Computer Science extra-curricular club (Mr. Rogers Sponsor)

Mr. Rogers Teacher's Blog

Mr. Rogers T-shirts

Mr. Rogers Information for Teachers

Mr. Rogers Science Fair Information

Check out other web sites created by Mr. R:

Check out Articles by Mr. Rogers:

Insultingly Stupid Movie Physics is one of the most humorous, entertaining, and readable physics books available, yet is filled with all kinds of useful content and clear explanations for high school, 1st semester college physics students, and film buffs.

It explains all 3 of Newton's laws, the 1st and 2nd laws of thermodynamics, momentum, energy, gravity, circular motion and a host of other topics all through the lens of Hollywood movies using Star Trek and numerous other films.

If you want to learn how to think physics and have a lot of fun in the process, this is the book for you!

 First the web site, now the book!

Mr. Rogers Home | Common Sylabus | AP Comp Sci I | AP Comp Sci II | AP Physics Mech | AP Physics E&M | AP Statistics | Honors Physics|IB Design Tech | Southside

[ Intuitor Home | Physics | Movie Physics | Chess | Forchess | Hex | Intuitor Store |