A Web version of the
Česká republika
The Czech Republic
Vysoké učení technické v Brně
Brno University of Technology
Fakulta informačních technologií
Faculty of Information Technology
Information Technology
ThreeYear Bachelor Study Program
ITBC3
Information Brochure
Collected, Edited and Issued by
Adviser/Tutor for International Students
mailto:eysselt@fit.vutbr.cz
In this booklet, a reader will find basic information on courses instructed in English.
The Fifth Edition: 2004, December; Updates: 2005,
March, July; 2009, December
For internal use
Entrance Requirements
All applicants to the BSc Study Program are expected to pass an entrance examination in mathematics, and in the English language at a level corresponding to standard secondary schools specialized in the sciences. Those applicants, who fail to prove sufficient capabilities to enter the BSc Study Program will be offered a oneyear bridging study. The passing of the final examination of the bridging study enables an applicant to be enrolled into the BSc Study Program.
The standard deadline for applications is April 30th of the year preceding the first academic year of the study. The Secondary SchoolLeaving Certificate, the Curriculum Vitae, and the EnglishLanguageTest Certificate are indispensable for the admission procedure.
The FIT does not provide scholarships or other financial support for international BSc applicants.
For futher information on tuition fee, accomodation and meals, etc., please contact the admission office of the FIT.
The basic contact address is info@fit.vutbr.cz.
Comment 1: There is an ongoing innovation of courses,
and the current contents of lectures, practices, PClaboratories, and
instructors may change at any time.
Comment 2: Degree equivalents of guarantees/instructors:
prof. ..... Full Professor
doc. ..... Associate Professor
CSc., Dr., DrSc., Ph.D. ..... PhD
Ing., Mgr., PhDr., RNDr. ..... MA, MEng, MSc, etc.
INGPAED IGIP ..... Pedagogic Qualification guaranteed
by the International Society for Engineering Education
Comment 3: FourTerm Course of the Czech Language C1Z, C2Z, C3Z, C4Z:
The main principle of the course is communication. The student will learn the principles of the Czech language by means of the conversational method. Following this method the student will be able to use the language in social life: in the city, at the hotel, in restaurants, shops, post office and other places of business, at the railway station, the airport, the customs office and on the highway, and so on. The student will be able to make appointments and give invitations, as well as to conduct both social conversation and simple negotiations in Czech. At the same time the student will be learning the necessary grammar including the system of declination and the conjugation of verbs.
Credit System
European Credit Transfer System (ECTS for short) defines for one academic year 60 credits. One credit corresponds to a little less than one hour of teaching per week for the period of one term. At the Faculty of Information Technology, in the NewCurriculum BSc study program, these relations are used, e.g.:
* 3 class hours per week ... 4 ÷ 5 credits
* 4 class hours per week ... 5 ÷ 6 credits (2 credits for Czech Language courses)
* 5 class hours per week ... 6 ÷ 7 credits
Completion Forms of Course Score
There are three forms of completing (Ending) the courses:
* accreditation 'ac' (on the pass/fail basis: without points and without grade/mark):
prescribed for supporting courses, or for a part of a course
* classified accreditation 'ca' (with points and grade/mark):
it is an examination of special type prescribed for practiceoriented courses
* examination 'ex' (with points and grade/mark)
Grading
The maximum number of points is 100. Tests, evaluated/classified course projects, evaluated/classified homeworks, laboratory activities, midterm and final examinations, and other activities, earn points. The scale table, available since 20040901, follows.
Grade 
Points 
Mark 
ECTS 
excellent 
100 ÷ 90 
1 
A 
very good 
89 ÷ 80 
1.5 
B 
good 
79 ÷ 70 
2 
C 
satisfactory 
69 ÷ 60 
2.5 
D 
sufficient 
59 ÷ 50 
3 
E 
failed 
49 ÷ 0 
4 
F 
Completion of the BSc Study Program
A student who has completed a BSc study is awarded the 'Bc.' degree ('Bc.' is the Czech equivalent of 'BSc' or 'BEng' degree) in her/his respective field on the assumption that during the course of her/his study
* she/he has obtained at least 180 credits in the prescribed structure,
* she/he has successfully defended her/his BSc Thesis (Project),
* she/he passed the oral part of the final examination at the final examination board.
The table with the prescribed structure of credits follows.
Group of Courses 
Credits 
Comments 
Bachelor Thesis 
nom. 6 
group 'C' 
Compulsory courses 
nom. 143 
group 'C' 
Czech Language 
nom. 8 
group 'C' 
Optional courses 
min. 23 
group 'O' 
Total 
min. 180 

