Skip to content
Uni Noter
Introduction
Initializing search
mathiasandresen/uni-notes
Forside
3 semester
4 semester
5 semester
6 semester
7 semester
8 semester
Uni Noter
mathiasandresen/uni-notes
Forside
3 semester
3 semester
Index
AD1
AD1
Course
Introduction
Analysing Algorithms
Divide-and-Conquer
Solving Recurrences
Sorting Algorithms
Heap Sort
Data Structures
Hash Tables
Binary Search Trees
Dynamic Programming
Elementary graph algorithms (A)
Elementary graph algorithms (B)
Elementary graph algorithms (C) - Topological Sort
Strongly Connected Components
Minimum Spanning Tree
Finding Shortest Paths
Big-O Cheat-Sheet
Standard Notation and Common Functions
Earlier Knowledge
DEB
DEB
Course
Envisionment
Physical Design
Physical Design - Memory & Attention
Physical Design - Perception & Navigation
Evaluation - What is Usability and Usability Testing
Evaluation - Identifying Problems
Evaluation - Alternative methods and UX
Evaluation - Alternative methods and UX
SU
SU
Course
Classes and Objects
FACTOR
Structure
Usage
4 semester
4 semester
Index
PSS
PSS
Course
Introduction to Operating Systems
Memory Management
Exam
Exam
Exam
1 - Processes and Threads
2 - Scheduling
3 - Memory Management
4 - Paged Memory
5 - Concurrency
6 - Concurrency Problems
7 - I/O and Device Drivers
8 - XV6 Exercise of Choice
SPO
SPO
Course
Programming Languages and Compilers
Tombstone Diagrams
The Phases of a Compiler
The 'ac' Language and Compiler
Language Specification
Context Free Grammars
From Tokens to Parse Trees
Lexical Analysis
Exam
Exam
Exam
1 - Language Design and Control Structures
2 - Structure of the Compiler
3 - Lexical Analysis
4 - Parsing
5 - Semantic Analysis
6 - Runtime Organization
7 - Heap Allocation and Garbage Collection
8 - Code Generation
SS
SS
Course
Eksamen - Fremgangsmåder
Regulære Sprog
Endelige Automater
Nondeterministiske Endelige Automater
Regulære Udtryk
Pumping Lemma
Kontekstfrie Grammatikker
Pushdown Automater
Pumping Lemma for Kontekstfrie Sprog
Rekursive Definitioner
5 semester
5 semester
Index
CC
CC
Course
Turing Maskiner
Church-Turing-Tesen
Acceptproblemet for Turing-maskiner
Er der Flere Problemer end Algoritmer? Og er Problemer Beslægtede?
Uafgørbare Problemer om Beregningshistorier
Posts Korrospondanceproblem ; Teorien for Reduktioner
Rice's Sætning
Tidskompleksitet
NP og NP-fuldstændighed
Flere NP-fuldstændige Sprog
Pladskompleksitet
Sprogproblemer
MI
MI
Course
Introduction
Problem Solving as Search
Constraints Satisfaction Problems
Constraints Satisfaction Problems - Appendix
Reasoning Under Uncertainty
Bayesian Networks
Inference in Bayesian Networks
Learning: Introduction and Decision Trees
Learning: Neural Network
Learning: Neural Network - Appendix
Learning: Methods and Issues
Learning: Clustering
Planning under Uncertainty
Multi-Agent Systems
Exam
Cheat Sheet for Probability Calculus
SOE
SOE
Course
Software Engineering
Agile, XP, and Scrum
(R)UP
Project Planning and Management
Risk Management
Quality Management
Test
Exam
Exam
Exam Questions
1. Software process models: waterfall
2. Software process model: incremental and iterative
3. Software process model: integration & configuration
4. Comparison of plan-driven and agile SOE processes
5. Key features of Scrum
6. Key features of RUP
7. Requirements Elicitation and Managing change to requirements
8. Quality Control: Verification and Validation
9. Risk Management
10. Project Planning and Management
11. Quality Management
12. Configuration Management
6 semester
6 semester
Index
AALG
AALG
Course
Dynamic Programming
All-pairs Shortest Paths (Dynamic Programming)
Flow Networks and Maximum Flow
Greedy Algorithms
Amortized Analysis
Computational Geometry Algorithms: Sweeping Techniques
Computational Geometry Data Structures: Range Searching
Multithreaded Algorithms
Approximation for NP-complete Problems
Backtracking and Branch-and-Bound
Guides
Guides
Amortized Analysis
Approximation and Parallelism
Flow Networks
Graphs
Others
Range Queries and Trees
Sweeping
Year based old
Year based old
2015
2016
2017
DBS
DBS
Course
Introduction
Relational Model and Relational Algebra
The Entity Relationship Model
Relational Database Design Theory
SQL
Transactions
Physical Design
Query Processing and Optimization
Guides
Guides
Logical (Heuristic) Query Optimization
Lossless Decomposition and Dependency Preservation
Mapping ER to Relations
Calculate Minimal Cover (Canonical Cover)
Determine Relational Schema Normal Form
7 semester
7 semester
Index
DS
DS
Course
Introduction
OS and Networking Fundamentals
Mutual Exclusion (Mutex) and Election
Multicast
Consensus
Replication and Consistency
Transactions
Wireless Sensor Networks and Internet of Things
Peer to Peer
Cluster Data Storage
Blockchain
Big Data Analytics
Service-oriented Architectures
Exam
Exam
Exam
Question 1 - Distributed Mutual Exclusion
Question 2 - Multicast
Question 3 - Replication and Consistency
Question 4: Consensus
Question 5 - Clustered Storage
Question 6 - Big Data Processing
Question 7 - Internet of Things Routing (Directed Diffusion, Tree Routing in ZigBee, AODV, DSR)
Question 8 - Peer to Peer (Gnutella, Chord)
Question 9 - Blockchain (Tamper-free linked lists, Nakamoto Consensus, proof of work, transactions in Merkle trees)
PP
PP
Course
Logic
Logic
Semantics of Datalog / Prolog
Exam
Exam
PP Exam
Datalog and Prolog
Haskell
Scheme
Solutions
Solutions
Scheme Exercises
Haskell Exercises
Datalog and Prolog Exercises
WI
WI
Course
Introduction
Index Construction
Content-based Ranking
Structure-based Ranking
Recommender Systems
Recommender Systems 2
Network Structure and Communities
Communities and Information Diffusion
Node Classification
Exam
Exam
WI Exam
8 semester
8 semester
Index
MDLS
MDLS
Introduction
mHCI
mHCI
mHCI Introduction
MCHI Concepts and Understanding Context
Introduction to Quantitative Studies
Lab Experiments
Field Experiments
Exam Questions
sP
sP
Introduction
Fundamentals
Initialization
Classes Continued
PIMPL Idiom and Dynamic Polymorphism
Double Dispatch
Generic Programming
Lambda Expressions
Rvalue and Forwarding References
Concurrency
Exam Notes
Linear Search
¶
Brute-force
algorithm
Binary Search
¶
Running Example
¶
Last update:
February 20, 2019
