ICNA1. Course code. Lesson. Type of course. Level of course. Bc

Course title Course code

CISCO Networking Academy I KST/ICNA1

Type of course

Lesson

Level of course

Bc.

Year of study Semester Number of credits Language

0 ZS 2 CZ

Name of lecturer * Horálek Josef, Mgr. * Fidler Tomáš, Ing.

Objective 4 semestr long course CCNA Exploration teaches networking based on technology, covering networking concepts using a top-down, theoretical, and integrated approach ? from network applications to the network protocols and services provided to those applications by the lower layers of the network. CCNA Exploration includes the following features: * Students learn the basics of routing, switching, and advanced technologies to prepare for Cisco CCNA certification and entry-level networking careers * The curriculum discusses networking concepts in depth and uses language that allows for integration with engineering concepts, providing a deep, theoretical understanding of networking concepts for experienced learners with advanced problem-solving and analytical skills. * Courses emphasize critical thinking, problem solving, collaboration, and the practical application of skills * Rich multimedia content, including Flash-based interactive activities, videos, games, and quizzes, addresses a variety of learning styles and help stimulate learning and increase knowledge retention * Hands-on labs and Packet Tracer simulation-based learning activities help students develop critical thinking and complex problem solving skills * Innovative assessments provide immediate feedback to support the evaluation of knowledge and acquired skills * Provides students with the skills needed to succeed in networking-related degree programs This course introduces the architecture, structure, functions, components, and models of the Internet and other computer networks. It uses the OSI and TCP layered models to examine the nature and roles of protocols and services at the application, network, data link, and physical layers. The principles and structure of IP addressing and the fundamentals of Ethernet concepts, media, and operations are introduced to provide a foundation for the curriculum. Labs use a ?model Internet? to allow students to analyze real data without affecting production networks. Packet Tracer (PT) activities help students analyze protocol and network operation and build small networks in a simulated environment. At the end of the course, students build simple LAN topologies by applying basic principles of cabling, performing basic configurations of network devices such as routers and switches, and implementing IP addressing schemes.

Prerequisities

Course contents * Living in a Network-Centric World * Communicating Over the Network * Application Layer Functionality and Protocols * OSI Transport Layer * OSI Network Layer * Addressing the Network ? IPv4 * Data Link Layer

* OSI Physical Layer * Ethernet * Planning and Cabling Networks * Configuring and Testing Your Network

Teaching methods Metody práce s textem (učebnicí, knihou), Demonstrace, Nácvik dovedností, Laborování, Aktivizující (simulace, hry, dramatizace), Coordinated practice

Assesment methods Analýza výkonu studenta

Recommended reading * Materiály kurzu CCNA-exploration.


CISCO Networking Academy II KST/ICNA2

Type of course

Lesson

Level of course

Bc.


0 LS 2 CZ


Objective 4 semestr long course CCNA Exploration teaches networking based on technology, covering networking concepts using a top-down, theoretical, and integrated approach ? from network applications to the network protocols and services provided to those applications by the lower layers of the network. CCNA Exploration includes the following features: * Students learn the basics of routing, switching, and advanced technologies to prepare for Cisco CCNA certification and entry-level networking careers * The curriculum discusses networking concepts in depth and uses language that allows for integration with engineering concepts, providing a deep, theoretical understanding of networking concepts for experienced learners with advanced problem-solving and analytical skills. * Courses emphasize critical thinking, problem solving, collaboration, and the practical application of skills * Rich multimedia content, including Flash-based interactive activities, videos, games, and quizzes, addresses a variety of learning styles and help stimulate learning and increase knowledge retention * Hands-on labs and Packet Tracer simulation-based learning activities help students develop critical thinking and complex problem solving skills * Innovative assessments provide immediate feedback to support the evaluation of knowledge and acquired skills * Provides students with the skills needed to succeed in networking-related degree programs This course describes the architecture, components, and operation of routers, and explains the principles of routing and routing protocols. Students analyze, configure, verify, and troubleshoot the primary routing protocols RIPv1, RIPv2, EIGRP, and OSPF. By the end of this course, students will be able to recognize and correct common routing issues and problems. Students complete a basic procedural lab, followed by basic configuration, implementation, and troubleshooting labs in each chapter. Packet Tracer activities reinforce new concepts, and allow students to model

and analyze routing processes that may be difficult to visualize or understand.

Prerequisities KST/ICNA1 Course contents * Introduction to Routing and Packet Forwarding * Static Routing * Introduction to Dynamic Routing Protocols * Distance Vector Routing Protocols * RIP Version 1 * VLSM and CIDR * RIPv2 * The Routing Table: A Closer Look * EIGRP * Link-State Routing Protocols * OSPF


Assesment methods Analýza výkonu studenta



CISCO Networking Academy III KST/ICNA3

Type of course

Lesson

Level of course

Bc.


0 ZS 2 CZ


Objective 4 semestr long course CCNA Exploration teaches networking based on technology, covering networking concepts using a top-down, theoretical, and integrated approach ? from network applications to the network protocols and services provided to those applications by the lower layers of the network. CCNA Exploration includes the following features: * Students learn the basics of routing, switching, and advanced technologies to prepare for Cisco CCNA certification and entry-level networking careers * The curriculum discusses networking concepts in depth and uses language that allows for integration with engineering concepts, providing a deep, theoretical understanding of networking concepts for experienced learners with advanced problem-solving and analytical skills. * Courses emphasize critical thinking, problem solving, collaboration, and the practical application of skills * Rich multimedia content, including Flash-based interactive activities, videos, games, and quizzes, addresses a variety of learning styles and help stimulate learning and increase knowledge retention * Hands-on labs and Packet Tracer simulation-based learning activities help students develop critical thinking and complex problem solving skills * Innovative assessments provide immediate feedback to support the evaluation of knowledge and acquired skills * Provides students with the skills needed to succeed in networking-related degree programs This course provides a comprehensive, theoretical, and practical approach to learning the technologies and protocols needed to design and implement a converged switched network. Students learn about the hierarchical network design model and how to select devices for each layer. The course explains how to configure a switch for basic functionality and how to implement Virtual LANs, VTP, and Inter-VLAN routing in a converged network. The different implementations of Spanning Tree Protocol in a converged network are presented, and students develop the knowledge and skills necessary to implement a WLAN in a small-to-medium network.

