WORK SCHEDULE FOR CS 3100 -- Fall 2015

• ♥ First day of class is Monday, August 24. Class meets in P-101.
  
  
• Reading Assignment:
  • Carefully read the course description this week.
  • Read this schedule (this document)
  • Read most of Appendix A in the first two weeks of class.
  • If you know Java, but not C++, also read Appendix K. You may want to go back and forth between reading Appendices A and K.
  • If you know Python, but not Java or C++, do as above, except read Appendix L instead of Appendix K.
  • Review the use of unix computers. Use your unix book if you have one. If you don't have one, get one.
  • Read Carrano: sections 5.1 and 5.2 in chapter 05 (Recursion as a Problem-Solving Technique)
  
  
• Note: There may be confusing errors in Carrano. Throughout the semester, while reading be sure to check the errata sheet Carrano has posted.
  
  
• Lecture Topics:
  • Sections 5.1 and 5.2
  
  
• If you like, you can print copies of the document you are reading now (the course schedule) and the course description.
  
  If you need a computer account, or help with your username or password, please fill out and submit one of the account service forms. After you fill out the form you can submit it electronically by clicking on "Send Data" at the bottom, or you can print it and give it to me during the first week of class.
  
  
• We will go to the CS Lab and perform the "Hello World" tutorial soon, at a time to be announced soon.

• Reading Assignment:
  • Read Carrano: sections 5.3 and 5.4 in chapter 05 (Recursion as a Problem-Solving Technique)
  • Read Carrano: section 10.1 in chapter 10 (Algorithm Efficiency)
  
  
• Lecture Topics:
  • Program #01: (I strongly advise you to finish it THIS WEEK.)
  • Sections 5.3, 5.4, and 10.1

• ♥ NO CLASS on Monday, September 7 - Labor Day
  
  
• Reading Assignment:
  • Read Carrano: section 10.2 in chapter 10 (Algorithm Efficiency)
  • Read Carrano: section 11.1 in chapter 11 (Sorting Algorithms and Their Efficiency)
  
  
• Lecture Topics:
  • Chapter 10 (Algorithm Efficiency)
  
  
• DUE this week: Program #01: (Title: Expression Checker).
  ☘ Due date is Wednesday, September 9.

• Reading Assignment:
  • Read Carrano: sections 11.2, and 11.3 in chapter 11 (Sorting Algorithms and Their Efficiency)
  
  
• Lecture Topics:
  • Algorithm Efficiency and Sorting

• Reading Assignment:
  • Read Carrano: starting on page 333, sections C4.1, C4.2, and C4.3 in C++ Interlude 4 (Class Relationships and Reuse)
  
  
• Lecture Topics:
  • Work on Program #02
  • Advance Sorts
  • Class Relationships and Reuse
  
  

• Reading Assignment:
  • Read Carrano: sections 15.1, 15.2, and 15.3 in chapter 15 (Trees)
  
  
• Lecture Topics:
  
  
• QUIZ #1 on the following sections in Carrano: 5.1, 5.2, 5.3, 5.4, 10.1, 10.2, 11.1, 11.2, and 11.3.
  
  • ☘ Class takes the quiz on Monday, September 28.
  • Bring a Scantron 882-E form and a #2 pencil with you. The 882-E forms are sold in the bookstore.
  
  
• DUE this week: Program #02: (Title: Comparing Sorting Algorithms).
  ☘ Due date is Wednesday, September 30.

• Reading Assignment:
  • Read Carrano: sections 16.1 and 16.2 in chapter 16 (Tree Implementations)
  
  
• Lecture Topics:
  • C++ Programming Issues
  • Binary Trees
  
  

• ♥ No class on Tuesday, October 13 - Non-instructional Day
  
  
• Reading Assignment:
  • Read Carrano: sections 16.3, 16.4, and 16.5 in chapter 16 (Tree Implementations)
  
  
• Lecture Topics:

• Reading Assignment:
  • Read Carrano: section 16.6 in chapter 16 (Tree Implementations)
  • Read Carrano: sections 17.1, 17.2, and 17.3 in chapter 17 (Heaps)
  
  
• Lecture Topics:
  
  
• DUE this week: Initial (level two) work on Program #03: (Title: America's Most Wanted).
  ☘ Due date is Monday, October 19.

• Reading Assignment:
  • Read Carrano: section 17.4 in chapter 17 (Heaps)
  • Read Carrano: sections 18.1 and 18.2 in chapter 18 (Dictionaries and Their Implementations)
  
  
• Lecture Topics:
• DUE this week: Final version of Program #03: (Title: America's Most Wanted).
  ☘ Due date is Wednesday, October 28.

• Reading Assignment:
  • Read Carrano: sections 18.3 and 18.4 in chapter 18 (Dictionaries and Their Implementations)
  
  
• Lecture Topics:
  
  
• DUE this week: Initial version of Program #04: (Title: Simulated Disk Scheduler).
  ☘ Due date is Wednesday, November 4.

• ♥ No class on Wednesday, November 11 - Veteran's Day
  
  
• Reading Assignment:
  • Read Carrano: sections 19.1 and 19.2 in chapter 19 (Balanced Search Trees)
  
  
• Lecture Topics:
  
  
• QUIZ #2 on the following sections in Carrano: 15.1-15.3, 16.1-16.6, 17.1-17.4, 18.1-18.4
  
  • ☘ Class takes the quiz on Monday, November 9.
  • Bring a Scantron 882-E form and a #2 pencil with you. The 882-E forms are sold in the bookstore.

• Reading Assignment:
  • Read Carrano: sections 19.3 and 19.4 in chapter 19 (Balanced Search Trees)
  
  
• Lecture Topics:
  
  
• DUE this week: Final version of Program #04: (Title: Simulated Disk Scheduler).
  ☘ Due date is Monday, November 16.

• ♥ No class on Thursday-Friday, November 26-27 - Thanksgiving
  
  
• Reading Assignment:
  • Read Carrano: section 19.5 in chapter 19 (Balanced Search Trees)
  • Read Carrano: sections 20.1, 20.2 and 20.3 in chapter 20 (Graphs)
  
  
• Lecture Topics:

• Reading Assignment:
  • Read Carrano: section 20.4 in chapter 20 (Graphs)
  
  
• Lecture Topics:
  
  
• DUE this week: Initial version of Program #05: (Title: Hashing Social Security Numbers).
  ☘ Due date is Monday, November 30.

• ♥ No class on Friday, December 11 - Reading Day
  
  
• Reading Assignment:
  • Catch Up!!
  
  
• Lecture Topics:
  
  
• DUE this week: Final version of Program #05: (Title: Hashing Social Security Numbers).
  ☘ Due date is Wednesday, December 9.