Master Algorithmic Programming Techniques. Learn algorithms through programming and advance your software engineering or data science career

4.6

별점

17,989개의 평가

Alexander S. Kulikov +4명의 강사

제공자:

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

HSE 대학

데이터 구조 및 알고리즘 특화 과정캘리포니아 샌디에고 대학교

배울 내용

Apply basic algorithmic techniques such as greedy algorithms, binary search, sorting and dynamic programming to solve programming challenges.

Apply various data structures such as stack, queue, hash table, priority queue, binary search tree, graph and string to solve programming challenges.

Apply graph and string algorithms to solve real-world challenges: finding shortest paths on huge maps and assembling genomes from millions of pieces.

Solve complex programming challenges using advanced techniques: maximum flow, linear programming, approximate algorithms, SAT-solvers, streaming.

귀하가 습득할 기술

DebuggingSoftware TestingAlgorithmsData StructureComputer ProgrammingDynamic ProgrammingBinary Search TreePriority QueueHash TableStack (Abstract Data Type)ListGraph Theory

이 전문 분야 정보

최근 조회 143,531회

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.

응용 학습 프로젝트

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.

학습자 경력 결과

36%

이 특화 과정을(를) 수료한 후 새로운 경력을 시작함

25%

급여 인상 또는 승진하기

공유 가능한 수료증

완료 시 수료증 획득

100% 온라인 강좌

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

유동적 일정

유연한 마감을 설정하고 유지 관리합니다.

중급 단계

Basic knowledge of at least one programming language: C++, Java, Python, C, C#, Javascript, Haskell, Kotlin, Ruby, Rust, Scala. Basic knowledge of discrete mathematics: proof by induction, proof by contradiction.

완료하는 데 약 8개월이 걸립니다

권장 학습 속도: 주 6시간

영어

자막: 영어, 아랍어, 프랑스어, 포르투갈어 (유럽), 중국어 (간체자), 이탈리아어, 베트남어, 한국어, 독일어, 러시아어, 터키어, 스페인어

학습자 경력 결과

36%

이 특화 과정을(를) 수료한 후 새로운 경력을 시작함

25%

급여 인상 또는 승진하기

공유 가능한 수료증

완료 시 수료증 획득

100% 온라인 강좌

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

유동적 일정

유연한 마감을 설정하고 유지 관리합니다.

중급 단계

완료하는 데 약 8개월이 걸립니다

권장 학습 속도: 주 6시간

영어

자막: 영어, 아랍어, 프랑스어, 포르투갈어 (유럽), 중국어 (간체자), 이탈리아어, 베트남어, 한국어, 독일어, 러시아어, 터키어, 스페인어

이 전문 분야에는 6개의 강좌가 있습니다.

강좌1

강좌 1

Algorithmic Toolbox

4.6

별점

10,227개의 평가

•

2,166개의 리뷰

The course covers basic algorithmic techniques and ideas for computational problems arising frequently in practical applications: sorting and searching, divide and conquer, greedy algorithms, dynamic programming. We will learn a lot of theory: how to sort data and how it helps for searching; how to break a large problem into pieces and solve them recursively; when it makes sense to proceed greedily; how dynamic programming is used in genomic studies. You will practice solving computational problems, designing new algorithms, and implementing solutions efficiently (so that they run in less than a second).

강좌2

강좌 2

데이터 구조

4.6

별점

4,063개의 평가

•

685개의 리뷰

A good algorithm usually comes together with a set of good data structures that allow the algorithm to manipulate the data efficiently. In this course, we consider the common data structures that are used in various computational problems. You will learn how these data structures are implemented in different programming languages and will practice implementing them in our programming assignments. This will help you to understand what is going on inside a particular built-in implementation of a data structure and what to expect from it. You will also learn typical use cases for these data structures.

A few examples of questions that we are going to cover in this class are the following: 1. What is a good strategy of resizing a dynamic array? 2. How priority queues are implemented in C++, Java, and Python? 3. How to implement a hash table so that the amortized running time of all operations is O(1) on average? 4. What are good strategies to keep a binary tree balanced? You will also learn how services like Dropbox manage to upload some large files instantly and to save a lot of storage space!

강좌3

강좌 3

Algorithms on Graphs

4.7

별점

1,917개의 평가

•

321개의 리뷰

If you have ever used a navigation service to find optimal route and estimate time to destination, you've used algorithms on graphs. Graphs arise in various real-world situations as there are road networks, computer networks and, most recently, social networks! If you're looking for the fastest time to get to work, cheapest way to connect set of computers into a network or efficient algorithm to automatically find communities and opinion leaders in Facebook, you're going to work with graphs and algorithms on graphs.

In this course, you will first learn what a graph is and what are some of the most important properties. Then you'll learn several ways to traverse graphs and how you can do useful things while traversing the graph in some order. We will then talk about shortest paths algorithms — from the basic ones to those which open door for 1000000 times faster algorithms used in Google Maps and other navigational services. You will use these algorithms if you choose to work on our Fast Shortest Routes industrial capstone project. We will finish with minimum spanning trees which are used to plan road, telephone and computer networks and also find applications in clustering and approximate algorithms.

강좌4

강좌 4

문자열 알고리즘

4.5

별점

930개의 평가

•

158개의 리뷰

