On completion of the course, the student should be able to:
use the programming language Python, and tools for testing, debugging and version control, both writing codeand explaining what a given code does;
explain the concepts polymorphism and duck typing in Python, and use these concepts in the softwaredevelopment;
implement recursive solutions to problems;
describe the principle for analysing algorithm efficiency and perform analysis on basic algorithms;
describe, implement and use the fundamental data structures lists, hash tables and trees and implement abstractdata types such as stacks, queues, generators and mapping;
describe how debugging with exceptions is working and to be able to use it in programs;
implement programs with both sequential and event driven flows, incuding simple parallel processing, and discussthe differences.
Continued programming in Python: polymorphism, duck typing, exceptions. The concepts stacks and queues, simplegraphs such as lists and trees, hash tables, mapping in general and Pythons dictionary as a special case. Generators andthe Python yield statement.
Fundamental algorithms for storing, searching and sorting. Debugging, version control and testing. Analysis of asymptotictime complexity.
Python language and programming environment properties compared with C++ . Implemented and basic performancecomparisons between Python and C++ .
Represenation of code as object and lambda expressions, and using this for event driven and parallel programming inPython.
Lectures, problem classes/computer lab and compulsory assignments.
Written examination (2 credits) and approved assignments (3 credits).
If there are special reasons for doing so, an examiner may make an exception from the method of assessment indicatedand allow a student to be assessed by another method. An example of special reasons might be a certificate regardingspecial pedagogical support from the disability coordinator of the university.