Description
Time and space complexity analysis (big-O notation) is a training course to analyze and estimate the time and space complexity of algorithms with the big O notation, published by Yudemi Academy. Analyzing the time and space complexity of the algorithm is one of the most valuable and money-making skills in the field of computer science and programming, which has attracted the attention of many engineers and programmers. The topics presented in this course are divided into two theoretical and practical areas. In the theory section, he is familiar with all topics in the field of algorithm analysis such as notations, input cases, amortized complexity analysis, analysis of the complexity of different information structures, analysis of the amount of resources required for the implementation of algorithms, etc. and you will get a general view of them.
During the educational process of the course, the instructor will introduce you to external resources and refer you to books and other available educational tools if necessary. Practice and test are one of the most important parts of this training course, which can have a significant impact on your learning process.
Topics presented in this training course:
- Basic concepts of complexity analysis of algorithms
- Getting to know the symbols Big-O, Big-Omega and Big-Theta
- Introducing different scenarios when receiving data and types of excellent, average and bad scenarios
- Hierarchy of complications (complexities hierarchy)
- Complexity class and its different types such as P and NP
- Different methods of analyzing time and space complexity of an algorithm
- Different methods of comparing the efficiency of an algorithm
- Amortized complexity analysis
- Analysis of the complexity of search algorithms
- Analysis of the complexity of sorting algorithms
- Analysis of the complexity of recursive functions
- Analysis of the complexity of operators and main operators of the data structure
- Common problems and misconceptions of beginners
- Familiarity with frequently asked questions and issues in job interviews
What you will learn in Time and space complexity analysis (big-O notation) course:
- Time and space complexity analysis of different algorithms
- Comparison of different algorithms
- Analysis of search algorithms and data sorting
- Different methods of comparing and checking algorithms
- Familiarity with the complexity of data structures and basic operators
Course details
Publisher: Yodmi
teacher: Inside Code
English language
Education level: introductory
Number of courses: 57
Training duration: 7 hours and 35 minutes
Course headings
Time and space complexity analysis course prerequisites (big-O notation)
Basic programming knowledge
Course images
Time and space complexity analysis course introduction video (big-O notation)
Installation guide
After Extract, view with your favorite Player.
English subtitle
Quality: 720p
download link
Password file(s): www.downloadly.ir
Size
1.55 GB
Be the first to comment