Tour of the most important data structures, fundamental algorithms, and algorithm design techniques: lists, stacks, queues, dynamic arrays, hash tables, priority queues, disjoint set unions, binary ...

Introduction to programming in Python. Introduction to the theory of algorithms: running time and correctness of an algorithm. Recursion. Data structures: arrays, linked lists, stacks, queues, binary ...

Next, we introduce the heap data structure and the basic properties of heaps. This is followed by algorithms for insertion, deletion and finding the minimum element of a heap along with their time ...

Many of these algorithms exploit the inherent structure of finite fields, utilising concepts such as cyclotomic coefficient rings and multi-point evaluation to effectively reduce computational ...

The doctoral researcher should have a master's degree in computer science or bioinformatics (or a related field) with an emphasis on computational sciences. Prior experience in algorithms is expected.

Course Type: Pathway | Breadth Specialization: Advanced Data Structures, RSA and Quantum Algorithms Instructor: Dr. Sriram Sankaranarayanan, Professor of Computer Science Prior knowledge needed: You ...

The Postdoctoral Researcher should have a PhD degree in computer science or bioinformatics (or related fields) with an emphasis on computational sciences and have experience in algorithm development.