Introduction (with all dates and assessmentcriteria)

The Knots and Bolts of Computing

Programming

Hypertext Markup Language

JavaScript

Growth of Functions (Landau Notation)

Problems in Computer Science

Algorithmic Methods

Sorting Algorithms

Turing Machines and Finite Automata

Tractability and Decidability

Cryptography

As the Java Script lecture is important, some oral explanations have been attached to the file. If you save the file from the browser and open it with Acrobat Reader, you can click the markings__Oral Explanations__ and
listen to these. Please note that the making of these explanations is
quite time consuming and therefore done only for this set of slides.

## Introduction to Javascript

**Deadline for presenting assignments 6 to 16, Friday, 21-Mar-2014 12:00-16:00 hrs (COM1-B1-10)**
**Deadline for presenting assignments 17 to 19, Friday, 11-Apr-2014 12:00-16:00 hrs (COM1-B1-10)**

The Knots and Bolts of Computing

Programming

Hypertext Markup Language

JavaScript

Growth of Functions (Landau Notation)

Problems in Computer Science

Algorithmic Methods

Sorting Algorithms

Turing Machines and Finite Automata

Tractability and Decidability

Cryptography

As the Java Script lecture is important, some oral explanations have been attached to the file. If you save the file from the browser and open it with Acrobat Reader, you can click the markings

An Introduction to Javascript

## Assignments

**Deadline for presenting assignments 0 to 5, Friday, 21-Feb-2014 12:00 - 16:00 hrs (COM1-B1-10)**

The project is to write
an improved version of the current
hexareversi implementation and to explain your version in 5 minutes
in the last lesson in this semester.