ofrecido por

Universidad de Princeton

Acerca de este Curso

5.0

736 calificaciones

ā¢

118 revisiones

This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers elementary data structures, sorting, and searching algorithms. Part II focuses on graph- and string-processing algorithms.
All the features of this course are available for free. It does not offer a certificate upon completion.

Comienza de inmediato y aprende a tu propio ritmo.

Restablece las fechas lĆmite en funciĆ³n de tus horarios.

Sugerido: 6 weeks of study, 6ā10 hours per week....

SubtĆtulos: InglĆ©s (English), Coreano

GraphsData StructureAlgorithmsData Compression

Comienza de inmediato y aprende a tu propio ritmo.

Restablece las fechas lĆmite en funciĆ³n de tus horarios.

Sugerido: 6 weeks of study, 6ā10 hours per week....

SubtĆtulos: InglĆ©s (English), Coreano

Semana

1Welcome to Algorithms, Part II....

1 video (Total 9 minutos), 2 readings

Welcome to Algorithms, Part II1m

Lecture Slides

We define an undirected graph API and consider the adjacency-matrix and adjacency-lists representations. We introduce two classic algorithms for searching a graphādepth-first search and breadth-first search. We also consider the problem of computing connected components and conclude with related problems and applications....

6 videos (Total 98 minutos), 2 readings, 1 quiz

Graph API14m

Depth-First Search26m

Breadth-First Search13m

Connected Components18m

Graph Challenges14m

Overview1m

Lecture Slides

Interview Questions: Undirected Graphs (ungraded)6m

In this lecture we study directed graphs. We begin with depth-first search and breadth-first search in digraphs and describe applications ranging from garbage collection to web crawling. Next, we introduce a depth-first search based algorithm for computing the topological order of an acyclic digraph. Finally, we implement the KosarajuāSharir algorithm for computing the strong components of a digraph....

5 videos (Total 68 minutos), 1 reading, 2 quizzes

Digraph API4m

Digraph Search20m

Topological Sort 12m

Strong Components20m

Lecture Slides

Interview Questions: Directed Graphs (ungraded)6m

Semana

2In this lecture we study the minimum spanning tree problem. We begin by considering a generic greedy algorithm for the problem. Next, we consider and implement two classic algorithm for the problemāKruskal's algorithm and Prim's algorithm. We conclude with some applications and open problems....

6 videos (Total 85 minutos), 2 readings, 1 quiz

Greedy Algorithm12m

Edge-Weighted Graph API11m

Kruskal's Algorithm12m

Prim's Algorithm33m

MST Context10m

Overview1m

Lecture Slides

Interview Questions: Minimum Spanning Trees (ungraded)6m

In this lecture we study shortest-paths problems. We begin by analyzing some basic properties of shortest paths and a generic algorithm for the problem. We introduce and analyze Dijkstra's algorithm for shortest-paths problems with nonnegative weights. Next, we consider an even faster algorithm for DAGs, which works even if the weights are negative. We conclude with the BellmanāFordāMoore algorithm for edge-weighted digraphs with no negative cycles. We also consider applications ranging from content-aware fill to arbitrage....

5 videos (Total 85 minutos), 1 reading, 2 quizzes

Shortest Path Properties14m

Dijkstra's Algorithm18m

Edge-Weighted DAGs19m

Negative Weights21m

Lecture Slides

Interview Questions: Shortest Paths (ungraded)6m

Semana

3In this lecture we introduce the maximum flow and minimum cut problems. We begin with the FordāFulkerson algorithm. To analyze its correctness, we establish the maxflowāmincut theorem. Next, we consider an efficient implementation of the FordāFulkerson algorithm, using the shortest augmenting path rule. Finally, we consider applications, including bipartite matching and baseball elimination....

6 videos (Total 72 minutos), 2 readings, 2 quizzes

FordāFulkerson Algorithm6m

MaxflowāMincut Theorem9m

Running Time Analysis8m

Java Implementation14m

Maxflow Applications22m

Overview

Lecture Slides

Interview Questions: Maximum Flow (ungraded)6m

