Open University

Tampere

Data Structures and Algorithms 2

Contact information Email: open.studies.tau [at] tuni.fi Phone: 0294 520 200More information concerning Open University studies <a href="https://www.tuni.fi/open-university">tuni.fi/open-university</a>

Advanced studies

Faculty of Information Technology and Communication Sciences

Data Processing and Information Technology

Apply for Open University studies by using the following links:<ul><li><a href="https://tau-avoin.ilmoittaudu.fi/lobby/?realization=J-otm-99eaf5b8-8a72-4021-a954-4ef294d1fbde_2023-tampere-COMPCS350" target="_blank">COMP.CS.350 Data Structures and Algorithms 2, Tampere</a></li></ul>You can find a link to the Open University Admissions service and application instructions on the <a href="https://www.tuni.fi/en/study-with-us/open-higher-education-studies/open-university/applying-open-university">Applying to Open University studies</a> page.Some of the studies require prior studies. For example, studying intermediate studies may require some completed basic studies. These are described on the Information about studies tab of the study unit under prior requirements.When you have been admitted to the studies, you must enrol separately via the Sisu information system for the implementation of the unit of study and, for example if set, for a practise group of your choice. You will receive instructions on how to do this by e-mail after you have confirmed your acceptance of the study place by paying the required fee.

English

Hervanta Campus

Look information at <a href="https://www.tuni.fi/en/study-with-us/open-higher-education-studies/open-university/applying-open-university">Applying to Open University studies</a>.

The course introduces typical algorithmic problem solving methods (greedy algorithms, divide &amp;amp; conquer, dynamic programming, flow graphs) and string algorithms. The course emphasizes algorithm implementation (&amp;#61; programming) over theory.

<h2>Common</h2><h3>Demo Lecture: </h3>08.03.2024 14:00 - 17:00, TAU S&#228;hk&#246;talo SE201 opetustila (33) 15.03.2024 14:00 - 17:00, TAU S&#228;hk&#246;talo SE201 opetustila (33) 22.03.2024 14:00 - 17:00, TAU S&#228;hk&#246;talo SE201 opetustila (33) 05.04.2024 14:00 - 17:00, TAU S&#228;hk&#246;talo SE201 opetustila (33) 12.04.2024 14:00 - 17:00, TAU S&#228;hk&#246;talo SE201 opetustila (33) 19.04.2024 14:00 - 17:00, TAU S&#228;hk&#246;talo SE201 opetustila (33) 26.04.2024 14:00 - 17:00, TAU S&#228;hk&#246;talo SE201 opetustila (33) 03.05.2024 14:00 - 17:00, TAU S&#228;hk&#246;talo SE201 opetustila (33) 10.05.2024 14:00 - 17:00, TAU S&#228;hk&#246;talo SE201 opetustila (33)

A student who has completed the course with a least the grade &amp;#34;good&amp;#34; is expected to <ul><li>be able to analyse formally the asymptotic complexity of basic (including recursive) algorithms</li><li>be able to apply and analyse common algorithm design methods in solving various problems </li><li>be able implement intermediate-level algorithms efficiently in C, C&amp;#43;&amp;#43;, Java or Python. </li></ul>

<h2>Prerequisites</h2>The course requires reasonable programming skills. You are allowed to use any of the following programming languages during the course: C, C&amp;#43;&amp;#43;, Java or Python.<h2>Recommended Prerequisites</h2><ul><li>Data Structures, TIETA6, 10 cr</li><li>Data Structures and Algorithms 1, COMP.CS.300, 5 cr</li><li>Mathematics for Algorithms 1, MAT-02651, 5 cr</li><li>Basic concepts of Mathematics, MTTMY1, 5 cr</li></ul>

The course offers lecture slides. You may in addition read e.g. the following books: Jon Kleinberg and &#201;va Tardos: Algorithm Design Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein: Introduction to AlgorithmsLecture recordings and written material will be provided in WETO.

The course contains four elements: 1) Weekly lectures / Q&amp;amp;A sessions that are recorded and made available for later viewing.2) Weekly exercises (theory questions in the form of multiple choice questions, essays, etc.). Some questions involve mandatory peer reviewing.3) Automatically graded programming tasks. They can be completed freely in an open environment (on the course homepages) for little points or in a controlled/restricted environment (electronic exam room) for a lot of points. Passing the course requires solving at least some tasks in an electronic exam room.4) A final exam done in an electronic exam room.

Data Structures and Algorithms 2

Extent

Course dates

Application period

Fees

Campus

City

Faculty or school

Language of instruction

Code

Study fields

Study level

Data Structures and Algorithms 2, 5 cr

Contact information

How to apply

Payment terms

Give us feedback!

Your last viewed study options

Data Structures and Algorithms 2