Browse IS/STAG - Portál OSU

Course info KIK / FKARP : Course description

• Course description , selected item
• Study programmes, wherein the course is included
• List of students course
• Timetable course
• Examination datesexaminations course
• Timetable events course
• Permissions for Course

Department/Unit / Abbreviation	KIK / FKARP			Academic Year	2023/2024
Academic Year	2023/2024
Title	Algoritmizace 1			Form of course completion	Exam
Form of course completion	Exam
Long Title	Algorithmization 1
Accredited / Credits	Yes, 6 Cred.			Type of completion	Combined
Type of completion	Combined
Time requirements	Lecture 12 [Hours/Semester] Tutorial 14 [Hours/Semester]			Course credit prior to examination	No
Course credit prior to examination	No
Automatic acceptance of credit before examination	No
Included in study average	YES
Language of instruction	Czech
Occ/max				Automatic acceptance of credit before examination	No
Summer semester	0 / -	0 / 0	0 / 0	Included in study average	YES
Winter semester	0 / -	0 / -	0 / -	Repeated registration	NO
Repeated registration	NO
Timetable	Yes			Semester taught	Summer semester
Semester taught	Summer semester
Minimum (B + C) students	not determined			Optional course	Yes
Optional course	Yes
Language of instruction	Czech			Internship duration	0
No. of hours of on-premise lessons				Evaluation scale	A|B|C|D|E|F
Periodicity	every year
Specification periodicity				Fundamental theoretical course	No
Fundamental course	No
Fundamental theoretical course	No
Evaluation scale	A|B|C|D|E|F
Substituted course	None
Preclusive courses	N/A
Prerequisite courses	N/A
Informally recommended courses	N/A
Courses depending on this Course	N/A
Histogram of students' grades over the years: Graphic PNG ,  XLS

Course objectives:
The objective of the course is to lead students to algorithmic approach to problem solving and to acquaint them with the basics of creation and development of applications for MS Windows operating system. Object Pascal in Borland Delphi environment will be the programming language. The content of the course is to master the principles of algorithm design and the foundations of programming language ? definitions and use of basic data structures (number, character, string, file, field, etc.), conditional statements, loops, recursion. Students will first practice the basic elements of the programming environment in the course of creation graphic application using TZelva. They will learn to use and modify the basic components to create graphic form of the resulting programming work. Some basic sorting algorithms of external and internal sorting will be the part of the course. Several separate programmes will form the output.
Requirements on student
- lecture and seminar attendance - regular seminar preparation at home - completion of tasks - self-study - simple programmes created during semester as seminar output (approx. 15 programmes) - self-produced correspondence tasks according to instructions (4 programmes) - exam preparation
Content
Programme structure, algorithm design. Programme proposal in Borland Delphi. Variables, declaration of variables; FOR-cycle, Object Zelva, use of Zelva. Conditional statements, conditional cycle. Subroutines - procedure and function declaration. Call by value, call by address. Character variables, text files. Type interval, type field. Character strings. Two-dimensional array. Bitmap images. Sorting Algorithms - external and internal sorting.
Activities
Fields of study
Guarantors and lecturers
Guarantors: Mgr. Bc. Libor Klubal, Ph.D. (100%),  Lecturer: Mgr. Tatiana Havlásková, Ph.D. (100%),  Mgr. Bc. Libor Klubal, Ph.D. (100%),  Tutorial lecturer: Mgr. Tatiana Havlásková, Ph.D. (100%),  Mgr. Bc. Libor Klubal, Ph.D. (100%),
Literature
Basic: Kostolányová, K. Algoritmizace a řešení problémů. Ostrava: Repronis, 2008. ISBN 80-7042-227-0. Basic: CANTÚ, M. Myslíme v jazyku Delphi 7. Praha: Computer Press, 2003. ISBN 80-247-0694-6. Basic: Častová, N., Šarmanová, J. Počítače a algoritmizace. Ostrava: VŠB TU Ostrava, 1987. ISBN cnb000037489. Basic: Nagyová, I. Základy programování. Ostrava: Repronis, 2008. ISBN 978-80-7368-275-0. On-line library catalogues
Time requirements
All forms of study Activities Time requirements for activity [h] Being present in classes 18 Unaided e-learning tasks completion 20 Self-tutoring 20 Consultation of work with the teacher/tutor (incl. electronic) 15 Scientific text studying in the Czech language 30 Preparation for an exam 30 Continuous tasks completion (incl. correspondence tasks) 50 Total 183
Prerequisites
Learning outcomes
Knowledge - knowledge resulting from the course: The student will acquire: knowledge of the basic structure and organization of algorithms; knowledge of the fundamentals of programming language Object Pascal in Delphi ? assignment command, loop command, structuring the program into subprograms, fieldwork and with files etc.; - knowledge of sorting algorithms; ability to read and write program code; ability to work with the object TZelva and building simple graphical application; ability to use the basic components of Delphi; competence in creative working, analyzing and solving problems; Information technology skills - IT skills.
Assessment methods
Knowledge - knowledge achieved by taking this course are verified by the following means: Continuous analysis of student´s achievements Oral examination Point system Verbal evaluation Written examination
Teaching methods
Knowledge - the following training methods are used to achieve the required knowledge: Ability and practical skills Activities (simulations, games, dramatizations) Briefing Computer-based tutoring Demonstration E-learning (tutorial, electronic study materials) Monologic (explanation, lecture, briefing) Projection (static, dynamic) Working with text (coursebook, book) Written assignments (eg. comprehensive examination, written examination)