Field of study: Computer science
Lectures
Assessment methods: Exam
Item number 
Contents of the Education

Amount of hours 
1  Organizational classes, conditions of the credit 
2

2  Introduction to algorithm. Ownership correctly developed algorithm. Flowchart building blocks. Tower of Hanoi. 
2

3  Graph mining methods Breadthfirst search, Depth first search Algorithms in Data Mining. 
2

4  Sorting algorithms. Stable and unstable, classification. Bucket sort on the words and numbers. Comb sort and Merge sort. 
2

5  Graph Theory. Optimization algorithms graph. Euler and Hamiltonian cycles. 
2

6  Dynamic structures. Trees, list, queue, stack. 
2

7  Binary Trees. Reverse Polish Notation. 
2

8  Page Rank – PR. Hubs & Authorities – HITS 
2

9  Algorithms for NIP, PESEL, ID. Travelling salesman problem 
2

10  Genetic algorithms. 
2

Exam 0 – 11.01.2022 /13.01.2022 (For 1st year of study)
Exam I – 18.01.2022/20.01.2022 (For 1st year of study) Exam II – 25.01.2022/27.01.2022 (For 1st year of study)
Exceseries 

Item number

Contents of the Education

Amount of hours

1  Organizational classes, conditions of the credit 
2

2  Exercises with design flowcharts of algorithms, representation of basic math problems, calculating the arithmetic mean, Horner scheme. Fibonacci sequence. 
2

3  Exploration of graphs – Methods DFS and BFS – practical exercises. Designing flowcharts above methods and saves it as a highlevel language code. 
2

4  Sort of numerical values – by inserting, selecting, bubble. Design flowcharts for the abovementioned algorithms. 
2

5  Sort of numerical values – fast – qiucksort. Sieve of Eratosthenes. Designing flowchart for the above algorithms and saves it as a highlevel language code. 
2

6  Graph optimization algorithms: Dijkstra, FloydWarshall, FordBellman. Matrices by weight of edge. Tables calculations. 
2

7  Test 1 – 15.11.2021 (For 2nd year of study) /25.11.2021 (For 1st year of study)
Improvement tests 1 – 10.01.2022 (For 2nd year of study) /20.01.2022 (For 1st year of study) 
2

8  Data Structures: RPN for example: stack, queue – the structure, the list unidirectional, bidirectional – structure, trees – describing properties, methods to view binary trees. Representation of algebraic expressions for binary trees. 
2

9  Web mining algorithms: Page Rank, Hubs & Authorities – HyperlinkInduced Topic Search. Generating a square matrices for the purpose algorithms. 
2

10  Algorithms for creating identification number: VAT, social security (pesel in polish), ID. 
2

11  Exercises in designing solutions to algorithmic problems (a list of steps, pseudo code) based on interesting examples of mathematicallogical. 
2

12  Test 2 – 13.12.2021 (For 2nd year of study) /13.01.2022 (For 1st year of study)
Improvement tests 2 – 17.01.2022 (For 2nd year of study) /27.01.2022 (For 1st year of study) Entries for USOS/index: 24.01.2022 (For 2nd year of study) /27.01.2022 (For 1st year of study). 
2

Literature:
[1] Aho, A. V., Hopcroft, J. E., Ullman, J. D., The Design and Analysis of Computer Algorithms
[2] Sedgewick R., Algorithms in C
[3] Wirth N., Algorithms Data Structures = Programs
[4] Cormen T.H., Leiserson C.E., Rivest R.L., Introduction to Algorithms
[5] Knuth D E. The art of computer programming. Volume 1, Volume 2, Volume 3
Organisational remarks: