A Quick Introduction to Algorithms

A Quick Introduction to Algorithms, available at Free, has an average rating of 4, with 16 lectures, based on 36 reviews, and has 2342 subscribers.

Free Enroll Now

You will learn about Basics of data structures and algorithms Different sorting algorithms (Selection Sort, Bubble Sort, Insertion Sort) Binary search trees and will be able to perform different operations (i.e., search, insertion, deletion) Graphs (Undirected, Directed, Adjacency Matrix) Minimum Spanning Trees (Prims, Kruskals) Ford Fulkersons Algorithm Bipartite Graphs Minimum Vertex Cover Problem Two-approximation to minimum vertex cover This course is ideal for individuals who are Beginners or Individuals who need a refreshers to Algorithms or Candidates preparing for interviews in time crunch It is particularly useful for Beginners or Individuals who need a refreshers to Algorithms or Candidates preparing for interviews in time crunch.

Enroll now: A Quick Introduction to Algorithms

Summary

Title: A Quick Introduction to Algorithms

Price: Free

Average Rating: 4

Number of Lectures: 16

Number of Published Lectures: 16

Number of Curriculum Items: 16

Number of Published Curriculum Objects: 16

Original Price: Free

Quality Status: approved

Status: Live

What You Will Learn

Basics of data structures and algorithms

Different sorting algorithms (Selection Sort, Bubble Sort, Insertion Sort)

Binary search trees and will be able to perform different operations (i.e., search, insertion, deletion)

Graphs (Undirected, Directed, Adjacency Matrix)

Minimum Spanning Trees (Prims, Kruskals)

Ford Fulkersons Algorithm

Bipartite Graphs

Minimum Vertex Cover Problem

Two-approximation to minimum vertex cover

Who Should Attend

Beginners

Individuals who need a refreshers to Algorithms

Candidates preparing for interviews in time crunch

Target Audiences

Beginners

Individuals who need a refreshers to Algorithms

Candidates preparing for interviews in time crunch

Data Structures and Algorithms is one of the core topics in computer science. Being able to design and analyze algorithms is one of the most important skills required by computer science students and software professionals. All major software companies (e.g., Google, Meta, Microsoft) ask a variety of questions related to algorithms in their interviews.

This short course is designed to provide a quick overview of a variety of different algorithms. This course is ideal for individuals who seek a quick yet comprehensive refresher to data structures and algorithms (e.g., while preparing for an exam or job interviews). This course is also well-suited for individuals who are enthusiastic about computer science and want to obtain a high-level understanding of various algorithms.

Upon successful completion of this course, students will be able to understand, explain and apply key algorithmic concepts related to sorting algorithms (selection sort, bubble sort, and insertion sort). The course will also introduce Binary Search Trees and the various actions supported by them (i.e., insertion, deletion and search). Students will also be introduced to graph and graph algorithms. Specifically, we will cover minimum spanning tree algorithms such as Prim’s Algorithm and Kruskal’s Algorithm. The course also includes advanced topics such as bipartite graphs, Ford Fulkerson’s Algorithm and minimum vertex cover.

Course Curriculum

Chapter 1: Introduction

Lecture 1: Introduction to Algorithms

Chapter 2: Sorting Algorithms

Lecture 1: Selection Sort

Lecture 2: Bubble Sort

Lecture 3: Insertion Sort

Chapter 3: Binary Search Trees

Lecture 1: Binary Search Trees: Introduction

Lecture 2: Binary Search Trees: Insertion

Lecture 3: Binary Search Trees: Deletion

Lecture 4: Binary Search Trees: Search

Chapter 4: Graphs

Lecture 1: Introduction to Graphs

Lecture 2: Minimum Spanning Trees: An Introduction

Lecture 3: Prims Algorithm

Lecture 4: Kruskals Algorithm

Chapter 5: Advanced Graph Algorithms

Lecture 1: Bipartite Graphs and Maximum Matching

Lecture 2: Ford Fulkerson Maximum Flow Algorithm

Lecture 3: Minimum Vertex Cover

Lecture 4: Two Approximation Algorithm for Minimum Vertex Cover

Instructors

Anand Seetharam
Data Scientist, Researcher, Ex-professor, AI for good

Rating Distribution

1 stars: 0 votes

2 stars: 0 votes

3 stars: 5 votes

4 stars: 17 votes

5 stars: 14 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!