72sample.pdf - Chapter 2 This file contains the exercises hints and solutions for Chapter 2 of the book ”Introduction to the Design and Analysis of

72sample.pdf - Chapter 2 This file contains the exercises...

This preview shows page 1 - 3 out of 53 pages.

Chapter 2 This file contains the exercises, hints, and solutions for Chapter 2 of the book ”Introduction to the Design and Analysis of Algorithms,” 3rd edition, by A. Levitin. The problems that might be challenging for at least some students are marked by ; those that might be difficult for a majority of students are marked by . Exercises 2.1 1. For each of the following algorithms, indicate (i) a natural size metric for its inputs, (ii) its basic operation, and (iii) whether the basic operation count can be different for inputs of the same size: a. computing the average of n numbers b. computing n/n ! c. finding the smallest element in a list of n numbers d. Reverse display a list of n numbers e. Reverse a list of n numbers f. pen-and-pencil algorithm for addition of two n -digit decimal integers 2. a. Consider the definition-based algorithm for finding the difference be- tween two n x n matrices. What is its basic operation? How many times is it performed as a function of the matrix order n? As a function of the total number of elements in the input matrices? b. Answer the same questions for the definition-based algorithm for the inverse of a matrix. 3. Consider a classic sequential search that scans a list to search the occur- rences of a given search key in the list. Discuss the worst case, average case and best case efficiency of a classic sequential search. 4. a. Glove selection There are 22 gloves in a drawer: 5 pairs of red gloves, 4 pairs of yellow, and 2 pairs of green. You select the gloves in the dark and can check them only after a selection has been made. What is the smallest number of gloves you need to select to have at least one matching pair in the best case? in the worst case? b. Missing socks Imagine that after washing 5 distinct pairs of socks, you discover that two socks are missing. Of course, you would like to have the largest number of complete pairs remaining. Thus, you are left with 4 complete pairs in the best-case scenario and with 3 complete pairs in the worst case. Assuming that the probability of disappearance for each of the 10 socks is the same, find the probability of the best-case scenario; the probability of the worst-case scenario; the number of pairs you should expect in the average case. 1
Image of page 1
5. a. Prove formula (2.1) for the number of bits in the binary representation of a positive integer. b. Prove the alternative formula for the number of bits in the binary representation of a positive integer n : b = log 2 ( n + 1) . c. What would be the analogous formulas for the number of decimal digits? d. Explain why, within the accepted analysis framework, it does not mat- ter whether we use binary or decimal digits in measuring n ’s size. 6. Suggest how any sorting algorithm can be augmented in a way to make the best-case count of its key comparisons equal to just n 1 ( n is a list’s size, of course). Do you think it would be a worthwhile addition to any sorting algorithm?
Image of page 2
Image of page 3

You've reached the end of your free preview.

Want to read all 53 pages?

  • Fall '18
  • mot

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern

Stuck? We have tutors online 24/7 who can help you get unstuck.
A+ icon
Ask Expert Tutors You can ask You can ask You can ask (will expire )
Answers in as fast as 15 minutes
A+ icon
Ask Expert Tutors