Course content

Build and use data structures as: array, queue, stack, list, tree and graphs. Abstract data types. Advanced algorithms for searching, sorting, traversering. Recursion. Complexity for algorithms, efficiency, use of time and memory.

Learning outcome

Knowledge:

• Become familiar with, explain, apply and to some extent be able to rewrite some standard algorithms such as sorting, searching and graph handling.
• Describe and explain various data structures (arrays/tables, linked lists, queues, stacks, trees and graphs).
• Analyze advanced and complex (non-trivial) issues, and finding the algorithm to solve these.
• Apply recursive approach/method of problem solving and programming.
• Using abstraction in the construction of programs.

Skills:

• Writing reliable and efficient / fast computer programs.
• Write the program code that addresses advanced and complicated issues.
• Manage and handle advanced data structures (with particular emphasis on trees and graphs).

General competence:

• Had developed the ability to think and solve sophisticated and complex problems.
• Finding other/newer knowledge (here: algorithms), results and research in the field.

Learning methods and activities

• Lectures
• Mandatory Works
• Exercises
• Guidance

Mandatory Claims: 4 of 6 mandatory assignments work must be approved. Clearly inadequate work, not independently own work or deadline that is not complied is considered as undelivered.

Compulsory assignments

• Mandatory works

Specific conditions

Recommended previous knowledge

• PROG1003 Object-Oriented Programming or IDATG2001/IDATG2003 Programming 2
• IMAG1001/IMAG1002 Mathematics or BMA1010 Mathematics

Course materials

Advertised later.

Credit reductions