Here are a set of exercises that you may want to attempt before class Monday and discussion Mon/Tues.
Notation is ChapterNumber.{list of exercise numbers}
We plan to go over these as a review before the exam. Many are pretty straightforward and just help you review the various data structures/algorithms/analysis, but there are a few that are a bit more challenging and require some creativity. I recommend you read over them all, knock out the easy ones, then take some time on the harder ones.
- 2.{5,8,9,10,11}
- 3.{28,53,54,61}
- 4.{12,13,21,36,37,41}
- 5.{5,28,49,61,62,66}
- 6.{ 1,11,12,14, 15,18, 20,21,22, 26,27, 33,35, 59,60, 75,76}
- 7.{1,4,8,11,34,40}
- 8.{9,12,13,14,24}
- 9.{ 1,2,17,18,21,22, 54,56,57,58,60}
- Exam 1 on Wed. 2/25 covering lectures, discussions, and Chapters 1-10.
is available, due Feb. 23.
- Read Ch. 9 for Wed., Ch. 10 for Fri.
- Project 1b description
is available, due Feb. 23.
- Read Ch. 8
- Read Ch. 7
- Read Ch. 6
- Read Ch. 5
- Read Chapter 4, and brush up on generic programming (see LLM)
- The Project 1a description has been tweaked to remind you
that your implementation must be efficient, and to change
the print_queue() method to a less messy interface that
gets a single string that contains all the items in the
deque (which can then be printed to cout as before).
- Sorting
- Example Test Cases spreadsheet
is available as a suggested format for describing test cases.
You may wish to add information on code or functionality coverage
as well, along with version tested and date.
- Project 1a description
is available, due Feb. 11. Second part will be due Feb. 19.
- Read Chapter 4, and brush up on generic programming (see LLM)
-
Project 1 Draft
-
The Gnu Make Manual with lots of info on Makefiles and make
-
Tutorial on make you may find easier to digest
-
Gilpin's Tutorial on gdb you may find useful
-
UMd tutorial slides on gdb you may also find useful
- New TA office hours (see above)