SubjectsSubjects(version: 945)
Course, academic year 2023/2024
   Login via CAS
Informatics - OKRIT19111
Title: Informatika
Guaranteed by: Katedra informačních technologií a technické výchovy (41-KITTV)
Faculty: Faculty of Education
Actual: from 2019
Semester: both
E-Credits: 6
Hours per week, examination: 0/0, C [HS]
Extent per academic year: 8 [hours]
Capacity: winter:unknown / unknown (unknown)
summer:unknown / unknown (unknown)
Min. number of students: unlimited
4EU+: no
Virtual mobility / capacity: no
State of the course: not taught
Language: Czech
Teaching methods: combined
Teaching methods: combined
Note: course can be enrolled in outside the study plan
enabled for web enrollment
priority enrollment if the course is part of the study plan
you can enroll for the course in winter and in summer semester
Guarantor: PhDr. Miloš Prokýšek, Ph.D.
Annotation -
Last update: PROKYSEK/PEDF.CUNI.CZ (05.12.2011)
This subject is focused on basics of informatics as background for further studium of information technology. The aim is to to develop students' knowledge of general principles of computer science and the ability of orientation in terminology. The course content focuses on basic concepts of information technology, processing and compression of data, theory of finite automata, abstract computer model and neural networks.
Literature - Czech
Last update: PROKYSEK/PEDF.CUNI.CZ (05.12.2011)

CORMEN, T.H. et al. Introduction to Algorithms. Cambridge, Mass : MIT Press, 1990.

Habiballa, H. Teoretické základy informatiky 1. Ostrava : Ostravská univerzita, 2003.

Habiballa, H. Teoretické základy informatiky 2. Ostrava : Ostravská univerzita, 2003.

CHYTIL, M. Automaty a gramatiky. Praha : SNTL, 1984,

KOLÁŘ, J. Teoretická informatika. Praha : ČIS, 1996.

Syllabus -
Last update: PROKYSEK/PEDF.CUNI.CZ (05.12.2011)

Information theory
information, information needs, information technology, computer science, information theory, information and entropy

Encoding and compression
RLE algorithm, Huffman coding. LZW algorithm

Basic theory of finite automata
Moore and Mealy automata, team automata, automata as a flat abstract machine implementation through automatic relay circuits and logic gates

Abstract computer model
von Neummanovo scheme computer scheme limits VN, Turing machine and the concept of associative memory

Neural Networks
neuron, perceptron, perceptron settings, applications of neural networks

 
Charles University | Information system of Charles University | http://www.cuni.cz/UKEN-329.html