På Svenska

DD1339 Introduction to Computer Science 19.0 credits

Introduktion till datalogi

Basic course in computer science which starts with an introduction to how to use computers.

  • Educational level

    First cycle

  • Academic level (A-D)

  • Subject area

    Techonology

  • Grade scale

    A, B, C, D, E, FX, F

Course offerings

Autumn 12 CDATE for programme students

Autumn 13 inda13 for programme students

  • Periods

    Autumn 13 P1 (5.0 credits), P2 (4.0 credits)
    Spring 14 P3 (4.0 credits), P4 (6.0 credits)

  • Application code

    50099

  • Start date

    2013 week: 36

  • End date

    2014 week: 23

  • Language of instruction

    Swedish

  • Campus

    KTH Campus

  • Number of lectures

  • Number of exercises

  • Tutoring time

    Daytime

  • Form of study

    Normal

  • Number of places

    No limitation

  • Schedule

    Schedule (new window)

  • Course responsible

    Stefan Nilsson <snilsson@kth.se>

  • Target group

    Only for CDATE1

  • Part of programme

Learning outcomes

After finishing the course the participants should be able to

  • use common computing tools and, in particular, the computer environment at D,
  • design and implement simple sequential and parallel programs,
  • use programming to solve problems,
  • analyze, choose, select and implement basic algorithms and data structures,
  • take part in professional program development and know about the programmers roles and tasks

in order to

  • efficiently use computers in their continuing education and working life,
  • find and use the correct techniques for a given problem,
  • take continuation courses in computer science and numerical analysis.

Course main content

Operating systems and especially Unix, CSC's computer system, the hardware of a computer, text editing, basic HTML and LaTeX.

Programming: Theory and practise in all aspects of elementary programming and program development. Java and Go will be the language of instruction.

Elementary Data Structures: Lists, stacks, queues, heaps, sets, hash tables, trees and graphs.

Elementary Algorithms: Including but not limited to searching, sorting, graph and tree algorithms. Introduction to algorithm analysis.

Eligibility

Prerequisites

The course SF1604 (can be read at same time).

Literature

Course literature will be announced at least 4 weeks before course start at course web page.

Examination

  • HEM1 - Assignment, 6.0 credits, grade scale: A, B, C, D, E, FX, F
  • HEM2 - Assignment, 5.5 credits, grade scale: A, B, C, D, E, FX, F
  • HEM3 - Assignment, 3.0 credits, grade scale: P, F
  • LAB1 - Laboratory, 1.5 credits, grade scale: P, F
  • PRO1 - Project, 3.0 credits, grade scale: P, F

In this course all the regulations of the code of honor at the School of Computer science and Communication apply, see: http://www.kth.se/csc/student/hederskodex/1.17237?l=en_UK.

Offered by

CSC/Computer Science

Contact

Stefan Nilsson, e-post: snilsson@kth.se

Examiner

Stefan Nilsson <snilsson@kth.se>

Add-on studies

All second courses in computer science.

Version

Course plan valid from: Autumn 12.
Examination information valid from: Autumn 12.