MP4 | Video: h264, 1280x720 | Audio: AAC, 44.1 KHz, 2 Ch
Genre: eLearning | Language: English + srt | Duration: 25 lectures (4h 7m) | Size: 762.3 MB
Master the fundamentals of data structures and algorithms
What you'll learn:
Data Structures
Algorithms and Analysis of Algorithms
Programming interview skills
Requirements
Basic programming skill in any laguage
Description
In this course we will understand different data structures and how to use them effectively for solving problems. It is expected that the students have basic experience in any high-level programming language. Data structures and algorithms are a crucial part of programming interviews. This course is Part-1 of a 2 course series on Complete data structure and algorithms. The main focus here will be mastering the Data structures, implementing those and some problems explaining application of those data structures. The next part will cover different programming paradigms, analysis of algorithms and applying different data structures learnt in part 1. So, part 1 acts as a foundation for part 2.
In this part, we will cover the following topics:
Time and Space complexity of algorithms
Arrays,
Linked Lists,
Trees - Representation, binary trees, binary search trees, balanced binary search trees, and related problems
Stacks and Queues,
Heaps,
Graphs - representation, traversal of graph using breadth-first search, depth first search, graph algorithms
Hash Table,
Tries
A good understanding of data structures and algorithms is very crucial for programming interview. After completing this course you should be able to understand which data structures and algorithms should be used to solve a problem and why. It will not only prepare you for your coding interviews, but also make you a better programmer in general.
So, let's get started.
Who this course is for
Software Engineers
Computer Science students
Data Scientists
Homepage
https://www.udemy.com/course/data-structures-and-algorithms-course-1/
Buy Premium From My Links To Get Resumable Support,Max Speed & Support Me