School of Electronic Engineering and Computer Science

Mr Hamza Bandukara


Room Number: Peter Landin, CS 319


Algorithms and Data Structures (Undergraduate)

The module is an introduction to Algorithms and Data Structures. It covers topics such as running time of algorithms, asymptotic complexity, simple and advanced sorting algorithms, divide and conquer algorithms, recursion, dynamic programming, greedy algorithms, basic data structures (strings, arrays, lists), linked lists, trees, hash tables.

Probability and Matrices (Undergraduate)

This module covers: Probability theory Counting permutations and combinations Conditional probabilities Bayesian probability Random variables and probability models Vector and matrix algebra Linear equations Vector spaces Linear combinations, linear independence