Get updates on Eligibility, Admission, Placements Fees Structure
Quick Facts
| Medium Of Instructions | Mode Of Learning | Mode Of Delivery |
|---|---|---|
| English | Self Study | Video and Text Based |
Course Overview
The Algorithm programme offered by Princeton University has two parts, Part I and Part II. The programme covers critical knowledge about ‘algorithms and data structures while emphasizing on scientific performance analysis and applications of Java implementations. Every serious programmer needs to know this.
Algorithms, Part I includes elementary algorithms for data structures, sorting, and searching while Part II focuses on algorithms for graph- and string-processing. After the completion of the first part, candidates can enrol for the second part in Coursera.
The Algorithms, Part I programme is a 100 per cent free programme. Enrolment, access to content everything is provided for free. And also there will be no certification after completion of the programme.
Candidates who are looking for a way to learn algorithms, Java programming, data structures should enrol for this programme. Irrespective of the field, candidates can enrol in the Algorithms, Part I programme if they use computers to solve problems which are large.
Candidates who are programmers should also enrol for the Algorithms, Part I programme. By completing the programme they will be getting so many advantages in their career. The ones who have already finished the programme are now in better conditions.
The Highlights
- 100 percent online
- Flexible schedule
- Free to enrol
- Approximately 54 hours to complete
- Intermediate level
Programme Offerings
- online learning
- Quiz
- videos.
Courses and Certificate Fees
| Certificate Availability |
|---|
| no |
The Algorithms, Part I programme is a free programme offered by Princeton University. Candidates can enrol for free and get access to all lectures, videos, assignments and quizzes entirely for free.
Algorithms Part 1 Fees Structure
| Course | Fees |
| Algorithms Part 1 | Free |
Eligibility Criteria
Certification Qualifying Details
The Algorithms, Part I programme comes with no certificate. According to the policy, Princeton University no certificates or credentials are given after completion. Candidates can learn this programme for free.
What you will learn
After the completion of the Algorithms, Part I programme candidates will be acquiring knowledge in these:
- Union−Find, Stacks and Queues, Elementary Sorts, Mergesort, Priority Queues, Elementary Symbol Tables, Geometric Applications of BSTs, Hash Tables, Analysis of Algorithms, Balanced Search Trees, Quicksort, Symbol Table Applications
- The Algorithm programme is divided into 2 sections. After the completion of the first part, candidates will be ready for learning the next part.
- In this part I, candidates will be learning elementary algorithms for data structures, sorting, and searching. So that critical knowledge about algorithms and data structures will be acquired by every candidate.
- Candidates will gain skills like algorithms, data structures and Java programming.
Who it is for
The Algorithms, Part I programme is made for anyone who uses a computer to solve problems. For this purpose, there is a need for strong algorithms. So this programme is suitable for candidates in any field.
Application Details
Applicants of the Algorithms, Part I programme have to follow the steps explained below.
Step 1: Visit the course page
Step 2: Click on the “Enroll for Free” button
Step 3: A new page will open. If you already have an account in Coursera, please log in with credentials. Otherwise, sign up with your Google/Facebook/Apple account.
Step 4: You will be redirected to the home page again. Now an automated window will open, click on continue.
You will be allowed to access all the contents for free.
The Syllabus
Video
Course Introduction
Readings
- Welcome to Algorithms Part 1
Lecture Slides
Video
- Dynamic Connectivity
- Quick Find
- Quick Union
- Quick-Union Improvements
- Union−Find Applications
Module 2: Union-Find
- Overview
- Lecture Slides
quiz
- Interview Questions: Union–Find (ungraded)
Videos
- Analysis of Algorithms Introduction
- Observations
- Mathematical Models
- Order-of-Growth Classifications
- Theory of Algorithms
- Memory
reading
- Lecture Slides
quiz
- Interview Questions: Analysis of Algorithms (ungraded)
videos
- Stacks
- Resizing Arrays
- Queues
- Generics
- Iterators
- Stack and Queue Applications (optional)
Readings
- Overview
- Lecture Slides
Quiz
- Interview Questions: Stacks and Queues (ungraded)
Videos
- Sorting Introduction
- Selection Sort
- Insertion Sort
- Shellsort
- Shuffling
- Convex Hull
Reading
- Lecture Slides
Quiz
- Interview Questions: Elementary Sorts (ungraded)
Videos
- Mergesort
- Bottom-up Mergesort
- Sorting Complexity
- Comparators
- Stability
Reading
- Overview
- Lecture Slides
Quiz
- Interview Questions: Mergesort (ungraded)
Videos
- Quicksort
- Selection
- Duplicate Keys
- System Sorts
Reading
- Lecture Slides
Quiz
- Interview Questions: Quicksort (ungraded)
Videos
- APIs and Elementary Implementations
- Binary Heaps
- Heapsort
- Event-Driven Simulation (optional)
Reading
- Overview
- Lecture Slides
Quiz
- Interview Questions: Priority Queues (ungraded)
Videos
- Symbol Table API
- Elementary Implementations
- Ordered Operations
- Binary Search Trees
- Ordered Operations in BSTs
- Deletion in BSTs
Reading
- Lecture Slides
Quiz
- Interview Questions: Elementary Symbol Tables (ungraded)
Videos
- 2−3 Search Trees
- Red-Black BSTs
- B-Trees (optional)
Readings
- Overview
- Lecture Slides
Quiz
- Interview Questions: Balanced Search Trees (ungraded)
Videos
- 1d Range Search
- Line Segment Intersection
- Kd-Trees
- Interval Search Trees
- Rectangle Intersection
Readings
- Lecture Slides
Videos
- Hash Tables
- Separate Chaining
- Linear Probing
- Hash Table Context
Readings
- Overview
- Lecture Slide
Quiz
- Interview Questions: Hash Tables (ungraded)
Videos
- Symbol Table Applications: Sets (optional)
- Symbol Table Applications: Dictionary Clients (optional)
- Symbol Table Applications: Indexing Clients (optional)
- Symbol Table Applications: Sparse Vectors (optional)
Readings
- Lecture Slides
Evaluation process
There is no certification after the course completion. However, there will be a final exam included with the assessments.
Instructors
Princeton University, Princeton Frequently Asked Questions (FAQ's)
There is no fee for this programme. All of this programme's features are available for free.
As per Princeton University’s policy, certificates are not granted with this programme.
First candidates have to enrol. After that, all lectures, videos, assignments, etc. will be available for them. Candidates can start learning according to their schedule afterwards.
Weekly programming tasks, weekly exercises, questions from weekly interviews, and a final test are the assessments in this programme.
The Algorithms, Part I programme is suitable for anyone using a computer to solve large problems. There is a need that candidates should have a computer science background.25% of the students who take this programme at Princeton, include individuals with a major in engineering, biology, physics, chemistry, economics, and many other areas, not just computer science.
The Algorithms, Part I programme focuses on structures of elementary data, sorting, and searching. Topics include binary search, union-find, queues, stacks, bags, sort of option, type of insertion, shell sort, Graham check, mergesort, heapsort, 3-way quicksort, binary heaps, binary search trees, red-black trees, quicksort, hash tables, and KD-trees for separate-chaining and linear-probing.
The university’s central thesis is that by implementing and evaluating them, algorithms are better understood. Essentially, their use of Java is expository, and they shy away from exotic language functionality, so they expect candidates will be able to adapt the code to their preferred language. Even though they need candidates to submit the programming assignments in Java, however.