Scribd Logo
Upload

Welcome to Scribd!

  • Assignment1 Asymptotic Notation

    Uploaded by

    Arun Kumar Singh
    36 views1 page
    nk = Θ(cn) as k and c are constants, so nk grows polynomially with n at the same rate as cn. Θ is transitive, so if f(n) = Θ(g(n)) and g(n) = Θ(h(n)), then h(n) = Θ(f(n)). n/100 = Ω(n) because n/100 is a fraction of n and grows asymptotically at the same rate. The running time of the nested for loops is O(n3) as there are three nested loops with the innermost running n times per iteration of the outer loops. The statement that if f(n)

    Original Description:

    notation

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    nk = Θ(cn) as k and c are constants, so nk grows polynomially with n at the same rate as cn. Θ is transitive, so if f(n) = Θ(g(n)) and g(n) = Θ(h(n)), then h(n) = Θ(f(n)). n/100 = Ω(n) because n/100 is a fraction of n and grows asymptotically at the same rate. The running time of the nested for loops is O(n3) as there are three nested loops with the innermost running n times per iteration of the outer loops. The statement that if f(n)

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    36 views1 page

    Assignment1 Asymptotic Notation

    Uploaded by

    Arun Kumar Singh
    nk = Θ(cn) as k and c are constants, so nk grows polynomially with n at the same rate as cn. Θ is transitive, so if f(n) = Θ(g(n)) and g(n) = Θ(h(n)), then h(n) = Θ(f(n)). n/100 = Ω(n) because n/100 is a fraction of n and grows asymptotically at the same rate. The running time of the nested for loops is O(n3) as there are three nested loops with the innermost running n times per iteration of the outer loops. The statement that if f(n)

    Copyright:

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

    GLA University, Mathura

    Assignment-2
    Subject: Data Structure Code:CSE3001

    Year: 2nd Semester: III Submit: On or before 5/9/16

    1. For the functions, nk and cn, what is the asymptotic relationship between these functions?
    Assume that k>- 1 and c> 1 are constants. Explain your answer in brief .
    2. If f(n) = Θ(g(n)) and g(n) = Θ(h(n)), then h(n) = Θ(f(n)), then proof that Θ is transitive.
    3. Proof n/100 = Ω(n).
    4. The running time of for/while loop is number of iterations * running time of statement
    Sum=0

    for (i=0; i< n; i++)

    for (j=0;j<i*i;j++)

    for(k=0;k<j;k++)

    sum++;

    Gate-2007

    5. If f(n) = O(g(n)) and g(n) = O(f(n)) then f(n) = g(n). Is this statements are True or False.
    You must briefly justify your answer.

    You might also like