Study programmes / B-EMEN Economics and Management / Computer Technology and Algorithms II
Course code:VA2A
Course title in language of instruction:Computer Technology and Algorithms II
Course title in Czech:Výpočetní technika a algoritmizace II v AJ
Course title in English:Computer Technology and Algorithms II
Mode of completion and number of credits:Exam (4 credits)
(1 ECTS credit = 28 hours of workload)
Mode of delivery/Timetabled classes:full-time, period A 2/1, period B 1/2
(full-time, hours of lectures per week / hours of seminars per week)
Language of instruction:English
Level of course:bachelor
Semester:SS 2016/2017 - FBE
Name of lecturer:doc. Ing. František Dařena, Ph.D. (examiner, instructor, lecturer, supervisor)
Prerequisites:Computer Technology and Algorithms I or Computer Technology and Algorithms I
 
Aims of the course:The course is focused on problem solving using computers. Algorithmization is presented as a structured way of thinking used for scientific and economical calculations and mass data processing.
Course contents:
1.Algorithmization (allowance 21/21)
 
a.Algorithms, their representations, methods of algorithms design
b.Means of algorithm coding, structured algorhitmic language
c.Basic tasks of algorithmization
d.Data structures of algorithmic languages
e.Algorithms of mass data processing

Learning outcomes and competences:
Generic competences:
 
-ability to analyse and synthesize
-ability to create new ideas (creativity)
-ability to solve problems
-communication in second language
-general knowledge
-skilled at utilizing and processing information

Specific competences:
 
-Ability to design of algorithms for mass data processing and economical calculations
-Ability to work independently
-Development of logical and algorithmical thinking
-Knowledge of basic structures (flow and data) for algorithm development
-Practical application of methodology

Type of course unit:required
Year of study:Not applicable - the subject could be chosen at anytime during the course of the programme.
Work placement:There is no compulsory work placement in the course unit.
Recommended study modules:none
Assessment methods:in-process tests, final written exam, elaboration of project dealing with collective data procesing
 
Learning activities and study load (hours of study load)
Type of teaching methodDaily attendance
Direct teaching
     lecture21 h
     practice21 h
     consultation10 h
Self-study
     preparation for exam28 h
     preparation for regular testing16 h
     preparation of presentation4 h
     elaboration and execution of projects12 h
Total112 h

Basic reading list
  • DAŘENA, F. Computer Technology and Algorithms II. Brno: MZLU v Brně, 2004.
Recommended reading list
  • JEDLIČKA, P. -- KUNDEROVÁ, L. -- HÁLA, T. -- MACHALOVÁ, J. Introduction to Computer Science. 1. vyd. Brno: Konvoj, 2004. 63 p. ISBN 80-7302-089-0.
  • CORMEN, T H. et al. Introduction to algorithms. 3. vyd. Cambridge, Mass.: MIT Press, 2009. 1292 p. ISBN 978-0-262-03384-8.