MasterMedia and communication

Media Informatics

Master Medieninformatik

Universität Wien · Vienna · Austria

A 4-semester master's programme, taught in English, in Vienna.

Price€726.72/ semester · year not stated · non-EU Year not statedConfirm with the source
Next dateApply by
LanguageEnglish⁠Requires B2 level
Duration4 semesters⁠

✓ 6 official sources · checked 31 Oct 2026

Official page ↗
What you will study

19 modules published

What are all the subjects?

All 19 modules

Data and computing

6

Specialist subjects

4

Languages and communication

4

Projects and labs

3

Research methods

2

The institution lists these modules without a year. Source: studieren.univie.ac.at, checked 31 Oct 2026

The degree in facts
LevelMaster · EQF 7, ISCED 7⁠
QualificationMaster of Science · Abbr: MSc⁠
Credits120 ECTS⁠
Study modeNot found on official pages
DeliveryNot found on official pages
Places
  • Notetotal for Computer Science and Media Informatics, for applicants who participate in the selection procedure⁠
  • Value85⁠
What comes after?
9.2Average study duration semesters · November 2025
4Graduates past year · November 2025
62Students total · November 2025
€4,145Gross monthly income 3y after graduation · 2025
Where graduates work
Computer graphics and virtual realityDigital media productionHuman-machine communicationLeading research and development teamsSoftware development
Codes and faculty
Code066 935⁠
How it differs

Against similar programmes

Where this programme leans, compared with the same level and field.

What is there more of here?

More projects and labs than 2 of 2 similar

Share of credits by theme. Right: modules counted. Our classification by module titles.

This programmeMedia Informatics Universität Wien19
Interactive Media FH OÖ27
Contemporary History and Media Universität Wien16

1 of 3 similar programmes publish too few modules to compare.

  • Specialist subjects
  • Data and computing
  • Languages and communication
  • Research methods
  • Projects and labs
  • Thesis
Is this a typical programme?

More projects and labs, less research methods

Share here against the average of 2 similar programmes. Our classification by module titles.

More here than typical

Projects and labs
19% here
6% typical
Data and computing
26% here
17% typical
Specialist subjects
19% here
12% typical

Less here than typical

Research methods
6% here
21% typical
Thesis
0% here
11% typical
Languages and communication
29% here
33% typical
Where you'll study

Studying in Vienna

What is the campus like?
City sizeOver 1 million people · our calculation from Wikidata: about 2,028,289 in 2025
Distance to the centre≈ 1 km from the centre, straight line · our calculation
HousingHelp finding a room, no rooms of its ownInferred
RankingAcademic Ranking of World Universities (Shanghai Ranking) 2026: 101-150, world⁠
FacilitiesLibrary⁠
FoodCafeteria⁠, CanteenInferred

The rest of what we hold on Universität Wien is on its page.

What it costs

€726.72 / semester

What changes the price?

3 things that move it

Grant

Merit scholarship

Grant

Research scholarship

Offer

Discount

Every fee and condition published
FeeWho pays itYearAmount
TuitionEU/EEA citizens, chNot stated€363.36 / semester
ApplicationAll applicantsNot stated€50 one-time
TuitionNon-EU citizensNot stated€726.72 / semester
Student unionEU/EEA citizens, chNot stated€26.20 / semester
Student unionNon-EU citizensNot stated€26.20 / semester
Discounts
  • Citizenship waiverTuition · UA⁠
How to start

Apply by 31 Mar 2027

Dates that differ by citizenship are marked for your group.

When does it happen?
Next upAdmissionAdd to calendarReminds you 14 days beforeUnder 14 days left: the reminder fires right awayThis date has passed
Every date (1 date)
Mar 2027
  • Admission