Prerequisities KST/ICNA2 Course contents LAN Design Basic Switch Concepts and Configuration VLANs VTP STP Inter-VLAN Routing


Assesment methods Posouzení zadané práce, Rozhovor



CISCO Networking Academy IV KST/ICNA4

Type of course

Lesson

Level of course

Bc.


0 LS 2 CZ


Objective 4 semestr long course CCNA Exploration teaches networking based on technology, covering networking concepts using a top-down, theoretical, and integrated approach ? from network applications to the network protocols and services provided to those applications by the lower layers of the network. CCNA Exploration includes the following features: * Students learn the basics of routing, switching, and advanced technologies to prepare for Cisco CCNA certification and entry-level networking careers * The curriculum discusses networking concepts in depth and uses language that allows for integration with engineering concepts, providing a deep, theoretical understanding of networking concepts for experienced learners with advanced problem-solving and analytical skills. * Courses emphasize critical thinking, problem solving, collaboration, and the practical application of skills * Rich multimedia content, including Flash-based interactive activities, videos, games, and quizzes, addresses a variety of learning styles and help stimulate learning and increase knowledge retention * Hands-on labs and Packet Tracer simulation-based learning activities help students develop critical thinking and complex problem solving skills * Innovative assessments provide immediate feedback to support the evaluation of knowledge and acquired skills * Provides students with the skills needed to succeed in networking-related degree programs This course discusses the WAN technologies and network services required by converged applications in enterprise networks. The course uses the Cisco Network Architecture to introduce integrated network services and explains how to select the appropriate devices and technologies to meet network requirements. Students learn how to implement and configure common data link protocols and how to apply WAN security concepts, principles of traffic, access control, and addressing services. Finally, students learn how to detect, troubleshoot, and correct common enterprise network implementation issues.

Prerequisities KST/ICNA3 Course contents * Introduction to WANs * PPP

* Frame Relay * Network Security * ACLs * Teleworker Services * IP Addressing Services * Network Troubleshooting


Assesment methods Písemná zkouška, Analýza výkonu studenta



Data Structures KST/IDATS

Type of course

Lecture + Lesson

Level of course

Bc.


0 LS 6 CZ

Name of lecturer * Kavička Antonín, doc. Ing. Ph.D. * Šimerda Karel, Ing. * Hřídel Jan, Ing. * Fikejz Jan, Ing.

Objective The main goal of the course is to familiarize students with the elementary data structures and relevant algorithms as essentials of the efficient programming. Passing the course enables to manage elementary abstract data types, their applications and efficient implementations, which support creation of high-quality software products.

Prerequisities Course contents Abstract data types a their specification. Computational complexity of algorithms. Memory management. Set as an abstract data type. Linear data structures: Arrays, Lists, Stacks, Queues. Tree data structures: Unary tree, Binary tree, K-way tree (ordered, unordered). Priority queue and its implementations (using Lists, Binary heaps etc.). Data type Table and its elementary implementations (using Lists, Arrays, Binary search trees, Hashing techniques etc.). Table sorting algorithms (Quicksort, Heapsort, Mergesort, Radixsort etc.). Data type Graph and its basic vertex-oriented and edge-oriented implementations. Organization and principles of block oriented random access files.

Teaching methods Monologická (výklad, přednáška, instruktáž), Dialogická (diskuze, rozhovor, brainstorming), Nácvik dovedností

Assesment methods Ústní zkouška, Písemná zkouška, Posouzení zadané práce

Recommended reading * Cenek, Klima, Janáček:. Optimalizace dopravních a spojových procesů.. Žilina, Univerzita Žilina, 1994. ISBN 80-7100-197-X. * Cormen, T. H. et al. Introduction to algorithms. Boston: MIT Press, 2001. ISBN 0-262-03293-7. * Lewis, H. R., Denenberg, L. Data structures and their algorithms. Berkley, Adison-Wesley, 1997. ISBN 9780673397362. * Volek, J. Operační výzkum I, skripta DFJP. Pardubice, 2002. ISBN 80-7194-410-6. * Wirth, N.:. Algoritmy a štruktúry údajov, Alfa 1975. * Wróblewski, P. Algoritmy, datové struktury a programovací techniky. Computer Press, Praha, 2004. ISBN

80-251-0343-9.


Selected subjects from algorithms and data structures KST/IDSDS

Type of course

no contact

Level of course

Ph.D.


0 ZS+LS 0 CZ

Name of lecturer * Kavička Antonín, doc. Ing. Ph.D.

Objective The main goal of the course is to familiarize the students with the selected parts of advanced data structures and relevant algorithms, which are applicable to designing and effective implementations of the software solutions utilized within control and information systems. Passing the course supports the skills related to analysis and effective implementations of the software solutions utilized within control and information systems.

Prerequisities Course contents The content of the course is focused mainly on the basic concepts and applications of advanced data structures and algorithms from the following fields: interval and multi-dimensional searching (k-D trees, priority search trees, interval trees, quad and octal trees, grid files), hash tables (static hash tables, hash files with dynamic hashing) and multiindexed files (files with dense indices, inverted files).



