Added Computer Science First Year Courses #1
95 changed files with 586 additions and 792 deletions
8
src/content/docs/computer-science/course-description.md
Normal file
8
src/content/docs/computer-science/course-description.md
Normal file
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/course-description
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# Course Description
|
||||||
|
|
||||||
|
#Hello
|
||||||
|
|
||||||
|
#Hello
|
||||||
|
|
@ -0,0 +1,24 @@
|
||||||
|
---
|
||||||
|
title: Introduction to Computer Science
|
||||||
|
description: Historical course details for Introduction to Computer Science, recovered from the previous Incognito wiki.
|
||||||
|
---
|
||||||
|
|
||||||
|
:::caution[Historical information]
|
||||||
|
This information originated in the previous wiki and may be outdated. Check the current Maastricht University course information before relying on it.
|
||||||
|
:::
|
||||||
|
|
||||||
|
## Full course description
|
||||||
|
The primary goal of Introduction to Computer Science is to introduce fundamental concepts and foster critical skills found throughout the field of computer science. Fundamental concepts include algorithms, computer architecture and hardware, models of computation, computer networks, and operating systems. Critical skills include abstraction, decomposition, pattern recognition, and algorithmic thinking. All concepts and skills are introduced in a lecture setting and explored further in the lab through the development of a wirelessly controlled microcontroller device. At the end of this course, students will appreciate the depth of the field and be prepared for subsequent research and educational activities.
|
||||||
|
|
||||||
|
## Prerequisites
|
||||||
|
None
|
||||||
|
|
||||||
|
## Recommended reading
|
||||||
|
"Computational Thinking for the Modern Problem Solver" by David Riley, Kenny A. Hunt
|
||||||
|
"Computer Science Illuminated" by Nell B. Dale
|
||||||
|
|
||||||
|
## Files
|
||||||
|
None
|
||||||
|
---
|
||||||
|
|
||||||
|
|
||||||
|
|
@ -0,0 +1,24 @@
|
||||||
|
---
|
||||||
|
title: Computer Architecture
|
||||||
|
description: Historical course details for Computer Architecture, recovered from the previous Incognito wiki.
|
||||||
|
---
|
||||||
|
|
||||||
|
:::caution[Historical information]
|
||||||
|
This information originated in the previous wiki and may be outdated. Check the current Maastricht University course information before relying on it.
|
||||||
|
:::
|
||||||
|
|
||||||
|
## Full course description
|
||||||
|
The goal of Computer Architecture is to provide a foundational understanding of how computers are built and operate at the hardware level. The course introduces digital logic, combinational and sequential circuits, hardware description languages, processor architecture, memory systems, and input/output systems. Students gain hands-on experience designing and simulating hardware components and will complete the course with a working understanding of the structure and function of a modern processor.
|
||||||
|
|
||||||
|
## Prerequisites
|
||||||
|
None
|
||||||
|
|
||||||
|
## Recommended reading
|
||||||
|
Computer Architecture: A Quantitative Approach (8th edition) by John L. Hennessy and David A. Patterson.
|
||||||
|
|
||||||
|
## Files
|
||||||
|
None
|
||||||
|
|
||||||
|
---
|
||||||
|
|
||||||
|
|
||||||
|
|
@ -0,0 +1,24 @@
|
||||||
|
---
|
||||||
|
title: Algorithmic Design
|
||||||
|
description: Historical course details for Algorithmic Design, recovered from the previous Incognito wiki.
|
||||||
|
---
|
||||||
|
|
||||||
|
:::caution[Historical information]
|
||||||
|
This information originated in the previous wiki and may be outdated. Check the current Maastricht University course information before relying on it.
|
||||||
|
:::
|
||||||
|
|
||||||
|
## Full course description
|
||||||
|
This course follows on from Data Structures and Algorithms, developing students' ability to design and (equally importantly) analyse algorithms for both correctness and efficiency. The course begins with a more in-depth treatment of greedy algorithms and dynamic programming (introduced in DSA), and how to analyse recursive algorithms with the master theorem. We then investigate how we can justify that a given problem is unlikely to have an efficient solution, via the notion of NP-completeness. Finally we cover some techniques we can use to attack NP-hard problems, namely backtracking, linear programming and branch-and-bound.
|
||||||
|
|
||||||
|
## Prerequisites
|
||||||
|
Desired prior knowledge: Data Structures and Algorithms, Discrete Mathematics.
|
||||||
|
|
||||||
|
## Recommended reading
|
||||||
|
Goodrich and Tamassia (2015) Algorithm Design and Applications. Wiley. ISBN: 978—1-118-33591-8
|
||||||
|
|
||||||
|
## Files
|
||||||
|
None
|
||||||
|
|
||||||
|
---
|
||||||
|
|
||||||
|
|
||||||
|
|
@ -0,0 +1,24 @@
|
||||||
|
---
|
||||||
|
title: Databases
|
||||||
|
description: Historical course details for Databases, recovered from the previous Incognito wiki.
|
||||||
|
---
|
||||||
|
|
||||||
|
:::caution[Historical information]
|
||||||
|
This information originated in the previous wiki and may be outdated. Check the current Maastricht University course information before relying on it.
|
||||||
|
:::
|
||||||
|
|
||||||
|
## Full course description
|
||||||
|
This course introduces students to fundamental concepts of databases with a focus on relational database systems. Students will learn how to design, implement and optimize a relational database. The course provides a comprehensive study of data modeling, data description languages, and query facilities such as relational algebra and SQL. Students will also be exposed to the internal workings of database management systems with an overview of topics such as concurrency, recovery, indexing, and triggers. The course will cover current topics related to managing Big Data using alternate data models such as NoSQL. The students will apply their knowledge on these topics in designing and implementing a database system as a part of a group project.
|
||||||
|
|
||||||
|
## Prerequisites
|
||||||
|
None
|
||||||
|
|
||||||
|
## Recommended reading
|
||||||
|
"Readings in Database Systems" by Peter Bailis, Joseph M. Hellerstein, Michael Stonebraker, 5th Edition.
|
||||||
|
|
||||||
|
## Files
|
||||||
|
None
|
||||||
|
|
||||||
|
---
|
||||||
|
|
||||||
|
|
||||||
|
|
@ -0,0 +1,24 @@
|
||||||
|
---
|
||||||
|
title: Statistics
|
||||||
|
description: Historical course details for Statistics, recovered from the previous Incognito wiki.
|
||||||
|
---
|
||||||
|
|
||||||
|
:::caution[Historical information]
|
||||||
|
This information originated in the previous wiki and may be outdated. Check the current Maastricht University course information before relying on it.
|
||||||
|
:::
|
||||||
|
|
||||||
|
## Full course description
|
||||||
|
Statistics introduces the student to the main concepts of both probability theory and statistics. With respect to probability theory, students learn how to make use of random variables to extract the probability distribution of an experiment. Additionally, topics such as expectation, standard deviation, and independence will be discussed. The statistics part of the course discusses basic statistical topics such as the central limit theorem, verification of hypotheses, and confidence intervals. After completing this course students will have obtained an overview of commonly seen probability distributions, as well as several statistical procedures. Additionally, the student will be able to deal with problems that involve probabilities and determine an outcome for such problems (e.g., the expected outcome).
|
||||||
|
|
||||||
|
## Prerequisites
|
||||||
|
None
|
||||||
|
|
||||||
|
## Recommended reading
|
||||||
|
None
|
||||||
|
|
||||||
|
## Files
|
||||||
|
None
|
||||||
|
|
||||||
|
---
|
||||||
|
|
||||||
|
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-2/period-1/intelligent-user-interfaces
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# Intelligent User Interfaces
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-2/period-1/intelligent-user-interfaces.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-2/period-1/introduction-to-artificial-intelligence
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# Introduction to Artificial Intelligence
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-2/period-1/introduction-to-artificial-intelligence.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-2/period-1/operating-systems
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# Operating Systems
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-2/period-1/operating-systems.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-2/period-2/computer-networks
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# Computer Networks
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-2/period-2/computer-networks.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-2/period-2/software-engineering-and-architectures
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# Software Engineering and Architectures
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-2/period-2/software-engineering-and-architectures.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-2/period-4/computer-security
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# Computer Security
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-2/period-4/computer-security.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-2/period-4/embedded-programming
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# Embedded Programming
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-2/period-4/embedded-programming.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-2/period-4/parallel-programming
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# Parallel Programming
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-2/period-4/parallel-programming.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-2/period-5/numerical-methods
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# Numerical Methods
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-2/period-5/numerical-methods.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-2/period-5/principles-of-programming-languages
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# Principles of Programming Languages
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-2/period-5/principles-of-programming-languages.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-2/semester-1-electives/ai-and-machine-learning
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# M2-1: AI and Machine Learning
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-2/semester-1-electives/ai-and-machine-learning.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-2/semester-1-electives/intelligent-interaction
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# M2-1: Intelligent Interaction
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-2/semester-1-electives/intelligent-interaction.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-2/semester-2-electives/cybersecurity
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# M2-2: Cybersecurity
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-2/semester-2-electives/cybersecurity.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-2/semester-2-electives/high-performance-computing
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# M2-2: High Performance Computing
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-2/semester-2-electives/high-performance-computing.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-3/period-1-electives/digital-society
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# Digital Society
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-3/period-1-electives/digital-society.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-3/period-1-electives/game-theory
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# Game Theory
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-3/period-1-electives/game-theory.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-3/period-1-electives/graph-theory
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# Graph Theory
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-3/period-1-electives/graph-theory.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-3/period-1-electives/introduction-to-quantum-computing
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# Introduction to Quantum Computing
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-3/period-1-electives/introduction-to-quantum-computing.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-3/period-1-electives/robotics-and-embedded-systems
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# Robotics and Embedded Systems
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-3/period-1-electives/robotics-and-embedded-systems.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-3/period-1-electives/ubiquitous-computing-iot
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# Ubiquitous Computing & Internet of Things
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-3/period-1-electives/ubiquitous-computing-iot.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-3/period-2-electives/block-chains
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# Block Chains
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-3/period-2-electives/block-chains.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-3/period-2-electives/cryptography
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# Cryptography
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-3/period-2-electives/cryptography.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-3/period-2-electives/immersive-technologies
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# Immersive Technologies
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-3/period-2-electives/immersive-technologies.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-3/period-2-electives/introduction-to-bio-informatics
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# Introduction to Bio-Informatics
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-3/period-2-electives/introduction-to-bio-informatics.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-3/period-2-electives/large-scale-it-and-cloud-computing
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# Large Scale IT and Cloud Computing
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-3/period-2-electives/large-scale-it-and-cloud-computing.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-3/period-2-electives/software-and-systems-verification
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# Software and Systems Verification
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-3/period-2-electives/software-and-systems-verification.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-3/period-2-electives/startup-engineering
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# Startup Engineering: Building Scalable Tech Ventures
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-3/period-2-electives/startup-engineering.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-3/period-4/history-and-philosophy-of-computing
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# The History and Philosophy of Computing
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-3/period-4/history-and-philosophy-of-computing.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-3/period-4/operating-systems
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# Operating Systems
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-3/period-4/operating-systems.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,8 @@
|
||||||
|
> Source: https://wiki.msvincognito.nl/computer-science/year-3/period-4/theory-of-computing
|
||||||
|
> Captured: 2026-08-02
|
||||||
|
|
||||||
|
# Theory of Computing
|
||||||
|
|
||||||
|
##### Empty Page
|
||||||
|
|
||||||
|
Start writing in `content/1.computer-science/year-3/period-4/theory-of-computing.md` to see this page taking shape.
|
||||||
|
|
@ -0,0 +1,30 @@
|
||||||
|
---
|
||||||
|
title: Discrete Mathematics
|
||||||
|
description: Historical course details for Discrete Mathematics, recovered from the previous Incognito wiki.
|
||||||
|
---
|
||||||
|
|
||||||
|
:::caution[Historical information]
|
||||||
|
This information originated in the previous wiki and may be outdated. Check the current Maastricht University course information before relying on it.
|
||||||
|
:::
|
||||||
|
|
||||||
|
## Full course description
|
||||||
|
Discrete Mathematics introduces students to mathematical logic and reasoning. Students learn to recognise whether an argument is sound and if not, why certain steps go wrong. The basics of logic and mathematical proofs will be studied and used to discuss, among other things, concepts such as sets, relations, infinity, functions, permutations and combinations. This course builds upon common sense reasoning and abstract thinking, and no previous knowledge about mathematics is required. Lectures are accompanied with practical assignments to help the students apply the material that was learned. After completing this course the student will know how to use mathematical concepts correctly and apply several types of mathematical proofs.
|
||||||
|
|
||||||
|
## Prerequisites
|
||||||
|
None
|
||||||
|
|
||||||
|
## Recommended reading
|
||||||
|
None
|
||||||
|
|
||||||
|
## Files
|
||||||
|
- [Dm Exam October 2014](/media/legacy-dokuwiki/study/bachelor/year_1/block_1/discrete_mathematics/dm_exam_october_2014.pdf)
|
||||||
|
- [Dm October 2016 Exam](/media/legacy-dokuwiki/study/bachelor/year_1/block_1/discrete_mathematics/dm_october_2016_exam.pdf)
|
||||||
|
- [Dmjanuari2014](/media/legacy-dokuwiki/study/bachelor/year_1/block_1/discrete_mathematics/dmjanuari2014.pdf)
|
||||||
|
- [Dmjanuari2015](/media/legacy-dokuwiki/study/bachelor/year_1/block_1/discrete_mathematics/dmjanuari2015.pdf)
|
||||||
|
- [Dmjanuary2016](/media/legacy-dokuwiki/study/bachelor/year_1/block_1/discrete_mathematics/dmjanuary2016.pdf)
|
||||||
|
- [Dmoktober2013 1 ](/media/legacy-dokuwiki/study/bachelor/year_1/block_1/discrete_mathematics/dmoktober2013_1_.pdf)
|
||||||
|
- [Dmoktober2015](/media/legacy-dokuwiki/study/bachelor/year_1/block_1/discrete_mathematics/dmoktober2015.pdf)
|
||||||
|
|
||||||
|
---
|
||||||
|
|
||||||
|
Source: [Previous wiki page](https://msvincognito.nl/wiki/study/bachelor/year_1/block_1/discrete_mathematics)
|
||||||
|
|
@ -0,0 +1,40 @@
|
||||||
|
---
|
||||||
|
title: Procedural Programming
|
||||||
|
description: Historical course details for Procedural Programming, recovered from the previous Incognito wiki.
|
||||||
|
---
|
||||||
|
|
||||||
|
:::caution[Historical information]
|
||||||
|
This information originated in the previous wiki and may be outdated. Check the current Maastricht University course information before relying on it.
|
||||||
|
:::
|
||||||
|
|
||||||
|
## Full course description
|
||||||
|
Procedural Programming introduces students to the world of programming. Programming is a core tool as it allows translating theoretical ideas into practical applications. After a brief introduction about the inner workings of a computer, students learn about the principles of programming and basic programming tools. The lectures are accompanied by computer labs in which the student has to translate simple tasks into computer programs and feedback is provided to the student about their progress. Throughout the bachelor programme, Java is used as the main programming language. After completing this course the student is familiar with the core elements of programming and can implement simple programs in Java.
|
||||||
|
|
||||||
|
PROTIP:
|
||||||
|
|
||||||
|
Attend **all** of your tutorials and practice further at home making your own problems, or by trying websites such as [www.codingbat.com/java](http://www.codingbat.com/java) or [https://www.codecademy.com/learn/learn-java](https://www.codecademy.com/learn/learn-java). The entire exam will rely on your ability to write code on paper, with minimal errors, so having proper syntax and concept comprehension is key.
|
||||||
|
|
||||||
|
Further Tip:
|
||||||
|
|
||||||
|
One inevitable part of programming is findings errors in your program. This process is usually referred to as debugging and is aided by receiving custom error messages when the computer has detected as specific error. Creating a document in which you list error messages you have previously dealt with, and your approach to alleviating the situation can save you lots of time during future debugging, as you will be able to refer to your list.
|
||||||
|
|
||||||
|
**Study Materials and Tutorials:**
|
||||||
|
* Java exercises: [www.codingbat.com/java](http://www.codingbat.com/java)
|
||||||
|
* Java online course: [https://www.codecademy.com/learn/learn-java](https://www.codecademy.com/learn/learn-java)
|
||||||
|
* Java video tutorial series: [https://www.youtube.com/watch?v=TBWX97e1E9g&list=PLE7E8B7F4856C9B19](https://www.youtube.com/watch?v=TBWX97e1E9g&list=PLE7E8B7F4856C9B19)
|
||||||
|
|
||||||
|
## Prerequisites
|
||||||
|
None
|
||||||
|
|
||||||
|
## Recommended reading
|
||||||
|
Cay Horstmann (2012. Big Java Late Objects. John Wiley & Sons, New York, ISBN 978-1-1180-8788-6 (Chapter 1-6,13)
|
||||||
|
|
||||||
|
## Files
|
||||||
|
- [Cs1 Exam 2012-01-31](/media/legacy-dokuwiki/study/bachelor/year_1/block_1/introduction_to_computer_science_1/cs1_exam_2012-01-31.pdf)
|
||||||
|
- [Cs1 Extra Questions 2011-10-26](/media/legacy-dokuwiki/study/bachelor/year_1/block_1/introduction_to_computer_science_1/cs1_extra_questions_2011-10-26.pdf)
|
||||||
|
- [Cs1 Homemade Mock Exam 2016](/media/legacy-dokuwiki/study/bachelor/year_1/block_1/introduction_to_computer_science_1/cs1_homemade_mock_exam_2016.pdf)
|
||||||
|
- [Cs1 Terminology Notes](/media/legacy-dokuwiki/study/bachelor/year_1/block_1/introduction_to_computer_science_1/cs1_terminology_notes.pdf)
|
||||||
|
|
||||||
|
---
|
||||||
|
|
||||||
|
Source: [Previous wiki page](https://msvincognito.nl/wiki/study/bachelor/year_1/block_1/procedural_programming)
|
||||||
|
|
@ -0,0 +1,36 @@
|
||||||
|
---
|
||||||
|
title: Calculus
|
||||||
|
description: Historical course details for Calculus, recovered from the previous Incognito wiki.
|
||||||
|
---
|
||||||
|
|
||||||
|
:::caution[Historical information]
|
||||||
|
This information originated in the previous wiki and may be outdated. Check the current Maastricht University course information before relying on it.
|
||||||
|
:::
|
||||||
|
|
||||||
|
## Full course description
|
||||||
|
Calculus introduces the students to a theoretical notion of the basic concepts in applied mathematics. The topics discussed in calculus are fundamental for the mathematical aspect of knowledge engineering and, among others, include limits, continuity, differential equations, series and multivariable calculus. Both the intuition behind the concepts and their formal definitions will be presented along with simple examples of formal mathematical proofs. For this reason it is required that the student has completed discrete mathematics in period 1.1. After completing this course the student has obtained a theoretical notion of the basic topics in applied mathematics, and is able to validate all kinds of mathematical arguments.
|
||||||
|
|
||||||
|
## Prerequisites
|
||||||
|
None.
|
||||||
|
|
||||||
|
## Recommended reading
|
||||||
|
The course does not require any specific textbooks, although it does have a (changing) recommended textbook. However, the vast majority of information needed to learn to understand series, differential equations and derivatives/antiderivatives, and complex functions can be found easily online with a simple Google search.
|
||||||
|
|
||||||
|
We however strongly recommend investigating [the YouTube series by 3Blue1Brown "The Essence of Calculus"](https://www.youtube.com/playlist?list=PLZHQObOWTQDMsr9K-rj53DwVRMYO3t5Yr). It is an excellent and intuitive explanation of what we are doing in fundamental calculus, and why it works. The entire series takes about 4 hours to complete, and is split into convenient sections. We **strongly** recommend supplementing the course with this video series.
|
||||||
|
## Files
|
||||||
|
- [Ca1 Exam 2008-12-17](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/calculus/ca1_exam_2008-12-17.pdf)
|
||||||
|
- [Ca1 Exam 2009-01-29](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/calculus/ca1_exam_2009-01-29.pdf)
|
||||||
|
- [Ca1 Exam 2010-12-22](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/calculus/ca1_exam_2010-12-22.pdf)
|
||||||
|
- [Ca2 Mockexam 2009](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/calculus/ca2_mockexam_2009.pdf)
|
||||||
|
- [Ca2 Mockexam Solutions 2009](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/calculus/ca2_mockexam_solutions_2009.pdf)
|
||||||
|
- [Ca Cheat Sheet](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/calculus/ca_cheat_sheet.pdf)
|
||||||
|
- [Ca Exam 2016-03-31](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/calculus/ca_exam_2016-03-31.pdf)
|
||||||
|
- [Ca Exam 2016-06-27](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/calculus/ca_exam_2016-06-27.pdf)
|
||||||
|
- [Ca Mockexam 2016-03](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/calculus/ca_mockexam_2016-03.pdf)
|
||||||
|
- [Ca Mockexam Solutions 2016-03-31](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/calculus/ca_mockexam_solutions_2016-03-31.pdf)
|
||||||
|
- [Ca Spreadsheet](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/calculus/ca_spreadsheet.pdf)
|
||||||
|
- [Final Exam Calculus 2020 1 ](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/calculus/final_exam_calculus_2020_1_.pdf)
|
||||||
|
|
||||||
|
---
|
||||||
|
|
||||||
|
Source: [Previous wiki page](https://msvincognito.nl/wiki/study/bachelor/year_1/block_2/calculus)
|
||||||
32
src/content/docs/data-science-and-ai/year-1/block-2/logic.md
Normal file
32
src/content/docs/data-science-and-ai/year-1/block-2/logic.md
Normal file
|
|
@ -0,0 +1,32 @@
|
||||||
|
---
|
||||||
|
title: Logic
|
||||||
|
description: Historical course details for Logic, recovered from the previous Incognito wiki.
|
||||||
|
---
|
||||||
|
|
||||||
|
:::caution[Historical information]
|
||||||
|
This information originated in the previous wiki and may be outdated. Check the current Maastricht University course information before relying on it.
|
||||||
|
:::
|
||||||
|
|
||||||
|
## Full course description
|
||||||
|
Logic introduces the student to three core logical systems, namely propositional logic, first-order predicate logic and epistemic logic. Understanding these logical systems will improve the ability of the student to think in a structural way about, among others, problem solving and program design. Besides logical systems the course will focus on proving and reasoning techniques. These techniques are relevant to various kinds of logics and include, among others, semantic tableaux, deduction, and proof systems. After completing this course the student has obtained a solid basis in the three core logical systems. Additionally the ability of the student to reason and communicate about problems has been improved.
|
||||||
|
|
||||||
|
## Prerequisites
|
||||||
|
None.
|
||||||
|
|
||||||
|
## Recommended reading
|
||||||
|
None.
|
||||||
|
|
||||||
|
## Files
|
||||||
|
- [Logic - June 2020 Protocol](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/logic/logic_-_june_2020_protocol.pdf)
|
||||||
|
- [Logic Exam 2004](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/logic/logic_exam_2004.pdf)
|
||||||
|
- [Logic Exam 2005-06-03](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/logic/logic_exam_2005-06-03.pdf)
|
||||||
|
- [Logic Exam 2006-05-31](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/logic/logic_exam_2006-05-31.pdf)
|
||||||
|
- [Logic Exam 2007-05-30](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/logic/logic_exam_2007-05-30.pdf)
|
||||||
|
- [Logic Exam 2007-06-29](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/logic/logic_exam_2007-06-29.pdf)
|
||||||
|
- [Logic Exam 2008-06-04](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/logic/logic_exam_2008-06-04.pdf)
|
||||||
|
- [Logic Exam 2008-07-02](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/logic/logic_exam_2008-07-02.pdf)
|
||||||
|
- [Logic Mockexam 2016](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/logic/logic_mockexam_2016.pdf)
|
||||||
|
|
||||||
|
---
|
||||||
|
|
||||||
|
Source: [Previous wiki page](https://msvincognito.nl/wiki/study/bachelor/year_1/block_2/logic)
|
||||||
|
|
@ -0,0 +1,28 @@
|
||||||
|
---
|
||||||
|
title: Objects in Programming
|
||||||
|
description: Historical course details for Objects in Programming, recovered from the previous Incognito wiki.
|
||||||
|
---
|
||||||
|
|
||||||
|
:::caution[Historical information]
|
||||||
|
This information originated in the previous wiki and may be outdated. Check the current Maastricht University course information before relying on it.
|
||||||
|
:::
|
||||||
|
|
||||||
|
## Full course description
|
||||||
|
This course is a follow-up to the course Procedural Programming. It teaches object-oriented programming in Java. The main topics covered in the course are objects and classes, interfaces and polymorphism, event handling, inheritance, graphical user interfaces, exception handling, and streams.
|
||||||
|
|
||||||
|
## Prerequisites
|
||||||
|
Procedural Programming
|
||||||
|
|
||||||
|
## Recommended reading
|
||||||
|
H. Deitel and P. Deitel (2007). Java How to Program, 7/E, Pearson, ISBN- 10: 0132222205
|
||||||
|
|
||||||
|
## Files
|
||||||
|
- [Additonalpreexam-2017](/media/legacy-dokuwiki/study/bachelor/year_1/block_2/introduction_to_computer_science_2/additonalpreexam-2017.pdf)
|
||||||
|
- [Cs2 Mockexam 2015](/media/legacy-dokuwiki/study/bachelor/year_1/block_2/introduction_to_computer_science_2/cs2_mockexam_2015.pdf)
|
||||||
|
- [Homemade Exercises Cs2](/media/legacy-dokuwiki/study/bachelor/year_1/block_2/introduction_to_computer_science_2/homemade_exercises_cs2.pdf)
|
||||||
|
- [Preparation-Exam-2015 1 ](/media/legacy-dokuwiki/study/bachelor/year_1/block_2/introduction_to_computer_science_2/preparation-exam-2015_1_.pdf)
|
||||||
|
- [Unofficial Keys Additionalpreexam-2017](/media/legacy-dokuwiki/study/bachelor/year_1/block_2/introduction_to_computer_science_2/unofficial_keys_additionalpreexam-2017.pdf)
|
||||||
|
|
||||||
|
---
|
||||||
|
|
||||||
|
Source: [Previous wiki page](https://msvincognito.nl/wiki/study/bachelor/year_1/block_2/objects_in_programming)
|
||||||
|
|
@ -0,0 +1,27 @@
|
||||||
|
---
|
||||||
|
title: Data Structures and Algorithms
|
||||||
|
description: Historical course details for Data Structures and Algorithms, recovered from the previous Incognito wiki.
|
||||||
|
---
|
||||||
|
|
||||||
|
:::caution[Historical information]
|
||||||
|
This information originated in the previous wiki and may be outdated. Check the current Maastricht University course information before relying on it.
|
||||||
|
:::
|
||||||
|
|
||||||
|
## Full course description
|
||||||
|
Data Structures and Algorithms introduces the students to the design and application of data structures and algorithms. Abstract datatypes will be used as a central topic in this course. As part of the basic abstract data types, such as trees, lists, and graphs, the associated algorithms and their complexity will be treated. Besides abstract datatypes the course will focus on design principles for algorithms such as recursion, divide-and-conquer, and dynamic programming. The lectures in this course are accompanied by computer labs, and students are expected to have obtained an understanding of the basic concepts in java via earlier courses. After completing this course students will be able to determine the appropriate data structures and algorithms for a given problem.
|
||||||
|
|
||||||
|
## Prerequisites
|
||||||
|
Introduction to Computer Science 1 and 2.
|
||||||
|
|
||||||
|
## Recommended reading
|
||||||
|
None.
|
||||||
|
|
||||||
|
## Files
|
||||||
|
- [Complexity Cheatsheet](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/data_structures_and_algorithms/complexity_cheatsheet.pdf)
|
||||||
|
- [Dsa Exam 2008-03-31](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/data_structures_and_algorithms/dsa_exam_2008-03-31.pdf)
|
||||||
|
- [Dsa Exam 2009](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/data_structures_and_algorithms/dsa_exam_2009.pdf)
|
||||||
|
- [Dsa Exam Solutions 2008-03-31](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/data_structures_and_algorithms/dsa_exam_solutions_2008-03-31.pdf)
|
||||||
|
|
||||||
|
---
|
||||||
|
|
||||||
|
Source: [Previous wiki page](https://msvincognito.nl/wiki/study/bachelor/year_1/block_4/data_structures_and_algorithms)
|
||||||
|
|
@ -0,0 +1,25 @@
|
||||||
|
---
|
||||||
|
title: Linear Algebra
|
||||||
|
description: Historical course details for Linear Algebra, recovered from the previous Incognito wiki.
|
||||||
|
---
|
||||||
|
|
||||||
|
:::caution[Historical information]
|
||||||
|
This information originated in the previous wiki and may be outdated. Check the current Maastricht University course information before relying on it.
|
||||||
|
:::
|
||||||
|
|
||||||
|
## Full course description
|
||||||
|
Linear Algebra introduces students to the concepts of linear algebra from an algebraic and geometric point of view. Linear algebra is essential for most calculations in mathematics, engineering and computer science. This makes it a broad topic in which students are taught concepts ranging from solving systems of linear equations to linear transformations and characteristics of linear systems. The lectures in this course are accompanied by computer labs, in which the student has to program a set of assignments. The software package used in this course is Matlab, which is one of the industry standards for calculations and computations that involve linear algebra. After completing this course the student will be able to use the fundamental concepts of linear algebra to implement and perform mathematical computations. Additionally the student will obtain valuable experience in using and writing code for Matlab.
|
||||||
|
|
||||||
|
## Prerequisites
|
||||||
|
None
|
||||||
|
|
||||||
|
## Recommended reading
|
||||||
|
None
|
||||||
|
|
||||||
|
## Files
|
||||||
|
- [Linear Algebra Notes](/media/legacy-dokuwiki/study/bachelor/year_1/block_2/linear_algebra/linear_algebra_notes.pdf)
|
||||||
|
- [Linearalgebrasummary](/media/legacy-dokuwiki/study/bachelor/year_1/block_2/linear_algebra/linearalgebrasummary.pdf)
|
||||||
|
|
||||||
|
---
|
||||||
|
|
||||||
|
Source: [Previous wiki page](https://msvincognito.nl/wiki/study/bachelor/year_1/block_4/linear_algebra)
|
||||||
|
|
@ -1,792 +0,0 @@
|
||||||
---
|
|
||||||
title: Previous exams and documents
|
|
||||||
description: Permission-cleared exams, summaries, notes, and other course documents recovered from the previous Incognito wiki.
|
|
||||||
---
|
|
||||||
|
|
||||||
This archive contains 332 documents recovered from the previous Incognito wiki. The original folders and filenames are preserved so their course context remains visible.
|
|
||||||
|
|
||||||
:::caution[Historical documents]
|
|
||||||
These files originated in the previous wiki and may refer to older course structures, learning objectives, or examination formats. Check current course information before relying on them.
|
|
||||||
:::
|
|
||||||
|
|
||||||
## Bachelor
|
|
||||||
|
|
||||||
### Year 1
|
|
||||||
|
|
||||||
#### Block 1
|
|
||||||
|
|
||||||
##### Discrete Mathematics
|
|
||||||
|
|
||||||
- [Dm Exam October 2014](/media/legacy-dokuwiki/study/bachelor/year_1/block_1/discrete_mathematics/dm_exam_october_2014.pdf)
|
|
||||||
|
|
||||||
- [Dm October 2016 Exam](/media/legacy-dokuwiki/study/bachelor/year_1/block_1/discrete_mathematics/dm_october_2016_exam.pdf)
|
|
||||||
|
|
||||||
- [Dmjanuari2014](/media/legacy-dokuwiki/study/bachelor/year_1/block_1/discrete_mathematics/dmjanuari2014.pdf)
|
|
||||||
|
|
||||||
- [Dmjanuari2015](/media/legacy-dokuwiki/study/bachelor/year_1/block_1/discrete_mathematics/dmjanuari2015.pdf)
|
|
||||||
|
|
||||||
- [Dmjanuary2016](/media/legacy-dokuwiki/study/bachelor/year_1/block_1/discrete_mathematics/dmjanuary2016.pdf)
|
|
||||||
|
|
||||||
- [Dmoktober2013 1 ](/media/legacy-dokuwiki/study/bachelor/year_1/block_1/discrete_mathematics/dmoktober2013_1_.pdf)
|
|
||||||
|
|
||||||
- [Dmoktober2015](/media/legacy-dokuwiki/study/bachelor/year_1/block_1/discrete_mathematics/dmoktober2015.pdf)
|
|
||||||
|
|
||||||
##### Introduction To Computer Science 1
|
|
||||||
|
|
||||||
- [Cs1 Exam 2012-01-31](/media/legacy-dokuwiki/study/bachelor/year_1/block_1/introduction_to_computer_science_1/cs1_exam_2012-01-31.pdf)
|
|
||||||
|
|
||||||
- [Cs1 Extra Questions 2011-10-26](/media/legacy-dokuwiki/study/bachelor/year_1/block_1/introduction_to_computer_science_1/cs1_extra_questions_2011-10-26.pdf)
|
|
||||||
|
|
||||||
- [Cs1 Homemade Mock Exam 2016](/media/legacy-dokuwiki/study/bachelor/year_1/block_1/introduction_to_computer_science_1/cs1_homemade_mock_exam_2016.pdf)
|
|
||||||
|
|
||||||
- [Cs1 Terminology Notes](/media/legacy-dokuwiki/study/bachelor/year_1/block_1/introduction_to_computer_science_1/cs1_terminology_notes.pdf)
|
|
||||||
|
|
||||||
##### Introduction To Data Science And Artifical Intelligence
|
|
||||||
|
|
||||||
- [Exam-Ida-2023-2024-Regular](/media/legacy-dokuwiki/study/bachelor/year_1/block_1/introduction_to_data_science_and_artifical_intelligence/exam-ida-2023-2024-regular.pdf)
|
|
||||||
|
|
||||||
- [Ike Exam 2012-10-22](/media/legacy-dokuwiki/study/bachelor/year_1/block_1/introduction_to_data_science_and_artifical_intelligence/ike_exam_2012-10-22.pdf)
|
|
||||||
|
|
||||||
- [Notes](/media/legacy-dokuwiki/study/bachelor/year_1/block_1/introduction_to_data_science_and_artifical_intelligence/notes.pdf)
|
|
||||||
|
|
||||||
#### Block 2
|
|
||||||
|
|
||||||
##### Computational And Cognitive Neuroscience
|
|
||||||
|
|
||||||
- [Ccn Checklist Julian 2017](/media/legacy-dokuwiki/study/bachelor/year_1/block_2/computational_and_cognitive_neuroscience/ccn_checklist_julian_2017.pdf)
|
|
||||||
|
|
||||||
- [Ccn Comprehensive Study Guide](/media/legacy-dokuwiki/study/bachelor/year_1/block_2/computational_and_cognitive_neuroscience/ccn_comprehensive_study_guide.pdf)
|
|
||||||
|
|
||||||
- [Kpcp Mockexam A 2015](/media/legacy-dokuwiki/study/bachelor/year_1/block_2/computational_and_cognitive_neuroscience/kpcp_mockexam_a_2015.pdf)
|
|
||||||
|
|
||||||
- [Kpcp Mockexam B 2015](/media/legacy-dokuwiki/study/bachelor/year_1/block_2/computational_and_cognitive_neuroscience/kpcp_mockexam_b_2015.pdf)
|
|
||||||
|
|
||||||
- [Krcp Concept Quiz 2016 Pdf V1](/media/legacy-dokuwiki/study/bachelor/year_1/block_2/computational_and_cognitive_neuroscience/krcp_concept_quiz_2016_pdf_v1.pdf)
|
|
||||||
|
|
||||||
- [Krcp Notes Marta 2016](/media/legacy-dokuwiki/study/bachelor/year_1/block_2/computational_and_cognitive_neuroscience/krcp_notes_marta_2016.pdf)
|
|
||||||
|
|
||||||
- [Neuroscience Questions-Greg-2017.Docx](/media/legacy-dokuwiki/study/bachelor/year_1/block_2/computational_and_cognitive_neuroscience/neuroscience_questions-greg-2017.docx.pdf)
|
|
||||||
|
|
||||||
- [Notes Cognitive Neuroscience](/media/legacy-dokuwiki/study/bachelor/year_1/block_2/computational_and_cognitive_neuroscience/notes_cognitive_neuroscience.pdf)
|
|
||||||
|
|
||||||
##### Introduction To Computer Science 2
|
|
||||||
|
|
||||||
- [Additonalpreexam-2017](/media/legacy-dokuwiki/study/bachelor/year_1/block_2/introduction_to_computer_science_2/additonalpreexam-2017.pdf)
|
|
||||||
|
|
||||||
- [Cs2 Mockexam 2015](/media/legacy-dokuwiki/study/bachelor/year_1/block_2/introduction_to_computer_science_2/cs2_mockexam_2015.pdf)
|
|
||||||
|
|
||||||
- [Homemade Exercises Cs2](/media/legacy-dokuwiki/study/bachelor/year_1/block_2/introduction_to_computer_science_2/homemade_exercises_cs2.pdf)
|
|
||||||
|
|
||||||
- [Preparation-Exam-2015 1 ](/media/legacy-dokuwiki/study/bachelor/year_1/block_2/introduction_to_computer_science_2/preparation-exam-2015_1_.pdf)
|
|
||||||
|
|
||||||
- [Unofficial Keys Additionalpreexam-2017](/media/legacy-dokuwiki/study/bachelor/year_1/block_2/introduction_to_computer_science_2/unofficial_keys_additionalpreexam-2017.pdf)
|
|
||||||
|
|
||||||
##### Linear Algebra
|
|
||||||
|
|
||||||
- [Linear Algebra Notes](/media/legacy-dokuwiki/study/bachelor/year_1/block_2/linear_algebra/linear_algebra_notes.pdf)
|
|
||||||
|
|
||||||
- [Linearalgebrasummary](/media/legacy-dokuwiki/study/bachelor/year_1/block_2/linear_algebra/linearalgebrasummary.pdf)
|
|
||||||
|
|
||||||
#### Block 4
|
|
||||||
|
|
||||||
##### Calculus
|
|
||||||
|
|
||||||
- [Ca1 Exam 2008-12-17](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/calculus/ca1_exam_2008-12-17.pdf)
|
|
||||||
|
|
||||||
- [Ca1 Exam 2009-01-29](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/calculus/ca1_exam_2009-01-29.pdf)
|
|
||||||
|
|
||||||
- [Ca1 Exam 2010-12-22](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/calculus/ca1_exam_2010-12-22.pdf)
|
|
||||||
|
|
||||||
- [Ca2 Mockexam 2009](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/calculus/ca2_mockexam_2009.pdf)
|
|
||||||
|
|
||||||
- [Ca2 Mockexam Solutions 2009](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/calculus/ca2_mockexam_solutions_2009.pdf)
|
|
||||||
|
|
||||||
- [Ca Cheat Sheet](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/calculus/ca_cheat_sheet.pdf)
|
|
||||||
|
|
||||||
- [Ca Exam 2016-03-31](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/calculus/ca_exam_2016-03-31.pdf)
|
|
||||||
|
|
||||||
- [Ca Exam 2016-06-27](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/calculus/ca_exam_2016-06-27.pdf)
|
|
||||||
|
|
||||||
- [Ca Mockexam 2016-03](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/calculus/ca_mockexam_2016-03.pdf)
|
|
||||||
|
|
||||||
- [Ca Mockexam Solutions 2016-03-31](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/calculus/ca_mockexam_solutions_2016-03-31.pdf)
|
|
||||||
|
|
||||||
- [Ca Spreadsheet](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/calculus/ca_spreadsheet.pdf)
|
|
||||||
|
|
||||||
- [Final Exam Calculus 2020 1 ](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/calculus/final_exam_calculus_2020_1_.pdf)
|
|
||||||
|
|
||||||
##### Data Structures And Algorithms
|
|
||||||
|
|
||||||
- [Complexity Cheatsheet](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/data_structures_and_algorithms/complexity_cheatsheet.pdf)
|
|
||||||
|
|
||||||
- [Dsa Exam 2008-03-31](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/data_structures_and_algorithms/dsa_exam_2008-03-31.pdf)
|
|
||||||
|
|
||||||
- [Dsa Exam 2009](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/data_structures_and_algorithms/dsa_exam_2009.pdf)
|
|
||||||
|
|
||||||
- [Dsa Exam Solutions 2008-03-31](/media/legacy-dokuwiki/study/bachelor/year_1/block_4/data_structures_and_algorithms/dsa_exam_solutions_2008-03-31.pdf)
|
|
||||||
|
|
||||||
#### Block 5
|
|
||||||
|
|
||||||
##### Logic
|
|
||||||
|
|
||||||
- [Logic - June 2020 Protocol](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/logic/logic_-_june_2020_protocol.pdf)
|
|
||||||
|
|
||||||
- [Logic Exam 2004](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/logic/logic_exam_2004.pdf)
|
|
||||||
|
|
||||||
- [Logic Exam 2005-06-03](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/logic/logic_exam_2005-06-03.pdf)
|
|
||||||
|
|
||||||
- [Logic Exam 2006-05-31](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/logic/logic_exam_2006-05-31.pdf)
|
|
||||||
|
|
||||||
- [Logic Exam 2007-05-30](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/logic/logic_exam_2007-05-30.pdf)
|
|
||||||
|
|
||||||
- [Logic Exam 2007-06-29](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/logic/logic_exam_2007-06-29.pdf)
|
|
||||||
|
|
||||||
- [Logic Exam 2008-06-04](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/logic/logic_exam_2008-06-04.pdf)
|
|
||||||
|
|
||||||
- [Logic Exam 2008-07-02](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/logic/logic_exam_2008-07-02.pdf)
|
|
||||||
|
|
||||||
- [Logic Mockexam 2016](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/logic/logic_mockexam_2016.pdf)
|
|
||||||
|
|
||||||
- [Nm Exam 2020](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/nm_exam_2020.pdf)
|
|
||||||
|
|
||||||
##### Numerical Mathematics
|
|
||||||
|
|
||||||
- [Assignment 1](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/assignment_1.pdf)
|
|
||||||
|
|
||||||
- [Assignment 2](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/assignment_2.pdf)
|
|
||||||
|
|
||||||
- [Assignment 3](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/assignment_3.pdf)
|
|
||||||
|
|
||||||
- [Assignment 3 2017 ](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/assignment_3_2017_.pdf)
|
|
||||||
|
|
||||||
- [Assignment 4](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/assignment_4.pdf)
|
|
||||||
|
|
||||||
- [Assignment 4 2017 ](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/assignment_4_2017_.pdf)
|
|
||||||
|
|
||||||
- [Assignment 5](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/assignment_5.pdf)
|
|
||||||
|
|
||||||
- [Assignment 5 2017 ](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/assignment_5_2017_.pdf)
|
|
||||||
|
|
||||||
- [Exam 2015 - Solutions](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/exam_2015_-_solutions.pdf)
|
|
||||||
|
|
||||||
- [Exam 2016 - Solutions](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/exam_2016_-_solutions.pdf)
|
|
||||||
|
|
||||||
- [Example-Spline Interpolation](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/example-spline_interpolation.pdf)
|
|
||||||
|
|
||||||
- [Formulae Sheet](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/formulae_sheet.pdf)
|
|
||||||
|
|
||||||
- [Introductory Assignment](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/introductory_assignment.pdf)
|
|
||||||
|
|
||||||
- [Matlab Reference Cheat Sheet](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/matlab_reference_cheat_sheet.pdf)
|
|
||||||
|
|
||||||
- [Nm Exam 2012-05-30](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/nm_exam_2012-05-30.pdf)
|
|
||||||
|
|
||||||
- [Nm Exam 2012-06](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/nm_exam_2012-06.pdf)
|
|
||||||
|
|
||||||
- [Nm Exam 2013-05-27](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/nm_exam_2013-05-27.pdf)
|
|
||||||
|
|
||||||
- [Nm Exam 2013-06](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/nm_exam_2013-06.pdf)
|
|
||||||
|
|
||||||
- [Nm Exam 2014-05-26](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/nm_exam_2014-05-26.pdf)
|
|
||||||
|
|
||||||
- [Nm Exam 2015-06-03](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/nm_exam_2015-06-03.pdf)
|
|
||||||
|
|
||||||
- [Nm Exam 2015-06](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/nm_exam_2015-06.pdf)
|
|
||||||
|
|
||||||
- [Nm Exam 2016-06-01](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/nm_exam_2016-06-01.pdf)
|
|
||||||
|
|
||||||
- [Nm Exam 2020](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/nm_exam_2020.pdf)
|
|
||||||
|
|
||||||
- [Nm Exam Part1 2015-06-03](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/nm_exam_part1_2015-06-03.pdf)
|
|
||||||
|
|
||||||
- [Nm Exam Part1 2016-06-01](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/nm_exam_part1_2016-06-01.pdf)
|
|
||||||
|
|
||||||
- [Nm Exam Solutions 2013-05-27](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/nm_exam_solutions_2013-05-27.pdf)
|
|
||||||
|
|
||||||
- [Nm Exam Solutions 2014-05-26](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/nm_exam_solutions_2014-05-26.pdf)
|
|
||||||
|
|
||||||
- [Nm Mockexam 2012](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/nm_mockexam_2012.pdf)
|
|
||||||
|
|
||||||
- [Numerical Maths Exam 2017](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/numerical_maths_exam_2017.pdf)
|
|
||||||
|
|
||||||
- [Numerical Maths Notes](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/numerical_mathematics/numerical_maths_notes.pdf)
|
|
||||||
|
|
||||||
##### Software Engineering
|
|
||||||
|
|
||||||
- [Se Mockexam 2015](/media/legacy-dokuwiki/study/bachelor/year_1/block_5/software_engineering/se_mockexam_2015.pdf)
|
|
||||||
|
|
||||||
### Year 2
|
|
||||||
|
|
||||||
#### Block 1
|
|
||||||
|
|
||||||
##### Databases
|
|
||||||
|
|
||||||
- [Database Assignment - Week 2](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/databases/database_assignment_-_week_2.pdf)
|
|
||||||
|
|
||||||
- [Database Assignment - Week 2 Solutions ](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/databases/database_assignment_-_week_2_solutions_.pdf)
|
|
||||||
|
|
||||||
- [Database Assignment - Week 3](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/databases/database_assignment_-_week_3.pdf)
|
|
||||||
|
|
||||||
- [Database Assignment - Week 3 Solutions ](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/databases/database_assignment_-_week_3_solutions_.pdf)
|
|
||||||
|
|
||||||
- [Database Assignment - Week 4](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/databases/database_assignment_-_week_4.pdf)
|
|
||||||
|
|
||||||
- [Database Assignment - Week 4 Solutions ](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/databases/database_assignment_-_week_4_solutions_.pdf)
|
|
||||||
|
|
||||||
- [Database Assignment - Week 5](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/databases/database_assignment_-_week_5.pdf)
|
|
||||||
|
|
||||||
- [Database Assignment - Week 5 Solutions ](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/databases/database_assignment_-_week_5_solutions_.pdf)
|
|
||||||
|
|
||||||
- [Database Assignment - Week 6](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/databases/database_assignment_-_week_6.pdf)
|
|
||||||
|
|
||||||
- [Database Assignment - Week 6 Solutions ](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/databases/database_assignment_-_week_6_solutions_.pdf)
|
|
||||||
|
|
||||||
- [Databases-Exam-Structure-2018](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/databases/databases-exam-structure-2018.pdf)
|
|
||||||
|
|
||||||
- [Lecture 1](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/databases/lecture_1.pdf)
|
|
||||||
|
|
||||||
- [Lecture 2](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/databases/lecture_2.pdf)
|
|
||||||
|
|
||||||
- [Lecture 3](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/databases/lecture_3.pdf)
|
|
||||||
|
|
||||||
- [Lecture 4](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/databases/lecture_4.pdf)
|
|
||||||
|
|
||||||
- [Lecture 5](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/databases/lecture_5.pdf)
|
|
||||||
|
|
||||||
- [Lecture 6](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/databases/lecture_6.pdf)
|
|
||||||
|
|
||||||
- [Lecture 7](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/databases/lecture_7.pdf)
|
|
||||||
|
|
||||||
- [Relational Algebra Supplement](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/databases/relational_algebra_supplement.pdf)
|
|
||||||
|
|
||||||
##### Graph Theory
|
|
||||||
|
|
||||||
- [Exam---Graph Theory---2017](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/graph_theory/exam---graph_theory---2017.pdf)
|
|
||||||
|
|
||||||
- [Exam---Graph Theory---2018](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/graph_theory/exam---graph_theory---2018.pdf)
|
|
||||||
|
|
||||||
- [Exam---Graph Theory---2019 1 ](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/graph_theory/exam---graph_theory---2019_1_.pdf)
|
|
||||||
|
|
||||||
- [Graph Theory Exam 2020-10-19](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/graph_theory/graph_theory_exam_2020-10-19.pdf)
|
|
||||||
|
|
||||||
- [Graph Theory Notes](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/graph_theory/graph_theory_notes.pdf)
|
|
||||||
|
|
||||||
- [Gt Add Notes](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/graph_theory/gt_add_notes.pdf)
|
|
||||||
|
|
||||||
- [Gt Exam 2004](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/graph_theory/gt_exam_2004.pdf)
|
|
||||||
|
|
||||||
- [Gt Exam 2005](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/graph_theory/gt_exam_2005.pdf)
|
|
||||||
|
|
||||||
- [Gt Exercises 2016](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/graph_theory/gt_exercises_2016.pdf)
|
|
||||||
|
|
||||||
- [Gt Notes](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/graph_theory/gt_notes.pdf)
|
|
||||||
|
|
||||||
- [Gt Practice-Exam 2016](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/graph_theory/gt_practice-exam_2016.pdf)
|
|
||||||
|
|
||||||
- [Gt Selected-Topics 2016](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/graph_theory/gt_selected-topics_2016.pdf)
|
|
||||||
|
|
||||||
- [Resit---Graph Theory---2017](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/graph_theory/resit---graph_theory---2017.pdf)
|
|
||||||
|
|
||||||
- [Resit---Graph Theory---2018](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/graph_theory/resit---graph_theory---2018.pdf)
|
|
||||||
|
|
||||||
- [Solution Hints 6---2020-2021---Exercise 6.3](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/graph_theory/solution_hints_6---2020-2021---exercise_6.3.pdf)
|
|
||||||
|
|
||||||
##### Philosophy And Artificial Intelligence
|
|
||||||
|
|
||||||
- [Gt Add Notes](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/philosophy_and_artificial_intelligence/gt_add_notes.pdf)
|
|
||||||
|
|
||||||
- [Gt Exam 2004](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/philosophy_and_artificial_intelligence/gt_exam_2004.pdf)
|
|
||||||
|
|
||||||
- [Gt Exam 2005](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/philosophy_and_artificial_intelligence/gt_exam_2005.pdf)
|
|
||||||
|
|
||||||
- [Gt Exercises 2016](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/philosophy_and_artificial_intelligence/gt_exercises_2016.pdf)
|
|
||||||
|
|
||||||
- [Gt Notes](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/philosophy_and_artificial_intelligence/gt_notes.pdf)
|
|
||||||
|
|
||||||
- [Gt Practice-Exam 2016](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/philosophy_and_artificial_intelligence/gt_practice-exam_2016.pdf)
|
|
||||||
|
|
||||||
- [Gt Selected-Topics 2016](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/philosophy_and_artificial_intelligence/gt_selected-topics_2016.pdf)
|
|
||||||
|
|
||||||
##### Probability And Statistics
|
|
||||||
|
|
||||||
- [Exam 2016](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/probability_and_statistics/exam_2016.pdf)
|
|
||||||
|
|
||||||
- [Exam 2016 - Solutions](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/probability_and_statistics/exam_2016_-_solutions.pdf)
|
|
||||||
|
|
||||||
- [Exam Concept Sheet 2016](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/probability_and_statistics/exam_concept_sheet_2016.pdf)
|
|
||||||
|
|
||||||
- [Lecture -Random Variables](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/probability_and_statistics/lecture_-random_variables.pdf)
|
|
||||||
|
|
||||||
- [Lecture 5 - Expectation Variance](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/probability_and_statistics/lecture_5_-_expectation_variance.pdf)
|
|
||||||
|
|
||||||
- [Lecture 6 Random Variables](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/probability_and_statistics/lecture_6_random_variables.pdf)
|
|
||||||
|
|
||||||
- [Lecture 7 - Discrete Distributions](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/probability_and_statistics/lecture_7_-_discrete_distributions.pdf)
|
|
||||||
|
|
||||||
- [Lecture 8 - Continuous Distributions](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/probability_and_statistics/lecture_8_-_continuous_distributions.pdf)
|
|
||||||
|
|
||||||
- [Lecture 9 - Gaussian Distribution](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/probability_and_statistics/lecture_9_-_gaussian_distribution.pdf)
|
|
||||||
|
|
||||||
- [Lectures 1 And 2](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/probability_and_statistics/lectures_1_and_2.pdf)
|
|
||||||
|
|
||||||
- [Lectures 3 And 4](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/probability_and_statistics/lectures_3_and_4.pdf)
|
|
||||||
|
|
||||||
- [Lectures 3 And 4 Handwritten Notes](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/probability_and_statistics/lectures_3_and_4_handwritten_notes.pdf)
|
|
||||||
|
|
||||||
- [Notes - Expectation Variance Tail Inequalities](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/probability_and_statistics/notes_-_expectation_variance_tail_inequalities.pdf)
|
|
||||||
|
|
||||||
- [P S Assignment 1](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/probability_and_statistics/p_s_assignment_1.pdf)
|
|
||||||
|
|
||||||
- [P S Assignment 1 - Solutions](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/probability_and_statistics/p_s_assignment_1_-_solutions.pdf)
|
|
||||||
|
|
||||||
- [P S Assignment 2](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/probability_and_statistics/p_s_assignment_2.pdf)
|
|
||||||
|
|
||||||
- [P S Assignment 2 - Solutions Updated ](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/probability_and_statistics/p_s_assignment_2_-_solutions_updated_.pdf)
|
|
||||||
|
|
||||||
- [P S Assignment 3](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/probability_and_statistics/p_s_assignment_3.pdf)
|
|
||||||
|
|
||||||
- [P S Assignment 3 - Solutions](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/probability_and_statistics/p_s_assignment_3_-_solutions.pdf)
|
|
||||||
|
|
||||||
- [Ps Cheatsheet](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/probability_and_statistics/ps_cheatsheet.pdf)
|
|
||||||
|
|
||||||
- [Ps Exam 2010-10-28](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/probability_and_statistics/ps_exam_2010-10-28.pdf)
|
|
||||||
|
|
||||||
- [Ps Exam 2012-10-23](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/probability_and_statistics/ps_exam_2012-10-23.pdf)
|
|
||||||
|
|
||||||
- [Ps Exam Solutions 2010-10-28](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/probability_and_statistics/ps_exam_solutions_2010-10-28.pdf)
|
|
||||||
|
|
||||||
- [Scanned Lecture Notes - Lectures 3-5](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/probability_and_statistics/scanned_lecture_notes_-_lectures_3-5.pdf)
|
|
||||||
|
|
||||||
- [Summary P S 2020 First6lectures](/media/legacy-dokuwiki/study/bachelor/year_2/block_1/probability_and_statistics/summary_p_s_2020_first6lectures.pdf)
|
|
||||||
|
|
||||||
#### Block 2
|
|
||||||
|
|
||||||
##### Graph Theory
|
|
||||||
|
|
||||||
- [Graph Theory](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/graph_theory/graph_theory.pdf)
|
|
||||||
|
|
||||||
- [Lp Exam - 2016](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/graph_theory/lp_exam_-_2016.pdf)
|
|
||||||
|
|
||||||
- [Lp Exam 2017](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/graph_theory/lp_exam_2017.pdf)
|
|
||||||
|
|
||||||
- [Lp Resit - 2016 Outdated Sa Question ](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/graph_theory/lp_resit_-_2016_outdated_sa_question_.pdf)
|
|
||||||
|
|
||||||
- [Lp Resit 2016 Outdated Sa Question ](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/graph_theory/lp_resit_2016_outdated_sa_question_.pdf)
|
|
||||||
|
|
||||||
- [Lp Resit 2017](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/graph_theory/lp_resit_2017.pdf)
|
|
||||||
|
|
||||||
- [Linear Program Overview V2](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/linear_program_overview_v2.pdf)
|
|
||||||
|
|
||||||
##### Linear Programming
|
|
||||||
|
|
||||||
- [Exam Lp July2019 -- Official](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/linear_programming/exam_lp_july2019_--_official.pdf)
|
|
||||||
|
|
||||||
- [Exam Lp June2019---Official](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/linear_programming/exam_lp_june2019---official.pdf)
|
|
||||||
|
|
||||||
- [Exam Lp June2020---Official](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/linear_programming/exam_lp_june2020---official.pdf)
|
|
||||||
|
|
||||||
- [Linear Programming Overview](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/linear_programming/linear_programming_overview.pdf)
|
|
||||||
|
|
||||||
- [Lp Exam - 2016](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/linear_programming/lp_exam_-_2016.pdf)
|
|
||||||
|
|
||||||
- [Lp Exam 2017](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/linear_programming/lp_exam_2017.pdf)
|
|
||||||
|
|
||||||
- [Lp Resit - 2016 Outdated Sa Question ](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/linear_programming/lp_resit_-_2016_outdated_sa_question_.pdf)
|
|
||||||
|
|
||||||
- [Lp Resit 2016 Outdated Sa Question ](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/linear_programming/lp_resit_2016_outdated_sa_question_.pdf)
|
|
||||||
|
|
||||||
- [Lp Resit 2017](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/linear_programming/lp_resit_2017.pdf)
|
|
||||||
|
|
||||||
- [Lptentamen2014juni](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/linear_programming/lptentamen2014juni.pdf)
|
|
||||||
|
|
||||||
- [Lptentamen2015juni](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/linear_programming/lptentamen2015juni.pdf)
|
|
||||||
|
|
||||||
- [Resit Lp July2020---Official](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/linear_programming/resit_lp_july2020---official.pdf)
|
|
||||||
|
|
||||||
##### Machine Learning
|
|
||||||
|
|
||||||
- [2017 Machine Learning Summary V4 ](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/machine_learning/2017_machine_learning_summary_v4_.pdf)
|
|
||||||
|
|
||||||
- [Cheat-Sheet](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/machine_learning/cheat-sheet.pdf)
|
|
||||||
|
|
||||||
- [Summary](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/machine_learning/summary.pdf)
|
|
||||||
|
|
||||||
##### Reasoning Techniques
|
|
||||||
|
|
||||||
- [2017 Bonus Assignment 1](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/reasoning_techniques/2017_bonus_assignment_1.pdf)
|
|
||||||
|
|
||||||
- [2017 Bonus Assignment 1 - Solutions](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/reasoning_techniques/2017_bonus_assignment_1_-_solutions.pdf)
|
|
||||||
|
|
||||||
- [2017 Bonus Assignment 2](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/reasoning_techniques/2017_bonus_assignment_2.pdf)
|
|
||||||
|
|
||||||
- [2017 Bonus Assignment 2 - Solutions](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/reasoning_techniques/2017_bonus_assignment_2_-_solutions.pdf)
|
|
||||||
|
|
||||||
- [2017 Bonus Assignment 3](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/reasoning_techniques/2017_bonus_assignment_3.pdf)
|
|
||||||
|
|
||||||
- [2017 Bonus Assignment 3 - Solutions](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/reasoning_techniques/2017_bonus_assignment_3_-_solutions.pdf)
|
|
||||||
|
|
||||||
- [2023examprep](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/reasoning_techniques/2023examprep.pdf)
|
|
||||||
|
|
||||||
- [2023examprepanswers](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/reasoning_techniques/2023examprepanswers.pdf)
|
|
||||||
|
|
||||||
- [Rt Sample Exam 2017 A](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/reasoning_techniques/rt_sample_exam_2017_a.pdf)
|
|
||||||
|
|
||||||
- [Rt Sample Exam 2017 B](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/reasoning_techniques/rt_sample_exam_2017_b.pdf)
|
|
||||||
|
|
||||||
- [Sampleexam1](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/reasoning_techniques/sampleexam1.pdf)
|
|
||||||
|
|
||||||
- [Sampleexam2](/media/legacy-dokuwiki/study/bachelor/year_2/block_2/reasoning_techniques/sampleexam2.pdf)
|
|
||||||
|
|
||||||
#### Block 4
|
|
||||||
|
|
||||||
##### Human Computer Interaction And Affective Computing
|
|
||||||
|
|
||||||
- [Hci Summary 2012](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/human_computer_interaction_and_affective_computing/hci_summary_2012.pdf)
|
|
||||||
|
|
||||||
##### Mathematical Modelling
|
|
||||||
|
|
||||||
- [0 Prerequisite Sensitivity Species Growth Predator Prey Models ](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/0_prerequisite_sensitivity_species_growth_predator_prey_models_.pdf)
|
|
||||||
|
|
||||||
- [1 State Space Representation](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/1_state_space_representation.pdf)
|
|
||||||
|
|
||||||
- [2 Continuous Time Transfer Functions And The Impulse Response](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/2_continuous_time_transfer_functions_and_the_impulse_response.pdf)
|
|
||||||
|
|
||||||
- [3 Continuous-Time Transfer Functions With Repeated Roots Stability](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/3_continuous-time_transfer_functions_with_repeated_roots_stability.pdf)
|
|
||||||
|
|
||||||
- [4 Discrete-Time Transfer Functions And Impulse Response Sequences](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/4_discrete-time_transfer_functions_and_impulse_response_sequences.pdf)
|
|
||||||
|
|
||||||
- [5 From State-Space To Transfer Functions And Back. Canonical Forms Fadeev](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/5_from_state-space_to_transfer_functions_and_back._canonical_forms_fadeev.pdf)
|
|
||||||
|
|
||||||
- [6 Sinusoidal Fidelity](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/6_sinusoidal_fidelity.pdf)
|
|
||||||
|
|
||||||
- [7 Interconnected Systems](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/7_interconnected_systems.pdf)
|
|
||||||
|
|
||||||
- [8 Sampling And Discrete-Time Equivalents Of Continuous-Time Systems](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/8_sampling_and_discrete-time_equivalents_of_continuous-time_systems.pdf)
|
|
||||||
|
|
||||||
- [9 Control By State Feedback](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/9_control_by_state_feedback.pdf)
|
|
||||||
|
|
||||||
- [Complex Numbers Pdf 1](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/complex_numbers_pdf_1.pdf)
|
|
||||||
|
|
||||||
- [Controllability And Observability](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/controllability_and_observability.pdf)
|
|
||||||
|
|
||||||
- [Conversion Ct To Dt Solutions](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/conversion_ct_to_dt_solutions.pdf)
|
|
||||||
|
|
||||||
- [Discrete-Time Systems Analysis](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/discrete-time_systems_analysis.pdf)
|
|
||||||
|
|
||||||
- [Formula Sheet](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/formula_sheet.pdf)
|
|
||||||
|
|
||||||
- [Fpw - Chapter 4 - The Digital Filter](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/fpw_-_chapter_4_-_the_digital_filter.pdf)
|
|
||||||
|
|
||||||
- [Interconnected Systems Exercises](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/interconnected_systems_exercises.pdf)
|
|
||||||
|
|
||||||
- [Intro To Dsp Lecture Slides](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/intro_to_dsp_lecture_slides.pdf)
|
|
||||||
|
|
||||||
- [Laplace Transforms Table](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/laplace_transforms_table.pdf)
|
|
||||||
|
|
||||||
- [Mathematical Modelling Solutions Guide V3](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/mathematical_modelling_solutions_guide_v3.pdf)
|
|
||||||
|
|
||||||
- [Mm 19 20 Exam](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/mm_19_20_exam.pdf)
|
|
||||||
|
|
||||||
- [Mm Exam 2007 V1](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/mm_exam_2007_v1.pdf)
|
|
||||||
|
|
||||||
- [Mm Exam 2007 V1 - Solutions](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/mm_exam_2007_v1_-_solutions.pdf)
|
|
||||||
|
|
||||||
- [Mm Exam 2015-04-02](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/mm_exam_2015-04-02.pdf)
|
|
||||||
|
|
||||||
- [Mm Exam 2015 V1](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/mm_exam_2015_v1.pdf)
|
|
||||||
|
|
||||||
- [Mm Exam 2016-04-01](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/mm_exam_2016-04-01.pdf)
|
|
||||||
|
|
||||||
- [Mm Exam 2016 V1](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/mm_exam_2016_v1.pdf)
|
|
||||||
|
|
||||||
- [Mm Exam 2017](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/mm_exam_2017.pdf)
|
|
||||||
|
|
||||||
- [Mm Exam 2017 - Solutions](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/mm_exam_2017_-_solutions.pdf)
|
|
||||||
|
|
||||||
- [Mm Supplementary Notes V4](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/mm_supplementary_notes_v4.pdf)
|
|
||||||
|
|
||||||
- [Notesmm2021bysree](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/notesmm2021bysree.pdf)
|
|
||||||
|
|
||||||
- [Pole Placement With State Feedback](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/pole_placement_with_state_feedback.pdf)
|
|
||||||
|
|
||||||
- [Understanding Poles And Zeroes](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/understanding_poles_and_zeroes.pdf)
|
|
||||||
|
|
||||||
- [Z-Transform](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/mathematical_modelling/z-transform.pdf)
|
|
||||||
|
|
||||||
##### Theoretical Computer Science
|
|
||||||
|
|
||||||
- [Bonus Assignment 1](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/theoretical_computer_science/bonus_assignment_1.pdf)
|
|
||||||
|
|
||||||
- [Bonus Assignment 2](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/theoretical_computer_science/bonus_assignment_2.pdf)
|
|
||||||
|
|
||||||
- [Bonus Assignment 3](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/theoretical_computer_science/bonus_assignment_3.pdf)
|
|
||||||
|
|
||||||
- [Exam--Tcs--2020v1sample Sols](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/theoretical_computer_science/exam--tcs--2020v1sample_sols.pdf)
|
|
||||||
|
|
||||||
- [Final-Exam-Tcs-2020 Sample Sols](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/theoretical_computer_science/final-exam-tcs-2020_sample_sols.pdf)
|
|
||||||
|
|
||||||
- [Lecture 10 - Turing Machines](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/theoretical_computer_science/lecture_10_-_turing_machines.pdf)
|
|
||||||
|
|
||||||
- [Lecture 11 - Turing Machines And Unrestricted Grammars](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/theoretical_computer_science/lecture_11_-_turing_machines_and_unrestricted_grammars.pdf)
|
|
||||||
|
|
||||||
- [Lecture 12 - Intro Complexity Analysis](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/theoretical_computer_science/lecture_12_-_intro_complexity_analysis.pdf)
|
|
||||||
|
|
||||||
- [Lecture 13 - Time Complexity P And Np](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/theoretical_computer_science/lecture_13_-_time_complexity_p_and_np.pdf)
|
|
||||||
|
|
||||||
- [Lecture 1 - Languages And Strings](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/theoretical_computer_science/lecture_1_-_languages_and_strings.pdf)
|
|
||||||
|
|
||||||
- [Lecture 2 - Language Hierarchy](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/theoretical_computer_science/lecture_2_-_language_hierarchy.pdf)
|
|
||||||
|
|
||||||
- [Lecture 3 - Finite State Machines](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/theoretical_computer_science/lecture_3_-_finite_state_machines.pdf)
|
|
||||||
|
|
||||||
- [Lecture 4 - Simulating And Minimizing Fsms](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/theoretical_computer_science/lecture_4_-_simulating_and_minimizing_fsms.pdf)
|
|
||||||
|
|
||||||
- [Lecture 5 - Regular Expressions](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/theoretical_computer_science/lecture_5_-_regular_expressions.pdf)
|
|
||||||
|
|
||||||
- [Lecture 6 - Regular Grammars And Non Regular Languages](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/theoretical_computer_science/lecture_6_-_regular_grammars_and_non_regular_languages.pdf)
|
|
||||||
|
|
||||||
- [Lecture 7 - Context Free Grammars](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/theoretical_computer_science/lecture_7_-_context_free_grammars.pdf)
|
|
||||||
|
|
||||||
- [Lecture 8 - Pushdown Automata](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/theoretical_computer_science/lecture_8_-_pushdown_automata.pdf)
|
|
||||||
|
|
||||||
- [Lecture 9 - Non Context-Free Languages](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/theoretical_computer_science/lecture_9_-_non_context-free_languages.pdf)
|
|
||||||
|
|
||||||
- [Sample Exam Tcs](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/theoretical_computer_science/sample_exam_tcs.pdf)
|
|
||||||
|
|
||||||
- [Sample Exam Tcs - With Solutions](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/theoretical_computer_science/sample_exam_tcs_-_with_solutions.pdf)
|
|
||||||
|
|
||||||
- [Summary](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/theoretical_computer_science/summary.pdf)
|
|
||||||
|
|
||||||
- [Tcs Sample Exam 2017](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/theoretical_computer_science/tcs_sample_exam_2017.pdf)
|
|
||||||
|
|
||||||
- [Tcs Sample Exam Solutions 2017](/media/legacy-dokuwiki/study/bachelor/year_2/block_4/theoretical_computer_science/tcs_sample_exam_solutions_2017.pdf)
|
|
||||||
|
|
||||||
#### Block 5
|
|
||||||
|
|
||||||
- [Exam Test Nlp 2021](/media/legacy-dokuwiki/study/bachelor/year_2/block_5/exam_test_nlp_2021.pdf)
|
|
||||||
|
|
||||||
##### Linear Programming
|
|
||||||
|
|
||||||
- [Pos Summary Course 2016](/media/legacy-dokuwiki/study/bachelor/year_2/block_5/linear_programming/pos_summary_course_2016.pdf)
|
|
||||||
|
|
||||||
##### Mathematical Simulation
|
|
||||||
|
|
||||||
- [1 Introduction](/media/legacy-dokuwiki/study/bachelor/year_2/block_5/mathematical_simulation/1_introduction.pdf)
|
|
||||||
|
|
||||||
- [2 Discrete Event Simulation](/media/legacy-dokuwiki/study/bachelor/year_2/block_5/mathematical_simulation/2_discrete_event_simulation.pdf)
|
|
||||||
|
|
||||||
- [3 Random Number Generators](/media/legacy-dokuwiki/study/bachelor/year_2/block_5/mathematical_simulation/3_random_number_generators.pdf)
|
|
||||||
|
|
||||||
- [Mockexam Ssa](/media/legacy-dokuwiki/study/bachelor/year_2/block_5/mathematical_simulation/mockexam_ssa.pdf)
|
|
||||||
|
|
||||||
- [Ms Exam 2009-07-02](/media/legacy-dokuwiki/study/bachelor/year_2/block_5/mathematical_simulation/ms_exam_2009-07-02.pdf)
|
|
||||||
|
|
||||||
- [Ms Exam 2010-06-03](/media/legacy-dokuwiki/study/bachelor/year_2/block_5/mathematical_simulation/ms_exam_2010-06-03.pdf)
|
|
||||||
|
|
||||||
- [Ms Exam 2014-04-27](/media/legacy-dokuwiki/study/bachelor/year_2/block_5/mathematical_simulation/ms_exam_2014-04-27.pdf)
|
|
||||||
|
|
||||||
- [Ms Resit 2016](/media/legacy-dokuwiki/study/bachelor/year_2/block_5/mathematical_simulation/ms_resit_2016.pdf)
|
|
||||||
|
|
||||||
- [Summary - Ms](/media/legacy-dokuwiki/study/bachelor/year_2/block_5/mathematical_simulation/summary_-_ms.pdf)
|
|
||||||
|
|
||||||
##### Philosophy And Artificial Intelligence
|
|
||||||
|
|
||||||
- [Pos Summary Course 2016](/media/legacy-dokuwiki/study/bachelor/year_2/block_5/philosophy_and_artificial_intelligence/pos_summary_course_2016.pdf)
|
|
||||||
|
|
||||||
### Year 3
|
|
||||||
|
|
||||||
#### Block 1
|
|
||||||
|
|
||||||
##### Game Theory
|
|
||||||
|
|
||||||
- [Cooperative Games](/media/legacy-dokuwiki/study/bachelor/year_3/block_1/game_theory/cooperative_games.pdf)
|
|
||||||
|
|
||||||
- [Game Theory 2hr Exam](/media/legacy-dokuwiki/study/bachelor/year_3/block_1/game_theory/game_theory_2hr_exam.pdf)
|
|
||||||
|
|
||||||
- [Game Theory Solutions](/media/legacy-dokuwiki/study/bachelor/year_3/block_1/game_theory/game_theory_solutions.pdf)
|
|
||||||
|
|
||||||
- [Gametheory1](/media/legacy-dokuwiki/study/bachelor/year_3/block_1/game_theory/gametheory1.pdf)
|
|
||||||
|
|
||||||
- [Gametheory2](/media/legacy-dokuwiki/study/bachelor/year_3/block_1/game_theory/gametheory2.pdf)
|
|
||||||
|
|
||||||
- [Gametheory3](/media/legacy-dokuwiki/study/bachelor/year_3/block_1/game_theory/gametheory3.pdf)
|
|
||||||
|
|
||||||
- [Gametheory4](/media/legacy-dokuwiki/study/bachelor/year_3/block_1/game_theory/gametheory4.pdf)
|
|
||||||
|
|
||||||
- [Gametheory5](/media/legacy-dokuwiki/study/bachelor/year_3/block_1/game_theory/gametheory5.pdf)
|
|
||||||
|
|
||||||
- [Gametheory7](/media/legacy-dokuwiki/study/bachelor/year_3/block_1/game_theory/gametheory7.pdf)
|
|
||||||
|
|
||||||
- [Gt Exam 2006-03-31](/media/legacy-dokuwiki/study/bachelor/year_3/block_1/game_theory/gt_exam_2006-03-31.pdf)
|
|
||||||
|
|
||||||
- [Talmud](/media/legacy-dokuwiki/study/bachelor/year_3/block_1/game_theory/talmud.pdf)
|
|
||||||
|
|
||||||
##### Prolog
|
|
||||||
|
|
||||||
- [Prolog Sample Exam](/media/legacy-dokuwiki/study/bachelor/year_3/block_1/prolog/prolog_sample_exam.pdf)
|
|
||||||
|
|
||||||
- [Prolog Sample Exam Solutions](/media/legacy-dokuwiki/study/bachelor/year_3/block_1/prolog/prolog_sample_exam_solutions.pdf)
|
|
||||||
|
|
||||||
##### Robotics And Embedded Systems
|
|
||||||
|
|
||||||
- [Robotics Lecture Notes](/media/legacy-dokuwiki/study/bachelor/year_3/block_1/robotics_and_embedded_systems/robotics_lecture_notes.pdf)
|
|
||||||
|
|
||||||
#### Block 2
|
|
||||||
|
|
||||||
##### Introduction To Bio-Informatics
|
|
||||||
|
|
||||||
- [Bio Exam 2015-04-02](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/introduction_to_bio-informatics/bio_exam_2015-04-02.pdf)
|
|
||||||
|
|
||||||
- [Estimating A Markov Transition Matrix From Observational Data](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/introduction_to_bio-informatics/estimating_a_markov_transition_matrix_from_observational_data.pdf)
|
|
||||||
|
|
||||||
- [Hmms And Sequence Alignment](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/introduction_to_bio-informatics/hmms_and_sequence_alignment.pdf)
|
|
||||||
|
|
||||||
- [Ibi Exam2016oct](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/introduction_to_bio-informatics/ibi_exam2016oct.pdf)
|
|
||||||
|
|
||||||
- [Ibi Exam 2017](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/introduction_to_bio-informatics/ibi_exam_2017.pdf)
|
|
||||||
|
|
||||||
- [Ibi Jukes-Cantor And Subsitution Models](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/introduction_to_bio-informatics/ibi_jukes-cantor_and_subsitution_models.pdf)
|
|
||||||
|
|
||||||
- [Ibi Notes Evelina](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/introduction_to_bio-informatics/ibi_notes_evelina.pdf)
|
|
||||||
|
|
||||||
- [Ibi Resit2017jan](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/introduction_to_bio-informatics/ibi_resit2017jan.pdf)
|
|
||||||
|
|
||||||
##### Logic For Artificial Intelligence
|
|
||||||
|
|
||||||
- [Bonus1](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/logic_for_artificial_intelligence/bonus1.pdf)
|
|
||||||
|
|
||||||
- [Example Exam With Answers](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/logic_for_artificial_intelligence/example_exam_with_answers.pdf)
|
|
||||||
|
|
||||||
- [Lai Notes](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/logic_for_artificial_intelligence/lai_notes.pdf)
|
|
||||||
|
|
||||||
##### Parallel Programming
|
|
||||||
|
|
||||||
- [Introduction](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/parallel_programming/introduction.pdf)
|
|
||||||
|
|
||||||
- [Introduction Pp](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/parallel_programming/introduction_pp.pdf)
|
|
||||||
|
|
||||||
- [Mock Exam](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/parallel_programming/mock_exam.pdf)
|
|
||||||
|
|
||||||
- [Mpi 1](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/parallel_programming/mpi_1.pdf)
|
|
||||||
|
|
||||||
- [Mpi 2](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/parallel_programming/mpi_2.pdf)
|
|
||||||
|
|
||||||
- [Openmp 1](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/parallel_programming/openmp_1.pdf)
|
|
||||||
|
|
||||||
- [Openmp 2 Performance Until Slide 57 ](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/parallel_programming/openmp_2_performance_until_slide_57_.pdf)
|
|
||||||
|
|
||||||
- [Parallel Programming Exam-Prep Notes](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/parallel_programming/parallel_programming_exam-prep_notes.pdf)
|
|
||||||
|
|
||||||
##### Quantum Computation
|
|
||||||
|
|
||||||
- [Qm 1 Qbits](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/quantum_computation/qm_1_qbits.pdf)
|
|
||||||
|
|
||||||
##### Recommender Systems
|
|
||||||
|
|
||||||
- [Letscry2021mockexam](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/recommender_systems/letscry2021mockexam.pdf)
|
|
||||||
|
|
||||||
- [Recommender Systems Notes](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/recommender_systems/recommender_systems_notes.pdf)
|
|
||||||
|
|
||||||
- [Rs 0 Exam Review Checklist](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/recommender_systems/rs_0_exam_review_checklist.pdf)
|
|
||||||
|
|
||||||
- [Rs 10 Social Multi Stakeholder](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/recommender_systems/rs_10_social_multi_stakeholder.pdf)
|
|
||||||
|
|
||||||
- [Rs 1 Non-Personalised](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/recommender_systems/rs_1_non-personalised.pdf)
|
|
||||||
|
|
||||||
- [Rs 2 Content Based](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/recommender_systems/rs_2_content_based.pdf)
|
|
||||||
|
|
||||||
- [Rs 3 Collaborative Filtering Knowledge Based](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/recommender_systems/rs_3_collaborative_filtering_knowledge_based.pdf)
|
|
||||||
|
|
||||||
- [Rs 4 Evaluation](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/recommender_systems/rs_4_evaluation.pdf)
|
|
||||||
|
|
||||||
- [Rs 5 Interfaces](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/recommender_systems/rs_5_interfaces.pdf)
|
|
||||||
|
|
||||||
- [Rs 6 Group Recommenders](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/recommender_systems/rs_6_group_recommenders.pdf)
|
|
||||||
|
|
||||||
- [Rs 7 Hybrid Recsys](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/recommender_systems/rs_7_hybrid_recsys.pdf)
|
|
||||||
|
|
||||||
- [Rs 8 Context Based](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/recommender_systems/rs_8_context_based.pdf)
|
|
||||||
|
|
||||||
- [Rs 9 Ethics Fairness](/media/legacy-dokuwiki/study/bachelor/year_3/block_2/recommender_systems/rs_9_ethics_fairness.pdf)
|
|
||||||
|
|
||||||
#### Block 4
|
|
||||||
|
|
||||||
- [0 Intro Visualisation](/media/legacy-dokuwiki/study/bachelor/year_3/block_4/0_intro_visualisation.pdf)
|
|
||||||
|
|
||||||
- [1 Hypothesis Testing](/media/legacy-dokuwiki/study/bachelor/year_3/block_4/1_hypothesis_testing.pdf)
|
|
||||||
|
|
||||||
- [2 Linear Regression](/media/legacy-dokuwiki/study/bachelor/year_3/block_4/2_linear_regression.pdf)
|
|
||||||
|
|
||||||
- [3 Scraping](/media/legacy-dokuwiki/study/bachelor/year_3/block_4/3_scraping.pdf)
|
|
||||||
|
|
||||||
- [4 Classification](/media/legacy-dokuwiki/study/bachelor/year_3/block_4/4_classification.pdf)
|
|
||||||
|
|
||||||
- [5 Time Series](/media/legacy-dokuwiki/study/bachelor/year_3/block_4/5_time_series.pdf)
|
|
||||||
|
|
||||||
- [6 Storytelling](/media/legacy-dokuwiki/study/bachelor/year_3/block_4/6_storytelling.pdf)
|
|
||||||
|
|
||||||
- [7 Dimensionality Reduction](/media/legacy-dokuwiki/study/bachelor/year_3/block_4/7_dimensionality_reduction.pdf)
|
|
||||||
|
|
||||||
- [8 Interpretable Models](/media/legacy-dokuwiki/study/bachelor/year_3/block_4/8_interpretable_models.pdf)
|
|
||||||
|
|
||||||
##### Data Analysis
|
|
||||||
|
|
||||||
- [0 Intro Visualisation](/media/legacy-dokuwiki/study/bachelor/year_3/block_4/data_analysis/0_intro_visualisation.pdf)
|
|
||||||
|
|
||||||
- [1 Hypothesis Testing](/media/legacy-dokuwiki/study/bachelor/year_3/block_4/data_analysis/1_hypothesis_testing.pdf)
|
|
||||||
|
|
||||||
- [2 Linear Regression](/media/legacy-dokuwiki/study/bachelor/year_3/block_4/data_analysis/2_linear_regression.pdf)
|
|
||||||
|
|
||||||
- [3 Scraping](/media/legacy-dokuwiki/study/bachelor/year_3/block_4/data_analysis/3_scraping.pdf)
|
|
||||||
|
|
||||||
- [4 Classification](/media/legacy-dokuwiki/study/bachelor/year_3/block_4/data_analysis/4_classification.pdf)
|
|
||||||
|
|
||||||
- [5 Time Series](/media/legacy-dokuwiki/study/bachelor/year_3/block_4/data_analysis/5_time_series.pdf)
|
|
||||||
|
|
||||||
- [6 Storytelling](/media/legacy-dokuwiki/study/bachelor/year_3/block_4/data_analysis/6_storytelling.pdf)
|
|
||||||
|
|
||||||
- [7 Dimensionality Reduction](/media/legacy-dokuwiki/study/bachelor/year_3/block_4/data_analysis/7_dimensionality_reduction.pdf)
|
|
||||||
|
|
||||||
- [8 Interpretable Models](/media/legacy-dokuwiki/study/bachelor/year_3/block_4/data_analysis/8_interpretable_models.pdf)
|
|
||||||
|
|
||||||
##### Intelligent Systems
|
|
||||||
|
|
||||||
- [Intsys Summary ](/media/legacy-dokuwiki/study/bachelor/year_3/block_4/intelligent_systems/intsys_summary_.pdf)
|
|
||||||
|
|
||||||
- [Is-Summary-Final](/media/legacy-dokuwiki/study/bachelor/year_3/block_4/intelligent_systems/is-summary-final.pdf)
|
|
||||||
|
|
||||||
- [Marl Notes 2022](/media/legacy-dokuwiki/study/bachelor/year_3/block_4/intelligent_systems/marl_notes_2022.pdf)
|
|
||||||
|
|
||||||
##### Operations Research Case Studies
|
|
||||||
|
|
||||||
- [Orcs](/media/legacy-dokuwiki/study/bachelor/year_3/block_4/operations_research_case_studies/orcs.pdf)
|
|
||||||
|
|
||||||
- [Orcs Overview V1.2](/media/legacy-dokuwiki/study/bachelor/year_3/block_4/operations_research_case_studies/orcs_overview_v1.2.pdf)
|
|
||||||
|
|
||||||
- [Orcsexamprepincognito2023](/media/legacy-dokuwiki/study/bachelor/year_3/block_4/operations_research_case_studies/orcsexamprepincognito2023.pdf)
|
|
||||||
|
|
||||||
- [Summary2023](/media/legacy-dokuwiki/study/bachelor/year_3/block_4/summary2023.pdf)
|
|
||||||
|
|
||||||
## Master Ai
|
|
||||||
|
|
||||||
### Year 1
|
|
||||||
|
|
||||||
#### Block 1
|
|
||||||
|
|
||||||
##### Foundations Of Agents
|
|
||||||
|
|
||||||
- [2014-Example-Exam](/media/legacy-dokuwiki/study/master_ai/year_1/block_1/foundations_of_agents/2014-example-exam.pdf)
|
|
||||||
|
|
||||||
- [2015-Exam](/media/legacy-dokuwiki/study/master_ai/year_1/block_1/foundations_of_agents/2015-exam.pdf)
|
|
||||||
|
|
||||||
- [2015-Resit](/media/legacy-dokuwiki/study/master_ai/year_1/block_1/foundations_of_agents/2015-resit.pdf)
|
|
||||||
|
|
||||||
## Master Dsdm
|
|
||||||
|
|
||||||
### Year 1
|
|
||||||
|
|
||||||
#### Block 1
|
|
||||||
|
|
||||||
##### Model Identification And Data Fitting
|
|
||||||
|
|
||||||
- [Exam 4 April 2012 1 ](/media/legacy-dokuwiki/study/master_dsdm/year_1/block_1/model_identification_and_data_fitting/exam_4_april_2012_1_.pdf)
|
|
||||||
Loading…
Add table
Reference in a new issue