What Will You Learn?
This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with an emphasis on applications and the scientific performance analysis of Java implementations. It covers elementary data structures, sorting, and searching algorithms.
About This Course
Provider: Coursera
Format: Online
Duration: 54 hours to complete [Approx]
Target Audience: Intermediate
Learning Objectives: After completing this free course, participants will have a comprehensive understanding of essential algorithms and data structures, with a focus on practical applications and scientific performance analysis of Java implementations.
Course Prerequisites: NA
Assessment and Certification: Earn a Certificate upon completion from the relevant Provider
Instructor: Princeton University
Key Topics: Algorithms, Data Structure, Java Programming
Topic Covered:
- - Course Introduction
- - Dynamic Connectivity
- - Quick Find
- - Quick Union
- - Quick-Union Improvements
- - Analysis of Algorithms Introduction
- - Observations
- - Mathematical Models
- - Order-of-Growth Classifications
- - Theory of Algorithms
- - Stacks
- - Resizing Arrays
- - Queues
- - Generics
- - Iterators
- - Stack and Queue Applications (optional)
- - Sorting Introduction
- - Selection Sort
- - Insertion Sort
- - Shellsort
- - Shuffling
- - Mergesort
- - Quicksort
- - APIs and Elementary Implementations
- - Binary Heaps
- - Symbol Table API
- - Elementary Implementations
- - Ordered Operations
- - Binary Search Trees
- - Ordered Operations in BSTs
- - 2−3 Search Trees
- - Red-Black BSTs
- - 1d Range Search
- - Line Segment Intersection
- - Kd-Trees
- - Interval Search Trees
- - Hash Tables
- - Separate Chaining
- - Linear Probing
- - Hash Table Context
- - Symbol Table Applications: Sets
0 Comments