Recommended reading * CORMEN, H. a kol. Introduction to algorithms. Boston, MIT Press, 2001.. * GOODRICH, M. T.; TAMASSIA, R. Algorithm Design. Hoboken (NJ), John Wiley & Sons, 2002.. * LEWIS, H. R.; DENENBERG, L. Data structures and their algorithms. Berkley, Adison-Wesley, 1997..


Discrete simulation of technological processes KST/IDSTP

Type of course

no contact

Level of course

Ph.D.


0 ZS+LS 0 CZ


Objective The main goal of the course is to familiarize students with the concepts and approaches, which are applicable to modelling and discrete simulation of operational technological processes. Passing the course supports the skills related to analysis, design and verification of technological processes.

Prerequisities Course contents The content of the course is focused mainly on the formalism of coloured Petri nets (hierarchical and nonhierarchical), which is suitable for the construction of models reflecting generalized technological processes. Such models can be properly analyzed, verified and are also ready for the realizations of relevant simulation experiments (reflecting particular input conditions).



Recommended reading * BANKS, J. Handbook of simulation & Sons. New York, John Wiley, 1998.. * JENSEN, K. Coloured Petri nets. Berlin, Springer-Verlag, 1996.. * ZEIGLER, B. P. a kol. Theory of modeling and simulation. New York, Academic Press, 2000..


Information and Control Systems in Practise KST/IIRSP

Type of course

Lecture + Lesson

Level of course

Bc.


0 LS 3 CZ

Name of lecturer * Šotek Karel, prof. Ing. CSc.

Objective The main goal of the course is to familiarize students with the history, building up and applications of information and control systems in practice. Passing the course enables to manage elementary methodologies related to application of control and information systems in practice.

Prerequisities Course contents HW and SW technologies. Computer networks and services. Information and control systems linked with operational systems. Real-time information systems. Geographical information systems, GPS. Integration of information systems. Perspectives of information systems. Demonstrations, excursions.



Recommended reading * Přednášky a podklady pro semináře ve STAG. * Moos, P.,Malinovský, M. Informační systémy a technologie, ČVUT Praha, 2001. * Šotek, K. Výpočetní technika a informatika v dopravě. Pardubice : Univerzita Pardubice, 1999. ISBN 807194-230-8.


Modelling and simulation KST/IMOSI

Type of course

Lecture + Lesson

Level of course

Bc.


0 ZS 5 CZ

Name of lecturer * Kavička Antonín, doc. Ing. Ph.D. * Novosvětský Miroslav, Bc. * Bažant Michael, Ing. Ph.D.

Objective The main goal of the course is to familiarize students with the elementary principles related to experimental method of modelling & discrete simulation on digital computers. Passing the course enables to manage fundamental approaches related to experimental method of discrete simulation and its applications.

Prerequisities Course contents Introduction to basic notions from the filed of Modelling and Simulation (simulation model, discrete event, simulation time).Simulation models and their classification.Monte Carlo method Architectures of simulation models and fundamental synchronisation techniques (planning discrete events, interaction of processes, scanning activities). Management of simulation study/project Input data analysis - stochastic versus deterministic approach, statistical elaborations, meta-models, generators of pseudo-random numbers. Simulation experiments and output data analysis, finite-horizon simulations (replications), steady-state simulations. Case study - simulation model of a queuing system. Synchronization of combined discrete-continuous simulation models. Online animation approach.



Recommended reading * Banks, J. Handbook of Simulation: Principles, Methodology, Advances, Applications, and Practice. New York, John Wiley & Sons, 1998. ISBN 0-471-13403-9. * Kavička, A., Klima, V., Adamko, N. Agentovo orientovaná simulácia dopravných uzlov. Žilina, vydavatelství EDIS Žilinské univerzity, 2005. ISBN 80-8070-477-5. * Kelton, W. et al. Simulation with Arena. New York, McGraw-Hill, 2004. ISBN 0-07-285694-7.


Diploma work KST/INDIP

Type of course

Lesson

Level of course

Mgr.

Year of study

0

Semester

LS

Number of credits

15

Language

CZ


Objective Aim is, to student evidence, that the not only coped mull over material in requisite range, but at the same time these knowledge will prove use for independent work at solving choice special problem. Students topics washing pick out along 3. semester from offers, present UEI. Mastered defences diploma work.

Prerequisities Course contents Work student on choice subject proceeds above all form independent housework. On top take into account tuitions student with leadership diploma work work or with next pedagogues or with specialists from practice in full extent approximately 14 o'clock behind semester.

Teaching methods Dialogická (diskuze, rozhovor, brainstorming)

Assesment methods Ústní zkouška, Posouzení zadané práce, Analýza výkonu studenta

Recommended reading * CISCO SYSTEMS. Cisco Networking Academy Program - 1.-2. a 3.-4. díl, Indianapolis. USA, 2005.


Diploma seminar KST/INDIS

Type of course

Lesson

Level of course

Mgr.


0 LS 2 CZ

Name of lecturer * Šotek Karel, prof. Ing. CSc.

Objective Essential attention is paid to training effective presentation skills focused on the current cases of master thesis. Passing the course enables to manage elementary methodologies related to presentations of realized works or projects namely related to the field of information technologies.

Prerequisities Course contents Elementary rules of technical presentations. Developing presentation style. Dealing with presentation nerves. Working for the audience. Structuring effective presentations . Developing as a presenter. Presenting concrete technical topic.

Teaching methods Nácvik dovedností

Assesment methods Posouzení zadané práce

Recommended reading * CISCO SYSTEMS. Cisco Networking Academy Program - 1.-2. a 3.-4. díl, Indianapolis. USA, 2005.


Data Structures and Algorithms KST/INDSA

Type of course

Lecture + Lesson

Level of course

Mgr.


0 LS 5 CZ


