Algorithms
Analysis and Design of Algorithms
What you'll learn
- Understand algorithm fundamentals
- Learn to write linear algorithms
- Analyze recursive algorithms
- Manage diagrams and performance analysis
- Enhance logical thinking for problem solving
- Design algorithms in various forms
About this course
This course covers both basic and advanced algorithms, including linear and binary search, sorting, as well as graph, directed, and tree algorithms. It also explores algorithm applications in various fields such as data analysis, artificial intelligence, machine learning, cybersecurity, and network research. The course aims to equip learners with the fundamental concepts and tools necessary for developing and analyzing algorithms, while applying these tools in real-world scenarios to solve practical problems. It is beneficial for students pursuing advanced studies in computer science, as well as engineers and software developers in information technology.
Expected outcomes
- Deep understanding of algorithm analysis concepts.
- Writing efficient algorithms and analyzing their performance.
- Handling graphs and advanced algorithms.
- Applying algorithms to solve practical problems.
Course content
1New section
16 lectures
- General Introduction20:36
- Concept of Algorithm Analysis23:59
- Algorithm Analysis Strategies14:36
- How to Write Verbal Algorithms (Part One)12:59
- How to Write Verbal Algorithms (Part Two)21:41
- Flowcharts25:45
- Analyzing the Sequential Search Algorithm25:27
- Introduction to Asymptotic Notation/Big OH/Omega/Theta27:53
- Analysis of Iterative Loops22:20
- Analysis of Nested Loops20:46
- Recursive Algorithms (Part One)13:51
- Recursive Algorithms (Part Two)13:31
- Comparison of Recursion and Iteration22:29
- Algorithms for Handling BFS + DF Graphs18:45
- Insertion Sort Algorithm22:18
- Quick Sort Algorithm and Binary Search18:03
2Add-ons
1 attachments
- Download the Work Book
Instructor
Dr. Eng. Mohamed Al-Khodour
This course is part of the diploma
