Computer Science 3 H M

Unit 1: Object Oriented Programming (3 weeks)

• Class structure*

• Inheritance*

• Instantiating objects*

• Writing/using methods*

• Accessor/Return Types*

• Selection Statements*

• Ternary Operators

• Debugging Strategies*

• Math/String Class*

• Interface

• UML Diagrams*

• Big O Analysis

Unit 2: iteration & More (3 weeks)

• documentation

• pre/post conditions

• assertions

• while loops*

• for loops*

• do-while loops

• for each loops

• switch

• Try, catch, Finally

• break/continue

Unit 3: Arrays (3 weeks)

• declaration / initialization*

• traversal*

• accessing, changing elements*

• algorithms*

• 2D Declaration / initialization*

• 2D traversal/algorithms*

• ragged arrays

*Indicates prior exposure to topic

Unit 4: Searches & Sorts (3 weeks)

• linear search

• binary search

• insertion sort

• selection sort

• merge sort

• quick sort

• bubble sort

• heap sort

• Big O analysis

Unit 5: ArrayList (2 weeks)

• declaration / initialization*

• traversal*

• add(), remove(), set(), get()*

• size(), clear(), contains()

• Big O analysis

Unit 6: Linked List (4 weeks)

• declaration / initialization

• traversal

• add(), remove(), set(), get()

• size(), push(), pop(), peek()

• Unordered single

• ordered single

• double

• circular linked

Fall CCA

Unit 7: Stacks & Queues (3 weeks)

• declaration / initialization

• traversal

• push(), pop(), peek(), empty()

• size(), push(), pop(), peek()

• LIFO/FIFO

• priority queue

• Infix / prefix / postfix math expressions

Unit 8: Sets (3 weeks)

• declaration / initialization

• traversal

• hash set

• tree set

• duplicates

• lexicographical order

Unit 9: Maps (3 weeks)

• declaration / initialization

• traversal

• hash map

• hash tree

• duplicates

• lexicographical order

Unit 10: Trees, Heaps & Recursion (6 weeks)

• trees- root, nodes, leaf

• balanced tree

• full tree

• complete tree

• unbalanced tree

• traversal (in-order, pre-order, post-order, level order)

• min-heap, max-heap

• binary tree

• Recursion base case/recursive case*recursion tracing*

• recursion writing*

Unit 11: Programs & Scripts (2.5 weeks)

• bitwise operators

• low-level language assembly

• low-level programs

• operating system scripts

Spring CCA

Required Project:

Towers of Hanoi

Library Stack

Grocery Store Queue

Emergency Room Queue

Required Project: 

Vocabulary Test

Required Project:

Magazine Lists

Required Project:

Evaluate Arithmetic Expressions using a Binary Tree

Program written in several languages

Cycle 1:

-Professionalism

-Teamwork

-Problem Solving

127.15 (2)(A)

127.15 (2)(B)

127.15 (2)(C)

127.15 (2)(D)

127.15 (2)(E)

127.15 (2)(F)

127.15 (2)(G)

127.15 (2)(H)

127.15 (2)(I)

127.15 (2)(J)

127.15 (2)(L)

Cycle 2:

- Job Seeking Skills

127.15 (2)(A)

127.15 (2)(H)

127.15 (2)(I)

127.15 (2)(J)

127.15 (2)(K)

127.15 (2)(L)

Cycle 3:

-Communication Skills

-Self Management Skill

127.15 (2)(A)

127.15 (2)(B)

127.15 (2)(C)

127.15 (2)(D)

127.15 (2)(E)

127.15 (2)(F)

127.15 (2)(G)

127.15 (2)(H)

127.15 (2)(I)

127.15 (2)(J)

127.15 (2)(L)

Cycle 4:

-Civic and Social Responsibility

127.15 (2)(F)

127.15 (2)(G)

127.15 (2)(H)

127.15 (2)(I)

127.15 (2)(L)