Charles University

Overview

The Master of Science in Computer Science at Charles University, with a specialization in Discrete Models and Algorithms, equips students with advanced skills in mathematics and algorithms aimed at designing and analyzing discrete systems. This two-year full-time program offers in-depth knowledge in critical areas such as optimization, decision-making procedures, and formal methods, preparing graduates for both research and industry careers.

What you'll study

Programme Structure

The curriculum combines rigorous coursework in discrete mathematics and theoretical computer science with practical modules focused on algorithmic applications. Students will engage with core subjects and select electives, culminating in a master’s thesis or capstone project.

Indicative course areas

• Decision procedures and SAT/SMT solvers
• Optimization and algorithmic reasoning for discrete models
• Evolutionary algorithms
• Lambda calculus and functional programming
• Embedded and real-time systems
• Statistical methods in natural language processing
• Machine learning in bioinformatics

Capstone / Thesis

In the final phase of the program, students will undertake a master’s thesis or a comparable research project under the guidance of faculty. The thesis will focus on topics related to discrete models, algorithms, or associated theoretical and computational methodologies.

Entry requirements

No specific GRE, GMAT, or GPA grading score requirements have been noted for this program. Prospective students should submit an online application through the admissions process at Charles University.

Career prospects

Graduates of the MSc in Computer Science with a focus on Discrete Models and Algorithms can pursue diverse career paths in both academia and industry. Opportunities may include roles in software development, data analysis, algorithm design, and research positions in various sectors, including technology, finance, and healthcare.