Data Structures and Algorithms

Program Overview

Efficient software depends on choosing the right way to store and process data. This programme builds a working command of the core structures and algorithms used in professional development: complexity analysis with Big-O notation, arrays and linked lists, stacks and queues, hash tables, trees, heaps and graphs, sorting and searching algorithms, recursion, divide and conquer, greedy methods and dynamic programming. Participants implement each topic in Python or Java and apply it to realistic performance problems and technical interview style exercises.

Learning Outcomes

• ✓Analyse the time and space complexity of code using Big-O notation.
• ✓Implement linked lists, stacks, queues and hash tables and choose between them for a given task.
• ✓Build and traverse binary search trees and heaps and explain their performance characteristics.
• ✓Apply breadth-first search, depth-first search and Dijkstra's algorithm to graph problems.
• ✓Implement and compare sorting algorithms such as merge sort, quicksort and heap sort.
• ✓Solve optimisation problems using recursion, greedy approaches and dynamic programming.

Target Audience

• Software developers and engineers
• Computer science graduates entering industry
• Data engineers who write performance-sensitive code
• Developers preparing for technical interviews

Detailed Program Modules

Training Methodology

Applied Project & Assessment