CSCE476/876, Fall 2019: Course Syllabus

1. General Information

Prereq: A grade of "P" or "C" or better in CSCE 310 (Data structures and algorithms), CSCE 310H, CSCE 311, SOFT 260, SOFT 260H or RAIK 283H..

Course description: Introduction to the basic principles, techniques and tools now being used in the area of computational. Lecture topics will include problem solving, knowledge representation and reasoning, search, expert systems, and planning and action. More advanced topics may be included depending on class interests and performance. Programming will be done in Allegro Common Lisp, however other languages may be allowed at the discretion of the instructor and grader.

Lectures:
      Monday 2:30--3:20 in AvH 119, and 3:30--4:20 in AvH 21
      Wednesday 2:30--3:20 in AvH 119
      Friday 2:30--3:20 in AvH 119

Instructor:   Prof.  Berthe Y. Choueiry
      Office location: Room 360, Avery Hall,
      Office hours: Wednesdays and Fridays 3:30pm--4:30 or by appointment.

GTA
     GTA Tyler Bienhoff
      Office hours: @ AvH 12 on Mondays and Fridays 12:30--1:30 pm. or by appointment.

UTAs
     Sam Flint (helps with Lisp)
     Office hours: @ Student Resource Center (AvH 12) Tuesdays and Thursdays 10:00am -- 12:00pm or by appointment.

Textbooks (check the bookstore):

2. Communications

3. Protocol of the Course

This course syllabus is our 'contract' and we will abide by it.

The course consists of lectures by the instructor, 3 times per week.

Workload

Required and recommended reading (as indicated in the Class schedule)

AIMA (textbook) will be followed in a more or less linear fashion.  The content of the course will be dynamically adapted to students performance. Chapters to be studied may encompass:  Chapter: 1, 2, 3, 4, 5, 6 (partially), 7, 9, and 10 (quickly) and, time permitting, 11, 13, and/or 14. Sections from these and other chapters may be dropped or added during the course.  Regularly check the class schedule.

Programming, theoretical, and library-search assignments

Surprise quizzes