In this lecture we consider specialized sorting algorithms for strings and related objects. We begin with a subroutine to sort integers in a small range. We then consider two classic radix sorting algorithmsāLSD and MSD radix sorts. Next, we consider an especially efficient variant, which is a hybrid of MSD radix sort and quicksort known as 3-way radix quicksort. We conclude with suffix sorting and related applications....

6 videos (Total 85 minutos), 1 reading, 1 quiz

Key-Indexed Counting12m

LSD Radix Sort15m

MSD Radix Sort13m

3-way Radix Quicksort7m

Suffix Arrays19m

Lecture Slides

Interview Questions: Radix Sorts (ungraded)6m

Semana

4In this lecture we consider specialized algorithms for symbol tables with string keys. Our goal is a data structure that is as fast as hashing and even more flexible than binary search trees. We begin with multiway tries; next we consider ternary search tries. Finally, we consider character-based operations, including prefix match and longest prefix, and related applications....

3 videos (Total 75 minutos), 2 readings, 1 quiz

Overview10m

Lecture Slides

Interview Questions: Tries (ungraded)6m

In this lecture we consider algorithms for searching for a substring in a piece of text. We begin with a brute-force algorithm, whose running time is quadratic in the worst case. Next, we consider the ingenious KnuthāMorrisāPratt algorithm whose running time is guaranteed to be linear in the worst case. Then, we introduce the BoyerāMoore algorithm, whose running time is sublinear on typical inputs. Finally, we consider the RabināKarp fingerprint algorithm, which uses hashing in a clever way to solve the substring search and related problems....

5 videos (Total 75 minutos), 1 reading, 2 quizzes

Brute-Force Substring Search10m

KnuthāMorrisāPratt33m

BoyerāMoore8m

RabināKarp16m

Lecture Slides10m

Interview Questions: Substring Search (ungraded)6m

Semana

5A regular expression is a method for specifying a set of strings. Our topic for this lecture is the famous grep algorithm that determines whether a given text contains any substring from the set. We examine an efficient implementation that makes use of our digraph reachability implementation from Week 1....

5 videos (Total 83 minutos), 2 readings, 1 quiz

REs and NFAs13m

NFA Simulation18m

NFA Construction11m

Regular Expression Applications20m

Overview10m

Lecture Slides10m

Interview Questions: Regular Expressions (ungraded)6m

We study and implement several classic data compression schemes, including run-length coding, Huffman compression, and LZW compression. We develop efficient implementations from first principles using a Java library for manipulating binary data that we developed for this purpose, based on priority queue and symbol table implementations from earlier lectures....

4 videos (Total 80 minutos), 1 reading, 2 quizzes

Run-Length Coding5m

Huffman Compression24m

LZW Compression27m

Lecture Slides10m

Interview Questions: Data Compression (ungraded)6m

Semana

6Our lectures this week are centered on the idea of problem-solving models like maxflow and shortest path, where a new problem can be formulated as an instance of one of those problems, and then solved with a classic and efficient algorithm. To complete the course, we describe the classic unsolved problem from theoretical computer science that is centered on the concept of algorithm efficiency and guides us in the search for efficient solutions to difficult problems. ...

4 videos (Total 40 minutos), 2 readings, 1 quiz

Designing Algorithms8m

Establishing Lower Bounds9m

Classifying Problems12m

Overview10m

Lecture Slides10m

Interview Questions: Reductions (ungraded)6m

The quintessential problem-solving model is known as linear programming, and the simplex method for solving it is one of the most widely used algorithms. In this lecture, we given an overview of this central topic in operations research and describe its relationship to algorithms that we have considered....

4 videos (Total 61 minutos), 1 reading, 1 quiz

Simplex Algorithm11m

Simplex Implementations16m

Linear Programming Reductions11m

Lecture Slides10m

Interview Questions: Linear Programming (ungraded)6m

Is there a universal problem-solving model to which all problems that we would like to solve reduce and for which we know an efficient algorithm? You may be surprised to learn that we do no know the answer to this question. In this lecture we introduce the complexity classes P, NP, and NP-complete, pose the famous P = NP question, and consider implications in the context of algorithms that we have treated in this course....

6 videos (Total 85 minutos), 1 reading, 1 quiz

Search Problems10m

P vs. NP16m

Classifying Problems13m

NP-Completeness12m

