Representation, analysis, techniques, and principles for manipulation of basic combinatoric data structures used in computer science. Rigorous reasoning is emphasized. (Counts as a CS Background Course for the concentration.)
Lectures: CAS 226 Tue,Thu 12:30pm 2:00pm
Lab MCS B33 Mon 10:00am 11:00am
Lab CAS 208 Mon 4:00pm 5:00pm
I expect you to come to lectures (on time!) and I encourage you to participate.
There is no perfect textbook for the class, and lectures are your important source of information. Be sure to take good notes.
email: itkis+cs113 cs bu edu
office hours: Tuesday 10:30-11:30am, Thursday 2-4pm (or by appointment)
office : MCS-284
TF: Scott Russell
e-mail: srussell cs bu edu
office hours: Monday 2-3:30pm, Wednesday 3:30-5:00pm
phone: (617) 358-2359 (no voicemail!)
office: PSY (64 Cummington St.) room 223.
Notes for MIT's CS 6.042 course, by Eric Lehman and Tom Leighton, 2004
- Our text is based on notes for MIT course 6.042 - you can view its last semester's page and/or courseware from previous years
- CMU has a very nice course, from which I also plan to borrow: Great Theoretical Ideas in Computer Science
- Also, I highly recommend Computer Science Unplugged (browse the site, esp its available section). This material is suitable even for children, do not be put off by this, rather try it on your younger siblings (or non-CS friends) - there is no better way to understand any material than trying to teach it to others.
The class home page: http://www.cs.bu.edu/~itkis/113.
I will send some announcements by email to the class list. Please sign up by following instructions at "Mailing List" link on the left. I encourage you to ask questions and discuss the relevant subjects on this mailing list (both me and TF will monitor the list and provide the answers/corrections).