About this Course
최근 조회 159,349

다음 전문 분야의 6개 강좌 중 2번째 강좌:

100% 온라인

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

유동적 마감일

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

중급 단계

Basic knowledge of at least one programming language: C++, Java, Python, C, C#, Javascript, Haskell, Kotlin, Ruby, Rust, Scala.

완료하는 데 약 27시간 필요

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

영어

자막: 영어

귀하가 습득할 기술

Binary Search TreePriority QueueHash TableStack (Abstract Data Type)List

다음 전문 분야의 6개 강좌 중 2번째 강좌:

100% 온라인

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

유동적 마감일

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

중급 단계

Basic knowledge of at least one programming language: C++, Java, Python, C, C#, Javascript, Haskell, Kotlin, Ruby, Rust, Scala.

완료하는 데 약 27시간 필요

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

영어

자막: 영어

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

1
완료하는 데 5시간 필요

Basic Data Structures

7개 동영상 (총 60분), 7 readings, 2 quizzes
7개의 동영상
Singly-Linked Lists9m
Doubly-Linked Lists4m
Stacks10m
Queues7m
Trees11m
Tree Traversal10m
7개의 읽기 자료
Welcome10m
Slides and External References10m
Slides and External References10m
Slides and External References10m
Available Programming Languages10m
FAQ on Programming Assignments10m
Acknowledgements10m
1개 연습문제
Basic Data Structures10m
2
완료하는 데 1시간 필요

Dynamic Arrays and Amortized Analysis

5개 동영상 (총 31분), 1 reading, 1 quiz
5개의 동영상
Amortized Analysis: Aggregate Method5m
Amortized Analysis: Banker's Method6m
Amortized Analysis: Physicist's Method7m
Amortized Analysis: Summary2m
1개의 읽기 자료
Slides and External References10m
1개 연습문제
Dynamic Arrays and Amortized Analysis8m
3
완료하는 데 6시간 필요

Priority Queues and Disjoint Sets

15개 동영상 (총 129분), 6 readings, 4 quizzes
15개의 동영상
Naive Implementations of Priority Queues5m
Binary Trees1m
Basic Operations12m
Complete Binary Trees9m
Pseudocode8m
Heap Sort10m
Building a Heap10m
Final Remarks4m
Overview7m
Naive Implementations10m
Trees for Disjoint Sets7m
Union by Rank9m
Path Compression6m
Analysis (Optional)18m
6개의 읽기 자료
Slides10m
Tree Height Remark10m
Slides and External References10m
Slides and External References10m
Slides and External References10m
Slides and External References10m
3개 연습문제
Priority Queues: Quiz12m
Quiz: Disjoint Sets8m
Priority Queues and Disjoint Sets6m
4
완료하는 데 6시간 필요

Hash Tables

22개 동영상 (총 170분), 4 readings, 3 quizzes
22개의 동영상
Analysing Service Access Logs7m
Direct Addressing7m
List-based Mapping8m
Hash Functions3m
Chaining Scheme6m
Chaining Implementation and Analysis5m
Hash Tables6m
Phone Book Problem4m
Phone Book Problem - Continued6m
Universal Family9m
Hashing Integers9m
Proof: Upper Bound for Chain Length (Optional)8m
Proof: Universal Family for Integers (Optional)11m
Hashing Strings9m
Hashing Strings - Cardinality Fix7m
Search Pattern in Text7m
Rabin-Karp's Algorithm9m
Optimization: Precomputation9m
Optimization: Implementation and Analysis5m
Instant Uploads and Storage Optimization in Dropbox10m
Distributed Hash Tables12m
4개의 읽기 자료
Slides and External References10m
Slides and External References10m
Slides and External References10m
Slides and External References10m
2개 연습문제
Hash Tables and Hash Functions8m
Hashing6m
4.7
376개의 리뷰Chevron Right

37%

이 강좌를 수료한 후 새로운 경력 시작하기

39%

이 강좌를 통해 확실한 경력상 이점 얻기

12%

급여 인상 또는 승진하기

데이터 구조의 최상위 리뷰

대학: TTApr 6th 2018

Data Structures was really interesting over all, also assignments are quite challenging. It's important to consult the external references & discussion forums if you want to get the best of it.

대학: SGOct 28th 2019

I found the course a little tough, but it's worth the effort. It takes more time than mentioned. Apart from that, it is actually good and covers most of the topics required for interviews.

강사

Avatar

Alexander S. Kulikov

Visiting Professor
Department of Computer Science and Engineering
Avatar

Michael Levin

Lecturer
Computer Science
Avatar

Daniel M Kane

Assistant Professor
Department of Computer Science and Engineering / Department of Mathematics
Avatar

Neil Rhodes

Adjunct Faculty
Computer Science and Engineering

캘리포니아 샌디에고 대학교 정보

UC San Diego is an academic powerhouse and economic engine, recognized as one of the top 10 public universities by U.S. News and World Report. Innovation is central to who we are and what we do. Here, students learn that knowledge isn't just acquired in the classroom—life is their laboratory....

국립 연구 고등 경제 대학 정보

National Research University - Higher School of Economics (HSE) is one of the top research universities in Russia. Established in 1992 to promote new research and teaching in economics and related disciplines, it now offers programs at all levels of university education across an extraordinary range of fields of study including business, sociology, cultural studies, philosophy, political science, international relations, law, Asian studies, media and communicamathematics, engineering, and more. Learn more on www.hse.ru...

데이터 구조 및 알고리즘 전문 분야 정보

This specialization is a mix of theory and practice: you will learn algorithmic techniques for solving various computational problems and will implement about 100 algorithmic coding problems in a programming language of your choice. No other online course in Algorithms even comes close to offering you a wealth of programming challenges that you may face at your next job interview. To prepare you, we invested over 3000 hours into designing our challenges as an alternative to multiple choice questions that you usually find in MOOCs. Sorry, we do not believe in multiple choice questions when it comes to learning algorithms...or anything else in computer science! For each algorithm you develop and implement, we designed multiple tests to check its correctness and running time — you will have to debug your programs without even knowing what these tests are! It may sound difficult, but we believe it is the only way to truly understand how the algorithms work and to master the art of programming. The specialization contains two real-world projects: Big Networks and Genome Assembly. You will analyze both road networks and social networks and will learn how to compute the shortest route between New York and San Francisco (1000 times faster than the standard shortest path algorithms!) Afterwards, you will learn how to assemble genomes from millions of short fragments of DNA and how assembly algorithms fuel recent developments in personalized medicine....
데이터 구조 및 알고리즘

자주 묻는 질문

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

  • 강좌를 등록하면 전문 분야의 모든 강좌에 접근할 수 있고 강좌를 완료하면 수료증을 취득할 수 있습니다. 전자 수료증이 성취도 페이지에 추가되며 해당 페이지에서 수료증을 인쇄하거나 LinkedIn 프로필에 수료증을 추가할 수 있습니다. 강좌 내용만 읽고 살펴보려면 해당 강좌를 무료로 청강할 수 있습니다.

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