Degree Plans - General Computer Science

The specialization General Computer Science is suitable mainly for students interested in obtaining a solid foundation in computer science and mathematics, and who aim to follow their bachelor studies with a master's programme of study. Students are also well prepared for the job market, too. Taking General Computer Science allows the student to pursue algorithms, optimization, and their guiding principles, and also discrete mathematics.

Common obligatory courses in Computer Science

Common obligatory courses for all specializations are listed above in the section giving general information.

2.1 Obligatory Courses

2.2 Elective Courses

Elective courses – group 1

A prerequisite for taking either part of the State Final Exam is to have obtained at least 30 credits from courses in this group.

Elective courses – group 2

A prerequisite for taking either part of the State Final Exam is to have obtained at least 5 credits from courses in this group.

Elective courses – group 3

A prerequisite for taking either part of the State Final Exam is to have obtained at least 45 credits from elective courses overall. There is no specific limit for this third group.

2.3 Recommended Course of Study

The recommended course of study gives all the obligatory courses, while only some elective courses and optional courses are listed. Students need to choose other such courses themselves. Obligatory courses are printed in boldface, elective courses in roman, and optional courses in italics.

First year

Second year

Third year

Recommended elective courses

2.4 State Final Exam

The State Final Exam knowledge requirements common to all specializations are described in the first section of this chapter (General Information on Computer Science bachelor's degree plans). Students of the General Computer Science specialization will be further tested according to the list below from topics 1.-3. and from two selected topics among 4.-7. The choice of these two topics is to be declared by the student when signing up for the State Final Exam.

1. Networking Fundamentals
Taxonomy of computer networks. ISO/OSI reference architecture. Overview of the TCP/IP protocol model. Routing. Addresses, ports, sockets. Client-server architectures. Fundamentals of HTTP, FTP and SMTP protocols.

Relevant courses:

– Introduction to Networking (NSWI141)

2. Combinatorics
Generating functions. Estimates of factorials and binomial coefficients. Ramsey theorems. Error-correcting codes.

Relevant courses:

– Combinatorics and Graph Theory 1 (NDMI011)

– Combinatorics and Graph Theory 2 (NDMI012)

3. Multivariable Differential and Integral Calculus
Riemann integral. Extreme values of multivariable functions. Metric spaces, open and closed sets. Compactness.

Relevant courses:

– Mathematical Analysis 2 (NMAI055)

4. Optimization Methods
Polyhedra, Minkowski–Weyl theorem. Basics of linear programming, duality theorems, algorithms for LP. Edmonds' algorithm. Integer programming. Approximation algorithms for combinatorial problems (satisfiability, independent set, set cover, scheduling). Applications of linear programming to approximation algorithms. The use of probability in the design of algorithms.

Relevant courses:

– Linear Programming and Combinatorial Optimization (NOPT048)

– Discrete and Continuous Optimization (NOPT046)

5. Advanced Algorithms and Data Structures
Random-access machine (RAM). Dynamic programming. Strongly connected components of directed graphs. Maximal flows: algorithms, applications. Flows and paths in graphs with integer weights. Text search algorithms. DFT and its applications. Approximation algorithms and schemes. Parallel algorithms in Boolean circuits and comparator networks.

Relevant courses:

– Algorithms and Data Structures 1 (NTIN060)

– Algorithms and Data Structures 2 (NTIN061)

– Graph Algorithms (NDMI010)

6. Geometry
Basic theorems about convex sets (Helly, Rado, separation). Minkowski's lattice theorem. Convex polytopes (basic properties, V-polytopes, H-polytopes, combinatorial complexity). Geometric duality. Voronoi diagrams, hyperplane arrangements, point-line incidences. Elementary computational geometry algorithms (construction of a line arrangement in the plane, construction of a convex hull in the plane).

Relevant courses:

– Introduction to Combinatorial and Computational Geometry (NDMI009)

7. Advanced Discrete Mathematics
Graph colouring (Brooks' and Vizing's theorem). Tutte's theorem. Extremal combinatorics (Turán's theorem, Erdös–Ko–Rado theorem). Drawing graphs on surfaces. Sets and mappings. Subvalence and equivalence of sets. Well-ordered sets. Axiom of choice (Zermelo's theorem, Zorn's lemma).

Relevant courses:

– Combinatorics and Graph Theory 2 (NDMI012)

– Set Theory (NAIL063)