World and internet is full of textual information. We search for information using textual queries, we read websites, books, e-mails. All those are strings from the point of view of computer science. To make sense of all that information and make search efficient, search engines use many string algorithms. Moreover, the emerging field of personalized medicine uses many search algorithms to find disease-causing mutations in the human genome.

강사

제공자:

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

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.

HSE 대학

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

업계 파트너:

자주 묻는 질문

전문 분야를 완료하면 대학 학점을 받을 수 있나요?
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.
Can I just enroll in a single course?
구독하는 경우, 취소해도 요금이 청구되지 않는 7일간의 무료 평가판을 이용할 수 있습니다. 해당 기간이 지난 후에는 환불이 되지 않지만, 언제든 구독을 취소할 수 있습니다. 전체 환불 정책 보기.
하나의 강좌에만 등록할 수 있나요?
네! 시작하려면 관심 있는 강좌 카드를 클릭하여 등록합니다. 강좌를 등록하고 완료하면 공유할 수 있는 인증서를 얻거나 강좌를 청강하여 강좌 자료를 무료로 볼 수 있습니다. 전문 분야 과정에 있는 강좌에 등록하면, 전체 전문 분야에 등록하게 됩니다. 학습자 대시보드에서 진행 사항을 추적할 수 있습니다.
Can I take the course for free?
예, Coursera에서는 수업료를 낼 수 없는 학습자를 위해 재정 지원을 제공합니다. 왼쪽에 있는 등록 버튼 아래 재정 지원 링크를 클릭하면 지원할 수 있습니다. 신청서를 작성하라는 메시지가 표시되며 승인되면 알림을 받습니다. 성취 프로젝트를 포함하여 전문 분야의 각 강좌에서 이 단계를 완료해야 합니다. 자세히 알아보기.
해당 강좌를 무료로 수강할 수 있나요?
강좌를 등록하면 전문 분야의 모든 강좌에 접근할 수 있으며 강좌를 완료하면 인증서가 발급됩니다. 강좌 내용을 읽고 보기만 원한다면 강좌를 무료로 청강할 수 있습니다. 수업료를 지급하기 어려운 경우, 재정 지원을 신청할 수 있습니다.
이 강좌는 100% 온라인으로 진행되나요? 직접 참석해야 하는 수업이 있나요?
이 강좌는 100% 온라인으로 진행되므로 강의실에 직접 참석할 필요가 없습니다. 웹 또는 모바일 장치를 통해 언제 어디서든 강의, 읽기 자료, 과제에 접근할 수 있습니다.
What background knowledge is necessary?
1. Basic knowledge of at least one programming language: C++, Java, Python, C, C#, Javascript, Haskell, Kotlin, Ruby, Rust, Scala.
We expect you to be able to implement programs that: 1) read data from the standard input (in most cases, the input is a sequence of integers); 2) compute the result (in most cases, a few loops are enough for this); 3) print the result to the standard output. For each programming challenge in this course, we provide starter solutions in C++, Java, and Python. The best way to check whether your programming skills are enough to go through problems in this specialization is to solve two problems from the first week. If you are able to pass them (after reading our tutorials), then you will definitely be able to pass the course.
2. Basic knowledge of discrete mathematics: proof by induction, proof by contradiction.
Knowledge of discrete mathematics is necessary for analyzing algorithms (proving correctness, estimating running time) and for algorithmic thinking in general. If you want to refresh your discrete mathematics skills, we encourage you to go through our partner specialization — Introduction to Discrete Mathematics for Computer Science (https://www.coursera.org/specializations/discrete-mathematics). It teaches the basics of discrete mathematics in try-this-before-we-explain-everything approach: you will be solving many interactive puzzles that were carefully designed to allow you to invent many of the important ideas and concepts yoursel
What is the difference between this course and other courses covering algorithms?
We believe that learning the theory behind algorithms (like in most Algorithms 101 courses taught at 1000s universities) is important but not sufficient for a professional computer scientist today. This specialization combines the theory of algorithms with many programming challenges. In contrast with many Algorithms 101 courses, you will implement over 100 algorithmic problems in the programming language of your choice. And you will see yourself that the best way to understand an algorithm is to implement it!
How long does it take to complete the Specialization?
Time to completion can vary based on your schedule, but most learners are able to complete the Specialization in 6-8 months.
전문 분야를 완료하는 데 얼마나 걸리나요?
Each course in the Specialization is offered on a regular schedule, with sessions starting about once per month. If you don't complete a course on the first try, you can easily transfer to the next session, and your completed work and grades will carry over.
얼마나 자주 전문 분야의 강좌가 제공되나요?
Basic knowledge of at least one programming language (C/C++, Java, Python): loops, arrays, stacks, recursion. Basic knowledge of mathematics: proof by induction, proof by contradiction.
Do I need to take the courses in a specific order?
We recommend taking the courses in the order presented, as each subsequent course will build on material from previous courses.
Will I earn university credit for completing the Specialization?
Coursera courses and certificates don't carry university credit, though some universities may choose to accept Specialization Certificates for credit. Check with your institution to learn more.
전문 분야를 완료하면 대학 학점을 받을 수 있나요?
The lectures in this specialization will be self-contained. Most lectures will be based on the bestselling textbook "Algorithms" co-authored by Sanjoy Dasgupta from University of California at San Diego as well as Christos Papadimitriou and Umesh Vazirani from University of California at Berkeley. In addition to UCSD and Berkeley, the textbook has been adopted in over 100 top universities and is available on Internet.

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