Data structure course online

Hello sir I want to know about the online course in Data Structure of Stanford University so please provide me suitable information about this course.

[Shaleen]

In Data structure course you will learn several fundamental principles of algorithm design. You'll learn the divide-and-conquer design paradigm, with applications to fast sorting, searching, and multiplication.

About the course

You'll learn several blazingly fast primitives for computing on graphs, such as how to compute connectivity information and shortest paths.

You will learn the answers to questions such as:

How do data structures like heaps, hash tables, bloom filters, and balanced search trees actually work, anyway?

How come QuickSort runs so fast?

What can graph algorithms tell us about the structure of the Web and social networks?

Did my 3rd-grade teacher explain only a suboptimal algorithm for multiplying two numbers?

Course Syllabus

Week 1: Introduction, Asymptotic analysis including big-oh notation. Divide-and-conquer algorithms for sorting, counting inversions, matrix multiplication, and closest pair

Week 2: Running time analysis of divide-and-conquer algorithms. The master method, Introduction to randomized algorithms, with a probability review

Week 3: More on randomized algorithms and probability. Computing the median in linear time, a randomized algorithm for the minimum graph cut problem.

Week 4: Graph primitives. Depth- and breadth-first search. Connected components in undirected graphs, Topological sort in directed acyclic graphs, strongly connected components in directed graphs

Week 5: Dijkstra's shortest-path algorithm. Introduction to data structures, Heaps and applications

Week 6: Further data structures. Hash tables and applications. Balanced binary search trees

Recommended Background

How to program in at least one programming language (like C, Java, or Python); and familiarity with proofs, including proofs by induction and by contradiction

At Stanford, a version of this course is taken by sophomore, junior, and senior-level computer science majors.

Suggested Readings

No specific textbook is required for the course.

Much of the course material is covered by the well-known textbooks on algorithms, and the student is encouraged to consult their favorite for additional information.

Course Format

The class will consist of lecture videos, generally between 10 and 15 minutes in length.

These usually integrated quiz questions.

There will also be standalone homeworks and programming assignments that are not part of video lectures, and a final exam.