Algorithms and Design (Tests)
0.0 (0 ratings)
Course Ratings are calculated from individual students’ ratings and a variety of other signals, like age of rating and reliability, to ensure that they reflect course quality fairly and accurately.
0 students enrolled

Algorithms and Design (Tests)

Design
0.0 (0 ratings)
Course Ratings are calculated from individual students’ ratings and a variety of other signals, like age of rating and reliability, to ensure that they reflect course quality fairly and accurately.
0 students enrolled
Created by Ella Jeoffrey
Last updated 12/2019
English
Algorithms and Design (Tests)
Current price: $13.99 Original price: $19.99 Discount: 30% off
5 hours left at this price!
30-Day Money-Back Guarantee
This course includes
  • 5 Practice Tests
  • Full lifetime access
  • Access on mobile
Training 5 or more people?

Get your team access to 4,000+ top Udemy courses anytime, anywhere.

Try Udemy for Business
Requirements
  • no
Included in This Course
+ Practice Tests
5 Tests 21 questions

Basics of algorithm analysis

Correctness of algorithms

Computational tractability
Big-Oh and other related notations

Introduction-Short Questions
9 questions

Lower bound on sorting

Recurrences

Searching and sorting-Long Questions
6 questions

Merge sort
Master theorem and related recurrence

Maximum subarray problem

Divide and conquer algorithms
2 questions

Breadth-first search
Strongly connected component

Graph algorithms
3 questions

Matrix-chain multiplication

Longest common subsequence

Dynamic programming
1 question
Description

This is a fundamental course on Algorithms in Computer Science. The main goal of the course is to develop tools and techniques that aid in designing correct and efficient algorithms for computational problems and analyzing their correctness and running time. We will study pow- erful design techniques, such as dynamic programming and randomization, and useful analytical tools, such as recurrence relations and average case analysis. The algorithms under study are either quite useful, instructive, beautiful or any combination thereof. After taking this course, the student will be conversant in the language of algorithms, which is a chief component of technical interviews and software related jobs.

Who this course is for:
  • Undergraduate and graduate students