Princeton University - Algorithms, Part I
4.0 /5- Offered byCoursera
Algorithms, Part I at Coursera Overview
Duration | 54 hours |
Total fee | Free |
Mode of learning | Online |
Schedule type | Self paced |
Difficulty level | Intermediate |
Official Website | Explore Free Course  |
Credential | Certificate |
Algorithms, Part I at Coursera Highlights
- 100% online Start instantly and learn at your own schedule.
- Flexible deadlines Reset deadlines in accordance to your schedule.
- Intermediate Level
- Approx. 54 hours to complete
- English Subtitles: Arabic, French, Portuguese (European), Italian, Vietnamese, Korean, German, Russian, English, Spanish
Algorithms, Part I at Coursera Course details
- This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers elementary data structures, sorting, and searching algorithms. Part II focuses on graph- and string-processing algorithms.
- All the features of this course are available for free. It does not offer a certificate upon completion.
Algorithms, Part I at Coursera Curriculum
Course Introduction
Course Introduction
Welcome to Algorithms, Part I
Lecture Slides
Dynamic Connectivity
Quick Find
Quick Union
Quick-Union Improvements
Union?Find Applications
Overview
Lecture Slides
Interview Questions: Union?Find (ungraded)
Analysis of Algorithms Introduction
Observations
Mathematical Models
Order-of-Growth Classifications
Theory of Algorithms
Memory
Lecture Slides
Interview Questions: Analysis of Algorithms (ungraded)
Stacks and Queues
Stacks
Resizing Arrays
Queues
Generics
Iterators
Stack and Queue Applications (optional)
Overview
Lecture Slides
Interview Questions: Stacks and Queues (ungraded)
Sorting Introduction
Selection Sort
Insertion Sort
Shellsort
Shuffling
Convex Hull
Lecture Slides
Interview Questions: Elementary Sorts (ungraded)
Mergesort
Mergesort
Bottom-up Mergesort
Sorting Complexity
Comparators
Stability
Overview
Lecture Slides
Interview Questions: Mergesort (ungraded)
Quicksort
Selection
Duplicate Keys
System Sorts
Lecture Slides
Interview Questions: Quicksort (ungraded)
Priority Queues
APIs and Elementary Implementations
Binary Heaps
Heapsort
Event-Driven Simulation (optional)
Overview
Lecture Slides
Interview Questions: Priority Queues (ungraded)
Symbol Table API
Elementary Implementations
Ordered Operations
Binary Search Trees
Ordered Operations in BSTs
Deletion in BSTs
Lecture Slides
Interview Questions: Elementary Symbol Tables (ungraded)
Balanced Search Trees
2?3 Search Trees
Red-Black BSTs
B-Trees (optional)
Overview
Lecture Slides
Interview Questions: Balanced Search Trees (ungraded)
1d Range Search
Line Segment Intersection
Kd-Trees
Interval Search Trees
Rectangle Intersection
Lecture Slides
Hash Tables
Hash Tables
Separate Chaining
Linear Probing
Hash Table Context
Overview
Lecture Slides
Interview Questions: Hash Tables (ungraded)
Symbol Table Applications: Sets (optional)
Symbol Table Applications: Dictionary Clients (optional)
Symbol Table Applications: Indexing Clients (optional)
Symbol Table Applications: Sparse Vectors (optional)
Lecture Slides
Other courses offered by Coursera
Algorithms, Part I at Coursera Students Ratings & Reviews
1 Rating- 3-41
Student Forum
Anything you would want to ask experts?
Useful Links
Know more about Coursera
Know more about Programs
- Engineering
- Instrumentation Technology
- Food Technology
- Aeronautical Engineering
- What is Machine Learning
- Metallurgical Engineering
- MTech in Computer Science Engineering
- VLSI Design
- Petroleum Engineering
- Aerospace Engineering
- BTech in Biotechnology Engineering
- Pharmaceutical engineering
- Silk Technology
- Microelectronics
- Agriculture & Farm Engineering