714-0286/01 – Computer Technics and Algorithms (BcVTA)

Gurantor departmentDepartment of Mathematics and Descriptive GeometryCredits2
Subject guarantorRNDr. Břetislav Krček, CSc.Subject version guarantorRNDr. Břetislav Krček, CSc.
Study levelundergraduate or graduateRequirementCompulsory
Year2Semestersummer
Study languageCzech
Year of introduction1999/2000Year of cancellation2019/2020
Intended for the facultiesFASTIntended for study typesBachelor
Instruction secured by
LoginNameTuitorTeacher giving lectures
KRC20 RNDr. Břetislav Krček, CSc.
KRC23 Mgr. Jitka Krčková, Ph.D.
PAL39 RNDr. Radomír Paláček, Ph.D.
STA50 RNDr. Jana Staňková, Ph.D.
Extent of instruction for forms of study
Form of studyWay of compl.Extent
Full-time Graded credit 0+2

Subject aims expressed by acquired skills and competences

The main goal of the course is to acquaint with basic principles of problem solving using computers, to acquaint with basic abstract data types and to master their implementation and exploitation. The students shall gain knowledge and skills necessary for algorithm design, coding in a programming language (Delphi) and debugging.

Teaching methods

Tutorials
Other activities

Summary

Algorithmization: algorithms, basic operational structures , block diagrams. Hardware and software, operating system. Delphi: constants, standard types, variables, declaration and definition. Basic commands, input, output and structured commands. Types defined by users, array. String and commands for strings. Procedures and functions, declaration, value and variable parameters.

Compulsory literature:

Wirth, N.: Algorithms + Data Structures = Programs. Prentice Hall, New Jersey, 1975. ISBN 0-13-022418-9

Recommended literature:

Wirth, N., Jensen, K.: PASCAL - User Manual and Report, ISO Pascal Standard. Springer-Verlag 1991. ISBN 0-540-97649-3

Way of continuous check of knowledge in the course of semester

Předmět končí klasifikovaným zápočtem. Všechny body pro hodnocení lze proto získat přímo na cvičeních za individuální programy a za výsledky testů (1.test 30 b., 2.test 40 b., u každého testu je možný jeden opravný termín). Individuální programy musí být odevzdány formou protokolu až po předvedení programu na počítači. Programy jsou dva po 15 bodech, za každý týden zdržení po řádném termínu odevzdání se odečítají 2 body.

E-learning

Other requirements

...............................................

Prerequisities

Subject has no prerequisities.

Co-requisities

Subject has no co-requisities.

Subject syllabus:

Syllabus of subject 1. Algorithmization 1.1. Algorithm and its attributes, flow diagrams language, elementary algorithms creating, basic data types. 1.2. Loops, basic control structures, structured programming principles. 1.3. Arrays, one-dimensional arrays algorithms, sort algorithms. 2. Delphi 2.1. Integrated development environment, program’s structure, data types. 2.2. Expressions and statements. 2.3. Structured data types. 2.4. Procedures and functions. 2.5. Files. Syllabus of tutorial: At first the flow diagrams (FD) are mainly used for algorithms creating and notation, but from the very beginning the Delphi (D) notation is also applied. 1. Algorithm. Flow diagrams language. FD: Simple algorithms creating. D: Integer and real data types. 2. FD: Algorithms with loops. D: Integrated development environment, transcription of selected statements and control structures from FD. 3. FD: Algorithms with loops. D: Simple data types (ordinal types and real) and their using in programs. 4. FD: Array (one-dimensional). D: input and output statements 5. FD: Rectangular method for numerical calculation of integral. D: Program for integral calculation. 1st individual program task. 6. FD: Arrays and nested loops. D: Structured data types. 7. FD: 1st test. D: Other numerical methods for integral calculation. 8. FD: Algorithms with arrays (sort algorithms). D: Programs with matrixes. 9. (Only D since this moment) Subprograms (functions). 2nd individual program task. 10. Subprograms (procedures), program block structure. 11. Text file. Strings. Text information processing. 12. Files, types of files, files processing. Programs with subprograms. 13. 2nd test. Individual programs elaborating. 14. Reserve, individual work, tests repairing.

Conditions for subject completion

Conditions for completion are defined only for particular subject version and form of study

Occurrence in study plans

Academic yearProgrammeBranch/spec.Spec.ZaměřeníFormStudy language Tut. centreYearWSType of duty
2012/2013 (B3607) Civil Engineering P Czech Ostrava 2 Compulsory study plan
2011/2012 (B3607) Civil Engineering P Czech Ostrava 2 Compulsory study plan
2010/2011 (B3607) Civil Engineering P Czech Ostrava 2 Compulsory study plan
2009/2010 (B3607) Civil Engineering P Czech Ostrava 2 Compulsory study plan
2008/2009 (B3607) Civil Engineering P Czech Ostrava 2 Compulsory study plan
2007/2008 (B3502) Architecture and Construction (3501R011) Architecture and Construction P Czech Ostrava 2 Compulsory study plan
2007/2008 (B3607) Civil Engineering (3607R999) Společné studium FAST P Czech Ostrava 2 Compulsory study plan
2006/2007 (B3651) Stavební inženýrství (3651R999) Společné studium FAST P Czech Ostrava 2 Compulsory study plan
2006/2007 (B3502) Architecture and Construction (3501R011) Architecture and Construction P Czech Ostrava 2 Compulsory study plan
2005/2006 (B3607) Civil Engineering (3607R999) Společné studium FAST P Czech Ostrava 2 Compulsory study plan
2005/2006 (B3651) Stavební inženýrství (3651R999) Společné studium FAST P Czech Ostrava 2 Compulsory study plan
2005/2006 (B3502) Architecture and Construction (3501R011) Architecture and Construction P Czech Ostrava 2 Compulsory study plan
2004/2005 (B3651) Stavební inženýrství (3651R999) Společné studium FAST P Czech Ostrava 2 Compulsory study plan
2004/2005 (B3502) Architecture and Construction (3501R011) Architecture and Construction P Czech Ostrava 2 Compulsory study plan

Occurrence in special blocks

Block nameAcademic yearForm of studyStudy language YearWSType of blockBlock owner

Assessment of instruction



2012/2013 Summer
2011/2012 Summer
2010/2011 Summer
2009/2010 Summer