|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/algorithm-analysis-course-from-a-to-z-arabic/
课程评论：没有评论
课程名称：从A到Z的算法分析与设计课程 [阿拉伯语] 课程概述：算法无处不在。人们在日常任务中执行复杂算法时并不自知，且在选择多种算法的适用性上可能感到困惑。算法是区分中级开发者与优秀开发者的关键概念。然而，超过80%的应届毕业生对算法分析与设计缺乏基本知识。我们开设此课程旨在帮助学习者理解什么是算法，以及如何分析算法以选择最佳方案，同时提升逻辑思维能力。 欢迎参加此课程，这是关于算法分析与设计的首个和最优的讨论与解释课程。您将获得8小时21分钟的详细讲解和实际示例。本课程的算法分析与设计内容不是分散的主题讲解，而是一个有机的叙述故事。此外，在课程结束时，您将获得一份综合性的问题文件，包括28道选择题及答案，以评估您对课程内容的理解和掌握程度。 课程学习内容包括： - 引言：包含您必须了解的所有基本概念。 - 学习如何计算任何算法的时间复杂度，理解T(n)及不同计算技术，包括求和规则和循环转化为求和的技巧。 - 理解渐进符号（大O，Ω，Θ，小o，小ω）的数学定义，包括最坏情况、最好情况和平均情况。 - 探索增长率与时间的关系，以及如何依此进行排序。 - 理解递归及其递归方程的求解。 - 利用主定理、树形法和替换法（猜测与验证 vs 直接代入）解决递归问题。 - 学习空间复杂度、线性搜索、二分搜索、插入排序、选择排序、稳定性、内排序与外排序、快速排序。 - 深入了解算法分析技术，包括暴力法、分治法、贪心法等。 此外，您将获得总计3小时的大量实践题，包括高级问题，以最大化您的知识学习曲线。课程结束时，您也会获得一份已解决的考试，以训练自己并评估所学知识。
Algorithm used in everywhere. People Don't know how Complex algorithms they are executing when doing their day to day task and which algorithm to choose from multiple alternatives. The algorithm is the concept which differentiates intermediate and better developer. More than 80% of the fresh graduates don't have basic knowledge about algorithm analysis and design. So, we offer this course to help understand what is algorithm and how to analyze it to choose best one. Also to improve your logical thinking abilities.أهلا بك في الكورس الأول والأفضل في مناقشة وشرح تحليل وتصميم الخوارزميات. سوف تحصل على 8 ساعات و 21 دقيقة من الشرح التفصيلي والامثلة التطبيقية. تحليل وتصميم الخوارزميات هنا هو ليس شرح مواضيع منفصلة وانما هي حكاية وقصة مترابطة. أيضا في نهاية الكورس ستحصل على ملف اسئلة مختلفة شاملة اسئلة اختيارية مع الاجابة (28 سؤال مختلف) لتقيم مدي استيعابك وفهمك للكورس.Welcome to the first and best course in discussing and explaining algorithm analysis and design. You will receive 8 hours and 21 minutes of detailed explanations and practical examples. Algorithm analysis and design here is not just about explaining separate topics, but it is a connected story and narrative. Also, at the end of the course, you will receive a comprehensive file of different questions, including multiple-choice questions with answers (28 different questions) to assess your understanding and comprehension of the courseWhat you are Going to Learn?Introduction: including all basic concepts you must know.Learn How to calculate time for any algorithm (Time complexity) and what is T(n), different techniques including summation rules and how to convert loops to summation which are helpful in calculating T(n).Understand Asymptotic notations (Oh, Omega, Theta, Little Oh, Little Omega) with their mathematical definition [Worst Case, Best Case, Average Case].Growth Rate VS Time and how to sort based on each one + all possible equations you may get. What is recursion and how to find the Recursion equation.Solve recurrence using Master theorem.Solve recurrence using Tree methodSolve recurrence using Substitution method [Guess and verify VS Plug and chug] and much more. Space Complexity.Linear (Sequential) Search. Binary Search Insertion Sort Selection sort Stability In-place VS Out-of-place Quick sort Algorithm Analysis Techniques:- (brute force, Divide & Conquer, Greedy and so on)Also, you will get up to 3hr different practical questions including advanced questions which maximize your knowledge curve.You will get a Solved Exam at the end of this course to train your self and rate your gained knowledge.
