CSE 105 Home Page

Annoucements

  • Practice final is now available.
  • Practice final solutions are also available. Please do the practice final first before you look at the solutions.
  • Class Thursday 6/4/98 will be part lecture, part review session.
  • Revised version of HW 8 is available. We have corrected problem 6 and changed it from a solving to a reading problem.
  • Be sure to check with Skip and Adam to make sure that they have the correct scores for your homeworks.
  • Solutions to the midterm are in Soft Reserves.

    CSE 105

    CSE 105 provides an introduction to finite state automata, formal language theory, and undecidability. Check this page frequently for updates on the course. All information will be put on this page including homework assignments, practice problem sets, answer keys and important dates. The course description summarizes the structure of the course, resources you should know about, and how you will be graded.

    Course Schedule

    Lectures: Tuesday, Thursday 9:35-10:55, Center 214
    Session: Monday: 4:40-5:30, Center 105

    Course Personnel & Office Hours

    OfficeHourse-mail
    Professor Francine Berman AP&M 4202 Mon 2pm-3:30pmberman@cs.ucsd.edu
    TA Skip GaribaldiAP&M 3349ATue 12:30pm-2:20pmskip@math.ucsd.edu
    ReaderAdam HeineAP&M 3349AFri 12:15pm-2pm aheine@ucsd.edu

    Homework Assignments

    AssignmentDue dateSolns
    available    		MeanStd. Dev.Total
    possible
    1 4/7/98 Yes 21 5 28
    2 4/16/98 4/29/98 22 7 30
    3 4/21/98 4/24/98 18 5 24
    4 4/30/98 5/5/98 20 6 30
    5 5/7/98 5/13/98 20 5 29
    6 5/19/98 5/27/98 13 5 20
    7 5/26/98 6/4/98 14 5 24
    8 6/4/98 No 20 5 29

    Exams

    ExamMeanStd. Dev.Total
    possible
    Midterm 57 18 100
    Final 52 16 100