Deadline ruleApplication · Status: Not published yet · 2027/28⁠
Is my language good enough?
English requirementB2 CEFR minimum
What are the steps?
  1. 1
    Check you qualifyStatus: Eligible with study place · Programme: Business Informatics⁠
    +2 more
    • Status: Eligible with study place · Programme: Computer Science⁠
    • Status: Eligible with study place · Programme: Degree programmes that include core competencies in Computer Science of at least 90 ECTS.⁠
  2. 2
    Prove your languageStage: Application · CEFR from: B2 · Language: English⁠
  3. 3
    Admission testsProcedure: Selection procedure · Allocation: written test, date to be announced⁠
  4. 4
    How they chooseText: Accessibility and Inclusive Design⁠
    +98 more
    • Text: Algorithm Definition (Unambiguous, Effective, Deterministic, Finite, Complete, Correct)⁠
    • Text: Algorithm Paradigms, Greedy, Divide and Conquer, Dynamic Programming⁠
    • Text: Application Layer: Domain Name System, Electronic Mail, World Wide Web⁠
    • Text: Asymptotic Computational Complexity (O, Omega, Theta, o, omega, ~)⁠
    • Text: Automata theory: finite-state automaton, pushdown automaton, Turing machine, deterministic and nondeterministic automata.⁠
    • Text: Basics of quantum computing⁠
    • Text: Boolean algebra⁠
    • Text: BPMN: Business Process Model and Notation⁠
    • Text: Caching⁠
    • Text: Chomsky hierarchy: relationship languages/grammars/automata.⁠
    • Text: CMOS technology⁠
    • Text: Complexity theory. Complexity classes P and NP. SAT problem.⁠
    • Text: Computability theory. Computable functions, decidable sets and problems. Undecidable problems. Halting problem.⁠
    • Text: Correct answers must be marked with an “X” on the answer sheet.⁠
    • Text: Create a table with the computer science courses you passed and make sure you include their ECTS credits. Show that you meet the 90 ECTS requirement.⁠
    • Text: Data Link Layer: Framing, Error Control, Flow Control, Media Access Control, Ethernet, WLAN⁠
    • Text: Data Structures (List, Trees, Graphs)⁠
    • Text: Design Patterns⁠
    • Text: Determinants, eigenvalues/vectors, characteristic polynomial of a matrix, similar matrices⁠
    • Text: Differentiation in Higher Dimensions: vector-valued functions, Frenet–Serret formulas, partial derivative, tangent planes, directional derivative, total derivative, Jacobian, gradient, divergence, curl, Hessian matrix, definite quadratic forms, critical points⁠
    • Text: Differentiation: limits, derivative, sign of derivative, critical points, implicit differentiation, logarithmic differentiation⁠
    • Text: DMN: Decision Model and Notation⁠
    • Text: Each task contains several possible answers. One or more (but never all) of these may be correct.⁠
    • Text: Emerging Technologies in HCI (GenAI)⁠
    • Text: Entity Relationship Model⁠
    • Text: Event-driven process Chain (EPC)⁠
    • Text: First order predicate logic: Syntax: function and predicate symbols, terms, atomic formulas, free and bound variables, formulas, prenex normal form. Semantic: structures, models, satisfiability and validity of a first order formula.⁠
    • Text: font size 11pt⁠
    • Text: For each task, the number of points awarded for a correct answer is specified. This information is shown in brackets after each task.⁠
    • Text: Formal grammars: regular grammar, context-free grammar, context-sensitive grammar, unrestricted grammar.⁠
    • Text: Fundamentals of Network Security: Attacks, Symmetric-Key and Public-Key Cryptography, Digital Signatures⁠
    • Text: Fundamentals: complex numbers, fundamental theorem of algebra, linear factors, Euler's formula, properties of different types of functions, exponential function incl. complex exponential⁠
    • Text: Generic Programming, Templates (C++), Generics (Java)⁠
    • Text: Give us an idea with which research groups you’d be most interested in collaborating (for, e.g., the practical courses), and let us know why.⁠
    • Text: Graphs (Internal Representation, Traversal, Shortest Paths Algorithms)⁠
    • Text: Graphs: directed, undirected, complete, planar, adjacency matrix, degree of a node, paths in graphs⁠
    • Text: Groups and rings as algebraic structures and their properties⁠
    • Text: Hashing Methods (Double Hashing, Separate Chaining, Linear Hashing, Extendible Hashing, BISEH, Coalesced Hashing, Cuckoo Hashing)⁠
    • Text: Hashing Principles (Hash Function, Static, Dynamic, Collision Resolution)⁠
    • Text: Human-Centered Design (User research)⁠
  5. 5
    Where you applyUnknown
  6. 6
    DocumentsUnknown
  7. 7
    Deadline31 Mar 2027 · Admission · Term: Summer semester · Start date: 11 Jan 2027 · 2026/27⁠
    +1 more
    • Application · Status: Not published yet · 2027/28⁠
  8. 8
    StartUnknown
