Week |
|||
1 |
Welcome! |
Homework 1 (due Weds, 24 Jan): Read pages 12-28 of CALectureWeek1.pdf Computer architecture Read pages 21-33 of rs-02.pdf CPU Architecture and the Fetch-Execute Cycle Read pages 12-18 of vN.pdf Von Neumann Computers Read pp. 3-33 of Weiss. Play around with Java Start thinking about Program 1 due Tues 30 Jan at midnight. |
Homework 2 (due Fri, 26 Jan): Read pp. 33-59 of Weiss. Work on Program 1 due Tues 30 Jan at midnight. |
2 |
Homework 3 (due Mon, 29 Jan): Read pp. 63-87 of Weiss. Work on Program 1 due Tues 30 Jan at midnight |
Homework 4 (due Weds, 31 Jan): Read pages 93-108 of Weiss Read pages 163-186 of Weiss Play around with Java Start thinking about Program 2 due Tues 6 Feb |
Homework 5 (due Fri 2 Feb): Start working on Program 2 due Tues 6 Feb at midnight Read pages 109-128 of Weiss Skim pages 201-218 of Weiss |
3 |
Homework 6 (due Mon, 5 Feb): Read pp. 129-149 of Weiss. Work on Program 2 due Tues 6 Feb at midnight |
Homework 7 (due Weds, 7 Feb): Read pages 187-190 of Weiss Read pages 201-218 of Weiss Play around with Java Start thinking about Program 3 due Tues 13 Feb |
Homework 8 (due Fri 9 Feb): Start working on Program 3 due Tues 13 Feb at midnight Read pages 218-228 of Weiss Skim pages 343-349 of Weiss |
4 |
Homework 9 (due Mon, 12 Feb): Read pp. 251-266, 303-316 of Weiss. Work on Program 3 due Tues 13 Feb at midnight |
Homework 10 (due Weds, 14 Feb): Read pages 316-331 of Weiss |
Homework 11 (due Fri 16 Feb): Start working on Program 4 due Tues 20 Feb at midnight Read pages 218-228 of Weiss Skim pages 343-349 of Weiss |
5 |
Homework 12 (due Mon, 19 Feb): Work on Program 4 due Tues 20 Feb at midnight |
Homework 13 (due Weds, 21 Feb): Reread pages Chapters 4 and 5 of Weiss It should make sense now. |
Homework 14 (due Fri 23 Feb): Start working on Program 5 due Tues 27 Feb at midnight Read chapter 6 of Weiss Review pp. 251-266 of Weiss Read pp. 266-286 of Weiss Review chapter 8 of Weiss |
6 |
Homework 15 (due Mon, 26 Feb): Work on Program 5 due Tues 27 Feb at midnight Catch up on reading. |
Homework 16 (due Weds, 28 Feb): Read chapter 18 and pp.629-648 of Weiss |
Homework 17 (due Fri 2 Mar): Start working on Program 6 due Fri 9 Mar at midnight Catch up on reading. |
7 |
Homework 18 (due Mon, 5 Mar): Work on Program 6 due Fri 9 Mar at midnight Review the code in /home/cfk/pub/cs35/week6/wordfreq and /home/cfk/pub/cs35/week6/bst/trybst2. |
Homework 19 (due Weds, 7 Mar): Start to study for in-class test (on Wed 21 Mar) on what we will have covered by then. Make sure you know basic definitions and operations for linked lists, stacks, queues, trees, BSTs (sections 6.5.2, 6.6, 18.1.1, 18.2. Be familiar with algorithm analysis (chapter 5) and several sorts (chapter 8). Work on Program 6 due Fri 9 Mar at midnight |
Homework 20 (due Fri 9 Mar): Review chapters 5,7,8,16,17,18,19.1-19.3 of Weiss Work on Program 6 due Fri 9 Mar at midnight |
8 |
Homework 21 (due Mon, 19 Mar): Review chapters 5,7,8,16,17,18,19.1-19.3 of Weiss Study for in-class test (on Wed 21 Mar) on what we will have covered by then. Make sure you know basic definitions and operations for linked lists, stacks, queues, trees, BSTs (sections 6.5.2, 6.6, 18.1.1, 18.2. Be familiar with algorithm analysis (chapter 5) and several sorts (chapter 8). |
Homework 22 (due Weds, 21 Mar): Study for in-class test (on Wed 21 Mar) on what we have covered. Make sure you know basic definitions and operations for linked lists, stacks, queues, trees, BSTs (sections 6.5.2, 6.6, 18.1.1, 18.2. Be familiar with algorithm analysis (chapter 5) and several sorts (chapter 8). |
Homework 23 (due Fri 23 Mar): Work on take home midterm due Tues 27 Mar at midnight (NO LATES). To be made available on 23 March. |
9 |
Homework 24 (due Mon, 26 Mar): Work on take home midterm due Tues 27 Mar at midnight (NO LATES). |
Homework 25 (due Weds, 28 Mar): Read 19.4 of Weiss Skim 19.8 Read 21.1-21.5 |
Homework 26 (due Fri 30 Mar): Review 21.1-21.5 of Weiss Read 20.1-20.5 of Weiss Reread chapter 6 of Weiss Work on Program 8 due Tu 3 Apr at midnight |
10 |
Homework 27 (due Mon, 2 Apr): Read pp. 471-479 of Weiss Review 20.1-20.5 of Weiss Work on Program 8 due Tu 3 Apr at midnight |
Homework 28 (due Weds, 4 Apr): Read pp. 479-494 of Weiss |
Homework 29 (due Fri 6 Apr): Review pp 471-494 of Weiss Work on Program 9 due Tu 10 Apr at midnight |
11 |
Homework 30 (due Mon, 9 Apr): Read all of chapter 20 of Weiss Work on Program 9 due Tu 10 Apr at midnight |
Homework 31 (due Weds, 11 Apr): TBA |
Homework 32 (due Fri 13 Apr): Review pp 471-494 of Weiss Read Probability through expected value Start to think about the Final Project due F 11 May at noon Note there will be other shorter assignments in the interim. |
12 |
Homework 33 (due Mon, 16 Apr): Review chapter 8 of Weiss Pay particular attention to pp. 332-335 Continue to think about the Final Project due F 11 May at noon |
Homework 34 (due Weds, 18 Apr): Review pp. 471-496 of Weiss Pay particular attention to pp. 490-496 |
Homework 35 (due Fri 20 Apr): Review pp 471-494 of Weiss Read Appendix B of Weiss Start working on the Final Project due F 11 May at noon One more programming assignment is coming that will be due at midnight on 1 May. |
13 |
Homework 36 (due Mon, 23 Apr): Review Appendix B of Weiss Work on Program 10 due Tu 1 May at midnight Continue to think about the Final Project due F 11 May at noon |
Homework 37 (due Weds, 25 Apr): Review pp. 471-496 of Weiss Pay particular attention to pp. 490-496 Work on Program 10 due Tu 1 May at midnight Continue to think about the Final Project due F 11 May at noon |
Homework 38 (due Fri 27 Apr): Read Probability through expected value Work on Program 10 due Tu 1 May at midnight Continue to think about the Final Project due F 11 May at noon Work on the Final Project due F 11 May at noon Remember that the final exam is 14 May. 9:00am - 12:00n in SciCtr 240 (the CS lab where we usually meet). |
14 |
Homework 39 (due Mon, 30 Apr): Review Probability through expected value Review pp 316-329 of Weiss. Work on Program 10 due Tu 1 May at midnight Continue to think about the Final Project due F 11 May at noon |
Homework 40 (due Weds, 2 May): Read Optimal binary search trees Work on the Final Project due F 11 May at noon Remember to work in small increments and test often. |
Homework 41 (due Fri 4 May): Read Algorithm Design Read pp 277-296 of Weiss Keep working on the Final Project due F 11 May at noon Remember to work in small increments and test often. Study for the comprehensive final exam that is on 14 May. 9:00am - 12:00n in SciCtr 240 (the CS lab where we usually meet). Have a nice summer! |