Course details

PC Seminar

ISC Acad. year 2020/2021 Winter semester 2 credits

This is an intensive course running in the first half of the semester only. The aim is to bring to life the work with a computer from a view of the software creation. Especially, the course concentrates on number manipulation and treatment in various numeral systems and their representation in the computer as it is common in everyday programming practice. Together with this, elementary terms used in program development and implementation are discussed. Next, it is presented usage of tools supporting efficient (not only) program creation and development. The last, but not least topic presented is the ability to present results of projects, measurements, ideas, etc., in a suitable way using PC.


Deputy Guarantor

Language of instruction




Time span

12 hrs lectures, 12 hrs pc labs, 2 hrs projects

Assessment points

76 mid-term test, 12 exercises, 12 projects



Jeřábek Kamil, Ing. (DIFS FIT BUT)
Květoňová Šárka, Ing., Ph.D. (DIFS FIT BUT)
Zobal Lukáš, Ing. (DIFS FIT BUT)


Kohút Jan, Ing. (DCGM FIT BUT)
Květoňová Šárka, Ing., Ph.D. (DIFS FIT BUT)
Orsák Michal, Ing. (DCSY FIT BUT)
Sakin Martin, Ing. (DITS FIT BUT)
Švec Tomáš, Ing. (DCGM FIT BUT)

Subject specific learning outcomes and competences

  • The student gains an overview of basic work with a computer, especially, for what a computer is used and how it works.
  • S/he gets to know key domains where a computer plays an irreplaceable role (e.g. audio/video processing, biometrics, robotics, web design etc.).
  • S/he understands the meaning of a computer and its exploitation in order to build a software.
  • S/he gets to know the basic (abstract) data types and structures.
  • S/he gains the basic generic and general knowledge from programming languages domain.
  • S/he understands the ways of numbers manipulation and representation in a computer (how a man and a computer work with numbers /usually different way/ and why there are some complications with real /floating point/ numbers).
  • S/he gains an overview about common editors, usage of tool-tips/hints and utilities that make the work on a computer more efficient (e.g. software development).
  • S/he accomplishes manners of result presentation: word processor - WYSIWYG, PSpad, Notepad++, Eclipse, spreadsheets, electronic presentation (ppt, excel, word), WWW pages editors, interconnection and portability of documents, alternative office applications.

Generic learning outcomes and competences

  • The student learns domain-specific terminology in Czech and English language
  • The student learns to create small software projects and related project documentation
  • The student learns to present and defend the results of their work

Learning objectives

Student accomplishes the understanding of the basic principles of the work with a computer and s/he will be able to use this knowledge in the process of programs creation. The student will understand the way of the saving and representation of numbers in a computer. Student gets to know the manners of results presentation (word processor and spreadsheet editor) and tools supporting the more effective creation of programs. The student will understand the basic terms that are relating to abstract data types and s/he learns to use them.

Why is the course taught

After taking PC Seminar students will have a good grasp of the basic work with a computer from a view of the software creation. The knowledge can be used in various areas of IT domains. 

Prerequisite kwnowledge and skills

This course takes place in the winter term of the first year of the bachelor's study program. Thus, we expect that students have the secondary school knowledge of mathematics and computer manoeuvring.

Study literature

Honzík, J., Hruška, T., Máčel, M.: Vybrané kapitoly z programovacích technik, Ed.stř. VUT Brno, 1991. (in Czech)
BS ISO/IEC 9899:2011, Information technology. Programming languages. C, 2012, ISBN 978 0 580 80165 5.
Prokop,J.: Algoritmy v jazyku C a C++. Grada Publishing, 2015. (in Czech)

Fundamental literature

  • Cormen, T.H., Leiserson, Ch.E., Rivest, R.L.: Introduction to Algorithms.
  • Aho A.V., Hoppcroft J.E., Ullman J.D.: Data Structures and Algorithms.
  • Kruse, R.L.: Data Structures and Program Design. Prentice- Hall,Inc. 1984
  • Baase, S.: Computer Algorithms - Introduction to Design and Analysis. Addison Wesley, 1998
  • Sedgewick, R.: Algoritmy v C. (Základy. Datové struktury. Třídění. Vyhledávání.) Addison Wesley 1998. Softpress 2003. (in Czech)

Syllabus of lectures

  1. Presentation of areas and domains where computers are the key tool, von Neumann computer architecture, the model of computation/evaluation, the model of program development and implementation.
  2. Representation and manipulation of numbers in a computer (the difference between viewing numbers as man and as a computer, problems in representation of fully floating point numbers in a computer).
  3. Elementary terms used in programming languages: expression, statement, statement composition, control flow determination.
  4. Elementary terms of algorithm description. Overview of data structures and their manipulation. Pointer as an abstract data type and its specification.
  5. Editors, exploitation of tool-tips/hints, various utilities.
  6. Tools for result presentation - text editors: WYSIWYG, PSpad, Notepad++, Eclipse; spreadsheets; electronic presentation (ppt, excel, word); WWW pages editors; interconnection and portability of documents; alternative office applications.

Syllabus of computer exercises

Seminars correspond to the content of individual lectures and demonstrate the presented topics.

Progress assessment

  • Evaluated individual assignments - up to 12 points
  • Attendance list of classes - up to 12 points
  • Final written test - up to 76 points

Controlled instruction

Within this course, attendance on the lectures is not monitored. The knowledge of students is examined by the active attending classes, individual assignments and by the final credit test.
The attendance in PC labs is awarded points. A possibility of a substitute is by an individual task.

Exam prerequisites

  • To earn at least 50 points within the semester


Tuecomp.lablectures N105 08:0009:50 1BIA 1BIB xx
Tuecomp.lablectures N105 10:0011:50 1BIA 1BIB xx
Tuecomp.lablectures N105 16:0017:50 1BIA 1BIB xx
Tuecomp.lablectures N105 18:0019:50 1BIA 1BIB xx
Wedcomp.lablectures N203 08:0009:50 1BIA 1BIB xx
Wedcomp.lablectures N203 10:0011:50 1BIA 1BIB xx
Wedcomp.lablectures N203 18:0019:50 1BIA 1BIB xx
Thulecturelectures E104 E112 08:0009:50 1BIA 1BIB xx
Thulecture2., 4., 5., 6., 7., 13. of lectures E112v 08:0009:50YT
Thuexam2021-01-21 A112 A113 D0206 D0207 D105 E105 G202 M103 M104 M105 N103 N104 N105 N203 N204 N205 09:0010:50 1BIA 1BIB řádná
Fricomp.lablectures N103 10:0011:50 1BIA 1BIB xx
Fricomp.lablectures N103 13:0014:50 1BIA 1BIB xx

Course inclusion in study plans

  • Programme BIT, 1st year of study, Elective
  • Programme IT-BC-3, field BIT, 1st year of study, Elective
Back to top