이 강좌에 대하여

최근 조회 36,155
공유 가능한 수료증
완료 시 수료증 획득
100% 온라인
지금 바로 시작해 나만의 일정에 따라 학습을 진행하세요.
다음 특화 과정의 3개 강좌 중 3번째 강좌:
유동적 마감일
일정에 따라 마감일을 재설정합니다.
완료하는 데 약 21시간 필요
영어
자막: 영어
공유 가능한 수료증
완료 시 수료증 획득
100% 온라인
지금 바로 시작해 나만의 일정에 따라 학습을 진행하세요.
다음 특화 과정의 3개 강좌 중 3번째 강좌:
유동적 마감일
일정에 따라 마감일을 재설정합니다.
완료하는 데 약 21시간 필요
영어
자막: 영어

제공자:

일리노이대학교 어버너-섐페인캠퍼스 로고

일리노이대학교 어버너-섐페인캠퍼스

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

1

1

완료하는 데 8시간 필요

Orientation; Hashing

완료하는 데 8시간 필요
7개 동영상 (총 43분), 5 개의 읽기 자료, 4 개의 테스트
7개의 동영상
Lesson 1.1.2 Hashing - Hash Function10m
Lesson 1.1.3 Hashing - Hash Function Examples4m
Lesson 1.1.4 Collision Handling I: Separate Chaining4m
Lesson 1.1.5 Collision Handling II: Probing and Double Hashing12m
Lesson 1.1.6 Hashing Analysis3m
Lesson 1.1.7 Hash Tables in C++2m
5개의 읽기 자료
Syllabus10m
Additional References for C++10m
Week 1 Overview10m
Important Tips and Notes for All Challenge Problems10m
Guidelines for Asking for Help With Code10m
3개 연습문제
Orientation Quiz5m
Week 1 Quiz30m
Week 1 Challenge Problem30m
2

2

완료하는 데 3시간 필요

Disjoint Sets

완료하는 데 3시간 필요
6개 동영상 (총 32분), 2 개의 읽기 자료, 2 개의 테스트
6개의 동영상
2.1.2 Disjoint Sets: Naive Implementation4m
2.1.3 Disjoint Sets: UpTrees - A Better Implementation6m
2.1.4 UpTrees: Simple Running Time3m
2.1.5A UpTrees: Smart Union & Path Compression I8m
2.1.5B UpTrees: Smart Union & Path Compression II4m
2개의 읽기 자료
Week 2 Overview10m
Terminology Note: "Disjoint Sets" and "Union-Find"1m
2개 연습문제
Week 2 Quiz1시간
Week 2 Challenge Problem1시간
3

3

완료하는 데 7시간 필요

Graph Data Structures

완료하는 데 7시간 필요
5개 동영상 (총 35분), 1 개의 읽기 자료, 3 개의 테스트
5개의 동영상
3.1.2 Graphs: Vocabulary8m
3.1.3 Graphs: Edge List Implementation4m
3.1.4 Graphs: Adjacency Matrix Implementation6m
3.1.5 Graphs: Adjacency List Implementation8m
1개의 읽기 자료
Week 3 Overview10m
2개 연습문제
Week 3 Quiz30m
Week 3 Challenge Problem1시간
4

4

완료하는 데 3시간 필요

Graph Algorithms

완료하는 데 3시간 필요
11개 동영상 (총 75분), 1 개의 읽기 자료, 2 개의 테스트
11개의 동영상
4.1.2 Graphs: BFS Analysis9m
4.1.3 Graphs: DFS Traversal8m
4.2.1 Minimum Spanning Trees (MST) Introduction2m
4.2.2 MST: Kruskal's Algorithm I6m
4.2.3 MST: Kruskal's Algorithm II5m
4.2.4 MST: Prim's Algorithm9m
4.3.1 Graphs: Dijkstra's Algorithm6m
4.3.2 Graphs: Dijkstra's Edge Cases8m
4.3.3 Graphs: Dijkstra's Running Time2m
4.3.4 Graphs: Landmark Path Problem7m
1개의 읽기 자료
Week 4 Overview10m
2개 연습문제
Week 4 Quiz30m
Week 4 Challenge Problem1시간

검토

UNORDERED DATA STRUCTURES의 최상위 리뷰

모든 리뷰 보기

Accelerated Computer Science Fundamentals 특화 과정 정보

Topics covered by this Specialization include basic object-oriented programming, the analysis of asymptotic algorithmic run times, and the implementation of basic data structures including arrays, hash tables, linked lists, trees, heaps and graphs, as well as algorithms for traversals, rebalancing and shortest paths. This Specialization sequence is designed to help prospective applicants to the flexible and affordable Online Master of Computer Science (MCS) and MCS in Data Science prepare for the Online MCS Entrance Exam. The Online MCS Entrance Exam allows applicants who do not have graded and transcripted prerequisite CS coursework in the areas of data structures, algorithms, and object-oriented programming to strengthen their applications for admission. Learn more about the Online MCS Entrance Exam....
Accelerated Computer Science Fundamentals

자주 묻는 질문

  • Access to lectures and assignments depends on your type of enrollment. If you take a course in audit mode, you will be able to see most course materials for free. To access graded assignments and to earn a Certificate, you will need to purchase the Certificate experience, during or after your audit. If you don't see the audit option:

    • The course may not offer an audit option. You can try a Free Trial instead, or apply for Financial Aid.

    • The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.

  • When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.

  • If you subscribed, you get a 7-day free trial during which you can cancel at no penalty. After that, we don’t give refunds, but you can cancel your subscription at any time. See our full refund policy.

  • Yes, Coursera provides financial aid to learners who cannot afford the fee. Apply for it by clicking on the Financial Aid link beneath the "Enroll" button on the left. You'll be prompted to complete an application and will be notified if you are approved. You'll need to complete this step for each course in the Specialization, including the Capstone Project. Learn more.

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