|Mon 12-14 (U20)||Lecture (Peter)||Lecture (Daniel)||Lecture (Lene)||Lecture (Rolf)||Lecture (Lene)|
|Tue 12-14 (Terminalrum)||Lecture (Rolf) (U140)||Lab||>>>Exercise (U133)<<<||>>>Exercise (U52)<<<|
|Tue 14-16 (Terminalrum)||Lab||Exercise (U9)|
|Wed 14-16 (U28)||Lecture (Rolf)||Lecture (Kim)||Lecture (Lene)||Lecture (Rolf)|
|Thu 10-12 (U20)||Lecture (Daniel)|
|Thu 14-16 (U26)||Exercise (U20)||Lab (Terminalrum)||Exercise||Exercise >>>(U20)<<<||Exercise|
|Fri 10-12 (Terminalrum)||>>>Lab<<<|
|Mon 12-14 (U140)||Lecture (Tao)||Lecture (Lone)||Lecture (Jørgen)||Lecture (Jørgen)||Lecture (Marco)||Lecture (Marco)||Lecture (Kim)|
|Tue 10-12 (U37)||Exercise||Exercise||Exercise||Exercise||Exercise||Exercise >>>(U9)<<<||Exercise >>>(U9)<<<|
|Wed 14-16 (U28)||Lecture (Daniel)||Lecture (Jørgen)||Lecture (Marco)|
|Fri 10-12 (Terminalrum)||Lab||Lab||Lab|
Just come to my office. If you want to make sure I'm there, contact me before (by e-mail, jabber, phone).
Obligatory course book:
J. Glenn Brookshear: Computer Science: An Overview. Pearson Education, 10th Edition.
- Simulators for Brookshear Machine (Simulator, BrookshearMachine, run with java -jar Simulator.jar or java -jar BrookshearMachine.jar)
- Introduktion til LaTeX by Torben Nielsen and Arun Vadiveal
- Material for Operating Systems assignment (available via BlackBoard)
- Supplerende note om Maple by Torben Nielsen (based on notes by Hans Jøgen Munkholm and Leif Kjær Jørgensen)
- Jacob Aae Mikkelsen's Sorting Simulator (sorting, run with java -jar sorting.jar)
Required assignments. Internal evaluation by teacher. Pass/not passed.
Re-examination after 4th quarter.
Reexamination will consist of an oral examination, pass/fail and external censorship.
Withdrawal from the exam must be 7 days before the first exam date.
Lectures, hours 42. Tutorial, hours 42.
Tutorials will include group work. Members of the various research groups of the department will give some of the lectures.
1st and 2nd quarter, fall 2009.
The purpose of the course is to give a brief introduction to a selection of central subjects within Computer Science such that the participants obtain an understanding of what Computer Science is. Another purpose is to introduce some applications and tools useful during the computer science study.
Computer architecture, operating systems, algorithms, databases, networks, artificial intelligence, formal models of computation, software engineering, social issues relating to computers, formatting of mathematical text, version control, programs for symbolic computations.
After the course the students are expected to be able to:
- convert between decimal, binary, and floating point representations
- use simple error correcting codes
- construct simple logical circuits
- program in a simplified machine language
- recognize and avoid deadlock and race condition situations
- perform simple data modeling and simple queries in a relational database
- design and implement simple algorithms, and analyze their properties, including correctness and time complexity
- explain the idea behind RSA encryption and perform related calculations
- describe Turing machines and create simple programs for them
- describe and apply some principles for artificial intelligence
- describe basic elements from software engineering methods
- write programs in a simple universal programming language
- use LaTeX for formatting of mathematical text
- use version control tools for programming
- use Maple for symbolic computations
- write simple programs in Maple