Algorithms and Complexity

University of Westminster (UOW)

Here are the best resources to pass Algorithms and Complexity. Find Algorithms and Complexity study guides, notes, assignments, and much more.

All 11 results

Sort by

Elementary Sorting Algorithms
  • Elementary Sorting Algorithms

  • Class notes • 78 pages • 2016
  • 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.
    (0)
  • $3.86
  • + learn more
Hash Tables
  • Hash Tables

  • Class notes • 48 pages • 2016
  • 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.
    (0)
  • $3.86
  • + learn more
Balanced Search Trees
  • Balanced Search Trees

  • Class notes • 68 pages • 2016
  • 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.
    (0)
  • $3.86
  • + learn more
Arrays to Linked Lists, Queues and Stacks
  • Arrays to Linked Lists, Queues and Stacks

  • Class notes • 80 pages • 2016
  • 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.
    (0)
  • $3.86
  • + learn more
Introduction to Graphs in Algorithms
  • Introduction to Graphs in Algorithms

  • Class notes • 58 pages • 2016
  • 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.
    (0)
  • $3.86
  • + learn more
Algorithm Efficiency
  • Algorithm Efficiency

  • Class notes • 25 pages • 2016
  • 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.
    (0)
  • $3.86
  • + learn more
Analysis of Algorithms
  • Analysis of Algorithms

  • Class notes • 55 pages • 2016
  • 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.
    (0)
  • $3.86
  • 1x sold
  • + learn more
Brute Force Algorithms
  • Brute Force Algorithms

  • Class notes • 18 pages • 2016
  • 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.
    (0)
  • $3.86
  • + learn more
Introduction to Algorithms
  • Introduction to Algorithms

  • Class notes • 48 pages • 2016
  • 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.
    (0)
  • $3.86
  • + learn more