In this module you will develop an understanding of the design of algorithms, with a focus on time and space complexity. You will examine basic algorithms, looking at the implementation and analysis of linear search, binary search, and basic sorting, including insertion sort, selection sort, merger sort, quick sort, and heap sort. You will consider alternative data structure representations, such as binary search trees, hash tables, and binary heaps, and will gain an insight into the basics of graph algorithms.
You have torepay your Postgraduate Master’s Loanat the same time as any other student loans you have. Erasmus+ Master Degree Loans are EU-guaranteed loans with favourable pay-back terms. They’re designed to help prospective students finance their Master’s courses in an Erasmus+ Programme country while leaving as little of a lasting economic footprint as possible. Chevening Scholarships are the UK government’s global scholarship programme, funded by the Foreign and Commonwealth Office … Read More