×

### Let's log you in.

or

Don't have a StudySoup account? Create one here!

×

### Create a StudySoup account

#### Be part of our community, it's free to join!

or

##### By creating an account you agree to StudySoup's terms and conditions and privacy policy

Already have a StudySoup account? Login here

by: MW

13

1

1

# ECS 122A MT1 REVIEW ECS 122A

MW
UCD

### Preview These Notes for FREE

Get a free preview of these Notes, just enter your email below.

×
Unlock Preview

### Preview these materials now for free

Why put in your email? Get access to more of this material and other relevant free materials for your school

## About this Document

Winter 2016 Study Guide
COURSE
PROF.
Zhaojun Bai
TYPE
Study Guide
PAGES
1
WORDS
CONCEPTS
ECS
KARMA
50 ?

## Popular in Computer Science and Engineering

This 1 page Study Guide was uploaded by MW on Monday April 11, 2016. The Study Guide belongs to ECS 122A at University of California - Davis taught by Zhaojun Bai in Spring 2016. Since its upload, it has received 13 views. For similar materials see in Computer Science and Engineering at University of California - Davis.

×

## Reviews for ECS 122A MT1 REVIEW

×

×

### What is Karma?

#### You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!

Date Created: 04/11/16
ECS122A Midterm I Review Checklist Here are a list of math, concepts and deﬁnitions, algorithms that you should know from lecture, discussion and homework. This is not meant to be comprehensive. It is merely a reminder of what we need to review for the upcoming midterm exam I. Divide-and-conquer algorithmic technique 1. Divide-and-Conquer algorithm – three steps: • Divide the problem into a number of (independent) subproblems • Conquer subproblems by solving them recursively. If the subproblem sizes are small enough, however, just solve them in a straightforward manner. • Combine the solutions to the subproblems into the solution of the original problem 2. Case studies: (a) MergeSort (b) Finding the maximum and minimum values (c) Finding a maximum subarray (d) Strassen’s algorithm for matrix multiplication (e) Searching for index i such that A[i] = i in a sorted array A (f) Integer multiplication (g) k-way merge operation Deﬁnitions and concepts 1. Mathematical induction 2. Growth of functions and asymptotic notation: O,Ω,Θ 3. Best-case, worst-case and average-case complexity 4. Recurrence relations 5. Iteration method 6. The master theorem for solving divide-and-conquer recurrences Math 1. Set notation 2. Set of functions Xn Xn Xn 3. i =?, x =?, 1=? i i=1 i=0 i=1 4. Binomial coeﬃcients 5. Floor and ceiling 6. Logarithm and exponential 7. L’H¨pital’s rule 1

×

×

### BOOM! Enjoy Your Free Notes!

We've added these Notes to your profile, click here to view them now.

×

### You're already Subscribed!

Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'

## Why people love StudySoup

Steve Martinelli UC Los Angeles

#### "There's no way I would have passed my Organic Chemistry class this semester without the notes and study guides I got from StudySoup."

Janice Dongeun University of Washington

#### "I used the money I made selling my notes & study guides to pay for spring break in Olympia, Washington...which was Sweet!"

Steve Martinelli UC Los Angeles

Forbes

#### "Their 'Elite Notetakers' are making over \$1,200/month in sales by creating high quality content that helps their classmates in a time of need."

Become an Elite Notetaker and start selling your notes online!
×

### Refund Policy

#### STUDYSOUP CANCELLATION POLICY

All subscriptions to StudySoup are paid in full at the time of subscribing. To change your credit card information or to cancel your subscription, go to "Edit Settings". All credit card information will be available there. If you should decide to cancel your subscription, it will continue to be valid until the next payment period, as all payments for the current period were made in advance. For special circumstances, please email support@studysoup.com

#### STUDYSOUP REFUND POLICY

StudySoup has more than 1 million course-specific study resources to help students study smarter. If you’re having trouble finding what you’re looking for, our customer support team can help you find what you need! Feel free to contact them here: support@studysoup.com

Recurring Subscriptions: If you have canceled your recurring subscription on the day of renewal and have not downloaded any documents, you may request a refund by submitting an email to support@studysoup.com

Satisfaction Guarantee: If you’re not satisfied with your subscription, you can contact us for further help. Contact must be made within 3 business days of your subscription purchase and your refund request will be subject for review.

Please Note: Refunds can never be provided more than 30 days after the initial purchase date regardless of your activity on the site.