Join StudySoup for FREE

Get Full Access to
NYU - COM 122 - Study Guide - Final

Description

Reviews

Shlomi Oved CS2413- Design and Analysis of Algorithms 2/21/17 Lecture 1/26/17 Prof. Lisa Hellerstein Sections B and D Prof Aronov’s Section M-W 10:30-11:50am Office Hours: Tuesday and Thursday 4-5pm Lisa.hellerstein@nyu.edu 2 Midterms and a Final Final grade in course 15% HW 25% each Midterms 35% Final Algorithm Step by step procedure to solve problems. Algorithms can’t: • They can’t run forever • Can’t be right only some of the time History of Algorithms: Al Khwarizmi in the 9th Century invented some algorithms such as: • Basic methods for +,-,/,*, sqrt , digits of pi. Numerical Algorithms Fibonacci: 0, 1, 1, 2, 3, 5 �!, �!, �!, �!, �!, �! 0 �� � = 0 �! = 1 �� � = 1 �!!! + �!!! �� � ≥ 2 As n grows �!!! �!→ � = 1 + 5 2 �! ≈ 2!.!"#! How many n-bit binary strings are there that do not have two consecutive ones?
Number of bits n
Number of strings of length n without 2 consecutive ones
1
2

## How many n-bit binary strings are there that do not have two consecutive ones?

## How much time does it take as a function of n?

## What time of day done?

If you want to learn more check out c) What is the range of this function?

We also discuss several other topics like beneceptive

If you want to learn more check out rerunning a program with the same data produces

We also discuss several other topics like is anthrax prokaryote or eukaryote

We also discuss several other topics like sdsu mis

Don't forget about the age old question of hyperpnic

References: