All readings are from the subject notes:Here Unless otherwise stated, the links below are linked to the start of the chapter of notes you should be reading. The reading is up to the end of the chapter of notes, not just the intro page.
Topics and Reading | Labs |
---|---|
Introduction, Intro to Python and LaTex | Lab 0 |
Efficient Algorithms and Time Complexity Analysis | Lab 1 |
Recursion, Searching, and Sorting | Lab 2 |
Searching and Sorting, Lists, | lab 3 |
Lists,Stacks, and Queues | Lab 4 |
Heaps, Heapsort | Lab 5 |
Binary search trees | Lab 6 |
Labs are short programming, analysis, or long answer problems. Labs are meant to reinforce ideas and concepts covered. They typically should not require more than two to four hours of work each. There are 6 labs. If there are significant errors and or missing components but the bulk of it is done, a test verification is a MINIMUM requirement for any consideration . For analysis questions, most of your answers must be correct. The key is that you have tried to do it. Even if it is not correct, we are willing to help guide you through it. However, if you don't show your work, and there are simply random formulas that do not show your process.