Abidulmeah96
On this page, you find all documents, package deals, and flashcards offered by seller AbidulMeah96.
- 10
- 0
- 1
Community
- Followers
- Following
11 items
Algorithms and Complexity
These notes go through everything you need to know in Algorithms, from sorting to searching including algorithm efficiency and analysis of each and every one. This bundle is worth £18 (£2 each) but as a bundle option, I am selling them at a staggering £5!
- Package deal
- • 9 items •
- Brute Force Algorithms • Class notes
- Analysis of Algorithms • Class notes
- Algorithm Efficiency • Class notes
- Binary Search Trees • Class notes
- Introduction to Graphs in Algorithms • Class notes
- And more ….
These notes go through everything you need to know in Algorithms, from sorting to searching including algorithm efficiency and analysis of each and every one. This bundle is worth £18 (£2 each) but as a bundle option, I am selling them at a staggering £5!
Elementary Sorting Algorithms
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.
- Package deal
- Class notes
- • 78 pages •
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.
Hash Tables
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.
- Package deal
- Class notes
- • 48 pages •
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.
Balanced Search Trees
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.
- Package deal
- Class notes
- • 68 pages •
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.
Arrays to Linked Lists, Queues and Stacks
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.
- Package deal
- Class notes
- • 80 pages •
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.
Introduction to Graphs in Algorithms
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.
- Package deal
- Class notes
- • 58 pages •
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.
Algorithm Efficiency
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.
- Package deal
- Class notes
- • 25 pages •
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.
Analysis of Algorithms
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.
- Package deal
- Class notes
- • 55 pages •
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.
Brute Force Algorithms
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.
- Package deal
- Class notes
- • 18 pages •
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.
Introduction to Algorithms
These notes go through the fundamentals/basic information of what algorithms there are and how they function. Very important if you are studying Software Engineering and could be useful for computer science students. This is a Level 5 Module.
- Class notes
- • 48 pages •
These notes go through the fundamentals/basic information of what algorithms there are and how they function. Very important if you are studying Software Engineering and could be useful for computer science students. This is a Level 5 Module.