|
|
Main menu for Browse IS/STAG
Course info
KID / YCPAP
:
Course description
Department/Unit / Abbreviation
|
KID
/
YCPAP
|
Academic Year
|
2023/2024
|
Academic Year
|
2023/2024
|
Title
|
Algorithm and programming practicum
|
Form of course completion
|
Course-credit
|
Form of course completion
|
Course-credit
|
Accredited / Credits
|
Yes,
3
Cred.
|
Type of completion
|
Combined
|
Type of completion
|
Combined
|
Time requirements
|
Seminar
12
[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
|
NO
|
Language of instruction
|
Czech
|
Occ/max
|
|
|
|
Automatic acceptance of credit before examination
|
No
|
Summer semester
|
0 / -
|
0 / -
|
40 / -
|
Included in study average
|
NO
|
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 |
0
|
Evaluation scale |
S|N |
Periodicity |
každý rok
|
Periodicita upřesnění |
|
Fundamental theoretical course |
No
|
Fundamental course |
No
|
Fundamental theoretical course |
No
|
Evaluation scale |
S|N |
Substituted course
|
KID/DPZPK
|
Preclusive courses
|
KID/XCPAP
|
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 subject is focused on deepening and practical mastering of the subject matter Algorithm Development and Programming. It is designated mainly for students without sufficient practical experience with algorithm development, with programming in C# language and with creating simple console as well as window applications in the Microsoft Visual Studio environment.
|
Requirements on student
|
Given assignment confirms that a student has attended lessons to the extent required and fulfilled qualified requirements. Conditions for credit are: active work at exercises, min. 75% presence.
|
Content
|
Introduction to the course. Algorithm and its notation. Program structure, local variable and constant declaration, basic operation with numbers, data input and output. Operators and expressions. Summary of statements. Block and if statement. Algorithms with branching. Switch statement. Algorithms with branching. Methods for mathematical operation. Iteration statements. Algorithms with iterations without arrays. Value data types. Enum type. Conversion among data types. Data type array. One dimensional array. Operations with strings. Generating random numbers. Algorithms with one dimensional arrays. Program debugging. Multidimensional array. Algorithms for work with matrix. Subroutines, static method declaration, parameters, method calling. Classes - signification, declaration, instantiation, using. Text files - classes for work with files, data reading and writing. Additional C# language options, form application programming.
|
Activities
|
|
Fields of study
|
|
Guarantors and lecturers
|
|
Literature
|
-
Recommended:
Greiner, Karel. Studijní materiály z přednášek a cvičení předmětu Algoritmizace a programování.
|
Prerequisites - other information about course preconditions |
- |
Competences acquired |
After finishing this course students will be able to design and realize algorithms of basic problems in Visual Studio IDE. |
Teaching methods |
- Monologic (reading, lecture, briefing)
- Methods of individual activities
- Demonstration
- Graphic and art activities
|
Assessment methods |
- Student performance assessment
|
|
|
|