Algorithms and Data Structures

The course has been made within the framework of the project ”MOOC at the Westpomeranian Business School”; co-financed from Knowledge, Education, Development Operational Programme 2014-2020, from resources of the European Social Fund (POWR.03.01.00-00-W068/18-00).

COURSE DESCRIPTION

Coming to this course you probably already have some basic knowledge about the introduction to algorithmics, i.e. you are familiar with the concept of an algorithm and you probably know at least a few ways to write them. If you also have knowledge and skills in programming in any language, you must have encountered a popular data structure which is an array. In this course, you will learn about the most important data structures that can often be more efficient than the mentioned array and about algorithms that operate on these structures.

The knowledge, skills and, above all, experience that you will gain after this course should make it easier for you to solve more complex programming problems and will give you a different perspective on the issues that you will have to face one day.

PREREQUISITES

• Knowledge of the basics of algorithmization, recommended C++.
• Basics of programming in any programming language.
• Installed programming environment of a chosen programming language.
• Knowledge of English, including IT vocabulary.
• Basic office equipment such as a sheet of paper, a pen and some free space on a desk will be useful for some exercises.

COURSE OBJECTIVES

Overall course objective – To learn about different data structures and the algorithms that operate on them.

Detailed objectives:

• • Objective of Module 1. – To become familiar with the basic types of data structures.
  • Objective of Module 2. – To acquire the ability to determine prime numbers, to learn about the impact of prime numbers on the development of computer science.
  • Objective of Module 3. – To acquire the ability to select a sorting algorithm.
  • Objective of Module 4. – To become familiar with stack and its features.
  • Objective of Module 5. – To acquire the ability to solve a problem by using different approaches.

SUBJECT MATTERS

MODULE 1

  Basic data structures

MODULE 2

  Prime numbers

MODULE 3

  Sorting data structures

MODULE 4

  Stos LIFO

MODULE 5

  Greedy and dynamic algorithms

CONDITIONS FOR COMPLERTING THE COURSE

To successfully complete the course, it is necessary to take a final test with 20 closed-ended questions and give at least 11 correct answers (55%).

CONDITIONS FOR OBTAINING THE CERTIFICATE

The test consists of 20 questions with 1 point for each correctly answered question. After a minimum of 11 correct answers, a personal certificate of completion will be generated. The certificate of completion of the course will be generated automatically after exceeding the credit threshold and can be found in the "My Courses" tab (55%).

AUTHOR OF THE COURSE

Author of the course: Dominik Rynkiewicz

drynkiewicz@zpsb.pl

Dominik Jerzy Rynkiewicz, M.Sc. Eng. – computer scientist, university lecturer. He has been dealing with computer science since the beginning of the present millennium. From an early age, solving puzzles has been his passion, which in combination with computer science led him towards the design of algorithms and databases. Professionally, he is also involved in computer graphics and printing.