Comment 4: Fac: FIT (for short) is the Faculty of Information Technology)
Department of Mathematics (DMAT for short),
Department of Foreign Languages (DFLA for short) and
Department of Physics (DPHY for short) are departments
at the Faculty of Electrical Engineering and Communications (FEEC for short)
Comment 5: Codes (abbreviations) of courses are derived from the Czech titles of courses.
Comment 6: Lectures and Practices are presented in total number of hours per 1 term.
Year 1, Autumn Term (the 1st term)
Course 
Code 
Gr 
Crs 
Lec /Pra 
End 
Fac 
Guarantee 
Czech Language 1 
C1Z 
C 
2 
26 / 26 
ga 
DFLA 
DFLA 
Discrete Mathematics 
IDA 
C 
7 
39 / 26 
ac,ex 
DMAT 
Kovar 
Circuits Theory 
ITO 
C 
6 
26 / 26 
ac,ex 
FIT 
Kunovsky 
Assembly Languages 
IAS 
C 
6 
39 / 13 
ac,ex 
FIT 
Zboril 
Introuction to Software Engineering 
IUS 
C 
5 
26 / 13 
ga 
FIT 
Zendulka 
Introduction to Programming Systems 
IZP 
C 
7 
39 / 26 
ex 
FIT 
Kreslikova 
Total



33 




Year 1, Spring Term (the 2nd term)
Course 
Code 
Gr 
Crs 
Lec / Pra 
End 
Fac 
Guarantee 
Czech Language 2 
C2Z 
C 
2 
26 / 26 
ex 
DFLA 
DFLA 
Physics 
IFY 
C 
5 
26 / 26 
ex 
DPHY 
Grmela 
Mathematical Analysis 
IMA 
C 
5 
26 / 26 
ex 
DMAT 
Krupkova 
Digital Systems Design 
INC 
C 
5 
39 / 13 
ex 
FIT 
Fucik 
Operating Systems 
IOS 
C 
5 
39 / 13 
ex 
FIT 
Vojnar 
Computer Hardware 
IPR 
C 
6 
26 / 26 
ex 
FIT 
Kunovsky 
Total



28 




Year 2, Autumn Term (the 3rd term)
Course 
Code 
Gr 
Crs 
Lec / Pra 
End 
Fac 
Guarantee 
Czech Language 3 
C3Z 
C 
2 
26 / 26 
ga 
DFLA 
DFLA 
Algorithms 
IAL 
C 
5 
39 / 13 
ex 
FIT 
Honzik 
The C Programming Language 
IJC 
C 
5 
26 / 26 
ex 
FIT 
Peringer 
Numerical Methods and Probability 
INM 
C 
5 
26 / 26 
ex 
DMAT 
Novak M. 
Design of Computer Systems 
INP 
C 
5 
39 / 13 
ac,ex 
FIT 
Sekanina 
Signals and Systems 
ISS 
C 
6 
39 / 26 
ex 
FIT 
Cernocky 
Total



28 




Year 2, Spring Term (the 4th term)
Course 
Code 
Gr 
Crs 
Lec / Pra 
End 
Fac 
Guarantee 
Czech Language 4 
C4Z 
C 
2 
26 / 26 
ex 
DFLA 
DFLA 
Database Systems 
IDS 
C 
5 
39 / 13 
ex 
FIT 
Zendulka 
Formal Languages and Compilers 
IFJ 
C 
5 
39 / 13 
ex 
FIT 
Meduna 
Fundamentals of Artificial Intelligence 
IZU 
C 
4 
26 / 13 
ex 
FIT 
Zboril 
Computer Communications and Networks 
IPK 
C 
5 
39 / 13 
ex 
FIT 
Sveda 
Java Progamming Language 
IJE 
E 
5 
26 / 26 
ex 
FIT 
Koci 
Computer Graphics Principles 
IZG 
C 
6 
39 / 26 
ex 
FIT 
Krsek 
Total



