Overview
This week we will dive deeper into algorithm analysis as introduced last week in student presentations.
Thursday and Friday, February 12th and 13th
Classwork / Homework / Evaluation
During our early-release Wednesday some of our better students in our 3B section (the ones who weren't playing games instead, making their teacher feel that he was a failure as an educator) looked into the best resources we could find without charge to use for our study of data structures and algorithms using C.
The resource we settled on is one I've used before, which both I and the students who used it liked very much, Data Structures Using C by Reema Thareja. The book uses a Windows version of ANSI C, so we'll need to make changes to get sample code to compile on our K&R C compiler, but that's part of the fun. The algorithms are well explained and nice illustrated.
Toby pointed out that the Wikipedia page for conio.h will prove useful to us in translating examples from the text to our environment.
Assigned Tasks
Everyone will read sections 8.1 to 8.4.3 in Chapter 8: Queues on pages 254 to 272.
The following pairs of you will then rework the example code from the text so that it compiles and runs with BDSC in our CP/M environment:
Period 1A
- 8.2: Array Representation of Queues: Rockwell and Sean
- 8.3: Linked Representation of Queues: Eleanor and Alex
- 8.4.1: Circular Queues and 8.4.2: Deques: Abi and Gabriel
- 8.4.3: Priority Queues: Brendan and Nikita
Period 3B
- 8.2: Array Representation of Queues: Donovan and Anupama (and Josh)
- 8.3: Linked Representation of Queues: Noah and Dylan
- 8.4.1: Circular Queues: Alessandra and Toby
- 8.4.2: Deques: Blu and Conrad
- 8.4.3: Priority Queues: Jake and Gabriel
To earn an A for this assignment you need to come to our next class ready to share running code compiled with BDS C together with a clear explaination of what it is doing and why.
Monday and Tuesday, February 9th and 10th
Classwork / Homework / Evaluation
We'll begin class with the promised short quiz.
After that you should read Section 2.2: What Is Algorithm Analysis? in Problem Solving with Algorithms and Data Structures on pages 44 to 51, trying the examples and answering the questions at the end of the section.
All of this should be considered fair game
for a future quiz.