Security and administration of computer systems

ÚINF/KRS/15 and (ÚINF/ADL1/15 or ÚINF/ADW1/15) and ÚINF/FAN/15 and ÚINF/SKB1/15

State exam contents

Area 1: Compulsory profile courses:

**************************************

Programming, algorithms and complexity: Class and object as a means of grouping several variables, graphic class triangle, square, (methods show, hide, move, changeColor, ....), constructor, overloading methods, composition of objects. Interface as an intuitive means of abstraction, interface as a parameter and reference, array of objects implementing a given interface.

Inheritance, overlapping methods of polymorphism - it is possible to use overlapping and supplementing the methods of the pen class, (inheritance as a means of adapting and extending existing objects), arrays of polymorphic objects, abstract class "graphic object". Recursion (recursion in fractals, transcription of known functions into recursive form).

Sorting (O and Omega-notation, MinSort - sorting numbers, MinSort - sorting objects, QuickSort, tree in the field, HeapSort, MergeSort). Data structures (stack and row, and their use in solving some tasks). Trees (tree search, binary search trees).

Backtrack (generating variations and the problem of splitting the magnifying glass, backtrack in general and in tasks, trimming the backtrack). Divide and conquer, dynamic programming, principle and examples.

Text search (KMP algorithm). Graphs and basic graph algorithms (graphs and their representations, graph connection testing, depth search and width search, graph skeleton, shortest paths in a graph, Dijkstra's algorithm, FW algorithm). Greedy Algorithms (Cheapest Skeleton, TopSort).

***

Operating systems: Structure and functions of the operating system. Creating an image of a task and its execution. Characteristics of OS types. Process, process management, communication, classical problems, processor allocation. Memory management, segmentation, paging, virtualisation. FAT, NTFS and ext4 file systems, directories, security and access rights protection. I / O device management, resource allocation, deadlocks. Architecture of operating systems MS DOS, UNIX, Windows. Computer interconnection, file and host servers, mapping and redirection. Virtualisation.

***

Computer networks:

Introduction to computer networks, methods of connecting to the Internet, packet loss and delay, ISO / OSI reference model, TCP / IP family of protocols. Individual layers of the model: application (application protocols, domain names and DNS), transport (UDP, acknowledged data transmission, TCP, data flow control), network (NAT, ICMP, IPv4, IPv6, routing algorithms), connection ( transmission error detection, multiple access to CSMA / CD and CSMA / CA shared connections, MAC addresses, repeaters, switches, virtual VLANs, ..) and physical (digital and modulated transmission).

Area 2: Optional profile courses:

***************************************

Cryptographic systems and their applications: Conventional symmetric cryptography, DES, AES systems, methods of use, methods and possibilities of cryptanalysis. Asymmetric cryptographic systems RSA, ElGamal, hash functions and digital signature systems. Key generation and distribution, key agreement by Diffie-Hellman exchange, authentication protocols and their vulnerability. Certification, public key management systems.

****

Network and communication security: Security threats in individual communication layers of the Internet. Threat identification and protection options in virtual local area networks, use of the IPv6 protocol, vulnerabilities in transport protocols, security of DHCP and DNS services, e-mail security. Certificates, timestamps, public key management, trust management. Authentication and authorization (Kerberos, Radius systems). Selective security tools (filters), proxy servers, address translation, security gateways, demilitarized zones. Secure SSH, SSL / TLS and IPsec protocols. VPN security.

****

Computer architectures: Processor architecture at the level of digital logic, machine and instruction cycle. Types of machine instructions, procedure for their processing, concatenation, multithreaded processing, parallelization, superscalar and multiprocessor systems. Memory cell, organization of memory matrix, types of memory. I / O gateways, interrupt mechanism, direct memory access. Universal buses for communication with I / O devices. Controller functions, drivers and their integration into the operating system kernel. External memories on the principle of electromagnetic recording, optical recording. Graphic adapters, GPU usage options, monitors, printers, scanners.

***

Operating systems administration: Administration of microkernel operating systems. Communication interfaces, directory structure, devices, user accounts. Installation methods, bootloaders, post-installation configuration, packages, distributions. Creating and mapping partitions, virtual and network file systems, paging. User and group management, access rights, ACLs. System startup and various levels of its run, logs, crontab. Backup. Installation and configuration of network services, DHCP, DNS. System kernel compilation - reasons, preparation, kernel configuration, translation, module installation, testing. Administration of monolithic operating systems. Active Directory configuration and administration, DNS settings, replication, trust configuration, roles and services. Account management, group policies, audit, certification authority and its administration. Network access and service configuration, DHCP, routing, firewall, remote access protection. Configuration and administration of website, FTP server, mail server. Secure SSL and IPsec access, authentication support. Configuration and management of data storage, file system, its backup, printing services. Creating and restoring system images. Distribution installation and activation. Virtualization support, installation and management of virtual machines.

Bachelor Thesis and its Defence

Interdisciplinary applications of informatics

(ÚINF/ANO/15 or ÚINF/AFJ1a/15) and (ÚINF/ASU1/15 or ÚFV/POF1b/99 or ÚFV/UPF1/12) and (ÚINF/UNS1/15 or ÚINF/VKN1/22 or ÚFV/NOT1b/03)

State exam contents

Area 1: Compulsory profile courses:

**************************************

given interface. Inheritance, overlapping methods polymorphism - overlapping and complementing methods of the class can be used. Recursion. Sorting (O and Omega-notation, MinSort - sorting numbers, MinSort - sorting objects, QuickSort, tree in the field, HeapSort, MergeSort). Backtrack (generating variations and the problem of splitting the magnifying glass, backtrack in general and in tasks, trimming the backtrack). Divide and conquer, dynamic programming, principle and examples. Text search (KMP algorithm).

****

Database systems: Principles of database systems and SQL. SQL - working with data, integrity constraints, database model design. Batch operations.

****

Computer networks: Introduction to computer networks, methods of connecting to the Internet, packet loss and delay, ISO / OSI reference model, TCP / IP family of protocols. Individual layers of the model: application (application protocols, domain names and DNS), transport (UDP, acknowledged data transmission, TCP, data flow control), network (NAT, ICMP, IPv4, IPv6, routing algorithms), connection ( transmission error detection, multiple access to CSMA / CD and CSMA / CA shared connections, MAC addresses, repeaters, switches, virtual VLANs, ..) and physical (digital and modulated transmission).

****

Operating systems: Structure and functions of the operating system. Characteristics of OS types and their historical development. Process, process management, allocation strategies, communication between processes, classical competition problems and their solutions (mutual exclusion, deadlock, starvation). Memory management, relocation, segmentation, paging, memory virtualization. I / O device control, system controllers, resource allocation. File, file system, basic system functions for working with files, directories, security and access rights protection.

****

Area 2: Optional profile courses:

**************************************

Automata and formal languages: Basic concepts - alphabet, language, grammar. Chomsky hierarchy of languages and grammars. Finite state machine. Construction of reduced automaton I. Construction of reduced automaton II. Finite-state acceptors Nondeterministic acceptors, subset construction. Machines with epsilon transitions. Removing epsilon transitions. Regular expressions. Methods for solving regular set equations. Regular language class closure properties. Decidable problems in the class of regular languages. Regular views. Two-way finite state machines.

****

Algorithms and data structures: Algorithm analysis, Asymptotic notation, Basic data structures, Data types and abstraction, Stacks and hints, Arranged and sorted lists, Hash and hash tables, Trees, Search trees, Heaps, Sets and partitions, Dynamic space allocation, Sorting algorithms, Graphs and graph algorithms

*****

Non-traditional optimization techniques: Complex systems, emergent behavior. Evolutionary theory and memetics. Application of optimization techniques to complex systems. Use of methods - genetic algorithms, simulated annealing, taboo algorithms and selected problems of biomolecular simulations. Molecular dynamics, protein folding. Population dynamics, metabolic networks and complexity in bioinformatics.

*****

Image analysis: Computer vision. Image collection and storage. Scanning and digitization. Image representations - image space. Color models. Multispectral images. Properties of digital images. Point operations. Local operations. Global operations. Active contours. Segmentation. Textures, selection of symptoms. 3D reconstruction and imaging.

*****

Introduction to neural networks: Linear threshold units, perceptrons, algorithm of learning perceptron rules. Forward neural networks, adaptation process, error backpropagation method. Recurrent neural networks, Hopfield neural networks, their properties, optimization problems using recurrent neural networks. ART neural networks, architecture and phases. Basic stochastic optimization algorithms: blind algorithm, climbing algorithm, forbidden search method. Genetic and evolutionary algorithm, genetic programming.

*****

Computer physics: The essence and meaning of simulations. Ergodicity and quasi-ergodic disturbance. Molecular dynamics method, calculations in NVE, NVT, NPH NPT files. Langevin and Brown dynamics. Monte Carlo method, Metropolis algorithm, calculations in microcanonical, canonical and grand canonical file.

*****

Introduction to Neuroscience: Anatomy and Functions of the Central Nervous System; hierarchy of information processing in sensory, motor and associative areas of the brain. Methods of study in neurosciences and neural data analysis. Neural modeling: types of models and approaches to modeling. Neuron: activation, signal propagation, neural coding and biological neuron models. Synamtic transmission, plasticity and neural learning models. Vision, hearing, language, attention, cross-modal interactions: basic knowledge, models and computational tools for studying these cognitive functions.

Software and information system

ÚINF/ASU1/15 and ÚINF/TVP1/21 and ÚINF/PMO1/15 and ÚINF/SWI1b/15

State exam contents

Area 1: Compulsory profile courses:

**************************************

Algorithms and programming: Class and object as a means of grouping several variables, constructor, overloading methods), composition of objects. Interface as an intuitive means of abstraction, interface as a parameter and reference, array of objects implementing a given interface. Inheritance, overlapping methods polymorphism - overlapping and complementing methods of the class can be used. Recursion. Sorting (O and Omega-notation, MinSort - sorting numbers, MinSort - sorting objects, QuickSort, tree in the field, HeapSort, MergeSort). Backtrack (generating variations and the problem of splitting the magnifying glass, backtrack in general and in tasks, trimming the backtrack). Divide and conquer, dynamic programming, principle and examples. Text search (KMP algorithm).