Coping with Intractability 14m

Lecture Slides10m

Interview Questions: Intractability (ungraded)6m

comenzĆ³ una nueva carrera despuĆ©s de completar estos cursos

consiguiĆ³ un beneficio tangible en su carrera profesional gracias a este curso

consiguiĆ³ un aumento de sueldo o ascenso

por IOā¢Jan 21st 2018

Pretty challenging course, but very good. Having a book is a must (at least it was for me), video lectures complement book nicely, and some topics are explained better in the Algorithms, 4th ed. book.

por AKā¢Apr 17th 2019

Amazing course! Loved the theory and exercises! Just a note for others: Its part 1 had almost no dependency on book, but this part 2 has some dependency (e.g. chapter on Graph) on book as well.

Princeton University is a private research university located in Princeton, New Jersey, United States. It is one of the eight universities of the Ivy League, and one of the nine Colonial Colleges founded before the American Revolution....

ĀæCuĆ”ndo podrĆ© acceder a las lecciones y tareas?

Una vez que te inscribes para obtener un Certificado, tendrĆ”s acceso a todos los videos, cuestionarios y tareas de programaciĆ³n (si corresponde). Las tareas calificadas por compaĆ±eros solo pueden enviarse y revisarse una vez que haya comenzado tu sesiĆ³n. Si eliges explorar el curso sin comprarlo, es posible que no puedas acceder a determinadas tareas.

Do I need to pay for this course?

No. All features of this course are available for free.

Can I earn a certificate in this course?

No. As per Princeton University policy, no certificates, credentials, or reports are awarded in connection with this course.

I have no familiarity with Java programming. Can I still take this course?

Our central thesis is that algorithms are best understood by implementing and testing them. Our use of Java is essentially expository, and we shy away from exotic language features, so we expect you would be able to adapt our code to your favorite language. However, we require that you submit the programming assignments in Java.

Which algorithms and data structures are covered in this course?

Part II focuses on graph and string-processing algorithms. Topics include depth-first search, breadth-first search, topological sort, KosarajuāSharir, Kruskal, Prim, Dijkistra, BellmanāFord, FordāFulkerson, LSD radix sort, MSD radix sort, 3-way radix quicksort, multiway tries, ternary search tries, KnuthāMorrisāPratt, BoyerāMoore, RabināKarp, regular expression matching, run-length coding, Huffman coding, LZW compression, and the BurrowsāWheeler transform.

Part I focuses on elementary data structures, sorting, and searching. Topics include union-find, binary search, stacks, queues, bags, insertion sort, selection sort, shellsort, quicksort, 3-way quicksort, mergesort, heapsort, binary heaps, binary search trees, redāblack trees, separate-chaining and linear-probing hash tables, Graham scan, and kd-trees.

What kinds of assessments are available in this course?

Weekly programming assignments and interview questions.

The programming assignments involve either implementing algorithms and data structures (graph algorithms, tries, and the BurrowsāWheeler transform) or applying algorithms and data structures to an interesting domain (computer graphics, computational linguistics, and data compression). The assignments are evaluated using a sophisticated autograder that provides detailed feedback about style, correctness, and efficiency.

The interview questions are similar to those that you might find at a technical job interview. They are optional and not graded.

I am/was not a Computer Science major. Is this course for me?

This course is for anyone using a computer to address large problems (and therefore needing efficient algorithms). At Princeton, over 25% of all students take the course, including people majoring in engineering, biology, physics, chemistry, economics, and many other fields, not just computer science.

How does this course differ from Design and Analysis of Algorithms?

The two courses are complementary. This one is essentially a programming course that concentrates on developing code; that one is essentially a math course that concentrates on understanding proofs. This course is about learning algorithms in the context of implementing and testing them in practical applications; that one is about learning algorithms in the context of developing mathematical models that help explain why they are efficient. In typical computer science curriculums, a course like this one is taken by first- and second-year students and a course like that one is taken by juniors and seniors.

ĀæTienes mĆ”s preguntas? Visita el Centro de Ayuda al Alumno.

Coursera brinda acceso universal a la mejor educaciĆ³n del mundo, al asociarse con las mejores universidades y organizaciones, para ofrecer cursos en lĆnea.