Course details

PC Seminar

ISC Acad. year 2024/2025 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. 

Guarantor

Květoňová Šárka, Ing., Ph.D. (DIFS)

Course coordinator

Kolář Dušan, doc. Dr. Ing. (DIFS)

Language of instruction

Czech, English

Completion

Credit

Time span

  • 12 hrs lectures
  • 12 hrs pc labs
  • 2 hrs projects

Assessment points

  • 70 pts mid-term test (written part)
  • 12 pts numeric exercises
  • 18 pts projects

Department

Department of Information Systems (UIFS)

Lecturer

Čejka Rudolf, Ing. (CVT)
Květoňová Šárka, Ing., Ph.D. (DIFS)

Instructor

Grézl František, Ing., Ph.D. (DCGM)
Klem Richard, Ing. (DCGM)
Květoňová Šárka, Ing., Ph.D. (DIFS)
Sakin Martin, Ing. (DITS)
Sedlák David, Ing. (DCSY)
Škarvada Libor, RNDr. (DIFS)

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 able to analyse and design simply algorithms. The student will understand the way of the saving and representation of numbers in a computer. 

  • 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.
  • 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).

Prerequisite knowledge 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

  • Cormen, T.H., Leiserson, Ch.E., Rivest, R.L.: Introduction to Algorithms.

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. Algorithms - terms and attributes. Design and implementation of algorithms.
  4. Problem-solving techniques.
  5. Overview of data structures and their manipulation. Pointer as an abstract data type and its specification.
  6. Elementary terms used in programming languages: expression, statement, statement composition, control flow determination. Summary.

Syllabus of computer exercises

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

  • General introduction, command line, SSH.
  • Numeral systems.
  • Basics of C, compiler phases, variables.
  • Pointers and structures.
  • Tools for supporting development.
  • LaTeX.

Syllabus - others, projects and individual work of students

  1. Numerical systems.
  2. Data structures.

Progress assessment

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

Within this course, attendance on the lectures is 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.

How to contact the teacher

by email

Schedule

DayTypeWeeksRoomStartEndCapacityLect.grpGroupsInfo
Mon exam 2024-11-04 E104 E105 E112 08:0009:50 Zápočtový test
Mon lecture 1., 2., 3., 4., 5., 6. of lectures E104 E105 E112 08:0009:50294 1BIA 1BIB xx Květoňová
Mon comp.lab 1., 2., 3., 4., 5., 6. of lectures N203 10:0011:5020 1BIA 1BIB xx Grézl
Mon comp.lab 1., 2., 3., 4., 5., 6. of lectures N203 12:0013:5020 1BIA 1BIB xx Škarvada
Mon comp.lab 1., 2., 3., 4., 5., 6. of lectures N203 14:0015:5020 1BIA 1BIB xx Škarvada
Mon comp.lab *) 1., 2., 3., 4., 5., 6. of lectures N203 16:0017:5020 1BIA 1BIB xx
Mon comp.lab *) 1., 2., 3., 4., 5., 6. of lectures N203 18:0019:5020 1BIA 1BIB xx
Tue comp.lab 1., 2., 3., 4., 5., 6. of lectures N203 08:0009:5020 1BIA 1BIB xx Sedlák
Tue comp.lab 1., 2., 3., 4., 5., 6. of lectures N203 10:0011:5020 1BIA 1BIB xx Sedlák
Tue comp.lab *) 1., 2., 3., 4., 5., 6. of lectures N203 14:0015:5020 1BIA 1BIB xx
Tue comp.lab 1., 2., 3., 4., 5., 6. of lectures N203 16:0017:5020 1BIA 1BIB xx Grézl
Wed comp.lab 1., 2., 3., 4., 5., 6. of lectures N203 08:0009:5020 1BIA 1BIB xx Sakin
Wed comp.lab 1., 2., 3., 5., 6. of lectures N203 10:0011:5020 1BIA 1BIB xx Sedlák
Wed comp.lab 1., 2., 3., 5., 6. of lectures N203 12:0013:5020 1BIA 1BIB xx Sedlák
Wed comp.lab 1., 2., 3., 4., 5., 6. of lectures N203 14:0015:5020 1BIA 1BIB xx Sakin
Wed comp.lab *) 1., 2., 3., 4., 5., 6. of lectures N203 16:0017:5020 1BIA 1BIB xx Sakin
Wed comp.lab *) 1., 2., 3., 4., 5., 6. of lectures N203 18:0019:5020 1BIA 1BIB xx
Fri comp.lab 1., 2., 3., 4., 5., 6. of lectures N204 08:0009:5020 1BIA 1BIB xx Klem
It is not possible to register this class in Studis. (Some exercises may be opened later if needed, but this is not guaranteed.)

Course inclusion in study plans

  • Programme BIT, 1st year of study, Elective
  • Programme BIT (in English), 1st year of study, Elective
Back to top