hw1 - A LGORITHMS - CSE 101 Homework 1 Each problem is...

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

View Full Document Right Arrow Icon
A LGORITHMS - CSE 101 Homework 1 Each problem is worth 10 points. We suggest the following steps in writing up your solutions, when they are aplicable: 1. Understand the problem. Take a small numeric example and work it out manually to get a clear idea about the problem. Do not hesitate to contact us if you do not understand what you are supposed to do. 2. Give an informal description (at most 10 lines of english text) of your solution. The informal description should highlight the key ideas of your solution. Your solution may just be graded by the quality of this informal description. 3. Write up your design; Use the pseudo programming languge from the book to write your algorithms. Write your algorithms modularly. Provide sufFcient detail as warranted by the problem. 4. Analyze the time complexity. 5. Argue that your algorithm is correct. Problem 1: (Function Order) Is the function 2 lg 2 n polynomially bounded? Is the function d log log n e ! polynomially bounded? Justify your answers
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/16/2010 for the course CSE 101 taught by Professor Staff during the Winter '08 term at UCSD.

Page1 / 2

hw1 - A LGORITHMS - CSE 101 Homework 1 Each problem is...

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

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