Scribd Logo
Upload

Welcome to Scribd!

  • 8 views

    Attachment 1

    Uploaded by

    Nadine Mostafa
    This quiz will consist of 5 written questions about big O notation and analyzing algorithms. Students must submit their answers by uploading a file to Canvas by February 7 at 7AM. Resources like the textbook and class notes can be used but no other outside help. The questions will analyze time complexities of functions, explain why a statement about algorithm runtime is meaningless, and analyze the selection sort algorithm.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Attachment 1

    Uploaded by

    Nadine Mostafa
    8 views2 pages
    This quiz will consist of 5 written questions about big O notation and analyzing algorithms. Students must submit their answers by uploading a file to Canvas by February 7 at 7AM. Resources like the textbook and class notes can be used but no other outside help. The questions will analyze time complexities of functions, explain why a statement about algorithm runtime is meaningless, and analyze the selection sort algorithm.

    Original Description:

    Original Title

    attachment_1

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This quiz will consist of 5 written questions about big O notation and analyzing algorithms. Students must submit their answers by uploading a file to Canvas by February 7 at 7AM. Resources like the textbook and class notes can be used but no other outside help. The questions will analyze time complexities of functions, explain why a statement about algorithm runtime is meaningless, and analyze the selection sort algorithm.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    8 views2 pages

    Attachment 1

    Uploaded by

    Nadine Mostafa
    This quiz will consist of 5 written questions about big O notation and analyzing algorithms. Students must submit their answers by uploading a file to Canvas by February 7 at 7AM. Resources like the textbook and class notes can be used but no other outside help. The questions will analyze time complexities of functions, explain why a statement about algorithm runtime is meaningless, and analyze the selection sort algorithm.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 2

    CS146: Quiz 2

    Due Tuesday, February 7, at 7:00AM


    10 points

    This quiz will be a written quiz. Please submit your answers to these questions by
    uploading a file to Canvas. You may type or handwrite your solutions. You are free to use the
    textbook, slides, class notes, but DO NOT consult any other resources. There are five
    questions total (two of them on the second page).

    Question 1) [2 points]
    𝑛+1 𝑛
    Is 2 = 𝑂(2 )?

    Question 2) [2 points]
    2𝑛 𝑛
    Is 2 = 𝑂(2 )?

    Question 3) [2 points]
    2
    Explain why the statement, “The running time of algorithm A is at least 𝑂(𝑛 )” is
    meaningless.
    Question 4) [2 points]
    Using reasoning similar to what we used for insertion sort in class, analyze the running
    time of the selection sort algorithm from the first homework assignment.

    selectionSort(arr) cost time


    for startOfUnsorted in 0 to arr.length 𝑐1

    smallestInUnsorted = max value 𝑐2

    indexOfSmallest = -1 𝑐3

    for i in startOfUnsorted to arr.length 𝑐4

    int current = arr[i] 𝑐5

    if arr[i] < smallestInUnsorted 𝑐6

    smallestInUnsorted = arr[i] 𝑐7

    indexOfSmallest = i 𝑐8

    swap arr[indexOfSmallest],arr[startOfUnsorted] 𝑐9

    Question 5) [2 points]
    Why do all cases have the same runtime in selection sort?

    You might also like