Foundations of Computer Science
CourseDevelopment pages under development
Info below is for the Fall 2004 course (Olin ENGR 3520, Fall 2004). Welcome!
Contents
Current Notes and Assignments
See also CourseCalendar. These links should percolate down to their respective sections when they are no longer current.
Final exam is available now online at http://focs.olin.edu/documents/focs-exam-3.pdf
- in spite of a typo, it's a three hour exam (with the usual caveats about timing not being strict)
- you may take it during the designated final exam period Friday 1-4 in AC318 or elsewhere/elsewhen
- Please contact me if you have any questions, concerns, unclearness, .... I will be on campus Weds and Fri and working from home on Thurs; use IM or email anywhereor cell on campus and home phone eves/Thurs.
WhatYouShouldKnow -- a running count, plus resources
WrittenAssignment6: due Friday 12/10 3pm on paper at AC312 (apologies for early deadline)
ProjectAssignment5: due end of semester
Lecture - Friday NotesDecember10
Lecture - Tuesday NotesDecember7
Project: Tuesday NotesNovember30Proj
Bazaar
AskQuestions - use this page to ask questions about lectures and/or assignments, or post cool solutions to problems you encounter.
ReadingRoom - growing steadily. There are many special topics subpages and this includes textbook page references. Help us develop, PLEASE!
AlgorithmAnimations - Film screening fun!
Here is the python continuation discussion and here is the python validator for propositional logic. You can ignore these links, and they belong somewhere else, but I am putting them here rather than nowhere at all. Someone can move them to today's notes or a ReadingRoom entry.
All Notes
Please SignUpToTakeNotes on a certain day, and post a page with your notes here. If they are for today's lecture they should also go up with the Current stuff at the top of the page.
Lecture 1 - Friday NotesSeptember3 (scheme, abstract data types(ADTs))
Lecture 2 - Tuesday NotesSeptember7 (scheme, ADTs-stacks, big-O notation)
- Project Lecture 1 - NotesSeptember7Proj (htmlprag, webcrawler assmt)
Lecture 3 - Friday NotesSeptember10 (queue, tail recursion, order-of-growth)
Lecture 4 - Tuesday NotesSeptember14
- Project Lecture 2 - NotesSeptember14Proj
Lecture 5 - Friday - NotesSeptember17
Lecture 6 - Tuesday: NotesSeptember21
Project Lecture 3: NotesSeptember21Proj
Lecture 7 - Friday NotesSeptember24 (finite state automata)
Lecture 8 - Tuesday NotesSeptember28 (FSAs and regular expressions)
Project Lecture 4: NotesSeptember28Proj
- a more exhaustive but less descriptive list:
- === Individual Notes Collection ===
All Assignments
- Written/Vanilla FoCS
WrittenAssignment1 due, done
WrittenAssignment2: due Tuesday 9/28
WrittenAssignment3: due Friday 10/22
WrittenAssignment4: due Tuesday 11/2
WrittenAssignment5: due Tuesday 11/30
WrittenAssignment6: due Friday 12/10 at 3pm
- Project
ProjectAssignment1 due, done
ProjectAssignment1.5 due Tuesday 9/21: crawler plus some html tree hacking
ProjectAssignment2 due 12 October
ProjectAssignment3 due 26 October
ProjectAssignment4 due 9 November
ProjectAssignment5 due end of semester
- Exams
Exam2 You may take this at any time before 5pm Tuesday 16 November. The class session on Friday 12 November will be available for taking the exam.
More Course Resources
- === What's the plan? ===
Syllabus-like things: EmergingSyllabus, CourseTopics, CourseCalendar (last most up to date but least descriptive)
Front page from summer course development work: CourseDevFrontPage
ReadingRoom (increasingly well populated, includes Online resources, subpages for specific topics)
An older, less organized and less triaged page of online resources: CourseLinks
Textbooks: TextbookPolicy, CourseTextbooks, Topics2Textbooks
- Emails from Lynn pre-mailing-list
http://lemming.research.olin.edu/clicker (internal only)
²ÊÐÅ Êé¿â ÍøÂçµçÊÓ ´úÀí·þÎñÆ÷ ×ÀÃæ±ÚÖ½ Éú»î°Ù¿Æ ½»ÓÑ ÓÎÏ· µçÓ° bt flash Ц»° Èí¼þ qq Íâ¹Ò ×ÔÖúÁ´½Ó ¹ã¸æÁªÃË . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .¡¡ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .¡¡ . . . . . . . . . . . . . . . . . . . . . . . . .¡¡ . . . . . . . . .¡¡ . . . . . . . . .¡¡ . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .