E2011 Theoretical Fundamentals of Computer Science

Faculty of Science
Autumn 2023
Extent and Intensity
2/1/0. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium).
Teacher(s)
doc. Ing. Vlad Popovici, PhD (lecturer)
Mgr. Jan Böhm (assistant)
Guaranteed by
doc. Ing. Vlad Popovici, PhD
RECETOX – Faculty of Science
Contact Person: doc. Ing. Vlad Popovici, PhD
Supplier department: RECETOX – Faculty of Science
Timetable
Tue 8:00–11:50 F01B1/709
Prerequisites
! Bi2011 Theor. Fundam. Comp. Sci.
None, it is a basic course.
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
Course objectives
The course will provide a first exposure to various computing platforms and paradigms.
Learning outcomes
The students will be able to understand the fundamentals of Boolean algebra, data representation and scientific computing.
Syllabus
  • Computing platforms: historical perspective; modern architectures.
  • Data representation: numeral systems; precision.
  • Boolean algebra; propositional calculus.
  • Brief introduction to algorithms and complexity.
  • Programming paradigms.
  • Invited talks.
  • Literature (available as PDF from Springer-Verlag within the campus)
  • Jenkyns T., Stephenson B., Fundamentals of Discrete Math for Computer Science. 2nd Ed. Springer 2018
  • Makinson, D., Sets, Logic and Maths for Computing. 3rd Ed., Springer 2020
Teaching methods
lectures, guided discussions
Assessment methods
Lectures, class discussion;
Final written exam.
Language of instruction
English
Further Comments
Study Materials
The course is taught annually.
The course is also listed under the following terms Autumn 2022, Autumn 2024, Autumn 2025.
  • Enrolment Statistics (Autumn 2023, recent)
  • Permalink: https://is.muni.cz/course/sci/autumn2023/E2011