Calendar#

Note

Please note that this is a tentative plan and is subject to change.


#

TOPIC

READING

MEETING 1

MEETING 2

WRITTEN ASSIGNMENT

PROGRAMMING ASSIGNMENT

1

Introduction

GGT (Chapter 3)

Introduction

Analysis

WA.1.

PA.1.

2

Analysis

GGT (Chapter 3)

Time Complexity

Space Complexity

PA.2.

3

Brute Force +
Decrease & Conquer

GGT (Chapter 12)

Brute Force
+
Binary Search

Insertion Sort +
Selection Sort

WA.2.

PA 3.1.
PA 3.2

4

Divide & Conquer

GGT (Chapter 12)

Merge Sort

Quick Sort

Practice Exam 1
EXAM 1


#

TOPIC

READING

MEETING 1

MEETING 2

WRITTEN ASSIGNMENT

PROGRAMMING ASSIGNMENT

5

Recursion

GGT
(Ch. 4)

Recursion

Linear Recursion

WA.3.

PA 4

6

Recursion

GGT
(Ch. 4)

Branch Recursion

More Recursion

PA 5

Practice Exam 2
EXAM 2


#

TOPIC

READING

MEETING 1

MEETING 2

WRITTEN ASSIGNMENT

PROGRAMMING ASSIGNMENT

9

Object Oriented Programming 1

GGT (Chapter 2)

OOP

Built-in Data Types

PA 6

10

Object Oriented Programming 2

GGT (Chapter 2)

User-defined Types

Extending Types

WA.4

PA 7

12

Stacks and Queues

GGT (Chapter 6)

Stacks

Queues

PA 8

13

Linked Lists

GGT (Chapter 7)

Singly Linked Lists

Doubly Linked Lists &
Circular Linked Lists

PA 9

14

Miscellaneous

GGT (Chapter
5 & 1)

Arrays

Files & Modules

PA 10

FINAL EXAM