Objective The main goal of the course is to familiarize students with advanced data structures and relevant algorithms as essentials of sophisticated software applications. Passing the course enables to manage advanced data structures, their applications and efficient implementations, which support creation of high-quality software products.

Prerequisities Course contents String encoding (Huffman encoding trees, Lempel-Ziv encodings) Data type String and searching algorithms (Knuth-Morris-Pratt algorithm, Karp-Rabin algorithm, string-matching automaton) Rrefix trees (trie) and their implementations (de la Briandais tree) Advanced heaps (Binomial heap, Fibonacci heap, Pairing heap) and their implementations Table implementations using search trees (AVL-tree, Treap, Splay-tree, 2-3 tree, (a-b)-tree, B-tree) Data structures stored within external memory (block transfers, buffers) Sequential files and random access files Heap-files and hash-files Ordered files and indexed sequential files Hierarchical organization of indexed files (B+-tree) Dense multi-indexed files



Recommended reading * Cenek, P., Klima, V., Janáček, J. Optimalizace dopravních a spojových procesů. Žilina, 1994. ISBN 80-7100197-X. * Cormen, T. H. et al. Introduction to algorithms. Boston: MIT Press, 2001. ISBN 0-262-03293-7. * Lewis, H. R., Denenberg, L. Data structures and their algorithms. Berkley, Adison-Wesley, 1997. ISBN 9780673397362. * Volek, J. Operační výzkum I, skripta DFJP. Pardubice, 2002. ISBN 80-7194-410-6. * Wirth, N. Algoritmy a štruktúry údajov. Bratislava, Alfa, 1988. * Wróblewski, P. Algoritmy, datové struktury a programovací techniky. Computer Press, Praha, 2004. ISBN 80-251-0343-9.


Compilers KST/INKOM

Type of course

Lecture + Lesson

Level of course

Mgr.


0 LS 5 CZ

Name of lecturer * Benedikovič Miroslav, RNDr.

Objective Goal is an explanation foundations theory languages and grammars for students. This theory is used for making compilers and text analyzers writed in source code. Another goal is explaining methodics of creation compiler by construction concrete simple analyzer. Student will learn to make compilers and analyzer of text writed in source code.

Prerequisities Course contents Concept of language and grammar. Chomsky classifying of grammar and language hierarchy . Finite automaton and regular grammar - relations. Facilities of regular languages. Regular expression. Searching of lexem, using of symbol table (binary tree, hashing) Syntax tree. Finite status automaton, building of scanner. Context-free grammar and stack automata - relations. Facilities of context-free languages. Syntax Tree derivation. Single precedential grammar. LL and LR languages and their facilities. LL(1) language, elimination of straight left recursion and left factorization. Account of set FIRST and FOLLOW. Deterministic stack automata. Building of parser. Parsing of declaration, expression, program and routine. Semantic analysis. Target language, interpreting, creating of target code.

Teaching methods Monologická (výklad, přednáška, instruktáž), Dialogická (diskuze, rozhovor, brainstorming), Metody samostatných akcí, Demonstrace

Assesment methods Ústní zkouška, Posouzení zadané práce, Didaktický test

Recommended reading * Aho, A. V., Sethi, R., Ullmann, J. D. Compilers, Principles, Techniques, and Tools. Berkley: Addison-Wesley Publishing Company, 2006. ISBN 0-201-10088-6. * Benedikovič, M. Učební texty: Gramatiky, jazyky a kompilátory . * Hopcroft, J. E., Ullmann, J. D. Formální jazyky a automaty. ALFA, Bratislava, 1978. ISBN 63-096-78. * Louden, Keneth C. Compiler Construction - Principles and Praktice. Boston, PWS Publishing Comp., 1997.

* Mak, R. Writing Compilers & Interpreters. New York, John Wiley & Sons, 1991.


Database System Design KST/INPDS

Type of course

Lecture + Lesson

Level of course

Mgr.


0 LS 4 CZ

Name of lecturer * Karamazov Simeon, prof. Ing. Dr. * Lach Jaroslav, Ing.

Objective In this course the students learn to design large information and database systems in an object-oriented environment. Based on an existing design model the students learn to create a set of design models using the UML and Unified Process. The students also learn other aspects of database systems projects such as planning, project organiation, configuration and version management, iterative approach and testing. Ability to create a high-quality object-oriented system model using the principles of object-oriented design. Knowledge of and ability to use design patterns. Knowledge of and ability to apply the Design activities of UP. Ability to organize and plan a database system project. Ability to create and use a system for configuration and version management. Ability to design and execute different sorts of tests.

Prerequisities Course contents Principles of object-oriented design. Application architecture design. Design of the structure and the behaviour of the application. Design patterns. Transformation of the object-oriented model into a relational data model. Organization of a project according to UP. Project planning. Configuration and version management. Testing.

Teaching methods Monologická (výklad, přednáška, instruktáž), Dialogická (diskuze, rozhovor, brainstorming), Metody práce s textem (učebnicí, knihou), Metody samostatných akcí, Nácvik dovedností


Recommended reading

* Arlow, J., Neustadt, I. UML 2 a unifikovaný proces vývoje aplikaci. Brno, Computer Press, 2007. ISBN 97880-251-1503-9. * C. J. Date. An Introduction to the Database systemsAddison Wesley, 8th edition, 2004. Addison Wesley, 8th edition, 2004. * Dennis, Haley-Wixom, Tegarden. Systems Analysis And Design With UML Version 2.0.. Wiley, 2nd edition, 2005. * Page-Jones M. Základy objektově orientovaného návrhu v UML. GRADA, 2001. ISBN 80-247-0210-X. * Whitten, Bentley, Dittman. Systems Analysis & Design Methods. McGrawHill, 6th edition, 2004.


