About this course: 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).
Who is this class for: Programmers with basic experience looking to understand the practical and conceptual underpinnings of algorithms, with the goal of becoming more effective software engineers. Computer science students and researchers as well as interdisciplinary students (studying electrical engineering, mathematics, bioinformatics, etc.) aiming to get more profound understanding of algorithms and hands-on experience implementing them and applying for real-world problems. Applicants who want to prepare for an interview in a high-tech company.
Created by: University of California, San Diego, Higher School of Economics
Taught by: Alexander S. Kulikov, Visiting Professor
Department of Computer Science and Engineering
Taught by: Michael Levin, Lecturer
Computer Science
Taught by: Neil Rhodes, Adjunct Faculty
Computer Science and Engineering
Taught by: Pavel Pevzner, Professor
Department of Computer Science and Engineering
Taught by: Daniel M Kane, Assistant Professor
Department of Computer Science and Engineering / Department of Mathematics
| Basic Info |
Course 1 of 6 in the
Data Structures and Algorithms Specialization.
|
| Commitment | 5 weeks of study, 4-8 hours/week |
| Language | English, Subtitles: Spanish |
| How To Pass | Pass all graded assignments to complete the course. |
| User Ratings |
Syllabus
WEEK 1
Welcome
Welcome to the first module of Data Structures and Algorithms! Here we will provide an overview of where algorithms and data structures are used (hint: everywhere) and walk you through a few sample programming challenges. The programming challenges represent a...
6 videos, 7 readings, 2 practice quizzes
Graded: A plus B
Graded: Maximum Pairwise Product
WEEK 2
Introduction
In this module you will learn that programs based on efficient algorithms can solve the same problem billions of times faster than programs based on naïve algorithms. You will learn how to estimate the running time and memory of an algorithm without even imple...
12 videos, 3 readings
Graded: Logarithms
Graded: Big-O
Graded: Growth rate
Graded: Programming Assignment 1: Introduction
WEEK 3
Greedy Algorithms
In this module you will learn about seemingly naïve yet powerful class of algorithms called greedy algorithms. After you will learn the key idea behind the greedy algorithms, you may feel that they represent the algorithmic Swiss army knife that can be applied...
10 videos, 1 reading
Graded: Greedy Algorithms
Graded: Fractional Knapsack
Graded: Programming Assignment 2: Greedy Algorithms
WEEK 4
Divide-and-Conquer
In this module you will learn about a powerful algorithmic technique called Divide and Conquer. Based on this technique, you will see how to search huge databases millions of times faster than using naïve linear search. You will even learn that the standard wa...
20 videos, 5 readings
Graded: Linear Search and Binary Search
Graded: Polynomial Multiplication
Graded: Master Theorem
Graded: Sorting
Graded: Quick Sort
Graded: Programming Assignment 3: Divide and Conquer
WEEK 5
Dynamic Programming
In this final module of the course you will learn about the powerful algorithmic technique for solving many optimization problems called Dynamic Programming. It turned out that dynamic programming can solve many problems that evade all attempts to solve them u...
12 videos, 3 readings
Graded: Change Money
Graded: Edit Distance
Graded: Knapsack
Graded: Maximum Value of an Arithmetic Expression
Graded: Programming Assignment 4: Dynamic Programming
FAQs
How It Works
Coursework
Each course is like an interactive textbook, featuring pre-recorded videos, quizzes and projects.
Help from Your Peers
Connect with thousands of other learners and debate ideas, discuss course material, and get help mastering concepts.
Certificates
Earn official recognition for your work, and share your success with friends, colleagues, and employers.
Creators
University of California, San Diego
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.
Higher School of Economics
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 communications, IT, mathematics, engineering, and more.
Learn more on www.hse.ru
Pricing
| Audit | Purchase Course | |
|---|---|---|
| Access to course materials | Available | Available |
| Access to graded materials | Not available | Available |
| Receive a final grade | Not available | Available |
| Earn a shareable Course Certificate | Not available | Available |
Ratings and Reviews
You can include real life examples to describe problem also.
Very good, however subs are wrong in many cases
Very helpful and solid. The practice and home work not difficult but not too easy. It's great for who need to review or new to algorithm.
Coursera provides universal access to the world’s best education, partnering with top universities and organizations to offer courses online.
© 2017 Coursera Inc. All rights reserved.
Really great course for an introduction to greedy, divide-and-conquer and dynamic programming techniques. Programming assignments are challenging for beginners but are really helpful for mastering the concept and materials. Referenced materials are useful to understand the concepts when listening to lectures is not enough.