What else to look at

Other options

How do the alternatives compare?

0 of 3 similar publish a price

Similar: same level, field and language, Austria

The first two matches side by side with this programme, then 1 more.

This programmeMedia Informatics Universität WienSimilarInteractive Media FH OÖSimilarContemporary History and Media Universität Wien
PriceNot publishedNot publishedNot published
Duration4 semesters4 semesters4 semesters
LanguageEnglishEnglishGerman and English
Next date11 Jan 202731 May 202716 Nov 2026

3 of 3 publish a next date.

Universität Wien · ViennaAustria

Communication Science

Master Communication Science

€726.72 / semester · year not stated · confirm with the source
120
credits (ECTS)
2 yr
length
MasterTaught in EnglishScholarshipsEnglish
Next date
Where this comes from

Every fact has a source

Why trust this page?

159 facts from 6 official sources

Checked 4 days ago.

159facts with a quote
6official pages
2fields marked unknown
All 6 sources
studieren.univie.ac.at/en/applying-for-a-programme/admission-info/mag/media-inform10431 Oct 2026
studieren.univie.ac.at/en/find-your-degree-programme/masters-programmes/media-info2731 Oct 2026
ufind.univie.ac.at/cache/en/341934.html1231 Oct 2026
ufind.univie.ac.at/cache/en/333630.html1031 Oct 2026
studieren.univie.ac.at/en/studying-and-learning/financial-matters/amount-of-the-tu531 Oct 2026
studieren.univie.ac.at/en/applying-for-a-programme/deadlines131 Oct 2026
The short version

The programme, from the facts

Media Informatics is a master's programme in media and communication at Universität Wien in Vienna, Austria. It takes 4 semesters. It carries 120 ECTS credits. Teaching is in English.

The institution publishes 19 modules. By our classification of module titles, the largest themes are languages and communication (29%), data and computing (26%) and projects and labs (19%).

How much does Media Informatics cost?

€726.72 / semester · year not stated · non-EU. Year not stated: confirm with the source.

When is the next deadline or start?

11 Jan 2027 (Apply by).

What language is it taught in?

English (Requires B2 level).

How long does it take?

4 semesters.

Where is it?

Universität Wien, Vienna, Austria.

Spotted a mistake? Report an error and we fix and log it.

Everything we hold

All 20 fields we hold

Every value with its source, and every field we looked for but could not find.

