Computer Science

What Computer Science Is


The word computer science unfortunately has no clear "equivalent" in Greek from which it could derive. It essentially comes from English and German (those countries were pioneers in the world's computing development). Computer science is classified as an exact science. It commonly makes use of many mathematical and physical tools. This website is a great example of what computer science is used for, among other things (in the case of this website: HTML, CSS, JS, PHP). The main goal of computer science is essentially processing information and solving problems using algorithms. Today it is extremely closely tied to a wide variety of technical solutions, including electronic components, robots, electronic devices, and, really, many other solutions.

What's on This Page

This page will feature various computer science topics I am currently exploring and that seem interesting enough to share.

Algorithms Course
algorithm 0 - exponentiation

IT Matura Course. Post Zeroth. Exponentiation algorithm.

26.12.2022
algorithm 1 - determining a prime number

IT Matura Course. Post First. Algorithm for determining a prime number.

27.12.2022
algorithm 2 - binary search

IT Matura Course. Post Second. Binary search algorithm.

28.12.2022
algorithm 3 - bubble sort

IT Matura Course. Post Third. Bubble sort algorithm.

29.12.2022
algorithm 4 - Sieve of Eratosthenes

IT Matura Course. Post Fourth. Sieve of Eratosthenes algorithm.

30.12.2022
algorithm 5 - prime factorization

IT Matura Course. Post Fifth. Prime factorization algorithm.

31.12.2022
algorithm 6 - greedy change-making

IT Matura Course. Post Sixth. Greedy change-making algorithm.

1.01.2023
algorithm 7 - insertion sort

IT Matura Course. Post Seventh. Insertion sort algorithm.

2.01.2023
algorithm 8 - merge sort

IT Matura Course. Post Eighth. Merge sort algorithm.

3.01.2023
algorithm 9 - counting sort

IT Matura Course. Post Ninth. Counting sort algorithm.

4.01.2023
algorithm 10 - finding the longest common subsequence

IT Matura Course. Post Tenth. Algorithm for finding the longest common subsequence.

5.01.2023
algorithm 11 - finding the n-th Fibonacci term

IT Matura Course. Post Eleventh. Algorithm for finding the n-th term of the Fibonacci sequence.

7.01.2023
algorithm 12 - checking whether words are anagrams

IT Matura Course. Post Twelfth. Algorithm for determining whether two words are anagrams.

8.01.2023
algorithm 13 - checking whether a word is a palindrome

IT Matura Course. Post Thirteenth. Algorithm for determining whether a word is a palindrome.

9.01.2023
algorithm 14 - determining which word is greater

IT Matura Course. Post Fourteenth. Algorithm for determining which of two words is greater.

10.01.2023
algorithm 15 - length of the longest contiguous non-decreasing subsequence

IT Matura Course. Post Fifteenth. Algorithm for determining the length of the longest contiguous non-decreasing subsequence.

11.01.2023
algorithm 16 - length of the longest non-decreasing subsequence

IT Matura Course. Post Sixteenth. Algorithm for determining the length of the longest non-decreasing subsequence.

12.01.2023
algorithm 17 - maximum subarray sum

IT Matura Course. Post Seventeenth. Algorithm for finding the maximum subarray sum.

13.01.2023
algorithm 18 - checking the triangle inequality

IT Matura Course. Post Eighteenth. Algorithm for checking the triangle inequality.

14.01.2023
algorithm 19 - checking whether a point lies on a segment

IT Matura Course. Post Nineteenth. Algorithm for checking whether a point lies on a segment.

15.01.2023
algorithm 20 - checking a point's position relative to a line

IT Matura Course. Post Twentieth. Algorithm for checking a point's position relative to a line.

16.01.2023
algorithm 21 - checking whether lines intersect

IT Matura Course. Post Twenty-first. Algorithm for checking whether two lines intersect.

17.01.2023
algorithm 22 - finding a polynomial's root using bisection

IT Matura Course. Post Twenty-second. Algorithm for finding a polynomial's root using the bisection method.

18.01.2023
algorithm 23 - finding a square root using the Babylonian method

IT Matura Course. Post Twenty-third. Algorithm for finding a square root using the bisection method.

19.01.2023
algorithm 24 - Caesar cipher

IT Matura Course. Post Twenty-fourth. Algorithm for finding a square root using the Babylonian method.

20.01.2023
algorithm 25 - transposition cipher

IT Matura Course. Post Twenty-fifth. Caesar cipher.

21.01.2023
algorithm 26 - Horner's scheme

IT Matura Course. Post Twenty-sixth. Transposition cipher.

22.01.2023
algorithm 27 - Horner's scheme algorithm

IT Matura Course. Post Twenty-seventh. Horner's scheme algorithm.

23.01.2023
algorithm 28 - Monte Carlo algorithm

IT Matura Course. Post Twenty-eighth. Monte Carlo algorithm.

24.01.2023
algorithm 29 - length of the longest common subsequence

IT Matura Course. Post Twenty-ninth. Algorithm for the length of the longest common subsequence.

26.01.2023
Databases Course Theory Course Spreadsheet Course

Comments