Official course description:
Basic info last published 26/02-19
Offered to guest students:
Offered as a single subject:
M.Sc. in IT, Software Development and Technology
27 August 2018
28 December 2018
Formal prerequisitesBefore the course, the student should be able to: - Perform basic analysis of algorithm correctness and complexity, using invariants and big-O notation. - Use basic algorithms and data structures when programming (e.g., lists, queues, stacks, search trees, hashing, sorting algorithms, and basic graph algorithms). This can be achieved, for example, by taking the courses "Foundations of Computing - Algorithms and Data Structures" (SGDS) or "Algorithms and Data Structures" (BADS). The course Algorithm Design (SAD1) is not a prerequisite. The two course actually complement each other.
Intended learning outcomes
After the course, the student should be able to:
Ordinary examExam type:
C: Written report, internal (bestået/ikke bestået)
Parts of the exam are to be answered as text and other parts as source code that describes a correct and sufficiently efficient implementation. Written take-home exam (individual mini-project) - Total duration 6 hours - Individual - Date and time for exam publication and solution hand-in will be published in LearnIT. - Submission in LearnIT - All materials, including Internet access, allowed - Plagiarism, collaboration and copying of solutions not allowed. - There is no oral exam but a fraud check will be conducted after the hand-in. The study administration will randomly select 20 % of students who will have to show up at ITU to check authorship of submitted solutions. The selection of students and the place and time for the fraud check will be published in Learn IT.