Information on individual educational components (ECTS-Course descriptions) per semester | |
Degree programme: | Bachelor Computer Science - Software and Information Engineering |
Type of degree: | FH BachelorĀ“s Degree Programme |
Full-time | |
Summer Semester 2023 | |
Course unit title | Basic Algorithms and Object-oriented Programming |
Course unit code | 024717020301 |
Language of instruction | German |
Type of course unit (compulsory, optional) | Compulsory |
Semester when the course unit is delivered | Summer Semester 2023 |
Teaching hours per week | 7 |
Year of study | 2023 |
Level of course unit (e.g. first, second or third cycle) | First Cycle (Bachelor) |
Number of ECTS credits allocated | 8 |
Name of lecturer(s) | Wolfgang AUER Patrick RITSCHEL Martin SOBOTKA |
Prerequisites and co-requisites |
Structured Programming |
Course content |
The course is divided into two thematic blocks. In the first part of the course, fundamental topics from the field of algorithms and data structures are dealt with. These include:
In addition the following topics are discussed:
Selected design patterns are treated on the basis of concrete implementations in Java 2 (observer-observable, adapter, decorator, etc.). |
Learning outcomes |
Technical and methodological competence (F / M)
Through specifically selected forms of learning and teaching, this course also contributes to the training of the following general skills: Social and communicative competence (S / K)
English is the technical language of computer science. Students can describe program sequences and use cases in German and English. Self-competence (S)
Transfer Competence (T)
|
Planned learning activities and teaching methods |
Integrated lecture. Teaching content is developed in a combination of lecture-like presentations and subsequent practical implementation on the computer. Screen sharing between lecturers and students via Microsoft Teams replaces the projector used previously. In the lecture situation, the readability for the students is increased, in the exercises it is much easier to discuss different solutions of the students together. Students receive comprehensive, individual feedback on their programming exercises. Step by step development of the "binary search tree" concept from an ordered list. In the exercises, activating the students through various physical exercises, such as getting up, loosening limbs, facial concentration exercises (bite into the lemon, yawning), buzzing, and even tuning into a triad. The repetition will only be held in the first two dates as a presence event, afterwards it will take place as an online course in Microsoft Teams. |
Assessment methods and criteria |
Excersice 30% Final written exam 70% For a positive grade, overall across all parts of the examination a minimum of 50% of the possible points must be achieved AND in the following parts of the examination a minimum of 50% of the points must be achieved: Final written exam
|
Comment |
Not applicable |
Recommended or required reading |
Sedgewick, Robert; Wayne, Kevin (2011): Algorithms. 4th revised edition. Upper Saddle River, NJ: Addison Wesley.
|
Mode of delivery (face-to-face, distance learning) |
Classroom teaching |
Summer Semester 2023 | go Top |