CS112_21_assignment 3A

CS112_21_assignment 3A - Handout 21 Spring 2003 Yinglin...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Handout 21 Spring 2003 Yinglin Wang CS112 Assignment 3A Written by Nicholas Fang, updated by Justin Haugh Due date: April 10 Problem 1: Big-O Notation a) What is the computational complexity of the following function: b) What is the computational complexity of the this function: c) What is the computational complexity of the Enigma function expressed in terms of big-O notation? Problem 2: Complexity classes Chapter 7 introduces several different complexity classes, of which the most important
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
are the following: Think back over the algorithms you have seen in CS106A and B and see how many examples you can find for each of these categories. Problem 3: Recursion and big-O (from the 1996-97 midterm) Assume that the function Mystery has been defined as follows: What does this function do and what is its computational complexity?
Background image of page 2
Background image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 3

CS112_21_assignment 3A - Handout 21 Spring 2003 Yinglin...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online