There will be surprise quizzes throughout the semester  (with a frequency inversely proportional to students'  attendance).  Quizzes will address allmaterial covered during the lectures and/or appearing in the required reading.  No books or personal notes are allowed during the quizzes, unless explicitly specified. Quizzes cannot be made up.

Tests

Attendance

Attendance is not mandatory. But students are responsible for the material covered and announcements (such as lists of terms for glossary) made during the class. Also, there will be surprise quizzes during the regular class and the recitation.
Bonuses will be awarded to students who attend all lectures, interact lively, and participate in discussion in class.

Alerts

4. Grading Policy

Grade Distribution

Grade Conversion

97%

A+

[94, 97[

A

[90, 94[

A-

[87, 90[

B+

[84, 87[

B

[80, 84[

B-

[75, 80[

C+

[67, 75[

C

[60, 67[

C-

[57, 60[

D+

[54, 57[

D

[51, 53[

D-

<=51

F

4. How to Secure a Good Final Grade

Attendance

A bonus will be awarded to students who attend all lectures.

Glossaries

Students who return, every Monday before class, a glossary of terms listed in handouts will be credited for up to 8% bonus, computed proportionally to the list of terms they return. Rules for glossary:

Additional Work

Closely monitor your grade. If you feel that your grade is slipping, contact the instructor immediately. We may be able to assign to you an additional task to put you back on the right track.

5. Department and University Policies

Academic Honesty

Academic honesty is essential to the existence and integrity of an academic institution. The responsibility for maintaining that integrity is shared by all members of the academic community. The University's Student Code of Conduct addresses academic dishonesty. Students who commit acts of academic dishonesty are subject to disciplinary action and are granted due process and the right to appeal any decision.

All homework assignments, quizzes, exams, etc. must be your own work. No direct collaboration with fellow students, past or current, is allowed unless otherwise stated. The Computer Science & Engineering department has an Academic Integrity Policy. All students enrolled in any computer science course are bound by this policy. You are expected to read, understand, and follow this policy. Violations will be dealt with on a case by case basis and may result in a failing assignment or a failing grade for the course itself.

Services for Students with Disabilities

The University strives to make all learning experiences as accessible as possible. If you anticipate or experience barriers based on your disability (including mental health, chronic or temporary medical conditions), please let me know immediately so that we can discuss options privately. To establish reasonable accommodations, I may request that you register with Services for Students with Disabilities (SSD). If you are eligible for services and register with their office, make arrangements with me as soon as possible to discuss your accommodations so they can be implemented in a timely manner. SSD contact information: 232 Canfield Admin. Bldg.; 402-472-3787.

CSE Policies

The Student Resource Center is located in Avery 12. It is a valuable place to go for general CSE related issues.

It is CSE Department policy that all students in CSE courses are expected to regularly check their email so they do not miss important announcements.

The CSE Department has an anonymous suggestion box that you may use to voice your concerns about any problems in the course or department if you do not wish to be identified.

Students with disabilities are encouraged to contact the instructor or teaching assistant for a confidential discussion of their individual needs for academic accommodation. It is the policy of the University of Nebraska-Lincoln to provide flexible and individualized accommodations to students with documented disabilities that may affect their ability to fully participate in course activities or to meet course requirements. To receive accommodation services, students must be registered with the Services for Students with Disabilities (SSD) office, 132 Canfield Administration, 472-3787 voice or TTY.

6. Books on Reserve at the Math Library in Avery

AI

Artificial Intelligence, A Modern Approach (AIMA), by Russell Norvig. Second Edition.
Artificial Intelligence, 3rd Edition.  Winston. ISBN 0201533774.
Essentials of Artificial Intelligence. Ginsberg. ISBN 1-558s60-22-6.  Call number Q335.G55 1993.
Artificial Intelligence: A New Synthesis. Nilsson. ISBN 1-55860-535-5. Call number Q335.N496 1998.
Paradigms of Artificial Intelligence Programming. Norvig. ISBN 1-55860-191-0. Call number QA76.6.N687.
Artificial Intelligence. Structures and Strategies for Complex Problem Solving. Luger and Stubblefield

Lisp

Common Lisp, The Language, Second Edition. Guy L. Steele, Jr. Digital Press, ISBN: 1555580416
LISP, 3rd Edition. Winston & Horn. ISBN 0-201-08319-1.
ANSI Common Lisp; Graham. ISBN 0-13-370875-6.
Paradigms of Artificial Intelligence Programming. Norvig. ISBN 1-55860-191-0. Call number QA76.6.N687.
Object Oriented Common Lisp. Slade. ISBN 0-13-605940-6 Call number QA76.64 .S576

Other Topics

Foundations of Constraint Satisfaction by Edward Tsang.
A mathematical introduction to logic by Enderton, Herbert B, CALL NO. QA9 .E54 1972.

7. Other (AI) References

The MIT Encyclopedia of the Cognitive Sciences, call number BF311 .M556 1999, LIB USE ONLY.
Encyclopedia of artificial intelligence, 1992, SECOND EDITION,call number Q335 .E53, LIB USE ONLY.
Dictionary of Algorithms, Data Structures, and Problems
Online resources (wikipedia) and web search engines (Google, Altavista, etc.)

8. Online Resources

On-line tutorials

Colin Allen & Maneesh Dhagat Lisp Primer
Online Tutorial to Common Lisp , Adaptive Remote Tutor.

References

Common Lisp, The Language, Second Edition. Guy L. Steele, Jr. Digital Press, ISBN: 1555580416, also on Reserve at the Math Library.
Allegro Common Lisp (ACL) online documentation. Slow (local on cse: Introduction, Contents, Index). Quicker (link to Franz's web page Introduction).
Usenet newsgroup: comp.lang.lisp
Contributed by Eric Moss (S02): Parenthetically Speaking (with Kent M. Pitman)
Free copy of Allegro Common Lisp by Franz Inc.
David Cooper Jr.: Understanding Common Lisp (Basic Lisp techniques, PDF document).
COMMON LISP: An Interactive Approach, by Stuart C. Shapiro
Common Lisp: A Gentle Introduction to Symbolic Computation, by David S. Touretzky
LISP FAQ by  Mark Kantrowitz.

Finally, a touch of poetry: Only LISP Can Make a Tree.



Last modified: Mon Jan 5 15:00:00 CDT 2016