Revision Notes

 

Atificial Intelligence

Mindez notes: Robot Localisation

Mindez notes: Probabilistic Reasoning

 

Distributed Systems

Distributed Systems  –  Architectural Paradigms  <==>  a post about Clients and Servers and the the Exchanging of data between them

Distributed Systems — Synchronization and Blocking Primitives <==> the SENDing and RECIEVEing of data between processes

Distributed Systems — Defining A Distributed System <==> A quick definition of a DS and a few paradigmatic examples

Distributed Systems — Interconnects  <==>  A more in depth look into the protocols at each layer of a process, and main types of interconnects, such as MIMD.

Distributed Systems — Axioms of Distributed Computing <==> some of the truths behind Distributed Systems.

Distributed Systems — Server Level Sockets <==> creating sockets on a server, and how they send and recieve data.

Distributed Systems — Logical Clocks and Processes <==> What happens if 2 processes try to access the same memory location? How do processes know what time it is really?

Distributed Systems — The Bully Alorithm <==> how do processes decide who will be the new coordinator.

Need some help with VoIP? try Mindez notes: VoIP part 1  <==> what it VoIP, how does it work?

 

Discrete Mathematics

Discrete Maths — Functions (Part 1) <==> the layout of a function, and explaining Injective, Surjective and Bijective.

Discrete Maths — Functions (Part 2) <==> The composition of functions, and the fact that they are associative.

Discrete Maths — Induction (part 1)  <==> what is it, and how do we do it?

Discrete Maths — Induction (part 2)  <==> a better example to hopefully further understanding

what Relations notes? here: Mindez notes, Relations

 

Computation

Computation — Sets and Languages  <==> Defining Symbols, Alphabets and Languages, and to introduce Set-Notation.

• Want more? Try Mindez notes: Sets and Languages

Computation — Regular Expressions  <==> How a computer understand patterns, and how to match a word in a language to a pattern.

Computation — Intro to Automata (part 1)  <==>  A quick intro into how to express patterns by using pictures, also known as automata.

Computation — Finite State Automaton (part 2)  <==>  A more formal look at automatons, as well as what really makes them up.

Computation — An NFA to a DFA (part 3)  <==>  How to transform an NFA into its couterpart – a DFA. as well as a definition for an NFA.

Computation — Automata to Patterns (part 4)  <==>  The algorithm needed to get the regular expression that describes the same language as the automata.

Computation — Patterns to Automaton (part 5)  <==>  The algorithm needed to find an automata from a given pattern.

Computation — Context-Free Grammars  <==>  A better way of describing languages, that of which an automaton cannot.

Computation — Time and Space Complexity  <==> the amount of time and space programs, even very small one can take up. As well as some problems that can cause you to really think.

Computation — Halting Problem  <==>  Is it really possible to tell if a program really does terminate? Read here to find out!

Computation — Growth Rates and Order  <==>  which algorithms really have the fastest expressions? and when are 2 functions of the same order/degress.

Computation — CFG to DFA  <==> how to form a DFA from a given CFG