Money · 1 with values
DiscountsKind: Citizenship waiver · Covers: Tuition · Citizenship: UAInferred
Admission · 4 with values
Admission testsProcedure: Selection procedure · Allocation: written test, date to be announced⁠
Language requirementStage: Application · CEFR from: B2 · Language: English⁠
Prior educationStatus: Eligible with study place · Programme: Business Informatics⁠Status: Eligible with study place · Programme: Computer Science⁠Status: Eligible with study place · Programme: Degree programmes that include core competencies in Computer Science of at least 90 ECTS.⁠
Selection criteriaText: Accessibility and Inclusive Design⁠Text: Algorithm Definition (Unambiguous, Effective, Deterministic, Finite, Complete, Correct)⁠Text: Algorithm Paradigms, Greedy, Divide and Conquer, Dynamic Programming⁠Text: Application Layer: Domain Name System, Electronic Mail, World Wide Web⁠Text: Asymptotic Computational Complexity (O, Omega, Theta, o, omega, ~)⁠Text: Automata theory: finite-state automaton, pushdown automaton, Turing machine, deterministic and nondeterministic automata.⁠Text: Basics of quantum computing⁠Text: Boolean algebra⁠Text: BPMN: Business Process Model and Notation⁠Text: Caching⁠Text: Chomsky hierarchy: relationship languages/grammars/automata.⁠Text: CMOS technology⁠Text: Complexity theory. Complexity classes P and NP. SAT problem.⁠Text: Computability theory. Computable functions, decidable sets and problems. Undecidable problems. Halting problem.⁠Text: Correct answers must be marked with an “X” on the answer sheet.⁠Text: Create a table with the computer science courses you passed and make sure you include their ECTS credits. Show that you meet the 90 ECTS requirement.⁠Text: Data Link Layer: Framing, Error Control, Flow Control, Media Access Control, Ethernet, WLAN⁠Text: Data Structures (List, Trees, Graphs)⁠Text: Design Patterns⁠Text: Determinants, eigenvalues/vectors, characteristic polynomial of a matrix, similar matrices⁠Text: Differentiation in Higher Dimensions: vector-valued functions, Frenet–Serret formulas, partial derivative, tangent planes, directional derivative, total derivative, Jacobian, gradient, divergence, curl, Hessian matrix, definite quadratic forms, critical points⁠Text: Differentiation: limits, derivative, sign of derivative, critical points, implicit differentiation, logarithmic differentiation⁠Text: DMN: Decision Model and Notation⁠Text: Each task contains several possible answers. One or more (but never all) of these may be correct.⁠Text: Emerging Technologies in HCI (GenAI)⁠Text: Entity Relationship Model⁠Text: Event-driven process Chain (EPC)⁠Text: First order predicate logic: Syntax: function and predicate symbols, terms, atomic formulas, free and bound variables, formulas, prenex normal form. Semantic: structures, models, satisfiability and validity of a first order formula.⁠Text: font size 11pt⁠Text: For each task, the number of points awarded for a correct answer is specified. This information is shown in brackets after each task.⁠Text: Formal grammars: regular grammar, context-free grammar, context-sensitive grammar, unrestricted grammar.⁠Text: Fundamentals of Network Security: Attacks, Symmetric-Key and Public-Key Cryptography, Digital Signatures⁠Text: Fundamentals: complex numbers, fundamental theorem of algebra, linear factors, Euler's formula, properties of different types of functions, exponential function incl. complex exponential⁠Text: Generic Programming, Templates (C++), Generics (Java)⁠Text: Give us an idea with which research groups you’d be most interested in collaborating (for, e.g., the practical courses), and let us know why.⁠Text: Graphs (Internal Representation, Traversal, Shortest Paths Algorithms)⁠Text: Graphs: directed, undirected, complete, planar, adjacency matrix, degree of a node, paths in graphs⁠Text: Groups and rings as algebraic structures and their properties⁠Text: Hashing Methods (Double Hashing, Separate Chaining, Linear Hashing, Extendible Hashing, BISEH, Coalesced Hashing, Cuckoo Hashing)⁠Text: Hashing Principles (Hash Function, Static, Dynamic, Collision Resolution)⁠Text: Human-Centered Design (User research)⁠Text: Imperative Programming, Variables, Assignment, Selection, Iteration, Sequence⁠Text: Index Structures (B-trees and hashing methods)⁠Text: Integer arithmetic⁠Text: Integration in Higher Dimensions: multiple integral, substitution for multiple variables, Jacobian determinant, polar coordinate system, cylindrical coordinate system, spherical coordinate system⁠Text: Integration: fundamental theorem of calculus, antiderivative, Riemann integral, integration by substitution incl. trigonometric substitution, integration by parts, improper integrals⁠Text: Interaction Design Principles⁠Text: Lambda Expressions⁠Text: Linear independence of vectors, basis and dimension of a vector space, coordinates in a vector space⁠Text: Linear systems of equations, Gauss algorithm and various uses of it⁠Text: Linear Time Sorting Algorithms (Counting Sort, Radix Sort, Bucket Sort)⁠Text: Logic gates⁠Text: Mappings and functions: injective, surjective, bijective⁠Text: Markings and notes outside the designated boxes will not be taken into account during the automated evaluation and may impair legibility.⁠Text: Markings in the test booklet will also not be taken into account.⁠Text: N-ary, equivalence, and partial order relations⁠Text: Network Layer: Internet Protocol, Routing Algorithms and Protocols, Traffic Management and Quality of Service⁠Text: no more than three pages⁠Text: Normal Forms (Functional and Multivalued Dependencies, 1.-4. Normal Form, Boyce-Codd-Normal Form, Decomposition- and Synthesis Algorithm)⁠Text: Object Oriented Programming, Data Hiding, Polymorphism, Inheritance⁠Text: Perception and Cognition⁠Text: Petri Nets⁠Text: Physical Layer: Guided Transmission Media, Wireless Transmission, Spectra and Waveforms⁠Text: Please note that incorrectly selected answer choices will be deducted from the correct ones.⁠Text: Power set, operations with sets, cartesian product of sets, proof by mathematical induction⁠Text: Programming Language Paradigms⁠Text: Prototyping⁠Text: Recursion⁠Text: Relational Algebra (select, project, cartesian product, union, difference, intersection, division, join including inner, outer, equi-, and natural join)⁠Text: Relational Model (Definition of Relation, Key, Superkey, Data Definition Language of SQL)⁠Text: Relational Query Optimization (push projection, push selection, cost estimation)⁠Text: Scalar and superscalar computer architectures⁠Text: Scalar product, orthogonal vectors, orthogonal matrices, vector norms⁠Text: Search Trees (BST, Multiway Trees, B+ Tree)⁠Text: Sequences of Functions: uniform convergence, power series, Taylor series, Taylor series in several variables⁠Text: single spaced paragraphs⁠Text: Software Design and Architecture⁠Text: Software Quality and Code Quality⁠Text: Software Requirements Specification⁠Text: Software Rollout and Maintenance⁠Text: Software Verification and Validation⁠Text: Sorting Algorithm Properties (Insitu, Exsitu, Stable, Unstable, O(n ln n) Limit for Comparison Sort)⁠Text: Sorting Algorithms (Selection Sort, Insertion Sort, Bubble Sort, Quicksort, Mergesort, Heapsort)⁠Text: SQL (select, from, where, set operations, aggregation, grouping, ordering, views)⁠Text: STL, Container, Algorithms (C++), Collections (Java)⁠Text: Storage technologies⁠Text: submit as PDF⁠Text: Transactions, (Concurrency and Recovery including schedules, locking, logging)⁠Text: Transport Layer: UDP and TCP⁠Text: Trees and their characterization, properties of (regular) binary trees, Huffman codes⁠Text: Tuple and Domain Calculus (formulas and expressions, quantors)⁠Text: UML: Unified Modelling Language (UseCase, Class, Object, Activitiy, State, Sequence, Package, Component, and Deployment Diagrams)⁠Text: Usability and User Experience⁠Text: Vectors and matrices: basic operations, unit matrix, inverse matrix, rank⁠Text: Written test Prepare for the written test. The topics are based on the bachelor's programme in Computer Science at the University of Vienna. Detailed info about the test⁠Text: You cannot score less than zero points per task.⁠Text: You will earn full points for a task if all correct answer choices are selected.⁠Text: You will earn partial points for each correctly selected answer choice.⁠Text: You will need to solve multiple-choice tasks based on the specified topics.⁠
Programme · 10 with values · 2 without
Code066 935⁠
QualificationMaster of Science · Abbr: MSc⁠
Credits120 ECTS⁠
DeliveryNot found on official pages
Duration4 semesters⁠
Language of instructionEnglish⁠
LevelMaster · EQF 7, ISCED 7⁠
LocationVienna, AustriaInferred
Outcomes9.2 · As of: November 2025 · Metric: Average study duration semesters⁠4 · As of: November 2025 · Metric: Graduates past year⁠62 · As of: November 2025 · Metric: Students total⁠Kind: Career field · Field: Computer graphics and virtual reality⁠Kind: Career field · Field: Digital media production⁠Kind: Career field · Field: Human-machine communication⁠Kind: Career field · Field: Leading research and development teams⁠Kind: Career field · Field: Software development⁠€4,145 · 2025⁠
Places85 · Note: total for Computer Science and Media Informatics, for applicants who participate in the selection procedure⁠
Start ruleIntake: Once per academic year⁠
Study modeNot found on official pages

Institution record: Universität Wien

Programmes you open appear here, so you can switch between them.