Introduction to Computer Science
About

Course: Introduction to Computer Science (CH08320101)

Semester: Fall 2018

Instructor: Jürgen Schönwälder

TA: Jonas Bayer (Group D)

TA: Marco David (Group E)

TA: Dung Tri Huynh (Group B)

TA: Irsida Mana (Group C)

TA: Abhik Pal (Group A)

Class: Tuesday, 08:1509:30 (Lecture Hall Research II)

Class: Tuesday, 09:4511:00 (Lecture Hall Research II)

Class: Thursday, 11:1512:30 (Lecture Hall Research II)

Midterm: Tuesday, 20181030, 08:1509:30 (Campus Center, east wing and west wing)

Final: Thursday, 20181220, 16:0018:00 (SCC Hall 3+4)

Office: Monday, 11:1512:30 (Research I, Room 87)
Content
The course covers the fundamental concepts and techniques of computer science in a bottomup manner. Based on clear mathematical foundations (which are developed as needed) the course discusses abstract and concrete notions of computing machines, information, and algorithms, focusing on the question of representation versus meaning in Computer Science.
To develop a theoretical notion of computation, we introduce basic concepts of discrete mathematics with a focus on inductively defined structures. The functional programming language Haskell will be introduced and used as the primary programming language for the course. We cover a basic subset of Haskell that includes types, recursion, tuples, lists, strings, and higherorder functions. Back on the theoretical side, we cover the syntax and semantics of Boolean expressions and we explain how Boolean algebra relates to logic gates and digital circuits. On the technical side, we introduce the representation of basic data types such as numbers, characters, strings and dates as well as the basics of computer architecture and assembly programming. On the algorithmic side, the course introduces the notion of correctness and elementary complexity theory (bigO notation) and we introduce abstract data types.
Resources

Haskell Jupyter Notebook You can try to run the Jupyter Notebook on mybinder.org (wait until your virtual server has been created). Then press [upload] and select the notebook file [haskell.ipynb] that you have downloaded from the course web page. Then press the new [upload] button to push the code to the server. Finally, click on [haskell.ipynb] and cross your fingers.
Books

Eric Lehmann, F. Thomson Leighton, Albert R. Meyer, "Mathematics for Computer Science", 2018
Links

Real World Haskell (a book that is also available online)

Haskell Tutorial (a relatively concise online tutorial)

UNIX Tutorial for Beginners (a tutorial that can be downloaded and done offline)
Schedule
Tu 08:15  Th 11:15  Topics 

20180904  20180906  Introduction and maze generation algorithms 
20180911  20180913  String search algorithms, complexity and correctness 
20180918  20180920  Mathematical notations and proof techniques 
20180925  20180927  Sets, relations, and functions 
20181002  20181004  Representation of integer and floating point numbers 
20181011  Representation of characters, strings, date and time  
20181016  20181018  Boolean operations and expressions 
20181025  Boolean algebra and normal forms  
20181030  20181101  Boolean expression minimization and Boolean logic 
20181106  20181108  Logic gates, basic digital circuits, von Neuman computer architecture 
20181113  20181115  Assembly programming, interpreter, compiler 
20181120  20181122  Operating systems, processes, file systems, communication 
20181127  20181129  Finite state machines, pushdown automata and turing machines, formal languages 
20181204  20181206  Computability theory and complexity theory 
Tutorials
Tu 09:45  Topics 

20180904  Getting started with Haskell (ghc, expressions, functions, lists) 
20180911  Next steps with Haskell (types, tuples, pattern matching) 
20180918  Further steps in Haskell (guards, where, let, case, lambda) 
20181002  Lecture (substitute for 20181009) 
20181016  Grand tutorial (midterm preparation) 
20181030  Midterm exam (Campus Center, east wing and west wing) 
20181106  Higher order functions in Haskell (map, filter, foldr, foldl) 
20181113  
20181120  Midterm makeup exam 
20181127  Monads and I/O in Haskell 
20181204  Grand tutorial (final preparation) 
Dates
Date/Due  Name  Topics 

20180920  Sheet #1  boyer moore bad character rule, haskell leap year function 
20180927  Sheet #2  proof by contrapositive and induction, haskell rotate and circle 
20181004  Sheet #3  distributive laws for sets, relation properties, haskell circular prime numbers 
20181011  Sheet #4  order relations and function composition, haskell prefixes and suffixes 
20181018  Sheet #5  number systems, bcomplement, floating point numbers, haskell bin and binf 
20181025  Sheet #6  completeness of boolean operations, boolean algebra, dnf and cnf, haskell truthtable 
20181030  Midterm Exam  Campus Center East Wing and West Wing 
20181108  Sheet #7  boolean function minimization (quine mccluskey) 
20181115  Sheet #8  half and full adder, ripple and carry lookahead adder 
20181122  Sheet #9  assembly programming, fold function duality theorems 
20181129  Sheet #10  processes and zombies, file system directory walks 
20181206  Sheet #11  finite state machines, turing machines (bonus sheet) 
20181220  Final Exam  Sports and Convention Center, Halls 3+4 
Results
Evaluation
Rules
The final grade is made up of the final exam (50%), the midterm exam (30%) and homework assignments (20%).
Electronic submission is the preferred way to hand in homework solutions. Please submit documents (plain ASCII/UTF8 text or PDF, no Word) and your source code (packed into a tar or zip archive after removing all binaries and temporary files) via the online submission system. If you have problems, please contact one of the TAs.
Late submissions will not be accepted. Homeworks may need to be defended in an oral interview. In case you are ill, you have to follow the procedures defined in the university policies to obtain an official excuse. If you obtain an excuse, the new deadline will be calculated as follows:

Determine the number of days you were excused until the deadline day.

Determine the day of the end of your excuse and add the number of day you obtained in first step. This gives you the initial new deadline.

If the period between the end of your excuse and the new deadline calculated in the second step includes weekend days, add them as well to the new deadline. (Iterate this step if necessary.)
For any questions stated on assignment sheets, quiz sheets, exam sheets or during makeups, we by default expect a reasoning for the answer given, unless explicitely stated otherwise.
Students must submit solutions individually. If you copy material verbatim from the Internet (or other sources), you have to provide a proper reference. If we find your solution text on the Internet without a proper reference, you risk to lose your points. Any cheating cases will be reported to the registrar. In addition, you will lose the points (of course).
Any programs, which have to be written, will be evaluated based on the following criteria:

correctness including proper handling of error conditions

proper use of programming language constructs

clarity of the program organization and design

readability of the source code and any output produced
Source code must be accompanied by a README file providing an overview of the source files and giving instructions how to build the programs. A suitable Makefile is required if the build process involves more than a single source file.
If you are unhappy with the grading, please report immediately (within one week) to the TAs. If you can't resolve things, contact the instructor. Problem reports which come late, that is after the one week period, are not considered anymore.
The policy on makeup quizzes is the following: There won't be any quiz makeups. If you (a) get an official excuse for a quiz from the registrar's office or (b) approach we well in advance of the quiz with a very good reason for not being able to participate (e.g., because you take a GRE computer science subject test at the day of a quiz), then the weight of the final exam will be increased according to the weight of the quiz you got excused for.