Weekly schedule for COP 3502 Summer 2002

Week of
Reading Assignment
(in Shackleford)
Lecture Topic
and Assignments
Recitation Topic
and Quizzes
5/8
Read Chapter 1 Introduction & Chapter 1 No labs this week
5/13-5/15
Read Chapters 2 & 3 Basic Algorithmic Design
Introdution, binary number system,
binary/decimal conversion, log 2n
5/20-5/22
Read Sections 5.11, 5.13, 5.14, 5.15 Logic, conditional expressions,
iterative control & arrays
Assignment #1 posted 5/20
Introdution, binary number system, binary/decimal conversion, log 2n
Help with Assignment #1
5/27-5/29
Read sections 5.2, 5.3, 5.4 No class Monday - Memorial Day
Data variables and types
Records
Assignment #1 Due 5/29
6/3-6/5
Exam covers chapters 2 & 3
and sections 5.2-5.4, 5.11, 5-13-5.15
Monday: finish material and Wednesday reveiw
chapters 2, 3 & parts of 5, lab topics & class notes
Summations
Quiz #1: Binary numbers & logarithms
6/10-6/12
Read chapter 4Functions & procedures
parameters and recursion
Assignment # 2 posted 6/10
Monday 6/10: EXAM #1
Summations
Review: binary numbers, summations, and control structures
including: if-then-else, loops, arrays and records
6/17-6/19
Read the rest of chapter 5:
sections 5.5 through 5.10,
also read section 6.1
recursion, pointers,
dynamic structures: linked lists and trees
tracing code with recursion, pointers
Quiz #2: Writing and Tracing functions
6/24-6/26
Continue from Chapter 5, Section 6.1 and notes Assignment #2 due in class Wednesday 26th
Dynamic structures: trees, stacks, queues;
their traversal and modification
Assignment #3 posted 6/27
Linked lists, trees,
stacks, queues
Quiz #3: tracing recursion
7/1-7/3
Exam covers Chapter 4, 5.5-5.10,
Section 6.1, class notes, lab topics and examples
Continue with dynamic structuresMore on summations
Quiz #4 - Arrays, records, and pointers
Help with Assignment #3
7/8-7/10
Finish Chapter 6 material
Read Chapter 9
Monday 7/3:EXAM #2
Algorithmic Performance

Assignment #3 due 7/10
Order notation
Assignment #3 Due 7/15 in class
7/15-7/17
Read Chapters 7, 8, 10 & 11
(They're all short!)
Monday: Objects & verifying correctness
Wednesday: Parallelism and Concurrency &
Very Complex Problems
Using Order notation to estimate execution time
Quiz #5: order notation and stacks Order notation
7/22-7/24
Final exam covers:
All class notes on web page
and all lab notes
Monday: finish everything
Wednesday: Reivew
Review for exam
Quiz #6: Traversal Algorithms and Binary Search Trees Estimating execution time
7/29
Final Exam Monday 7/29:
Final Exam

No Labs - term ends

Check this schedule each week for updates and corrections.


Last updated: 7/17/2002
Return to COP 3502 home page