Data Structures and Algorithms with Python
About This Course
Upon successful completion of the module, trainees will be able to perform the following specific tasks:
• Understand the concepts and principles of data structures, algorithms, and computational complexity, including the use of big O notation to analyze the performance of algorithms.
• Understand and be able to implement different data structures, including linked lists, stacks, queues, various types of trees (binary tree, binary search tree, AVL tree) and graphs.
• Understand and be able to implement various sorting algorithms, including bubble sort, insertion sort, merge sort, selection sort, and quick sort.
• Understand and be able to implement different algorithmic design techniques, including brute force, divide-and-conquer, greedy algorithm, recursion, and dynamic programming.
• Be able to analyze and compare the performance of different algorithms, and choose the appropriate algorithm for a given problem based on factors such as time and space trade-off, and the specific requirements of the problem.
What You'll Learn
Entry Requirements
Diploma with 2 years of working experience.