|Teaching Assistant:||Dave Cochranfirstname.lastname@example.org|
InfBase provides drop-in help, in the person of our course tutor, Dave, for all first- and second-year courses in Informatics. It meets as follows:
The Piazza page for Inf1-CL provides an online forum for Inf1-FP in which you can post questions and answers on anything related to the course. The course lecturer, teaching assistant, tutors and demonstrators will also read and answer questions.
Normally Thursdays 11:10-12:00 and Fridays 14:10-15:00.
Recordings of most lectures are available online. Please note that these recordings supplement lectures by allowing you to review the material presented and revise for the exam. They are not intended as a substitute for attending and participating in the lectures themselves.
For reasons beyond our control, some lectures have not been recorded, and you should not rely on the recording of future lectures. Moreover, the Lecture videos do not capture use of the blackboard.
Last year's lecture videos are also available.
The Single Watched Literal Explorer is designed to help you explore the single watched literal algorithm.
Sometimes we will swap slots with INF1-FP.
|Week||Monday 14:10-15:00 LT4 AT||Tuesday 11:10-12:00 LT4 AT||Thursday 11.10-12:00 LT5 AT||Friday 14:10-15:00 LT5 AT|
Tutorials: These start in week 3 and take place each week until the end of semester, including week 11. If you are ill or otherwise unable to attend one week then email your tutor, and if possible attend another tutorial group in the same week.
If you wish to move to a different tutorial group, please ask the ITO through their online contact form and explain your constraints. Or visit them in Forrest Hill.
Students are expected to prepare for each tutorial, which includes completing the tutorial exercises and the reading.
You must attempt the work before the tutorial and bring with you a copy of the work you have done. Tutorials are mandatory, and the only way to learn is to do the work before the tutorial, not at the tutorial. Students who have not done the work in advance will be sent away.
Week 3: read pages 642-648 of Chapter 12 of the Aho and Ullman book.
A take-home exercise was provided on Thursday 26th of November. The aim of this exercise is to give you practice at tackling exam-style questions.
You should do the takehome exercise and bring it to class in the final week of term. The marking scheme will be explained, you will mark your answers, and you will have the opportunity to get feedback on any questions or misunderstandings you may have.
In the second part of the course we model change. Many systems in nature change continuously. Our second abstraction is to consider a discrete series of time steps, and to focus on how the state of our system changes from one step to another, without worrying about the details of what happens in between. For example, in describing a game of chess we focus on the state of the board before and after each move, but pay no attention to the way the players move their pieces.
A common theme is the analysis of complex systems using compositional descriptions. Complex truth tables are built using a few boolean operations. Complex machines are composed using primitives for sequential composition, alternation, and repetition.
Much of the material we will cover will only be presented in lectures. Copies of the slides, annotated with brief notes, will be available. The slides may be modified and expanded to clarify questions raised during the lecture, so they will normally be re-published a few days after each lecture.
The brief notes I provide should be supplemented with notes taken by you during the lecture. If you are unable to attend a lecture, you should try to go through the slides with someone who did. Don't be shy about asking someone to do this---explaining things to you will probably help them at least as much as it helps you.
The first 5 chapters of Genesereth, Computational Logic, 2012, provide a good summary of much of the basic technical material on propositional logic covered in this course.
Another reference is Foundations of Computer Science by Aho and Ullman. This book has been taken out of print by W. H. Freeman. You may be lucky and find a used copy, e.g. on Amazon, but it is freely available for download on the web :-)
Informatics Forum, 10 Crichton Street, Edinburgh, EH8 9AB, Scotland, UK
Tel: +44 131 651 5661, Fax: +44 131 651 1426, E-mail: email@example.com
Please contact our webadmin with any comments or corrections. Logging and Cookies
Unless explicitly stated otherwise, all material is copyright © The University of Edinburgh