MWF 10:30-11:20am, RTBA
Introduction to the concepts, techniques, and applications of computer science. Topics include computer systems (the design of computers and their languages); theoretical foundations of computing (computability, complexity, algorithm design); and artificial intelligence (the organization of knowledge and its representation for efficient search). Examples stress the importance of different problem-solving methods.
The Racket Guide. A description of Racket for people with previous programming experience.
Optional: How To Design Programs (online copy). (buy from Amazon) An introduction to programming using Racket written by the inventors of racket. It assumes no programming background.
The course requirements consist of class attendance, (more-or-less) weekly programming assignments in Racket and occasional written homework, and two EVENING MIDTERMS and a FINAL EXAM. Plan on spending between 6-8 hours per week on the course outside of class. The programming assignments are an integral part of the course.
Please try not to leave the homework to the last minute. You will be more efficient, learn more, have more chance to get help, and generally be calmer and happier if you do the associated reading first and start the programming or other problems early.
The final grade in the course will be based on class participation, your performance on the programming assignments and other homework, and the exams. The weighting of these components will be approximately 40% on homework and 60% on exams.
Late work without a Dean's excuse will be assessed a penalty of 5 points per day, based on the day and time recorded by the Zoo electronic submit program. At the end of term, up to 25 points will be deducted from the total lateness penalties your homework has accrued. However, according to Yale College regulations, *no* homework can be accepted after the end of Reading Week without a Temporary Incomplete (TI) authorized by your dean.
If you have a Dean's excuse or a TI, making up missed work may involve alternative assignments, at the discretion of the instructor; please check with the instructor in this case.
Unless otherwise specified, the homework assignments are your individual responsibility. Plagiarism is a violation of University rules and will not be tolerated. You must neither copy work from others (at Yale or elsewhere) nor allow your own work to be copied. You are definitely on the wrong side of the boundary if you give or receive a printed or electronic copy of your or anyone else's work for the course from this term or previous terms.
You are encouraged to ask others for help with the computers and Unix, with questions about Scheme, general questions about the concepts and material of the course, but if you need more extensive help with a program or other assignment, please ask a TA or the instructor for assistance. Working in groups to solve homework problems is not permitted in this course. Please talk to the instructor if you have any questions about this policy.
|1||Aug 29, 31||Introduction. Racket.|
|2||Sep 5, 7||Racket|
|3||Sep 10, 12, 14||Racket|
|4||Sep 17, 19, 21||Racket. Computability.|
|5||Sep 24, 26, 28||Computability.|
|6||Oct 1, 3, 5||Boolean functions and Expressions.|
|7||Oct 8, 10, 12||Review for midterm I. Gates and Circuits.|
|Oct 9||Evening midterm 7-8:30pm RTBA|
|8||Oct 15||Computer Architecture.|
|9||Oct 22, 24, 26||Strings and languages.|
|10||Oct 29, 31, Nov 2||Strings and languages.|
|11||Nov 5, 7, 9||Review for midterm II. Compilers.|
|12||Nov 12, 14, 16||Running time of programs.|
|Nov 13||Evening midterm 7-8:30pm RTBA|
|13||Nov 26, 28, 30||Recursion, memoization.|
|14||Dec 3, 5, 7||Dynamic programming. Review for final exam|
|Dec XX||Final Exam XX RTBA|
Please see the course webpage for lecture summaries from Spring 2014 for an indication of the topics covered by the course. This term's coverage may differ somewhat.