About this course

Algorithms power the biggest web companies and the most promising startups. Interviews at tech companies start with questions that probe for good algorithm thinking.
In this computer science course, you will learn how to think about algorithms and create them using sorting techniques such as quick sort and merge sort, and searching algorithms, median finding, and order statistics.
The course progresses with Numerical, String, and Geometric algorithms like Polynomial Multiplication, Matrix Operations, GCD, Pattern Matching, Subsequences, Sweep, and Convex Hull. It concludes with graph algorithms like shortest path and spanning tree.
Topics covered:
Sorting and Searching
Numerical Algorithms
String Algorithms
Geometric Algorithms
Graph Algorithms
This course is part of the Fundamentals of Computer Science XSeries Program:
Programming Basics
Object-Oriented Programming
Foundations of Data Structures
Implementation of Data Structures

At a Glance:
Institution: IITBombayX
Subject: Computer Science
Level: Intermediate
Prerequisites:
Concepts of data structures as covered in ‘Foundations of Data Structures’ and ‘Implementation of Data Structures’ courses.
Language: English
Video Transcript: English
Associated programs:
XSeries in Fundamentals of Computer Science
Associated skills:Operations, Search Algorithms, Shortest Path Problem, Graph Algorithms, Sorting, Computer Science, Algorithms, Object-Oriented Programming (OOP), Data Structures, Pattern Matching