31 




Year 3, Autumn Term (the 5th term)
Course 
Code 
Gr 
Crs 
Lec / Pra 
End 
Fac 
Guarantee 
Information Systems 
IIS 
C 
4 
26 / 13 
ex 
FIT 
Hruska T. 
Microprocessors and Embedded Systems 
IMP 
C 
5 
26 / 26 
ex 
FIT 
Schwarz 
Principles of Programming Languages 
IPP 
C 
5 
39 / 13 
ex 
FIT 
Kolar 
Network Applications and Network Administration 
ISA 
C 
5 
26 / 26 
ac,ex 
FIT 
Sveda 
User Interface Programming 
ITU 
C 
4 
13 / 26 
ga 
FIT 
Zemcik 
Modelling and Simulation 
IMS 
C 
5 
39 / 13 
ex 
FIT 
Peringer 
Term Project 
ISP 
C 
2 
0 / 2 
ac 
FIT 
Eysselt 
'Optional course (0 ÷ 1)' 
I?? 
E 
4 ÷ 5 

ex 
FIT 

Total



29 ÷ 35 




Comment 7: The opening of one optional course in the 5th term will be derived from students'interest. The final choise of the optional course will be a result of the updated course offer and the voting of students (the course with the majority of votes will be opened).
Year 3, Spring Term (the 6th term)
Course 
Code 
Gr 
Crs 
Lec+Pra 
End 
Fac 
Guarantee 
BSc Thesis 
IBP 
C 
6 
0 ÷ 78 
ac 
FIT 
Eysselt 
State Final Examination 
ISZ 
C 
0 
0 ÷ 0 
 
FIT 
FIT 
'Optional courses (4 ÷ 5)' 
I?? 
E 
19 ÷ 25 

ex 
FIT 

Total



24 ÷ 31 




