Algorithms and Complexity

This is a level 5 core Software Engineering module and optional for Computer Science students. These notes focuses on the Elementary Sorting Algorithms and which of these is the most efficient and how they work, examples are also included.

This is a level 5 core Software Engineering module and optional for Computer Science students. These notes focuses on Hash Tables in Algorithms and how they work, including efficiency, reliability etc. It goes through everything you need to know about them within these notes.

This is a level 5 core Software Engineering module and optional for Computer Science students. These notes focuses on the Balanced Search Trees including the attributes and how they function. This included the adding/deleting of nodes/keys and how to use it to sort an algorithm.

This is a level 5 core Software Engineering module and optional for Computer Science students. These notes go through Arrays, Linked Lists, Queues and Stacks in Algorithms and what each and every one does including examples.

This is a level 5 core Software Engineering module and optional for Computer Science students. These notes focuses on Graphs in Algorithms which are different to normal graphs. They show unique information as to how algorithms are portrayed in these graphs and show vital statistics and information on which is the most efficient.

This is a level 5 core Software Engineering module and optional for Computer Science students. It contains notes on the efficiency of Algorithms looks into how effective each and every algorithm is when sorting, solving etc.

This is a level 5 core Software Engineering module and optional for Computer Science students. These notes focuses on Binary Search Trees which consist of nodes and keys. Focuses on the attributes of the binary search tree and how to delete/add nodes as well as how to use it.

This is a level 5 core Software Engineering module and optional for Computer Science students. In these notes, you will find every algorithm thoroughly analysed and explained in depth as to how they function.

This is a level 5 core Software Engineering module and optional for Computer Science students. These notes focuses on one algorithmic problem solution strategy which is the Brute Force algorithm and how it functions and carried out.