About this Course
최근 조회 17,913

100% 온라인

지금 바로 시작해 나만의 일정에 따라 학습을 진행하세요.

유동적 마감일

일정에 따라 마감일을 재설정합니다.

중급 단계

완료하는 데 약 28시간 필요

권장: 10 weeks of study, 2-5 hours/week...

영어

자막: 영어

100% 온라인

지금 바로 시작해 나만의 일정에 따라 학습을 진행하세요.

유동적 마감일

일정에 따라 마감일을 재설정합니다.

중급 단계

완료하는 데 약 28시간 필요

권장: 10 weeks of study, 2-5 hours/week...

영어

자막: 영어

강의 계획 - 이 강좌에서 배울 내용

1
완료하는 데 10분 필요

INFORMATION ABOUT LECTURES 1–10

This lesson provides information about the course Computer Science: Programming with a Purpose, which is the precursor to Computer Science: Algorithms, Theory, and Machines.

...
1 reading
1개의 읽기 자료
Information about Lectures 1–1010m
완료하는 데 2시간 필요

SORTING AND SEARCHING

We introduce and study classic algorithms for two fundamental problems, in the context of realistic applications. Our message is that efficient algorithms (binary search and mergesort, in this case) are a key ingredient in addressing computational problems with scalable solutions that can handle huge instances, and that the scientific method is essential in evaluating the effectiveness of such solutions.

...
5 videos (Total 71 min), 3 readings, 1 quiz
5개의 동영상
Binary search10m
Insertion sort11m
Mergesort12m
Longest repeated substring19m
3개의 읽기 자료
Getting Started10m
Supplements for Lecture 1110m
Optional Enrichment on Sorting and Searching10m
1개 연습문제
Sorting and Searching8m
2
완료하는 데 2시간 필요

STACKS AND QUEUES

Our introduction to data structures is a careful look at the fundamental stack and queue abstractions, including performance specifications. Then we introduce the concept of linked structures and focus on their utility in developing simple, safe, clear, and efficient implementations of stacks and queues.

...
5 videos (Total 69 min), 2 readings, 1 quiz
5개의 동영상
APIs13m
Clients22m
Strawman implementations9m
Linked lists15m
Implementations8m
2개의 읽기 자료
Supplements for Lecture 1210m
Optional Enrichment on Stacks and Queues10m
1개 연습문제
Stacks and Queues8m
3
완료하는 데 1시간 필요

SYMBOL TABLES

The symbol table abstraction is one of the most important and useful programmer's tools, s we illustrate with several examples in this lecture. Extending the scientific approach of the previous two lectures, we introduce and study binary search trees, a classic data structure that supports efficient implementations of this abstraction.

...
5 videos (Total 57 min), 2 readings, 1 quiz
5개의 동영상
A design challenge6m
Binary search trees13m
Implementation4m
Analysis8m
2개의 읽기 자료
Supplements for Lecture 1310m
Optional Enrichment on Symbol Tables10m
1개 연습문제
Symbol Tables8m
4
완료하는 데 2시간 필요

INTRODUCTION TO THE THEORY OF COMPUTING

The theory of computing helps us address fundamental questions about the nature of computation while at the same time helping us better understand the ways in which we interact with the computer. In this lecture, we introduce formal languages and abstract machines, focusing on simple models that are actually widely useful in practical applications.

...
5 videos (Total 63 min), 2 readings, 1 quiz
5개의 동영상
Regular Expressions20m
DFAs14m
Applications12m
Limitations9m
2개의 읽기 자료
Supplements for Lecture 1410m
Optional Enrichment on Theory of Computing10m
1개 연습문제
Theory of Computing8m
4.8
19개의 리뷰Chevron Right

Computer Science: Algorithms, Theory, and Machines의 최상위 리뷰

대학: DLDec 24th 2018

Loved this course! Such a great introduction to Computer Science. The course is really well broken down and the videos are very well done!

대학: ANDec 5th 2018

Excellent clarity and pace with real-life problems and challenges to really understand the concepts and their motivation.

강사

Avatar

Robert Sedgewick

William O. Baker *39 Professor of Computer Science
Computer Science
Avatar

Kevin Wayne

Phillip Y. Goldman '86 Senior Lecturer
Computer Science

프린스턴 대학교 정보

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

자주 묻는 질문

  • 강좌에 등록하면 바로 모든 비디오, 테스트 및 프로그래밍 과제(해당하는 경우)에 접근할 수 있습니다. 상호 첨삭 과제는 이 세션이 시작된 경우에만 제출하고 검토할 수 있습니다. 강좌를 구매하지 않고 살펴보기만 하면 특정 과제에 접근하지 못할 수 있습니다.

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

궁금한 점이 더 있으신가요? 학습자 도움말 센터를 방문해 보세요.