Algorithms and data structures

Algorithms and data structures

1.

Subject title

Algorithms and data structures

Алгоритми и податочни структури

2.

Code

F23L2W001

3.

Study program

Софтверско инженерство и информациски системи, Компјутерски науки, Компјутерско инженерство, Software engineering and information systems, Софтверско инженерство и информациски системи, Компјутерски науки, Компјутерско инженерство, Software engineering and information systems, Bioinformatics,

4.

Organizer of the study program (unit, institute, department, division)

Faculty of Information Sciences and Computer Engineering

5.

Study cycle (first, second, third)

Прв циклус

6.

Academic year / semester

2 / Зимски

7. Number of ECTS credits

6.0

8.

Instructor

проф. д-р Ана Мадевска Богданова ворн. проф. д-р Бојана Котеска ворн. проф. д-р Ефтим Здравевски ворн. проф. д-р Христина Михајлоска Трпческа доц. д-р Илинка Иваноска проф. д-р Слободан Калајџиски проф. д-р Владимир Трајковиќ

9.

Prerequisites for enrollment

Структурно програмирање

10.

Subject goals and competencies:


Getting to know the basic data structures and algorithms that are further necessary for working with databases data as well as for other applications. The student will be able to use and develop structures and algorithms with linear lists, trees, graphs as well as search indexes. He will also be trained to implementation of the various archetypes of algorithms used in the practical implementation of many software solutions.

11.

Subject content:


(1) Introduction to data structures (1) Analysis of algorithms and complexity of algorithms (2) Data representation with fundamental data structures (arrays and lists) (2) Introduction to algorithms and techniques for creating algorithms (brute force, greedy, divide-and-conquer, dynamic programming...) (1) One-dimensional data structures (stack, queue) (1) Sorting algorithms (1) HASH structures (2) Hierarchical structures - trees (2) Graphs

12.

Learning methods:


Предавања поддржани со презентации преку слајдови, интерактивни предавања, вежби (користење на опрема и софтверски пакети), тимска работа, пример случаи, поканети гости предавачи, самостојна изработка на домашни задачи. учење во електронско опкружување (форуми, консултации).

13.

Total available time fund

6.0 ECTS x 30 hours = 180 hours

14.

Time distribution

30 + 60 + 10 + 10 + 70 = 180 hours

15.

Forms of teaching activities

15.1.

Lectures - theoretical teaching

30 hours

15.2.

Exercises (laboratory, classroom), seminars, team work

60 hours

16.

Other forms of activities

16.1.

Project tasks

10 hours

16.2.

Independent tasks

10 hours

16.3.

Homework

70 hours

17.

Grading method

17.1.

Tests

10 points

17.2.

Seminar work / project (presentation: written and oral)

10 points

17.3.

Activities and learning

10 points

17.4.

Final exam

70 points

18.

Grading criteria (points / grade)

up to 50 points

5 (five) (F)

from 51 to 60 points

6 (six) (E)

from 61 to 70 points

7 (seven) (D)

from 71 to 80 points

8 (eight) (C)

from 81 to 90 points

9 (nine) (B)

from 91 to 100 points

10 (ten) (A)

19.

Condition for signature and taking final exam

реализирани лабораториски вежби

20.

Language of instruction

македонски и англиски

21.

Quality assurance method

механизам на интерна евалуација и анкети

22.

Literature

22.1.

Mandatory literature

No.

Author

Title

Publisher

Year

4690

Steven S. Skiena

The Algorithm Design Manual

Springer

2008

4691

Robert Sedgewick and Kevin Wayne

Algorithms

Addison-Wesley Professional

2011

4692

Jon Kleinberg, Éva Tardos

Algorithm Design

Addison Wesley

2005

4693

Alfred V. Aho, Jeffrey D. Ullman, John E. Hopcroft

Data structures and algorithms

Addison Wesley

1983

4694

Donald Knuth

The Art of Computer Programming

Addison Wesley

2002

22.2.

Additional literature

No.

Author

Title

Publisher

Year