Algorithms, Part II

Kevin Wayne and Robert Sedgewick, Princeton University

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 II covers graph-processing algorithms, including minimum spanning tree and shortest paths algorithms, and string processing algorithms, including string sorts, tries, substring search, regular expressions, and data compression, and concludes with an overview placing the contents of the course in a larger context.

Recommended Background

You need basic familiarity with programming in Java and the algorithms and data structures from Algorithms, Part I. This course is primarily aimed at first- and second-year undergraduates interested in engineering or science, along with high school students and professionals with an interest (and some background) in programming.

Suggested Readings

Although the lectures are designed to be self-contained, students wanting to expand their knowledge beyond what we can cover in this 7-week class can find much more extensive coverage of these topics in our book Algorithms (4th Edition), published by Addison-Wesley Professional.

Course Format

There will be two lectures (75 minutes each) each week. The lectures are each broken into about 4-6 segments, separated by interactive quiz questions for you to to help you process and understand the material. In addition, there will be a problem set and a programming assignment each week and there will be a final exam.

FAQ

    • What algorithms and data structures are covered?

      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.

      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.

    • Are there any associated resources available on the web?

      Yes. Our free booksite contains synopses of the text, web exercises, Java implementations of all the algorithms covered (any many more) that are designed for you to be able to download and use with one click, test data, and many other resources.

      • 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.

      • I'd like to take Algorithms, Part II, but missed Part I. What should I do?
      • It depends on your background. If you have absolutely no familiarity with basic data types and classic sorting and searching algorithms, you probably need to wait for the next offering of Part I. If you have some familiarity with the basics, you may be able to get up to speed by studying our book and our booksite.

      • I am/was not a computer science major. Is this course for me?

        Yes. 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.

      • If I have no familiarity with Java programming, can I still take the 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 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. If you have some experience programming in another language, you might find it worthwhile to learn our programming model by studying our book An Introduction to Programming in Java: An Interdisciplinary Approach and associated free booksite.

      • If I have not programmed before, can I still take the course?

        Probably not.

      • Does Princeton University award credentials or reports regarding my work in this course?

        No certificates, statements of accomplishment, or other credentials will be awarded in connection with this course.

    Сессии:
    • 16 марта 2016, 6 недель
    • 30 октября 2015, 6 недель
    • 20 марта 2015, 6 недель
    • 31 октября 2014, 7 недель
    • 21 марта 2014, 7 недель
    • 1 ноября 2013, 7 недель
    • 25 марта 2013, 7 недель
    Характеристики онлайн курса:
    • Бесплатный:
    • Платный:
    • Сертификат:
    • MOOC:
    • Видеолекции:
    • Аудиолекции:
    • Email-курс:
    • Язык: Английский Gb

    Отзывы

    Пока никто не написал отзыв по этому курсу. Хотите быть первым?

    Зарегистрируйтесь, чтобы оставить отзыв

    Show?id=n3eliycplgk&bids=695438
    Входит в подборки курсов:
    6-046jf05 Algorithms
    Algorithms and data structures from the beginning to advanced analysis.
    Introcomplexitylogo Network Science
    Networks, graphs etc.
    Vyyjayfzd3pynkssdhnqwcrx4bk4ennc1-ren956ujr2e1pya9umefxe-z08yngaz4nptzjr4nqcte0whwul=s0#w=1724&h=1060 Алгоритмизация вычислений
    1 курс МИЭМ ВШЭ, 4 кредита
    NVIDIA
    Ещё курсы на эту тему:
    6-092iap10 Introduction to Programming in Java
    This course is an introduction to software engineering, using the Java&trade...
    Extensionflag Introduction to Computer Science Using Java I
    Intended for students with no previous programming background, this...
    6-451s05 Principles of Digital Communication II
    This course is the second of a two-term sequence with 6.450. The focus is on...
    Computing_b-02 Computing for Data Analysis
    This course is about learning the fundamental computing skills necessary for...
    Rprogramming R Programming
    Learn how to program in R and how to use R for effective data analysis. This...
    Ещё из рубрики «Технические науки»:
    Regular_1800ce45-0511-4bf2-b353-6b3bab9a9b60 Exploring Everyday Chemistry
    Explore the organic chemistry behind perfume, medicine, brewing and sport from...
    Regular_d22081d0-28bc-4122-b492-f3dcef8f6c27 Introduction to Psychology: The Psychology of Personality
    Explore the complex factors and influences that help shape our personality and...
    Regular_56cb2a32-9702-4b78-b8af-43bdf0a0a21a Beneath the Blue: The Importance of Marine Sediments
    Understand the importance of our planet's seafloor and get an introduction to...
    Regular_29f57fb2-9098-4f9b-91f4-9c3504a2ac33 Engineering the Future: Creating the Amazing
    Learn more about the fascinating world of engineering, and discover where an...
    Regular_a010978b-2f41-4422-a3d9-d1c8b34f5c13 Antimicrobial Stewardship for the Gulf, Middle East and North Africa
    Improve your knowledge of the spread of antimicrobial resistance in the Gulf...
    Ещё от Coursera:
    Success-from-the-start-2 First Year Teaching (Secondary Grades) - Success from the Start
    Success with your students starts on Day 1. Learn from NTC's 25 years developing...
    New-york-city-78181 Understanding 9/11: Why Did al Qai’da Attack America?
    This course will explore the forces that led to the 9/11 attacks and the policies...
    Small-icon.hover Aboriginal Worldviews and Education
    This course will explore indigenous ways of knowing and how this knowledge can...
    Ac-logo Analytic Combinatorics
    Analytic Combinatorics teaches a calculus that enables precise quantitative...
    Talk_bubble_fin2 Accountable Talk®: Conversation that Works
    Designed for teachers and learners in every setting - in school and out, in...

    © 2013-2019