Search result for Coursera data structures and algorithms Online Courses & Certifications
FollowFilter ![]()
Filter ![]()
Showing 237 courses
By Category ![]()
By Subject![]()
By Language![]()
By Duration![]()
By Price![]()
Get Course Alerts by Email
Data Structures and Algorithms (II)
by Junhui DENG- 0.0
-
![]()
![]()
![]()
![]()
![]()
Approx. 37 hours to complete
By learning this course, you will get a comprehensive grasp of stack, queue, binary tree, graph and BST structures and algorithms, as well as their applications. Algorithms used to solve complex problems Principles and methods in the design and implementation of various data structures Background on fundamental data structures and recent results...
Data Structures and Algorithms (IV)
by Junhui DENG- 0.0
-
![]()
![]()
![]()
![]()
![]()
Approx. 25 hours to complete
By learning this course, you will get a comprehensive grasp of Priority Queues and string match techniques, as well as their applications. Algorithms used to solve complex problems Principles and methods in the design and implementation of various data structures Skills for algorithm design and performance analysis Background on fundamental data structures and recent results...
Data Structures and Algorithms (III)
by Junhui DENG- 0.0
-
![]()
![]()
![]()
![]()
![]()
Approx. 27 hours to complete
By learning this course, you will get a comprehensive grasp of hashing and typical balanced binary search trees, as well as their applications. Algorithms used to solve complex problems Principles and methods in the design and implementation of various data structures Skills for algorithm design and performance analysis Background on fundamental data structures and recent results...
Data Structures and Algorithms: In-Depth using Python
by Syed Mohiuddin- 4.3
-
![]()
![]()
![]()
![]()
![]()
34.5 hours on-demand video
This course will help you in better understanding of the basics of Data Structures and how algorithms are implemented in high-level programming language. This course consists of lectures on data structures and algorithms which covers the computer science theory + implementation of data structures in python language. Each of the specific algorithms and data structures is divided into two sections....
$12.99
Recursion For Programmers
by Huw Collingbourne- 4.4
-
![]()
![]()
![]()
![]()
![]()
2 hours on-demand video
Algorithms and Data Structures: Recursion, the Stack and Trees A function that calls itself recursively not only saves programming effort and avoids repetition but it can also be used to navigate complex structures such as Trees and Class Hierarchies. This course explains the theory and the practice of recursion. The Stack and Stack Frames...
$11.99
Data Structures and Algorithms in java
by Muhammad Hamza AbdulRehman- 3.8
-
![]()
![]()
![]()
![]()
![]()
3 hours on-demand video
This course data Structures and Algorithms using java includes explanation of various data structures with coding examples, provided with detail explanation of code side by side with concept building. Most important Data Structures like This course is for students who want good understanding of data structures and algorithms and want to understand code....
$12.99
Unordered Data Structures
by Wade Fagen-Ulmschneider- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 21 hours to complete
The Unordered Data Structures course covers the data structures and algorithms needed to implement hash tables, disjoint sets and graphs. Graphs are used to represent relationships between items, and this course covers several different data structures for representing graphs and several different algorithms for traversing graphs, including finding the shortest route from one node to another node....
Related searches
I/O-efficient algorithms
by Mark de Berg- 4.6
-
![]()
![]()
![]()
![]()
![]()
Approx. 10 hours to complete
These data fetches are also called I/O operations and need to be taken into account during the design of an algorithm. - Graph terminology, representations of graphs (adjacency lists and adjacency matrix), basic graph algorithms (BFS, DFS, topological sort, shortest paths) Designing cache-aware and cache-oblivious algorithms Designing cache-aware and cache-oblivious algorithms...
Parallel programming
by Prof. Viktor Kuncak , Dr. Aleksandar Prokopec- 4.4
-
![]()
![]()
![]()
![]()
![]()
Approx. 33 hours to complete
We'll start the nuts and bolts how to effectively parallelize familiar collections operations, and we'll build up to parallel collections, a production-ready data parallel collections library available in the Scala standard library. - reason about task and data parallel programs, SBT tutorial and Submission of Assignments (Please read) Data Operations and Parallel Mapping Data Structures for Parallel Computing...
Parallel programming
by Prof. Viktor Kuncak , Dr. Aleksandar Prokopec- 4.4
-
![]()
![]()
![]()
![]()
![]()
Approx. 33 hours to complete
We'll start the nuts and bolts how to effectively parallelize familiar collections operations, and we'll build up to parallel collections, a production-ready data parallel collections library available in the Scala standard library. - reason about task and data parallel programs, SBT tutorial and Submission of Assignments (Please read) Data Operations and Parallel Mapping Data Structures for Parallel Computing...
Previous
