Skip to main content

DD1320 Applied Computer Science 6.0 credits

A basic course in computer science.

Choose semester and course offering

Choose semester and course offering to see information from the correct course syllabus and course offering.

Headings with content from the Course syllabus DD1320 (Autumn 2021–) are denoted with an asterisk ( )

Content and learning outcomes

Course contents

In this course, the students will develop their knowledge of algorithms, data structures and programming. The programming language used in the course is Python.

Algorithms and data structures: A systematic overview of the concepts abstract data types, stacks, queues, lists, trees, searching, sorting and recursion based on the knowledge the students acquired in the course Programming Techniques. Hashing. Priority queues. Search trees. Problem trees. Text searching. Simple syntactical analysis. Algorithm analysis. Cryptography.

Programming: Program quality. Abstraction. Modularisation. Testing. System calls. Standard modules.

Intended learning outcomes

After passing the course, the student shall be able to

  • systematically test programs to discover errors
  • use abstraction as a tool to simplify the programming
  • select an appropriate algorithm to a given problem
  • compare algorithms with regard to time and memory usage
  • describe different algorithms for searching and sorting and their properties
  • formulate and implement recursive algorithms
  • write a small BNF syntax (less than 10 rules) for a formal language, and write a programme that examines whether an expression follows a BNF syntax
  • model problems as search problems and implement algorithms for breadth-first search, depth-first search and best-first search
  • describe basic compression algorithms and for which types of compression they are used
  • design an automaton for text search and describe how it is working
  • implement stacks and queues and use these
  • implement insertion, traversal, and search operations for binary search trees and general trees and use these
  • implement hash tables and hash functions and use these
  • use priority queues
  • use simple encryption methods and explain the principles of asymmetric encryption
  • identify problems where the data structures above are useful and design simple algorithms with these

in order to

  • become a good problem solver using programming
  • be able to use computational methods in application projects
  • acquire sufficient prior knowledge to be able to take advanced courses in computer science.

Course disposition

No information inserted

Literature and preparations

Specific prerequisites

Knowledge and skills in basic programming, 6 higher education credits, equivalent to completed course DD1310/DD1311/DD1312/DD1314/DD1315/DD1316/DD1318/DD1331/DD100N/ID1018.

Active participation in a course offering where the final examination is not yet reported in LADOK is considered equivalent to completion of the course.

Registering for a course is counted as active participation.

The term 'final examination' encompasses both the regular examination and the first re-examination.

Recommended prerequisites

No information inserted

Equipment

No information inserted

Literature

No information inserted

Examination and completion

If the course is discontinued, students may request to be examined during the following two academic years.

Grading scale

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

Examination

  • KONT - Partial exams, 3.0 credits, grading scale: A, B, C, D, E, FX, F
  • LABD - Programming assignments, 3.0 credits, grading scale: A, B, C, D, E, FX, F

Based on recommendation from KTH’s coordinator for disabilities, the examiner will decide how to adapt an examination for students with documented disability.

The examiner may apply another examination format when re-examining individual students.

For higher grades on KONT, oral examination is used.

Opportunity to complete the requirements via supplementary examination

No information inserted

Opportunity to raise an approved grade via renewed examination

Only the TEN1 grade can be raised via renewed examination.

Examiner

Profile picture Sten Andersson

Profile picture Linda Kann

Ethical approach

  • All members of a group are responsible for the group's work.
  • In any assessment, every student shall honestly disclose any help received and sources used.
  • In an oral assessment, every student shall be able to present and answer questions about the entire assignment and solution.

Further information

Course web

Further information about the course can be found on the Course web at the link below. Information on the Course web will later be moved to this site.

Course web DD1320

Offered by

EECS/Computer Science

Main field of study

Information Technology, Technology

Education cycle

First cycle

Add-on studies

Advanced courses in computer science DD2350/DD2352, DD1418, DD1334, DD1420/DD2421, DH2323. Furthermore DD1380 followed by DD1385 or DD1389.

Contact

Linda Kann, tel:790 9276, e-post: lk@kth.se

Transitional regulations

TEN1 has been replaced by KONT.

Supplementary information

Students who have taken Numerical Methods and Basic Programming, 9 hp, should take DD1321 instead of DD1320.

Only one of the following courses can be counted in your degree: DD1320, DD1321, DD1325, DD1327, DD1338, DD1339, DD1340, DD1341, DD1343, DD1344, DD1345, DD2325, EL2310, HI1201, ID1020, ID1021.

In this course, the EECS code of honor applies, see:
http://www.kth.se/en/eecs/utbildning/hederskodex