Course detail

PC Seminar

FIT-ISCAcad. year: 2022/2023

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. 

Language of instruction

Czech

Number of ECTS credits

2

Mode of study

Not applicable.

Guarantor

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

Department

Department of Information Systems (UIFS)

Learning outcomes of the course unit

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

Prerequisites

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.

Co-requisites

Not applicable.

Planned learning activities and teaching methods

The course is running in the first half of the semester only by way of lectures (mandatory attendance), excercises and individual projects. 

 

Assesment methods and criteria linked to learning outcomes

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

 

Course curriculum

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

Work placements

Not applicable.

Aims

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. 

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

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.

Recommended optional programme components

Not applicable.

Prerequisites and corequisites

Not applicable.

Basic literature

Not applicable.

Recommended reading

Aho A.V., Hoppcroft J.E., Ullman J.D.: Data Structures and Algorithms.
Baase, S.: Computer Algorithms - Introduction to Design and Analysis. Addison Wesley, 1998
BS ISO/IEC 9899:2011, Information technology. Programming languages. C, 2012, ISBN 978 0 580 80165 5.
Cormen, T.H., Leiserson, Ch.E., Rivest, R.L.: Introduction to Algorithms.
Cormen, T.H., Leiserson, Ch.E., Rivest, R.L.: Introduction to Algorithms.
Honzík, J., Hruška, T., Máčel, M.: Vybrané kapitoly z programovacích technik, Ed.stř. VUT Brno, 1991.
Kruse, R.L.: Data Structures and Program Design. Prentice- Hall,Inc. 1984
Prokop,J.: Algoritmy v jazyku C a C++. Grada Publishing, 2015.
Sedgewick ,R.: Algoritmy v C. (Základy. Datové struktury. Třídění. Vyhledávání.) Addison Wesley 1998. Softpress 2003.

Elearning

eLearning: currently opened course

Classification of course in study plans

  • Programme BIT Bachelor's 1 year of study, winter semester, elective
  • Programme BIT Bachelor's 1 year of study, winter semester, elective

  • Programme IT-BC-3 Bachelor's

    branch BIT , 1 year of study, winter semester, elective

  • Programme VUB Bachelor's

    branch VU-D , 2 year of study, winter semester, elective
    branch VU-D , 2 year of study, winter semester, elective
    branch VU-IDT , 2 year of study, winter semester, elective
    branch VU-VT , 2 year of study, winter semester, elective
    branch VU-VT , 2 year of study, winter semester, elective
    branch VU-VT , 2 year of study, winter semester, elective
    branch VU-VT , 2 year of study, winter semester, elective
    branch VU-IDT , 2 year of study, winter semester, elective
    branch VU-IDT , 2 year of study, winter semester, elective
    branch VU-IDT , 2 year of study, winter semester, elective
    branch VU-IDT , 2 year of study, winter semester, elective
    branch VU-VT , 2 year of study, winter semester, elective
    branch VU-D , 2 year of study, winter semester, elective
    branch VU-VT , 2 year of study, winter semester, elective
    branch VU-IDT , 2 year of study, winter semester, elective
    branch VU-IDT , 2 year of study, winter semester, elective

Type of course unit

 

Lecture

12 hod., compulsory

Teacher / Lecturer

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

Syllabus

  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.

Exercise in computer lab

12 hod., compulsory

Teacher / Lecturer

Ing. Tomáš Švec
Ing. Karel Ondřej
Ing. Dominik Harmim
Ing. Bořek Reich
Ing. Daniel Snášel
Mgr. Jozef Drga

Syllabus

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

Project

2 hod., compulsory

Teacher / Lecturer

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

Elearning

eLearning: currently opened course