When last they met we had given the following pairs in our 1A section resposibilities for presenting on the following topics:

• Nikita and Sean: Address Arithmetic
• Abi and Rockwell: Storage Allocator
• Brendan, Gabriel C. and Liam: alloc
• Eleanor and Alex: Page 177 exercises

They will share these presenations in class on Wednesday.

We will cancel the quiz mentioned on 1/23 to make up for lost time. Instead, the following topics will be assigned to the following pairs in our 3B section, to be shared with everyone after they are presented on Thursday:

• Alessandra and Gabriel: What is a data structure? Provide a solid definition along with several compelling examples, at least some of which should come from our study together in class.
• Donovan and Anupama: Define algorithm. What do we mean by analysis of algorithms? Define analyize in our context. What about alogirthms needs to be analyzed?
• Dylan and Jake: What is Big O notation? Give a formal mathematical definition of it. Why is it used to analyze algorithms? What problems does it solve?
• Noah and Conrad: Discuss of the orders of common functions that we will encounter in our study of algorithms. Tell us the common names used for them and give us examples of each. Provide us with an easy to follow tabular summary of this information.
• Blu and Toby: Investigate the CDB debugger described on pages 109 to 122 of the BDS C User's Guide. Can you find the source code for this debugger and get it to work on our Altair 8800 platform running CP/M?

Take notes during the presentations and study them. Be prepared for a quiz on what you learn during the following class.