Scribd Logo
Upload

Welcome to Scribd!

  • Daa Assignment-2 QSN

    Uploaded by

    sb8515
    3 views1 page
    The document announces an assignment for a Design and Analysis of Algorithms course being taught in the II & IV Semester of the Computer Science department at SRM Institute of Science and Technology in Tiruchirappalli, India. The assignment contains 5 questions - the first asks to solve a recurrence relation and determine time complexity, the second explains asymptotic notations, the third performs merge sort on an array, the fourth performs quick sort on a list of numbers, and the fifth explains the master's theorem with examples. It provides the assignment details such as date of announcement, date of submission, and is signed by the faculty in-charge.

    Original Description:

    Original Title

    DAA ASSIGNMENT-2 QSN

    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
    The document announces an assignment for a Design and Analysis of Algorithms course being taught in the II & IV Semester of the Computer Science department at SRM Institute of Science and Technology in Tiruchirappalli, India. The assignment contains 5 questions - the first asks to solve a recurrence relation and determine time complexity, the second explains asymptotic notations, the third performs merge sort on an array, the fourth performs quick sort on a list of numbers, and the fifth explains the master's theorem with examples. It provides the assignment details such as date of announcement, date of submission, and is signed by the faculty in-charge.

    Copyright:

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

    Daa Assignment-2 QSN

    Uploaded by

    sb8515
    The document announces an assignment for a Design and Analysis of Algorithms course being taught in the II & IV Semester of the Computer Science department at SRM Institute of Science and Technology in Tiruchirappalli, India. The assignment contains 5 questions - the first asks to solve a recurrence relation and determine time complexity, the second explains asymptotic notations, the third performs merge sort on an array, the fourth performs quick sort on a list of numbers, and the fifth explains the master's theorem with examples. It provides the assignment details such as date of announcement, date of submission, and is signed by the faculty in-charge.

    Copyright:

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

    SRM INSTITUTE OF SCIENCE AND

    TECHNOLOGY
    TIRUCHIRAPPALLI TIRUCHIRAPPALLI CAMPUS
    FACULTY OF ENGINEERING AND TECHNOLOGY
    SCHOOL OF COMPUTING

    Year & Sememster: II & IV Branch: CSE(C ) and CSE (CS)


    Subject Name: Design and Analysis of Algorithms
    Subject Code : 21CSC204J

    Date of announcement : 12-2-24


    Date of Submission: 19-2-24

    1. For T(n)=7T(n/2)+18n2 Solve the recurrence relation and find the time complexity.
    2. Explain Asymptotic notations Based on growth functions with suitable examples.
    3. Consider the following values array = { 2, 1, 6, 10, 4, 1, 3, 9, 7} perform merge sort to
    arrange the numbers in ascending order. Find the time complexity of the algorithm.
    4. Consider the following values 54,26,93,17,77,31,44,55,20 . Perform quick sort and
    write the time complexity of an algorithm.
    5. Explain master’s theorem with suitable examples.

    Faculty in-charge
    Dr.P.Shanmuga Sundari

    You might also like