Introduction to Computer Science
About

Course: Introduction to Computer Science (CH08320101)

Semester: Fall 2017

Instructor: Jürgen Schönwälder

TA: Steven Abreu

TA: Mohit Shrestha

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

Start: 20170905
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
Books


Schöning, "Logic for Computer Scientists", Birkhäuser, 1989



Lehmann, F.T. Leighton, A.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)
Schedule
Tu 08:15  Th 11:15  Topics 

20170905  20170907  Introduction and maze generation algorithms 
20170912  20170914  String search algorithms, complexity and correctness 
20170919  20170921  Mathematical notations and proof techniques 
20170926  20170928  Sets, relations, and functions 
Representation of integer and floating point numbers  
20171010  20171012  Representation of characters, strings, date and time 
20171017  20171019  Boolean operations and expressions 
20171024  20171026  Boolean algebra and normal forms 
20171102  Boolean expression minimization and Boolean logic  
20171107  20171109  Logic gates, basic digital circuits, von Neuman computer architecture 
20171114  20171116  Assembly programming, interpreter, compiler 
20171121  20171123  Operating systems, processes, file systems, communication 
20171128  20171130  Finite state machines, pushdown automata and turing machines, formal languages 
20171205  20171207  Computability theory and complexity theory 
Tutorials
Tu 09:45  Topics 

20170912  Haskell Tutorial (Alexandru) 
20170919  Shell Tutorial (Steven) 
20170926  Haskell Tutorial (Alexandru) 
20171010  Lecture (moved from 20171005) 
20171017  Haskell Tutorial (Alexandru) 
20171024  Grand Tutorial 
20171107  
20171114  Haskell Tutorial (Alexandru) 
20171121  Haskell Tutorial (Alexandru) 
20171128  
20171205  Grand Tutorial 
Dates
Date/Due  Name  Topics 

20170912  Quiz #1  administrivia, mazes, kruskal's algorithm 
20170919  Quiz #2  complexity, correctness, software engineering, mathematical notation 
20170919  Sheet #1  boyer moore bad character rule, haskell factorial 
20170926  Quiz #3  proof techniques 
20170926  Sheet #2  proof by contrapositive and by induction 
20171003  Sheet #3  sets and relations 
20171010  Quiz #4  relations, functions, recursion 
20171010  Sheet #4  order relations, function composition 
20171017  Quiz #5  units, prefixes, characters, date and time 
20171017  Sheet #5  number systems, floating point numbers 
20171024  Quiz #6  boolean algebra and logic 
20171026  Midterm Exam  Eastwing 
20171031  Sheet #6  boolean expressions, tower of hanoi 
20171107  Quiz #7  normal forms, complexity of boolean functions, quinemccluskey 
20171107  Sheet #7  quinemccluskey algorithm 
20171114  Quiz #8  von Neumann computer architecture 
20171114  Sheet #8  half and full adder, ripple carry adder and carry lookahead adder 
20171121  Quiz #9  assembly programming, interpreter, compiler 
20171121  Sheet #9  assembly programming 
20171128  Quiz #10  operating systems 
20171128  Sheet #10  fold functions, processes 
20171205  Quiz #11  automata (bonus) 
20171205  Sheet #11  automata and formal languages (bonus) 
20171216  Final Exam  09:0011:00 East Wing (closed book) 
20180210  Makeup Final Exam  14:0016:00 CS Lecture Hall (closed book) 
Results
Evaluation
Rules
The final grade is made up of the final exam (30%), quizzes (30%), the midterm exam (20%) and homework assignments (20%).
Electronic submission is the preferred way to hand in homework solutions. Please submit documents (plain ASCII text or PDF, no Word) and your source code (tar, zip) 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.
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.