****

Database systems: Principles of database systems and SQL. SQL - working with data, integrity constraints, database model design. Batch operations.

****

Computer networks. Introduction to computer networks, methods of connecting to the Internet, packet loss and delay, ISO / OSI reference model, TCP / IP family of protocols. Individual layers of the model: application (application protocols, domain names and DNS), transport (UDP, acknowledged data transmission, TCP, data flow control), network (NAT, ICMP, IPv4, IPv6, routing algorithms), connection ( transmission error detection, multiple access to CSMA / CD and CSMA / CA shared connections, MAC addresses, repeaters, switches, virtual VLANs, ..) and physical (digital and modulated transmission).

****

Operating systems. Operating system structure and functions. Characteristics of OS types and their historical development. Process, process management, allocation strategies, communication between processes, classical competition problems and their solutions (mutual exclusion, deadlock, starvation). Memory management, relocation, segmentation, paging, memory virtualisation. I / O device control, system controllers, resource allocation. File, file system, basic system functions for working with files, directories, security and access rights protection.

****

Area 2: Optional profile items

***************************************

Business process modelling: Theoretical foundations of process modelling. Petri nets. Process orchestration. Process choreography. Process model architectures. Methodologies and standards.

****

Software Engineering: Software Processes. Basics of project management. SW application architecture. Software development methodologies. SW verification and validation. Resource planning and control. UML modelling - syntax and semantics of individual diagrams. Basics of MDA. Basic legal aspects of SW engineering. Design patterns.