Computer Science

The royal discipline of computer science focuses on the study of efficient algorithms. It pays close attention to its principles and laws. The knowledge you gain will never become obsolete because they deal with the essence of informatics. You will get acquainted with the basic styles of high-level programming languages, with the principles of their implementation and with the basic methods of extracting knowledge from data. You will enjoy creating efficient algorithms and logic to the fullest. You can also try everything in practice.

What will you learn?

We will teach you to think critically about algorithms and create them so that they always work effectively. As a graduate, you will know how programming languages work and where their limits are. You will be able to:

  • Analyze algorithmic problems and assess their complexity
  • Create efficient algorithms
  • Understand the principles and implementations of high-level programming languages

What jobs will you be able to do?

Although the name of the specialization strongly smells of a theoretical level, its graduates will definitely not get lost in practice. They can be used as high-quality programmers, analysts or in the field of data processing. You can become:

  • Problem-solving analyst or designer in development teams
  • Programmer with knowledge of creating efficient algorithms
  • Specialist for processing large volumes of data
  • Specialist in algorithmic tasks in application areas

Specialization is focused on these topics

Theoretical Computer Science

We do research in the areas of algorithm theory, stringology, data compression, arbology, compilers, artificial intelligence and machine learning.

Research groups

Arbology

In this group, we focus on research in the theory of algorithms for processing of tree data structures. Examples of tree structures include abstract syntactic trees or XML documents. With regard...

Graphs, Games, Optimization, Algorithms, Theoretical Computer Science (G²OAT)

The G²OAT research group focuses on research in discrete optimization.

The Prague Stringology Club (PSC)

The researchers of the Prague Stringology Club deal with processing one dimensional strings, their efficient storage, and pattern matching. The main research topics are stringology, data...

What have we achieved?

FIT CTU student received the extraordinary Professor Vlček scholarship

Students awarded at SVOČ competition

Fulfilling children’s wishes makes it to Forbes 30 under 30

FIT students’ app motivates millions of people around the world to improve their fitness

All success stories

Guarantor

Department of Theoretical Computer Science

doc. Ing. Jan Janoušek, Ph.D.

Head of the Department of Theoretical Computer Science

The person responsible for the content of this page: Ing. Zdeněk Muzikář, CSc.