Computer Science 126 |
2/5 | Hello, world | |
2/5 | C | |
2/8 | Functions | |
2/12 | Unix | |
2/12 | Structures | |
2/15 | Arrays | |
2/19 | Linked Lists | |
2/22 | ADTs | |
2/26 | Algorithms | |
3/5 | Boolean Logic | |
3/5 | Numbers | |
3/22 | Architecture | |
3/22 | PostScript | |
3/22 | Recursion | |
3/26 | TOY | |
4/2 | FSAs/REs | |
4/5 | Strings | |
4/9 | Formal Languages | |
4/19 | BSTs | |
4/23 | Java | |
4/30 | Miscellaneous | |
Any changes or corrections to the exercises will be noted in the course announcements. You are responsible for the information in the (most up to date) electronic versions. Feel free to look ahead at any future exercises that appear online, but those are subject to change.
Another good way to prepare for an exam is to answer old exam questions. The course packet includes some of these. Here are detailed solutions to some of the problems. You will benefit much more by attempting the problems first, then checking the solutions.