Computer graphics 2D KST/INPG2

Type of course

Lecture + Lesson

Level of course

Mgr.


0 LS 5 CZ

Name of lecturer * Fribert Miroslav, Ing. Dr. * Veselý Petr, Ing.

Objective Aim of the course is to gain knowledge to create advanced graphics applications. Acquaint students with advanced techniques and algorithms of computer graphics. Acquiring knowledge for creating graphical applications in the development environment of MS Visual Studio using library GDI+ and C# language. After finishing the course the student is able to create advanced graphical applications for display of raster and vector objects. Student is able develop graphics applications using MS Visual Studio, graphical means of GDI+ library and language C#. Student is able to implement more ambitious methods and algorithms of computer graphics.

Prerequisities Course contents Create graphics applications, tools and methods of GDI+ (MS Visual Studio, C# language). Raster image display and adjustment raster image. Vector defined base, vector graphics. Triangulation method. Cartographic display. Animation.

Teaching methods Monologická (výklad, přednáška, instruktáž), Demonstrace, Projekce, Nácvik dovedností

Assesment methods Ústní zkouška, Písemná zkouška

Recommended reading * Prezentace přednášek a materiály ke cvičení.

* Petzold, Ch. Programování Microsoft Windows v jazyce C#. SoftPress, 2003. ISBN 8086497542.


Post-relational database systems KST/INPOD

Type of course

Lecture + Lesson

Level of course

Mgr.


0 ZS 4 CZ

Name of lecturer * Lach Jaroslav, Ing.

Objective The goal of this course is to present the possible directions of the future developments of the database systems. The focus of the course is on the object and object-relational databases based on the relational model. Ability to use and apply different sorts of database systems Ability to compare database systems based on different models, knowledge of their advantages and disadvantages Ability to choose the most appropriate database system depending on de sort of the software to be made

Prerequisities Course contents Fundamentals of the object-oriented database systems Databse system db4objects as an example of an object-oriented database system Relational database systems, relational model and relational algebra Modeling of complex objects and inheritance in the relational model D Languages and language TutorialD as an example of an implementation of a D language

Teaching methods Monologická (výklad, přednáška, instruktáž)


Recommended reading * Dokumentace produktu Dataphor. * Dokumentace produktu db4objects. * http://www.thethirdmanifesto.com/. * C. J. Date. An Introduction to the Database systemsAddison Wesley, 8th edition, 2004. Addison Wesley, 8th edition, 2004. * C. J. Date, H. Darwen. Databases, types and the relational model, Addison Wesley; 3 edition, 2006.


Year´s Project KST/INPRO

Type of course

Lesson

Level of course

Mgr.


0 ZS 4 CZ

Name of lecturer * Dvořák Tomáš, Ing.

Objective The main goal of the course is to train designing skills needed within projects focused on software development. There is expected creative application of UML methodology, which supports high-quality design software products. Passing the course enables to manage essential skills related to practical development of software products.

Prerequisities Course contents Requirements specification a Use Case diagrams. Analysis and design of static system structure - class diagrams. Analysis and design of dynamic behaviour. State model - object behaviour. Process modelling - activity diagrams. System deployment - deployment and components diagrams. Project management, application of increment life cycle. System documentation.



Recommended reading * ARLOW, J., NEUSTADT, I. UML 2 a. unifikovaný proces vývoje aplikaci. Brno, Computer Press, 2007.. * Schmuller, J. Myslíme v jazyku UML. Praha, Grada, 2001.. Praha, Grada, 2001. ISBN 80-247-0029-8.


Designing of software systems KST/INPSW

Type of course

Lecture + Lesson

Level of course

Mgr.


0 ZS 4 CZ

Name of lecturer * Dušek František, doc. Ing. CSc. * Veselý Petr, Ing. * Šimerda Karel, Ing.

Objective The goal of the subject is to acquaint the students with the process of the design of software applications and extensive information systems in object environment with emphasis on: object models, methodology processes and handling a corresponding tool. After completing the course the students will be able to understand UML (Unified Modeling Language) and will be able to apply it in practice for the system designeing including handling the methods for planning and control of iterative development process withing a project team. Students will be familiar with system object analysis by the basic UML diagrams.

Prerequisities Course contents What is UML? What is the Unified Process? Requirements. Use case modelling. Advanced use case modelling. Analysis. Object and classes. Finding analysis classes. Relationships. Inheritance and polymorphism. Analysis packages. Use case realization. Advanced use case realization. Activity diagrams.

Teaching methods Monologická (výklad, přednáška, instruktáž), Dialogická (diskuze, rozhovor, brainstorming)

Assesment methods Ústní zkouška, Rozbor díla tvůrčího charakteru, Rozhovor

Recommended reading * Arlow, J., Neustadt, I. 2 and the Unified Process: Practical Object-Oriented Analysis and Design, 2/E. Addison-Wesley Professional, 2005. ISBN 978-0321321275.

* Alistair Cockburn. Use Cases - Jak efektivně modelovat aplikace. Computer Press, 2004. ISBN 80-2510721-3. * Arlow, J., Neustadt, I. UML 2 a unifikovaný proces vývoje aplikaci. Brno, Computer Press, 2007. ISBN 97880-251-1503-9. * Kanisová H., Muller M. UML srozumitelně. Brno, 2004. ISBN 80-251-0231-9. * Page-Jones M. Základy objektově orientovaného návrhu v UML. GRADA, 2001. ISBN 80-247-0210-X. * Schmuller, J. Myslíme v jazyku UML. Praha, Grada, 2001.. Praha, Grada, 2001. ISBN 80-247-0029-8.


Modelling and simulation KST/INSIE

Type of course

Lecture + Lesson

Level of course

Mgr.


0 ZS 5 CZ

Name of lecturer * Kavička Antonín, doc. Ing. Ph.D. * Bažant Michael, Ing. Ph.D.

Objective The main goal of the course is to familiarize students with the elementary principles related to experimental method of modelling & discrete simulation on digital computers. Passing the course enables to manage fundamental approaches related to experimental method of discrete simulation and its applications.

Prerequisities Course contents Introduction to basic notions from the filed of Modelling and Simulation (simulation model, discrete event, simulation time). Simulation models and their classification. Monte Carlo method. Architectures of simulation models and fundamental synchronisation techniques (planning discrete events, interaction of processes, scanning activities). Management of simulation study/project. Input data analysis - stochastic versus deterministic approach, statistical elaborations, meta-models, generators of pseudo-random numbers. Simulation experiments and output data analysis, finite-horizon simulations (replications), steady-state simulations . Case study - simulation model of a queuing system. Synchronization of combined discrete-continuous simulation models. On-line animation approach.



Recommended reading * Banks, J. Handbook of Simulation: Principles, Methodology, Advances, Applications, and Practice. New York, John Wiley & Sons, 1998. ISBN 0-471-13403-9. * Kavička, A., Klima, V., Adamko, N. Agentovo orientovaná simulácia dopravných uzlov. Žilina, vydavatelství EDIS Žilinské univerzity, 2005. ISBN 80-8070-477-5. * Kelton, W. et al. Simulation with Arena. New York, McGraw-Hill, 2004. ISBN 0-07-285694-7.


Advanced techniques of model. and simul. KST/INTMS

Type of course

Lecture + Lesson

Level of course

Mgr.


0 ZS 5 CZ

Name of lecturer * Kavička Antonín, doc. Ing. Ph.D. * Bažant Michael, Ing. Ph.D.

Objective The main goal of the course is to familiarize students with advanced techniques and approaches of discrete and continuous simulation on digital computers as well as with exploitations of those experimental methods within the frame of different application domains. Passing the course enables to manage advanced simulation techniques and design & construction of simulation models.

Prerequisities Course contents Agent-based architecture of simulation models (decomposition of the model into autonomous components, differences in comparison with event-driven and process-driven architectures). Real-time/on-line simulation (operational planning - reactive versus pro-active approach). Distributed simulation (conservative and optimistic synchronization methods). Petri nets (P/T Petri nets, coloured Petri nets, formal description related to components of simulation model). Application of artificial intelligence within simulation of systems. Principles of theory of continuous dynamical systems. Definition of continuous dynamical systems and relevant solving methods. Numerical methods applied within continuous simulation of dynamical systems. Fundamental types of regulation functions. Stability of dynamical system solution. State space analysis and synthesis . Integrated environment of MATLAB tool, module SIMULINK and its utilization for continuous simulation and modelling of dynamic systems.


Assesment methods

Ústní zkouška, Písemná zkouška, Posouzení zadané práce

Recommended reading * Dušek, F. MATLAB A SIMULINK. Úvod do používání.. Pardubice, 2005. ISBN 80-7194-776-8. * Kavička, A., Klima, V., Adamko, N. Agentovo orientovaná simulácia dopravných uzlov. Žilina, vydavatelství EDIS Žilinské univerzity, 2005. ISBN 80-8070-477-5. * Kelton, W. et al. Simulation with Arena. New York, McGraw-Hill, 2004. ISBN 0-07-285694-7.


Object Oriented Programming KST/IOOP

Type of course

Lecture + Lesson

Level of course

Bc.


0 ZS 5 CZ

Name of lecturer * Kavička Antonín, doc. Ing. Ph.D. * Kleprlíková Zuzana, Ing. * Šilar Zdeněk, Ing. * Šimerda Karel, Ing.

Objective This course provides students with theory of OOP and practical abilities to develop programs in object oriented programming language Java. Students will be familiar with system object analysis by the basic UML diagrams. He/she will be also capable of implementing well structured program using object oriented approach.

Prerequisities Course contents The basic terms of OOP theory, object, message, methods, attribute The class, different views of the class The date type of class and the instance of class Relations between classes, inherence, association, agregation Polymorphis, virtual methods Software Engineering, basic diagrams UML

Teaching methods Monologická (výklad, přednáška, instruktáž), Dialogická (diskuze, rozhovor, brainstorming), Demonstrace

Assesment methods Rozbor díla tvůrčího charakteru, Rozhovor

Recommended reading * Arlow, J., Neustadt, I. UML a unifikovaný proces vývoje aplikací. Praha: Computer Press. ISBN 80-7226-947X.

* Bruce Eckel. Myslíme v jazyku Java 1.díl, knihovna programátora. Grada, 2000. ISBN 80-247-9010-6. * Bruce Eckel. Myslíme v jazyku Java 2.díl, knihovna zkušeného programátora. Grada, 2000. ISBN 80-2470027-1. * Horton, I. Java 5. Praha: Neocortex, s.r.o. ISBN 80-86330-12-5. * Meilir Page-Jones. Základy objektově orientovaného návrhu v UML. Grada, 2001. ISBN 80-247-0210-X. * Rudolf Pecinovský. Návrhové vzory. Computer Press, 2007. ISBN 978-80-251-1582-4. * Sharon Zakhour, Scott Hommel, Jacob Royal, Isaac Rabinovitch, Tom Risser, Mark Hoeber. JAVA 6 Výukový kurz. null. Computer Press, 2007. ISBN 978-80-251-1575-6.


Algorithmization and programming practicum KST/IPALP

Type of course

Lesson

Level of course

Bc.


0 LS 2 CZ

Name of lecturer * Bažant Michael, Ing. Ph.D. * Neradová Soňa, Ing. * Doležel Petr, Ing. * Kleprlíková Zuzana, Ing. * Šimerda Karel, Ing.

Objective Aim of the subject is to improve and practice subject matter of the subject Basics of algorithmization and Basics of programming. The subject is designated for students who do not have sufficient experience with algorithmization and programming. Algorithmization of problems, programming in Java.

Prerequisities Course contents Introduction to development environment, basic program structure, arrays, program inputs and outputs, basic programming techniques.

Teaching methods Monologická (výklad, přednáška, instruktáž), Dialogická (diskuze, rozhovor, brainstorming), Demonstrace, Projekce, Nácvik dovedností

Assesment methods Posouzení zadané práce, Analýza výkonu studenta, Rozbor produktů pracovní činnosti studenta, Rozhovor

Recommended reading * HEROUT P. Učebnice jazyka Java. České Budějovice: Kopp, 2006. 349 s. ISBN 80-7232-115-3.. null. null, null. ISBN null. * TAUFER, I., HRUBINA, J., TAUFER, J.:. Algoritmy a algoritmizace: vývojové diagramy, sbírka řešených příkladů. Pardubice: Univerzita Pardubice, 2001.. Kopp, České Budějovice, 1997. ISBN 80-901342-2-X.


Computer Graphics KST/IPOGR

Type of course

Lecture + Lesson

Level of course

Bc.


0 ZS 6 CZ

Name of lecturer * Fribert Miroslav, Ing. Dr. * Veselý Petr, Ing. * Kopecký Zbyněk, Ing. * Benedikovič Miroslav, RNDr.

Objective This course aims to familiarise students with the fundamental and the most practically used algorithms and methods of the computers graphics including scan conversion of geometric primitives, 2D and 3D geometric transformations, clipping and filling, algorithms for visible surface determination, use of raster and vector graphics, demonstration of common image formats and next. The accent is given to the implementation of selected algorithm in Java language. After finishing the course the student is able to create simple graphical applications for display of raster and vector objects and applications for a basic adjustment of raster images. Student is able to use basic graphics instrument supported by the graphics library of Delphi. Student is able to implement the selected methods and algorithms of computer graphics.

Prerequisities Course contents null

Teaching methods Monologická (výklad, přednáška, instruktáž), Demonstrace, Projekce, Nácvik dovedností

Assesment methods Ústní zkouška, Písemná zkouška

Recommended reading * Murray, J. D., Ryper, W. Encyklopedie grafických formátů II. Brno, Computer Press, 2000. ISBN 80-7226033-2. * Sobota, B. Počítačová grafika a jazyk C. České Budějovice, Kopp, 1995. ISBN 80-85828-52-9. * Žára, J. a kol. Počítačová grafika, principy a algoritmy. Praha, Grada, 1992. ISBN 80-85424-54-1. * Žára, J., Beneš, B., Sochor, J., Felkel, P. Moderní počítačová grafika. Brno, Computer Press, 2004. ISBN 80-251-0454-0.


Computer Networks II KST/IPS2

Type of course

Lecture + Lesson

Level of course

Bc.


0 LS 4 CZ

Name of lecturer * Fidler Tomáš, Ing. * Horálek Josef, Mgr.

Objective Goal of this course is to bring deeper understanding of routing principles, how finding of remote network is done and how to choose the best route under united administration entity, routing algorithms and to acquire related skills. Gained skills are oriented for successful administration of small and medium sized companies. After completing this course, students will have theoretical knowledges about architecture, concepts and tasks of switch, deep knowledge about architecture of enterprise networks, and basic management of this networks. Students should be able to aplly gained skills for analysis, configurations and validating basic faults and setting in enterprise networks.

Prerequisities Course contents History routed networks. Structure in terms of packet routers and router operations on the link layer. The role of routers in the network architecture, routers Addressing over packet networks. Different ways of addressing, classfull addressing, subnetting, VLSM and CIDR, and their influence on the search path networks. Routing, ways to implement the routing table, diagnostics and trouble-shooting. Management of routing tables. Dynamic routing protocols, reasons, advantages, disadvantages, administrative distance and metrics, classification and main characteristics of routing protocols Distance-vector routing protocols to their characteristics and problems Routing Information Protocol, history, characteristics, data structures, configuration, implementation. RIP version 2, characteristics, data structures, method of communication, configuration, troubleshooting, authentication in routing protocols, automatic summarization EIGRP, characteristics, data structures, identifying metrics, communication method, algorithm DUAL, configuration Link-state routing protocols, path finding algorithm (SPF), Link-state principles, advantages and disadvantages OSPF, characteristics, data structures, identifying metrics, method of communication, configuration, BR / BDR, basic types of administrations in OSPF Addressing sustainable development network, delegation and distribution of network administration in terms of routing protocols, Introduction to BGP and Internet routing.

Teaching methods Monologická (výklad, přednáška, instruktáž), Dialogická (diskuze, rozhovor, brainstorming), Pozorování, Demonstrace, Nácvik dovedností, Laborování


Recommended reading * Dokumenty IEEE. * Dokumenty RFC. * Materiály kurzu CCNA-exploration. * RNDr. Libor Dostálek. Archiv materiálů RNDr. Libora Dostálka. * Jiří Peterka. Archiv materiálů Jiřího Peterky. * Libor Dostálek. Velký průvodce protokoly TCP/IP a systémem DNS. Praha: Computer Press, 2002. ISBN 80-7226-675-6. * Mark A. Sportack. Směrování v sítích IP. Brno: Computer Press, 2004. ISBN 80-251-0127-4. * Rita Pužmanová. TCP/IP v kostce. Kopp. ISBN 80-7232-236-2. * VELTE, T. J. Síťové technologie CISCO- velký průvodce. Brno: Computer Press, 2003.


Computer Networks III KST/IPS3

Type of course

Lecture + Lesson

Level of course

Bc.


0 ZS 4 CZ

Name of lecturer * Horálek Josef, Mgr. * Drvota Zdeněk, Ing.

Objective Goal of this course is to bring deeper understanding of frame switching for LAN, wireless LANs, security of access layer and to acquire related skills. Gained skills are oriented for successful administration of small and medium sized companies. After completing this course, students will have theoretical knowledges about architecture, concepts and tasks of router, deep knowledge about architecture of internetnetworks, and basic management of this networks. Students should be able to apply gained skills for analysis, configurations and validating basic faults and setting of routed networks.

Prerequisities KST/IPS2 Course contents LAN Design Basic Switch Concepts and Configuration Ethernet switch architecture VLANs VTP STP, RSTP, PVST, PVST+ Inter-VLAN Routing Basic Wireless Concepts and Configuration Wireless network security Ethenet security

Teaching methods

Monologická (výklad, přednáška, instruktáž), Dialogická (diskuze, rozhovor, brainstorming), Pozorování, Demonstrace, Nácvik dovedností, Laborování


Recommended reading * Dokumenty IEEE. * Dokumenty RFC. * Materiály kurzu CCNA-exploration. * RNDr. Libor Dostálek. Archiv materiálů RNDr. Libora Dostálka. * Jiří Peterka. Archiv materiálů Jiřího Peterky. * VELTE, T. J. Síťové technologie CISCO- velký průvodce. Brno: Computer Press, 2003.


Computer Networks IV KST/IPS4

Type of course

Lecture + Lesson

Level of course

Bc.


0 LS 4 CZ


Objective Goal of this course is to bring deeper understanding of wide area network technologies, remote connection technologies and security of connection to public Internet. After completing this course, students will have theoretical knowledges about taught subjects, will be able to describe and practically application of it.

Prerequisities Course contents Introduction to WANs public Wan PPP protocol Frame Relay ISDN, xDSL Network Security ACLs Teleworker Services IP Addressing Services IPv6

Teaching methods Monologická (výklad, přednáška, instruktáž), Dialogická (diskuze, rozhovor, brainstorming), Pozorování, Demonstrace, Nácvik dovedností, Laborování


Recommended reading * Dokumenty IEEE. * Dokumenty RFC. * Materiály kurzu CCNA-exploration. * RNDr. Libor Dostálek. Archiv materiálů RNDr. Libora Dostálka. * Jiří Peterka. Archiv materiálů Jiřího Peterky. * VELTE, T. J. Síťové technologie CISCO- velký průvodce. Brno: Computer Press, 2003.


Introduction to Language C KST/IUJC

Type of course

Lecture + Lesson

Level of course

Bc.


0 ZS 5 CZ

Name of lecturer * Fikejz Jan, Ing. * Brom Pavel, Ing. * Karamazov Simeon, prof. Ing. Dr.

Objective To learn basic programming techniques of structured programming in C language. After taking the course, the student has basic skills in C language programming.

Prerequisities Course contents Program elements in C language. Control statement in C language. Data types, variables, and expressions. Fields and strings. Using pointer. Function. Console input and output. File input and output. Structures and union. Dynamic alocation memory. Data types and operators. Preprocesor in in C language. Graphics and C language.

Teaching methods

Monologická (výklad, přednáška, instruktáž), Metody samostatných akcí, Nácvik dovedností

Assesment methods Písemná zkouška, Posouzení zadané práce

Recommended reading * Herout, P. Učebnice jazyka C - 2. díl. IV. přepracované vydání.. KOPP, 2004. * Herout, P. Učebnice jazyka C. Kopp. * Nenadál K., - Václavíková D. Turbo C - popis jazyka. Grada.


Language Java KST/IZAPR

Type of course

Lecture + Lesson

Level of course

Bc.


0 LS 4 CZ

Name of lecturer * Neradová Soňa, Ing. * Rulicová Iva, RNDr. * Bažant Michael, Ing. Ph.D. * Šimerda Karel, Ing.

Objective Students learn to analyze the basic role and subsequently implement using Java programming language. Student will be able to implement a simple algorithm using the Java programming language.

Prerequisities Course contents The definition of the algorithm, the characteristics of the algorithm. Working with the numeral systems, transfers between them. Programming language Java - code conventions, primitive data types, literals, program routines, operators, casting, basics of object oriented programming, parameters and return values of methods, method calling, arrays, console input and output, methods and constructors overriding, regular expressions, exceptions, interface, text files, inner classes, basics of GUI applications.


Assesment methods Písemná zkouška, Didaktický test

Recommended reading

* Horton, I. Java 5.. Praha: Neocortex, s.r.o. ISBN 80-86330-12-5.


Language Java KST/IZKPR

Type of course

Lecture + Lesson

Level of course

Bc.


0 LS 4 CZ

Name of lecturer * Neradová Soňa, Ing. * Rulicová Iva, RNDr. * Bažant Michael, Ing. Ph.D. * Šimerda Karel, Ing.

Objective Students learn to analyze the basic role and subsequently implement using Java programming language. Student will be able to implement a simple algorithm using the Java programming language.

Prerequisities Course contents The definition of the algorithm, the characteristics of the algorithm. Working with the numeral systems, transfers between them. Programming language Java - code conventions, primitive data types, literals, program routines, operators, casting, basics of object oriented programming, parameters and return values of methods, method calling, arrays, console input and output, methods and constructors overriding, regular expressions, exceptions, interface, text files, inner classes, basics of GUI applications.


Assesment methods Písemná zkouška, Didaktický test

Recommended reading * Horton, I. Java 5.. Praha: Neocortex, s.r.o. ISBN 80-86330-12-5.

ICNA1. Course code. Lesson. Type of course. Level of course. Bc

Recommend Documents