Announcements

CSE341 Description

Syllabus (including links to reference material)

Lecture Slides

Tentative Course Schedule

Assignments

Quizzes and Exams
 
 
 
 
 
 
 

 

CSE 341, Autumn 2003
Programming Languages
Home Page 
Instructor: Steve Tanimoto
Office: CSE 638 (Sixth floor of the Allen Center for Computer Science and Engineering)
Office Hours: Mondays & Fridays 2:30-3:20 or by appointment. 
e-mail: tanimoto@cs
Phone: (206) 543 4848

Graduate Teaching Assistant: Jessica Miller
Office: CSE 218
Office Hours: W 3:00-4:00, Th 12:00-1:00 
e-mail: jessica@cs
 

Undergraduate Teaching Assistant: Aiman Erbad
Office Hours: W 2:00-3:00 in CSE 220, Th 3:30-4:30 in CSE002 
e-mail: erbad@cs
 
 

Class Meeting Times and Location:
Lecture: MWF 12:30 - 1:20 in MGH 231  

Section AA: Th 8:30-9:20 in EE1 042

Section AB: Th 9:30-10:20 in MEB 235

 

Announcements


 
Welcome to CSE 341!
 
29 Sept. Each student registered for the course as of this morning has been added to the class mailing list. If for any reason you are not on the list, please join. To do this, send a message to cse341-request@cs.washington.edu with the subject line
subscribe
Then when you receive an email message requesting confirmation, simply reply to that message. You should then receive an actual confirmation of being subscribed.
 
1 Oct. Log into INFACT to answer the background questionnaire questions and to enter your preferences for groupmates. Log in using your UWNetID as the login name and your student number as the password. Once you are in, you can change your password.
 
1 Dec. Recommended reading and exercises for learning the basics of Prolog: Read Roman Bartak's Learning Prolog Via Examples online (lessons 1-7 and 11). Define and test a predicate cousin(A,B). Define and test a predicate palindrome(List) that is true if its argument is a list that is palindromic (or contains variables that can be instantiated to make it palindromic). Define and test a predicate singletons([a,b,c],[[a],[b],[c]]) that is true if its second argument is a list of lists, each of whose elements is the corresponding element from the first argument list. You are not required to turn in this work, but you can expect questions on the final exam related to these exercises and the Prolog constructs that support them.
 BACK TO TOP

 Last Updated:
1 Dec. 2003

A link to previous quarters' web pages

Contact the instructor at: tanimoto@cs.washington.edu