Comment 8: In the 6th term, four or five optional courses will be opened. The final choise of these courses will be a result of the updated course offer and the voting of students (the courses with the majority of votes will be opened). Students have a possibility to put forward some optional course(s) which is/are not in this basic offer. Faculty has an interest to meet students´ wish if a realization is possible.
Optional Courses (examples)
Comment 9: Note that the offer of optional courses in a particular term may be limited depending on the availability of the FIT staff and on students' interest. Faculty has an interest to meet students´ wish if a realization is possible.
Course 
Code 
Gr 
Crs 
Lec / Pra 
End 
Fac 
Guarantee 
VHDL Seminar 
IVH 
E 
4 
26 / 13 
ga 
FIT 
Sekanina 
Design of External Adapters 
NAV 
E 
5 
26 / 26 
ex 
FIT 
Kotásek 
Advanced Information Systems 
PIS 
E 
5 
39 / 13 
ex 
FIT 
Hruska T. 
Computer Aided Design 
IPN 
E 
5 
26 / 26 
ex 
FIT 
Schwarz 
Peripheral Devices 
IPZ 
E 
4 
39 / 0 
ex 
FIT 
Kotásek 
Information Systems Project Management 
IRP 
E 
4 
26 / 13 
ex 
FIT 
Kreslíková 
Personal Computers 
ITP 
E 
5 
26 / 26 
ex 
FIT 
Kotásek 
Annotations of Courses
Compulsory Courses
Year 1, Autumn Term (the 1st term)
C1Z  Czech Language 1
Introduction. Czech vowels and consonants: to be, who, what, where. Nouns. Adjectives. Room. Locative case. Conjugation 'ám', 'uju'. Accusative case. Possessive pronouns. Family. Numerals 1 ÷ 20. Conjugation of 'ím', 'u'. Infinitives. Personal pronouns in the accusative. My day. Days, when? Aspect. Genitive case. Modal verbs. Instrumental case. Neither  nor. I will go to Prague. Will you go to Prague too? Numerals 21 ÷ 1000. Preposition with the genitive. Preposition 'na' with the accusative. 'Kde  kam' (where  to where). 'V Praze' (in Prague).
Guarantee/Instructor: FEEC/DFLA
IAS  Assembly Languages
Machine language, assembly language, assembler. Pentium processors architecture. Real mode instruction set. Programming in machine language. Personal computers (PC) with Pentium processors. Programming of PC peripherals. PC assembly language. Assembling and linking. Standard control transfer and passing of parameters in procedures and functions.
Guarantee/Instructor: Frantisek Zboril, doc., Ing. CSc. (FIT)
IDA  Discrete Mathematics
The sets, relations and mappings. The topology and the continuous mapping. The structures with one and two operations. Equivalences and partitions. Posets. Lattices and Boolean algebras. The proposional calculus. The normal forms of formulas. Deduction. The proving techniques. The elementary notions of the graph theory. Connectedness. Subgraphs and morphisms of graphs. Planarity. Trees and their properties. Simple graph algorithms. Other actual items.
Guarantee/Instructor: Martin Kovar, doc., RNDr., Ph.D. (FEEC/DMAT)
ITO – Circuits Theory
Basic notions and quantities in electric circuits. Stable steady state in linear electric circuits. Principle of superposition. Analysis of circuits by the method of simplification, theorems on backup resources, application of Kirchhoff laws, method of loop currents and node voltages. Amplifiers, ideal operational amplifier. Typical input and feedback circuits of operational amplifier. Digitaltoanalog and analogtodigital converters, circuit conceptions and properties. Harmonically steady state in electric circuits. Basics of measurement. Principles and use of digital measuring devices. Methods of measuring electrical quantities. Safety regulations.
Guarantee/Instructor: Jiri Kunovsky, doc., Ing., CSc. (FIT)
IUS  Introduction to Software Engineering
The
history of software engineering, problems of software development, the software
process, structured and objectoriented approach to software development. Introduction to
software project management. Fundamentals of requirement analysis and
software design. Fundamentals of objectoriented approach: object, class,
encapsulation, inheritance, polymorphism. The role of
modelling in software development, introduction to modelling techniques of structured
and objectoriented analysis and design. Introduction to software
quality assurance: verification and validation, testing. Practices address the
following topics: the use of the university network environments (Unix, Novell NetWare), the use of text processors and
spreadsheets (MS Word, MS Excel), introduction to WWW page development (HTML)
and desktop publishing (LaTeX). In addition, application of selected principles
of software engineering will be included in projects from the course of
Introduction to Programming Systems.
Guarantee/Instructor:
Bohuslav Krena, Ing., Ph.D. (FIT)
IZP  Introduction to Programming Systems
Algorithms and problem solving: strategy of problem solving, structured decomposition, concept and features of algorithm. Basic programming construction: syntax and semantics of high programming language, variables, type, assignment, control structures, procedure and functions, parameter passing, input/output, exceptional state processing. Basic data structure. Simple data types. Structured data types: array, record, set, file, strings. Dynamic data structures, concept of pointers. Strategy for selecting appropriate data structure. Recursion, concept of recursion. Global and local variables. Simply recursion procedures. Modular Design and abstraction. Concepts will be illustrated by using appropriate programming language.
Guarantee/Instructor: Jitka Kreslikova, doc., RNDr., CSc. (FIT)
~~~~~~~~~~~~~~~~~~~~
Year 1, Spring Term (the 2nd term)
C2Z  Czech Language 2
'Vědět' (to know). Indefinite and negative pronouns and adjectives. Future tense of the perfective verbs. 'Jít', 'jet' (to go on foot, to go by vehicle). In the square. Numerals 1000 ÷ 'infinity'. Pronoun 'svůj'. Plural of nominative and accusative. Future tense of the imperfective verbs. 'Když' (when, as soon as). Visit. Dative case, personal pronouns. Dative case, nouns and adjectives. Prepositions with the dative. Past tense. Sentences without subjects. Present tense. Being late. What did you do yesterday?
Guarantee/Instructor: FEEC/DFLA
IPR – Computer Hardware
Analysis of transitional processes in electric circuits in a time area. TKSL simulation language. Formulation of circuit equations and possibilities of their solutions. Analysis of RC, RL, and RLC circuits. Analysis of nonlinear electric circuits. Parameters and characteristics of semiconductor elements. Graphical, numerical, and analytical methods of nonlinear circuit analysis. TTL and CMOS gates. Power supply units. Limiters and sampling circuits. Level translators, stabilizers. Astable, monostable, and bistable flipflops. Dissipationless and dissipation lines. Wave propagation on lines, reflections, adjusted lines.
Guarantee/Instructor: Jiri Kunovsky, doc., Ing., CSc. (FIT)
IFY  Physics
Overview of principles and models of classical physics. Mechanics, waves, thermodynamics, electromagnetism and optics. Applications, holography, fiber optics. Results and hypotheses of modern physics, quantum mechanics, statistical physics, relativity.
Guarantee/Instructor: Lubomir Grmela, doc., Ing., CSc. (FEEC/DPHY)
IMA  Mathematical Analysis
The limit and the continuity of a function. The derivative. Partial derivatives. Basic differentiation rules. The chain rule. The elementary functions. Applications of derivatives. Extrema for functions (of one and of several variables). Indefinite integral. Techniques of integration. The Riemann (definite) integral. Multiple integrals. Applications of integrals. Infinite sequences and infinite series. Taylor polynomials. Fourier series. Functions of a complex variable. Their derivative. Integral with respect to a complex variable. The Laurent series. Differential equations (basic notions). Elements of operational calculus. The Laplace transform, applications to solving differential equations). The Ztransform and solving difference equations.
Guarantee/Instructor: Vlasta Krupkova, RNDr., CSc. (FEEC/DMAT)
INC  Digital Systems Design
Binary digit system: positional notation, conversion of base, binary codes, binary arithmetic. Boolean algebra, logic functions and their representations: logic expressions, reduction methods, design of combinational logic networks. Analysis of logic networks behaviour: signal races, hazards. Selected logic modules: adder, subtractor, multiplexer, demultiplexer, decoder, coder, comparator, arithmetic and logic unit. Sequential logic networks, latches and flipflops. State machines and their representations. Design of synchronized sequential networks: state assigment, optimization and implementation. Register, counter, shift register, impulse divider. Design of simple digital equipment: design CAD tools, description tools, design strategy. Integrated circuits families: SSI, MSI, LSI. Programmable logic devices: gate arrays, PROM, PLA, PAL. Simple asynchronous networks: design, analysis of behaviour.
Guarantee/Instructor: Otto Fucik, doc., Ing., Dr. (FIT)
IOS  Operating Systems
The concept of an operating system (OS) as a part of software of a computer system. Architectures of operating systems, a classification of operating systems. An overview of the contemporary operating systems. UNIX: The kernel of the OS, its structure, calling services of the kernel. The user interface of the UNIX OS, graphical and textbased interfaces, command languages. Context switching, multitasking. Basic principles of the implementation of the UNIX OS. File systems. Management of processes, virtual memory. Basic principles of computer networks, Internet, TCP/IP. Security of operating systems.
Guarantee/Instructor: Tomas Vojnar, doc., Ing., Ph.D. (FIT)
~~~~~~~~~~~~~~~~~~~~
Year 2, Autumn Term (the 3rd term)
C3Z  Czech Language 3
Money. Genitive case (declination of nouns and adjectives). Prepositions with the genitive. Comparatives. In the grocery. In the garments. Plural genitive. Genitive case of pronouns. In the kitchen. At the restaurant. Singular instrumental. Prepositions with the instrumental. Verbs of motion. Ordinal numerals. What's the time? When? How long? How often? Seasons of the year. Weather. Imperative form. Vocative case. Instrumental of pronouns. Post office. Letter. Postcard. Telegram. Telephone.
Guarantee/Instructor: FEEC/DFLA
IAL  Algorithms
Overview of fundamental data structures and their exploitation. Principles of dynamic memory allocation. Specification of abstract data types (ADT). Specification and implementation of ADT's: lists, stack and its exploitation, queue, set, array, searching table, graph, binary tree. Algorithms upon the binary trees. Searching: sequential, in the ordered and in not ordered array, searching with the guard (sentinel), binary search, search tree, balanced trees (AVL). Searching in hashtables. Ordering (sorting), principles, sorting without the moving of items, sorting with multiple keys. Most common methods of sorting: Selectsort, Bubblesort, Heapsort, Insertsort and its variations, Shellsort, recursive and nonrecursive notation of the Quick sort, Mergesort, Listmergesort, Radixsort. Recursion and backtrack algorithms. Searching the patterns in the text. Proving of correctness of programs, construction of proved programs.
Guarantee/Instructor: Jan M. Honzik, prof., Ing., CSc., INGPAED IGIP (FIT)
IJC  The C Programming Language
The C programming language as defined by ISO. The definition of C language, pointers, modularity, C standard library. Basic overview of C++, using of the C++ standard library.
Guarantee/Instructor: Petr Peringer, Dr., Ing. (FIT)
INM  Numerical Methods and Probability
Numerical mathematics: Metric spaces, Banach theorem. Solution of nonlinear equations. Approximations of functions, interpolation, least squares method, splines. Numerical derivative and integral. Solution of ordinary differential equations, onestep and multistep methods. Probability: Random event and operations with events, definition of probability, independent events, total probability. Random variable, characteristics of a random variable. Probability distributions used, law of large numbers, limit theorems.
Guarantee/Instructor: Michal Novak, RNDr., Ph.D. (FEEC/DMAT)
INP  Design of Computer Systems
Von Neumann computer. Introduction to VHDL. Performance evaluation. Data types, formats and coding. Instructions, formats, coding and addressing, ISA. VHDL models of algorithms and subsystems. Pipelining. Arithmetic and logic operations. Algorithms and function units. Sequencer: basic function, hardwired and microprogram implementation. Memories: types, organization, controlling. Memory hierarchies, virtual memory. Peripheral units, buses and bus control, parallel and serial digital interfaces.
Guarantee/Instructor: Lukas Sekanina, doc., Ing., Ph.D. (FIT)
~~~~~~~~~~~~~~~~~~~~
Year 2, Spring Term (the 4th term)
C4Z  Czech Language 4
Prefixes. Singular local. Locative case of pronouns. Prepositions with the locative. In the hotel. Holidays. Plural local. Conjunction 'aby'. Body. At the doctor's. Plural dative. Declination of numbers. Time conjunctions. On the highway. Fine. Plural instrumental. Declination of 'kolega', 'centrum', 'muzeum'. Conditional clauses. Dealing. At the airport.
Guarantee/Instructor: FEEC/DFLA
IDS  Database Systems
Fundamental
concepts of database systems (DBS). Conceptual modelling.
The relational model of data. Mapping
a conceptual model to relational tables. The SQL
language. Normalizationbased refinement of a database
schema. Physical level of a database. Transaction processing. Introduction to database administration:
data security and integrity, database recovery, performance optimization. DBS
architectures: client/server, multitier architectures, distributed DBS. Trends in database technologies. A project: development of a
database application.
Guarantee/Instructor: Jaroslav Zendulka, doc., Ing., CSc. (FIT)
IFJ  Formal Languages and Compilers
Basic notions: formal languages and their models, grammars, automata; compilers. Regular languages and lexical analysis: regular languages and expressions, finite automata and transducers, lexical analyzer, Lex, symbol table. Contextfree languages and syntax analysis: contextfree grammars, pushdown automata and transducers, deterministic topdown syntax analysis (recursive descent), the essence of deterministic bottomup syntax analysis, Yacc. Semantic analysis and code generation: intermediate code generation, optimization, code generation.
Guarantee/Instructor: Alexander Meduna, prof., RNDr., CSc. (FIT)
IPK  Computer Communications and Networks
Data communication principles. Data communication systems. Computer networks, layer models, communication services and protocols. Multiple access. Error control. Naming and addressing. Network interconnections. Switching and switches. Routing. Internet concepts, TCP/IP, Internet routing. Highspeed networks, quality of communication services. Wireless and mobile networks and protocols. Protocol implementation and protocol engineering.
Guarantee/Instructor: Miroslav Sveda, prof., Ing., CSc. (FIT)
IZG  Computer Graphics Principles
The course comprises topics on basic algorithms for 2D and 3D computer graphics.It presents methods used for rasterization of primitive graphics objects and transformations, solving global/local illumination and visibility as well as visualization of complex 3D scenes. Introduction to practical object representations and their realistic visualization is presented.
Guarantee/Instructor: Premysl Krsek, doc., Ing., Ph.D. (FIT)
IZU  Fundamentals of Artificial Intelligence
Problem solving, state space search, problem decomposition, games playing. AI languages: PROLOG, LISP. Machine learning. Pattern recognition. Fundamentals of computer vision. Pinciples of natural language processing. Principles of expert systems.
Guarantee/Instructor: Frantisek Zboril, doc., Ing., CSc. (FIT)
~~~~~~~~~~~~~~~~~~~~
Year 3, Autumn Term (the 5th term)
IIS  Information Systems
Information system as a special case of a system. Kinds of information systems. History of information systems. Management information systems, their desing and development. Special information systems. Technology of information system with relational database system building. Distributed information system. Methods of large information system building and communication.
Guarantee/Instructor: Tomas Hruska, prof., Ing., CSc. (FIT)
IMP  Microprocessors and Embedded Systems
Embedded systems. Microprocessor architecture overview. Selected microcontroller architecture. Memory subsystem and its design. Instruction set. Programming in assembly language. Stack and subroutines. Interrupt subsystem and its programming. Peripheral devices and their programming. Programming techniques for embedded systems and HLL. Constrained embedded system design. Typical embedded system case study.
Guarantee/Instructor: Josef Schwarz, doc., Ing., CSc. (FIT)
IMS  Modelling and Simulation
Introduction to modelling and simulation concepts. System analysis and classification. Abstract and simulation models. Continuous, discrete, and combined models. Heterogeneous models. Using Petri nets and finite automata in simulation. Pseudorandom number generation and testing. Queuing systems. MonteCarlo method. Continuous simulation. Simulation experiment control. Visualization and analysis of simulation results.
Guarantee/Instructor: Petr Peringer, Dr., Ing. (FIT)
IPP  Principles of Programming Languages
The course offers basic classification of programming languages with more detailed explanation of imperative and declarative languages. Explaining imperative paradigm, it will be presented nonstructured, structured (both block and modular), and objectoriented programming languages. A brief introduction into functional and logic programming will be studied during explanation of declarative paradigm. The underlying theories are discussed too. Students will be also given an introduction to processing (translation) of presented programming paradigms/languages.
Guarantee/Instructor: Dusan Kolar, doc., Dr., Ing. (FIT)
ISA  Network Applications and Network Administration
Programming of network applications. Addressing and routing in TCP/IP/Ethernet environment. Address translation. Serial communication and modems. Time synchronization. File services. Print services. Directory and authentization services. Remote logging. Data services: FTP, WWW. Electronic mail. Conference services.
Guarantee/Instructor: Miroslav Sveda, prof., Ing., CSc. (FIT)
ISP – Term Project
Students will receive an
individual project specification from various areas of intormation technology.
Students work individually under the supervising of some skilled leaders.
Students will proceed as follows: problem analysis, solution, verification,
implementation, and others. The course is successfully completed after
student's oral presentation of the project studystage results at the faculty
board.
Guarantee/Instructor: 'supervisor' from the FIT
ITU  User Interface Programming
Communication between computers and humans, information throughput of the interfaces, different ways to implement the interfaces, user interfaces of the current operation systems, event controlled interfaces in detail, tools for user interface programming, traditional and component models of the interface, elements of the user interfaces.
Guarantee/Instructor: Pavel Zemcik, doc., Dr., Ing. (FIT)
~~~~~~~~~~~~~~~~~~~~
Year 3, Spring Term (the 6th term)
IBP  BSc Thesis
A student will receive an individual project specification from various information technology areas in order to work out her/his project individually under the leadership of her/his supervisor. A student will proceed as follows: problem analysis, problem solving, verification, implementation, documentation and presentation. During her/his work, a student will follow all instructions and requirements concerning contents and volume of the thesis, the project adjustment, the literature, the language quality and the written report typography as well as project parts consigned in the electronic form. The BSc Thesis is presented and defended at the Faculty Examination Board on the end of the last term of the study.
Guarantee/Instructor: 'supervizor' from the FIT
ISZ – State Final Examination (0 ECTS credits)
This is a fictive, but compulsory, course. The main parts played by this
course are:
1) Enrolling of students to the state final examination.
2) Easy printing of all documents supporting the state final examination.
3) Easy closing and evaluating of study conditions at the FIT.
Guarantee: The FIT
~~~~~~~~~~~~~~~~~~~~
Optional courses (exapmles)
IJE  Java Programming Language
Java language: development environments, libraries, programming techniques, development of applications, comparison with other languages. Internet applications.
Guarantee/Instructor: Radek Koci, Ing., Ph.D. (FIT)
IPN  Computer Aided Design
Design automation concept. Software packages CAD/CAE. Specification of OrCAD and Xilinx platform. Specification and synthesis of digital systems. Schematic design tools, partitioning of logic design, digital system simulation, standard and advanced methods for placement, autorouters. Programming of programmable logic devices (PLD), design of printed circuit boards (PCB). Output data for manufacturing.
Guarantee/Instructor: Josef Schwarz, doc., Ing., CSc. (FIT)
IPZ  Peripheral Devices
The attention is paid especially to the principles of construction and control of peripheral devices. The course has a survey nature, it provides students with basic information in the area.
Guarantee/Instructor: Zdenek Kotasek, doc., Ing., CSc. (FIT)
IRP  Information Systems Project Management
Basic conception of project management. Traditional project management methodologies. Principles, tools and techniques of project management. Project leadership. Defining the project. Planning, monitoring and controlling mechanisms and techniques for leadership and team building. Quality assurance and assessment of project products. Conflict resolutions techniques and risk management. Project management software support. Norms and the current standards in project management.
Guarantee/Instructor: Jitka Kreslikova, doc., RNDr., CSc. (FIT)
ITP  Personal Computers
The course will provide students with uptodate information on personal computer technique. Students will acquire the information on the principles of personal computer structure, I/O buses, elementary principles of external adapter construction and buses for the communication with peripheral devices.
Guarantee/Instructor: Zdenek Kotasek, doc., Ing., CSc. (FIT)
IVH  VHDL Seminar
Basic VHDL language constructs, lexical description, VHDL source code. Data types, data objects, data classes, data objects declaration. VHDL language commands. Advanced VHDL features, VHDL 93. Delay modelling, time scheduling in VHDL. Combinational circuits modelling, 'don't cares', tristate circuits. Sequential circuits modelling, Mealy and Moore machines. Models testing, test benches. Designing at algorithm, registertransfer and gate levels. Modelling for synthesis. Semantics for simulation and synthesis, delay in model. Programming techniques, shared components, flattening and structuring. Case studies of complex digital circuits: UART, RISC processor, FIR filter.
Guarantee/Instructor: Lukas Sekanina, doc., Ing., Ph.D. (FIT)
NAV  Design of Extenal Adapters
The themes of lectures deal with problems that must be solved by a designer during the design of components of a peripheral device adapter. Students will become acquainted with the principles of I/O bus system operation and the communication with adapters: communication with memory components, registers, interrupt request generation and its service, DMA request generation and its service. The principles of component design (synthesis) for peripheral operation control will be discussed. The laboratory tutorials will be directed towards the presentation of these principles on a computer structure and on the design of external adapter components and external adapter design in a design system environment.
Guarantee/Instructor: Zdenek Kotasek, doc., Ing., CSc. (FIT)
PIS – Advanced Information Systems
Modelling of process in information systems, workflow. Internet interfaces of information systems. Persistent objectoriented systems. Information systems over objectoriented databases. Manager information systems and devices for knowledge data discovery. Geografical information systems. Information systems for state and government. Detailed structure of a typical economic information system.
Guarantee/Instructor: Tomas Hruska, prof., Ing., CSc. (FIT)
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
i
Fakulta informacnich technologii
Vysoke uceni technicke v Brne
Bozetechova 2
CZ61266 Brno
fax: ++420 541 141 270
email: info@fit.vutbr.cz
http://www.fit.vutbr.cz
doc. Ing. Dr. Pavel Zemcik
ViceDean for Public Relations and International Affairs
email: prodekanzahranici@fit.vutbr.cz
Ing. Bohuslav Krena, Ph.D.
ViceDean for BSc Study Affairs
email: krena@fit.vutbr.cz
Ing. Milos Eysselt, CSc.
Adviser/Tutor for International Students
email: eysselt@fit.vutbr.cz
http://www.fit.vutbr.cz/~eysselt