B_PrP Computer Principles

University of Finance and Administration
Winter 2021
Extent and Intensity
2/0/0. 6 credit(s). Type of Completion: zk (examination).
Teacher(s)
prof. Ing. Petr Berka, CSc. (seminar tutor)
prof. RNDr. Ondřej Čepek, Ph.D. (seminar tutor)
Guaranteed by
prof. RNDr. Ondřej Čepek, Ph.D.
Department of Computer Science and Mathematics – Departments – University of Finance and Administration
Contact Person: Ivana Plačková
Timetable of Seminar Groups
B_PrP/pAPH: Mon 14:00–14:44 S35, Mon 14:45–15:30 S35, except Mon 22. 11., except Mon 29. 11. ; and Mon 6. 12. 10:30–12:00 S35, Mon 13. 12. 10:30–12:00 S35, O. Čepek
B_PrP/vAPH: Fri 8. 10. 17:30–19:00 S34, 19:15–20:45 S34, Fri 22. 10. 17:30–19:00 S34, 19:15–20:45 S34, Fri 26. 11. 17:30–19:00 S34, 19:15–20:45 S34, Fri 10. 12. 19:15–20:45 S34, P. Berka
Prerequisites
This subject requires no special knowledge above common high school mathematics.
Course Enrolment Limitations
The course is offered to students of any study field.
Course objectives
The aim of this course is to familiarize the students with the lowest physical levels of a computer. Students will learn the history of the field, computer architectures, data representations, processors, control units, memory, interconecting systems, and buses. After completing the course, the student will be capable of - understanding the differences among particular computer architectures - critically evaluate advantages and disadvantages of different hardware components and whole computers and use this evaluation in practice (e.g. for purchasing purposes).
Learning outcomes
Knowledge of computer architectures, data representations in computer memory, CPU construction, computer memory function, design of interconnecting systems (bus architectures)
Syllabus
  • 1. History of computers (up to the mainframes of the 50's)
  • 2. Development of computers in the modern era
  • 3. Different computer architectures
  • 4. Representations of character and logical data
  • 5. Number systems, representations of integer data
  • 6. Representations of floating point numerical data
  • 7. Instructions, instructions as a type of data, types of addressing
  • 8. Logic gates and logic circuits
  • 9. Examples of logic circuits used in ALU and in memory
  • 10. Memory, properties, types of memory according to several criteria
  • 11. Processor, control unit, ALU
  • 12. Interconnecting systems, buses
Literature
    recommended literature
  • Stallings, William. Computer Organisation and Architecture: Designing for Performance (11th edition). Pearson Publishing 2018. ISBN 0-13-499719-0.
Teaching methods
The instruction is conducted in the form of lectures for full time students and group consultations for part tiem students. The minimum mandatory attendance at lectures is 75% and minimum mandatory attendance at group consultations is 50%. Students not fulfilling the mandatory attendance will be assigned extra coursework to make up for the absences.
Assessment methods
The course is completed with a written exam which consists of 15 multiple choice questions and 5 questions requiring an independently formulated answer (usually containing some computation). The exam is evaluated on a point scale. At least 10 out of 30 possible points are required to pass the exam.
Language of instruction
Czech
Further comments (probably available only in Czech)
The course can also be completed outside the examination period.
Information on the extent and intensity of the course: 14 hodin KS/semestr.
Teacher's information
http://ktiml.mff.cuni.cz/~cepek/vyuka.html
The course is also listed under the following terms Winter 2007, Summer 2008, Winter 2008, Summer 2009, Winter 2009, Summer 2010, Winter 2010, Summer 2011, Winter 2011, summer 2012, Winter 2012, Winter 2013, Winter 2014, Winter 2015, Winter 2016, Winter 2017, Winter 2018, Winter 2019, Winter 2020, Winter 2022, Winter 2023, Winter 2024.
  • Enrolment Statistics (Winter 2021, recent)
  • Permalink: https://is.vsfs.cz/course/vsfs/winter2021/B_PrP