The first lecture provides details about C structures. It also introduces less used control structures: break and continue.

The second lecture explores arrays more deeply. It introduces sorting. Sorting is conceptually simple, but complicated to implement. If you can sort an array, you understand how arrays work.

The third lecture introduces databases: collections of data. It describes the four basic operations in a database: create, retrieve, update, and delete, which are oftern refered to by the acronym CRUD.

The tutorial this week covers lectures for this week. It provides questions on structures, database operations and sorting.

In the lab this week you will begin working on arithemetic. To do this, you will first need to enter integers on which to operate.

You will demo the functions you wrote for last week that allow you to enter commands and execute them.

This is the backlog for this week. You will begin work on stories 6-11. Not that you can start with story 8 before completeing story 7. Story 7 is the most difficult, so you may want to work on stories 8-11 before going back to complete story 7.

In addition, you will be demonstrating your code for stories 1-5. You teacher will ask you to make the file and run the tests. She will also ask to see your code as she will be assigning marks for correct formatting.