DD1320 Applied Computer Science 6.0 credits

In this course, the student will further develop their knowledge from the course in programming. The programming language used in the course is Python.

Algorithms and data structures: A systematic presentation of computer science concepts: abstract data types, algorithm analysis, recursion, stacks, queues, lists, searching, sorting, hashing, priority queues, trees, search trees, problem trees, text searching, simple syntax analysis, encryption.

Programming: Abstraction. Modularisation. Testing. Programming interfaces.

After passing the course, the student should be able to

• systematically test programs to discover errors
• use abstraction as a tool to simplify the programming
• use programming interfaces
• select an appropriate algorithm for a given problem
• compare algorithms with regard to time and memory usage
• implement different algorithms for searching and sorting and give an account of their properties
• formulate and implement recursive algorithms
• 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
• implement stacks, queues, binary search trees, general trees, hash tables and hash functions and use these
• use priority queues
• identify problems where the data structures above are useful and design simple algorithms with these
• use simple encryption methods and explain the principles of asymmetric encryption
• use algorithms for text searching, regular expressions and BNF syntax

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.

Knowledge and skills in 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.
Being registered for a course counts as active participation.
The term 'final examination' encompasses both the regular examination and the first re-examination.

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

• 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 or computer exam is used. Which of the examination forms will be used is stated in the course memo.

Only the TEN1 grade can be raised via renewed examination.

Sten Andersson

Linda Kann

Alexander Baltatzis

• 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.

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

TEN1 has been replaced by KONT.

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