After successful completion of the course, students are able to

• describe important concepts of a modern programming language
• implement small programs
• design and implement simple algorithms
• compare the complexity of selected algorithms and justify the selection of an algorithm for a given problem

The following topics are covered in this course:

• basic programming concepts (variables, data types, branches, loops)
• functions and recursion
• lists and dictionaries
• testing and debugging
• exceptions
• classes and OOP
• complexity of algorithms
• searching algorithms
• sorting algorithms
• stack and queue
• trees

Python is used as programming language.

• lectures with discussions
• exercise sheets
• discussion of exercise sheets during exercise part of lectures
• programming test
• online tests (TUWEL) for algorithmic topics

Preliminary lecture: Tuesday, March 3, 2020 from 7:15 p.m. - 9:00 p.m.,

Lectures are on Tuesday, 7:15 p.m. - 9:00 p.m. and  Wednesday 7:15 p.m. - 9:00 p.m in room GM 2.

Workload estimation (ECTS Breakdown): 125 hours = 5 ECTS

•     lecture attendance (45 hours)
•     homework exercises (40 hours)
•     test preparation (40 hours)

All information, documents and exercises will be available on the TUWEL platform of the course.

For further questions please send an e-mail to: gpa@list.tuwien.ac.at

The grading is based on the performance during the labs:

• number of solved examples from 8 exercise sheets
• three tests, the best two tests count
  • programming test
  • TUWEL test
  • extra test (programming test)

This course is offered for studies with code numbers starting with 045 006. Registrations with other code numbers will be refused.