Course detail

Computer Science

FSI-1INAcad. year: 2007/2008

The course deals with the following topics: Algorithmization, control structures, data types, basic data structures. Recursion based algorithms. Abstract data structures and its implementation. Methodology in software design, top-down design principle, structured and modular programming. Introduction to object concept, object oriented programming. Pascal - program structure, variable declarations, data type definition, commands, procedures and function, working with files, dynamic variables and pointer type. Software development using Delphi environment. General structure of operating systems, using Windows. Introduction to word processors and spread sheets and databases. Introduction to the working in computer networks, Internet, email.

Language of instruction

Czech

Number of ECTS credits

5

Mode of study

Not applicable.

Guarantor

prof. RNDr. Ing. Tomáš Březina, CSc.

Department

Institute of Automation and Computer Science (ÚAI)

Learning outcomes of the course unit

Students will acquire the knowledge of program making methodology and principles of computers and computer networks. They will experience computer aided problems solving and will be able to use both hardware and software resources of computing systems.

Prerequisites

The usual secondary school computer literacy is supposed.

Co-requisites

Not applicable.

Planned learning activities and teaching methods

Teaching methods depend on the type of course unit as specified in the article 7 of BUT Rules for Studies and Examinations.

Assesment methods and criteria linked to learning outcomes

1. Individual elaboration of an assigned project.
2. Through-out tests – starting the 5th week the short test on computer, that contains modified examples explained during previous week, is realized at the beginning of every seminar.
3. A final test (13th week) – theoretical part on paper, practical part on computer.

Course curriculum

Not applicable.

Work placements

Not applicable.

Aims

Knowledge unification of 1st year students. Development of computers usage abilities. Implementation of the algorithmic thinking basics and a structured approach to problem solving.

Specification of controlled education, way of implementation and compensation for absences

The attendance at lectures is recommended while at seminars it is obligatory. Education runs according to week schedules. The form of compensation of missed seminars is fully in the competence of a tutor.

Recommended optional programme components

Not applicable.

Prerequisites and corequisites

Not applicable.

Basic literature

Wirth, N.: Algorithms and Data Structures

Recommended reading

Not applicable.

Classification of course in study plans

  • Programme B3901-3 Bachelor's

    branch B3942-99 , 1. year of study, winter semester, compulsory
    branch B3904-00 , 1. year of study, winter semester, compulsory
    branch B3940-00 , 1. year of study, winter semester, compulsory

  • Programme B2341-3 Bachelor's

    branch B2381-00 , 1. year of study, winter semester, compulsory
    branch B2339-00 , 1. year of study, winter semester, compulsory

Type of course unit

 

Lecture

26 hours, optionally

Teacher / Lecturer

RNDr. Jiří Dvořák, CSc.
Ing. Radek Poliščuk, Ph.D.
doc. Ing. Jan Roupec, Ph.D.

Syllabus

1. Introduction, basic terms, algorithmisation.
2. Resources of programs script, control structures.
3. Pascal program structure, expression and commands.
4. Data types.
5. Data structures.
6. Procedures and functions.
7. Recursion, dynamic data structures.
8. Life cycle of program.
9. Technology of programming.
10. Object programming in Pascal.
11. Numerical notations, structure of computer.
12. Hardware..
13. Operating systems and computer networks.

Exercise

12 hours, compulsory

Teacher / Lecturer

prof. RNDr. Ing. Tomáš Březina, CSc.

Syllabus

1. Arithmetic, logic and relational expressions, simple algoritms.
2. Algorithmisation, simple programs in Pascal.
3. Work with control structures, use of array.
4. Procedures and functions use.
5. Work with records and files.
6. Structured design of more complex program.
7. Final test.

Computer-assisted exercise

14 hours, compulsory

Teacher / Lecturer

RNDr. Jiří Dvořák, CSc.
Ing. Miroslav Holý
Ing. Jiří Kostiha
Ing. Petr Krček, Ph.D.
Ing. Jiří Liška
Ing. Petr Ludík
prof. Ing. Radomil Matoušek, Ph.D.
Ing. Jan Minařík
Ing. Martin Minařík, Ph.D.
Ing. Martin Odehnal
Ing. Oto Ondráček
Ing. Eduard Pavlech
Ing. Jitka Pavlíková
Ing. Petr Pernes
Ing. Radek Poliščuk, Ph.D.
doc. Ing. Jan Roupec, Ph.D.
Ing. Bořek Řezanina
Ing. Miroslav Zbořil

Syllabus

1. Windows environment, working in computer network, introduction to MS Office.
2. Simple programs in Pascal, Delphi environment, demonstration of Delphi projects.
3. Work with control structures, use of array.
4. Use of procedures and functions.
5. Work with records and files.
6. Implementation and debugging of more complicated project.