hamburger menu
All Coursesall course arrow
adda247
reward-icon
adda247
    arrow
    arrow
    arrow
    Match List - I with List – II. List - I (Recurrence Relations) List - II (Complexity) A. T(n) =
    Question

    Match the columns.

    Match List - I with List – II.
    List - I (Recurrence Relations)
    List - II (Complexity)
    A.
    T(n) = 2T(n/2) + n
    I.
    T(n) = θ (n log n) {exact solution}
    B.
    T(n) = T(n/2) + 1
    II.
    O(n2)
    C.
    T(n) = 2T(n/2) + 1
    III.
    Tn = θ(n) {exact solution}
    D.
    T(n) = T (n – 1) + 1
    IV.
    O(n)
    Choose the correct answer from the options given below:

    A.

    A-I, B-IV, C-III, D-II

    B.

    A-IV, B-II, C-I, D-III

    C.

    A-I, B-III, C-IV, D-II

    D.

    A-III, B-I, C-IV, D-II

    Correct option is C



    Free Tests

    Free
    Must Attempt

    Basics of Education: Pedagogy, Andragogy, and Hutagogy

    languageIcon English
    • pdpQsnIcon10 Questions
    • pdpsheetsIcon20 Marks
    • timerIcon12 Mins
    languageIcon English
    Free
    Must Attempt

    UGC NET Paper 1 Mock Test 1

    languageIcon English
    • pdpQsnIcon50 Questions
    • pdpsheetsIcon100 Marks
    • timerIcon60 Mins
    languageIcon English
    Free
    Must Attempt

    Basics of Education: Pedagogy, Andragogy, and Hutagogy

    languageIcon English
    • pdpQsnIcon10 Questions
    • pdpsheetsIcon20 Marks
    • timerIcon12 Mins
    languageIcon English
    test-prime-package

    Access ‘UGC NET Computer Science’ Mock Tests with

    • 60000+ Mocks and Previous Year Papers
    • Unlimited Re-Attempts
    • Personalised Report Card
    • 500% Refund on Final Selection
    • Largest Community
    students-icon
    354k+ students have already unlocked exclusive benefits with Test Prime!
    Our Plans
    Monthsup-arrow