|
|
Main menu for Browse IS/STAG
Course info
KPV / TI
:
Course description
Department/Unit / Abbreviation
|
KPV
/
TI
|
Academic Year
|
2023/2024
|
Academic Year
|
2023/2024
|
Title
|
Introduction to Comp. Sc. in Mech. Eng.
|
Form of course completion
|
Exam
|
Form of course completion
|
Exam
|
Accredited / Credits
|
Yes,
4
Cred.
|
Type of completion
|
Combined
|
Type of completion
|
Combined
|
Time requirements
|
Lecture
2
[Hours/Week]
Tutorial
2
[Hours/Week]
|
Course credit prior to examination
|
Yes
|
Course credit prior to examination
|
Yes
|
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
|
229 / -
|
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
|
10
|
Optional course |
Yes
|
Optional course
|
Yes
|
Language of instruction
|
Czech
|
Internship duration
|
0
|
No. of hours of on-premise lessons |
|
Evaluation scale |
1|2|3|4 |
Periodicity |
každý rok
|
Evaluation scale for credit before examination |
S|N |
Periodicita upřesnění |
|
Fundamental theoretical course |
Yes
|
Fundamental course |
Yes
|
Fundamental theoretical course |
Yes
|
Evaluation scale |
1|2|3|4 |
Evaluation scale for credit before examination |
S|N |
Substituted course
|
None
|
Preclusive courses
|
KIV/PPA1 and KPV/TIA
|
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 course is intended to give students a good insight into the following areas:
fundamentals of technical informatics, computer systems, algorithms and programs, programming languages and compilers, basics of Pascal: program structure, lexical elements, identifiers, constants, variables, Pascal types: integer, real, char, Boolean, string; input/output, assignment statement, compound statement, if and case statements, loop statements (While, Repeat, For), goto statement, empty statement; procedures and functions, block structure, parameters, recursivity; user Pascal types: intervals, enumerated types, sets, arrays, records, files, pointers.
|
Requirements on student
|
To pass the credit it is necessary to actively participate in seminars, passing tests.
To pass the exam it is necessary to successfully pass its written and oral part.
A point system will be used for credit and examination - detailed conditions are given in courseware.
|
Content
|
The course offers students an overview of the following areas: algorithmization, programming software, programming languages in general, 3rd generation object-oriented programming language and data processing.
1. Introduction, credit and exam conditions, recommended literature, e-learning courses, algorithmization
2. Flowcharts, programming languages in general, basic concepts, basic commands, simplified input and output commands, operators, intuitive examples
3. Method with output and without parameters, method with output and with parameters, method without output and with parameters, method calls, real and formal parameter, return of multiple outputs
4. Parameter passed by value, reference, output parameter, expression-oriented method, method overloading, optional parameters, parameter naming, recursion
5. Decision making - complete branching, incomplete branching, relational operators, logical operators, ternary conditional operator, cascading, multiple branching
6. Loop - loop with condition at the beginning, loop with condition at the end, loop with step, loop control
7. Exceptions - error and exception handling, exception handling, unhandled exceptions, handling multiple exceptions, exception filtering, exception invocation, finally block, exception classes
8. Data types - overview, value types - integer, conversions, real number, character, logical data type
9. Value types - enumeration type, structure, difference between structure and class
10. Reference types - overview, stack, heap, arrays - one dimensional, two dimensional, three dimensional, multi dimensional
11. Class - description, encapsulation, declaration, static class, data components, methods, constructors, destructor, anonymous class
12. Solving sample examples
13. Solving sample examples
|
Activities
|
|
Fields of study
|
Studentům jsou k dispozici studijní materiály umístěné v kurzech (cvičení a přednášek) v prostředí Moodle. Tyto materiály jsou následně využity jako podklady pro osvojení teoretických a praktických poznatků využitelných při řešení příkladů realizovaných během cvičení, nebo přednášek.
|
Guarantors and lecturers
|
-
Guarantors:
Doc. Ing. Pavel Kopeček, CSc. (100%),
-
Lecturer:
Doc. Ing. Petr Hořejší, Ph.D. (100%),
Doc. Ing. Pavel Kopeček, CSc. (20%),
Doc. Ing. Pavel Raška, Ph.D. (80%),
-
Tutorial lecturer:
Ing. Matěj Dvořák (100%),
Doc. Ing. Petr Hořejší, Ph.D. (25%),
Doc. Ing. Pavel Kopeček, CSc. (50%),
Ing. Jan Kubr (100%),
Ing. Bc. Miroslav Malaga, Ph.D. (100%),
Doc. Ing. Pavel Raška, Ph.D. (25%),
Doc. Ing. Zdeněk Ulrych, Ph.D. (100%),
|
Literature
|
|
Time requirements
|
All forms of study
|
Activities
|
Time requirements for activity [h]
|
Contact hours
|
52
|
Preparation for an examination (30-60)
|
36
|
Preparation for formative assessments (2-20)
|
16
|
Total
|
104
|
|
Prerequisites
|
Knowledge - students are expected to possess the following knowledge before the course commences to finish it successfully: |
understand what mathematical logic is |
know the properties of integers and real numbers and operations with them |
Skills - students are expected to possess the following skills before the course commences to finish it successfully: |
be able to work with MS Office tools (Word, Excel) |
be able to work with PC |
be able to think logically |
|
Learning outcomes
|
Knowledge - knowledge resulting from the course: |
know what an algorithm is, its properties and possibilities of its description, resp. display |
know the basic features of the 3rd generation programming language |
know what structured and object-oriented programming is |
Skills - skills resulting from the course: |
create a simple form application in an object-oriented programming system |
create simple algorithms for technical calculations, including work with arrays |
express the algorithm graphically |
be able to write to and read from a file |
|
Assessment methods
|
Knowledge - knowledge achieved by taking this course are verified by the following means: |
Combined exam |
Test |
Skills - skills achieved by taking this course are verified by the following means: |
Skills demonstration during practicum |
|
Teaching methods
|
Knowledge - the following training methods are used to achieve the required knowledge: |
E-learning |
Individual study |
One-to-One tutorial |
Interactive lecture |
Seminar classes |
Skills - the following training methods are used to achieve the required skills: |
Multimedia supported teaching |
Task-based study method |
|
|
|
|