Fundamentals of Algorithmization and Programming

PATH	OPTION	DESCRIPTION
1cs.1sem/LAB1..	B4	Simple formula count.
1cs.1sem/LAB2..	B4	Switchcase with formula count.
1cs.1sem/LAB3..	B4	Recurrence formula with for loop.
1cs.1sem/LAB4..	B4	Dynamic arrays.
1cs.1sem/LAB5..	B4	Matrix (NxM).
1cs.1sem/LAB7..	B4	Symbol datatype.
1cs.1sem/LAB8..	B4	Structures experience.
1cs.1sem/LAB9..	B4	Branch of LAB8..(Structures experience) but with *FILE additionally. Functions from "1cs.2sem/LAB1.." were used.

PATH	OPTION	DESCRIPTION
1cs.2sem/LAB1..	B4	Functions.
1cs.2sem/LAB2..	B4	Recursion.
1cs.2sem/LAB3..	B4	QuickSort(NON-RECURSIVE!) and SelectionSort.
1cs.2sem/LAB4..	B4	LinearSearch with barrier and BinarySearch.
1cs.2sem/LAB5..	B4	Singly linked lists.
1cs.2sem/LAB6..	B4	Doubly linked lists.
1cs.2sem/LAB7..	B4	Binary Tree.
1cs.2sem/LAB8..	B4	Reverse Polish Notation.
1cs.2sem/LAB9..	B4	Hashing (collisions solved with singly linked lists).
1cs.2sem/KURS..	B4	Coursework: Numerical calculation of integrals using the method of averages, the two-node Gauss formula and the adaptive Simpson method.