Main page | Study Branches/Specializations | Groups of Courses | All Courses | Roles                Instructions

A course is the basic teaching unit, it's design as a medium for a student to acquire comprehensive knowledge and skills indispensable in the given field. A course guarantor is responsible for the factual content of the course.
For each course, there is a department responsible for the course organisation. A person responsible for timetabling for a given department sets a time schedule of teaching and for each class, s/he assigns an instructor and/or an examiner.
Expected time consumption of the course is expressed by a course attribute extent of teaching. For example, extent = 2 +2 indicates two teaching hours of lectures and two teaching hours of seminar (lab) per week.
At the end of each semester, the course instructor has to evaluate the extent to which a student has acquired the expected knowledge and skills. The type of this evaluation is indicated by the attribute completion. So, a course can be completed by just an assessment ('pouze zápočet'), by a graded assessment ('klasifikovaný zápočet'), or by just an examination ('pouze zkouška') or by an assessment and examination ('zápočet a zkouška') .
The difficulty of a given course is evaluated by the amount of ECTS credits.
The course is in session (cf. teaching is going on) during a semester. Each course is offered either in the winter ('zimní') or summer ('letní') semester of an academic year. Exceptionally, a course might be offered in both semesters.
The subject matter of a course is described in various texts.

BIK-SAP.21 Computer Structure and Architecture Extent of teaching: 14KP+6KC
Instructor: Daňhel M. Completion: Z,ZK
Department: 18103 Credits: 5 Semester: L

Annotation:
Students will get acquainted with the basic architecture and units of a digital computer, understand the structure, function, and implementation of arithmetic-logic unit , controllers, memory, I/O communication, methods of data transfers between the units. The logic design and the implementation of a program-controlled simple processor is practically implemented in the labs using programmable circuits (FPGA), a single-chip microcomputer, and modern design (EDA) tools.

Lecture syllabus:
1. Computer organization, units and their interfaces. Logic functions, combinatorial components, gate-level design.
2. Structure of sequential components, description and implementation. Mealy and Moore type of implementation. Typical combinatorial and sequential components of a computer.
3. Data, storage and processing. Representation of negative numbers, fix-point and floating point numbers.
4. Implementation of arithmetic operations. Memory structures and design principles.
5. Computer memory system. Input-output components, buses and communication.
6. Instruction set architecture and machine code. Instruction cycle.
7. Control units.

Seminar syllabus:
1. Numeral systems and conversions. Representation of negative numbers and arithmetic operations. Fix point and floating point numbers. Combinatorial components design (gate level). Implementation of sequential components.
2. [2] Implementation of logic circuits. Hardware implementation of arithmetic operations. Memories. Simple processor structure and machine code. Machine code design. Machine code debugging. Assessment.

Literature:
1. Patterson D. A., Hennessy J. L. : Computer Organization and Design: The Hardware/Software Interface (5th Edition). Morgan Kaufmann, 2014. ISBN 978-0128012857.
2. Wakerly J. F. : Digital Design: Principles and Practices (5th Edition). Pearson, 2018. ISBN 978-0134460093.
3. Mano M.M., Ciletti M.D. : Digital Design: With an Introduction to the Verilog HDL, VHDL, and SystemVerilog (6th Edition). Pearson, 2017. ISBN 978-0134549897.
4. Kubátová H. : Struktura a architektura počítačů s řešenými příklady. ČVUT Praha, 2016. ISBN 978-80-01-06410-8.

Requirements:
Basic knowledge of physical principles of digital circuits (transistors as switches, implementation of registers, data storage principles) and fundamentals of discrete mathematics (number representation systems, Boolean algebra).

Informace o předmětu a výukové materiály naleznete na https://courses.fit.cvut.cz/BI-SAP/

The course is also part of the following Study plans:
Study Plan Study Branch/Specialization Role Recommended semester
BIK-IB.21 Information Security 2021 (in Czech) PP 2
BIK-SPOL.21 Unspecified Branch/Specialisation of Study PP 2
BIK-PV.21 Computer Systems and Virtualization 2021 (in Czech) PP 2
BIK-PS.21 Computer Networks and Internet 2021 (in Czech) PP 2
BIK-SI.21 Software Engineering 2021 (in Czech) PP 2


Page updated 26. 4. 2024, semester: Z/2020-1, L/2021-2, L/2019-20, L/2022-3, Z/2019-20, L/2020-1, L/2023-4, Z/2022-3, Z/2021-2, Z/2023-4, Z/2024-5, Send comments to the content presented here to Administrator of study plans Design and implementation: J. Novák, I. Halaška