Trees and Graphs: Basics
Develop your knowledge on the fundamental algorithms associated with tree data structures and graphs with the ‘Trees and Graphs: Basics’ course.
Expert
Online
3 Weeks
1,699 INR Quick Facts
| Medium Of Instructions | Mode Of Learning | Mode Of Delivery |
|---|---|---|
| English | Self Study | Video and Text Based |
Course Overview
The Trees and Graphs: Basics online course is a study of the algorithms and data structures associated with trees and graphs such as tree data structures, binary search trees, self-balancing trees, graph data structures with some fundamental traversal algorithms on graphs. The online program is provided by the online educational platform Coursera and the course curriculum is offered by the University of Colorado Boulder. The course consists of 10 hours of course content that is scheduled for three weeks. The educator for this online training is associate professor Sriram Sankaranarayanan from the University of Colorado Boulder.
The Trees and Graphs: Basics is part of the ‘Data Science Foundations: Data Structures and Algorithms Specialization’ and the Master of Science in Data Science(MS-DS) degree hence this online course can be taken for the MS-DS degree. This advanced-level program enables the students to utilize flexible deadlines for convenience to complete the course and a shareable course certificate after course completion.
The Highlights
- Online course
- Three weeks program
- Ten hours to complete
- Advanced-level training
- English subtitles
- Shareable course certificate
Programme Offerings
- Course Modules
- videos
- Lectures
- Readings
- Practice Exercises
- quizzes
- Graded Programming
- assignments
- peer feedback
- Self-paced learning
- Shareable course certificate.
Courses and Certificate Fees
| Certificate Availability | Certificate Providing Authority |
|---|---|
| yes | Coursera |
Trees and Graphs: Basics fee structure :
Fees components | Amount |
One Month | Rs. 1,699 |
Three Months | Rs. 3,499 |
Six Months | Rs. 5,199 |
Eligibility Criteria
Certificate qualifying details
The students of this course will receive the ‘Trees and Graphs: Basics’ course certificate that is shareable after completion of the online program and paying the course fee.
What you will learn
- The Trees and Graphs: Basics syllabus is structured for the students to gain knowledge about the fundamental tree data structures and know about the algorithmic functions linked to them.
- The course enabled the students to demonstrate the sternly related elements in the graphs.
- The students will be able to implement traversals and build graphs within a binary search tree structure.
Who it is for
The Trees and Graphs: Basics certification program is for candidates who are interested in learning about algorithms, programming applications, and data structures associated with trees and graphs.
Admission Details
The course on ‘Trees and Graphs: Basics’ by Coursera can be applied for by registering online through the official website.
Step 1: Find the course page using the link below
https://www.coursera.org/learn/trees-graphs-basics
Step 2: Click on the ‘Enroll For Free’
Step 3: Choose between ‘Audit course’ or ‘Start a Free Trial’ version
Step 4: Enter the details and make the payment
Step 5: Start the course
Application Details
The applicants of this course are required to enter their name and email address to create a Coursera account to join the course, or also can join using their Google or Facebook ID.
The Syllabus
Videos
- Binary Search Trees -- Introduction and Properties
- Binary Search Trees -- Insertion and Deletion
- Red-Black Trees Basics
- Red-Black Trees -- Rotations/Algorithms for Insertion (and Deletion)
- Skip Lists
Readings
- Earn Academic Credit for your Work!
- Course Support
- Important Prerequisites
- Logistics: Textbook and Readings
- Important Specialization Information
- Overview of Module 1
- Reading CLRS Chapter 12
- CLRS Chapter 12.1-12.3
- CLRS Chapter 13 - 13.1
- CLRS Chapter 13.2 - 13.3
- Skip
Quizzes
- Basics of Binary Search Trees
- Binary Search Tree: Insert and Delete
- Red-Black Tree Basics
- Tree Rotations
- Skip Lists
Programming Assignment
- Binary Search Trees
Discussion Prompt
- Introduce Yourself!
Videos
- Graphs and Their Representations
- Graph Traversals and Breadth First Traversal
- Depth First Search
- Topological Sorting and Applications
- Strongly Connected Components - Definitions
- Strongly Connected Components - Properties
- Strongly Connected Components - Algorithm
Readings
- Overview of Module 2
- CLRS Chapter 22 (Section 22.1)
- CLRS Chapter 22 (Section 22.2)
- CLRS Chapter 22 (Section 22.3)
- CLRS Chapter 22 (Section 22.4
- CLRS Chapter 22 (Section 22.5)
Quizzes
- Graph Representations
- Combined Quiz on Graph Traversals
- Topological Sort Graphs
- Strongly Connected Components
Programming Assignment
- Graphs
Videos
- Amortized Analysis of Data Structures
- Amortized Analysis: Potential Functions
- Spanning Trees and Minimal Spanning Trees with Applications
- Kruskal’s Algorithm for Finding Minimal Spanning Trees
- Union-Find Data Structures and Rank Compression
Readings
- Overview of Module 3
- CLRS Chapter 17
- CLRS Chapter 23 (Section 23.1)
- CLRS Chapter 23 (Section 23.2)
- CLRS Chapter 21
Quizzes
- Amortized Analysis
- Minimum Spanning Tree
- Kruskal's Algorithm
- Disjoint Set Forest
Programming Assignment
- Spanning Trees and Union-Find Data Structure
Videos
- Shortest Path Problems and Their Properties
- Bellman-Ford Algorithm for Single Source Shortest Paths
- Dijkstra’s Algorithm for Single Source Shortest Paths with Nonnegative Edge Weights
- Proof of Dijkstra's Algorithm
- Shortest Path on DAGs
- All Pairs Shortest Path Problems and Floyd-Warshall’s Algorithm
Readings
- Overview of Module 4
- CLRS Chapter 24 (up to section 24.1)
- CLRS Chapter 24 (Section 24.1)
- CLRS Chapter 24 (Section 24.3 and 24.5)
- CLRS Chapter 24 (Section 24.2)
- CLRS Chapter 25 (Sections 25.1 and 25.2)
Quizzes
- Shortest Path Problems Properties
- Shortest Path - Bellman Ford Algorithm
- Dijkstra's Algorithm
Programming Assignment
- Shortest Path Algorithms
Instructors
CU Boulder Frequently Asked Questions (FAQ's)
The course is offered by the University of Colorado Boulder.
The course will take ten hours to complete.
There are no prerequisites to join the program.
Yes, there is financial aid available for the candidates of this program.
Yes, you can earn a shareable course certificate after completing the course.