Scribd Logo
Upload

Welcome to Scribd!

  • 8 views

    DAA Internal Test 1

    Uploaded by

    Pushpavalli Mohan
    This document is an internal assessment for the course Design & Analysis of Algorithms. It has two parts: Part A contains 7 short answer questions worth 2 marks each about algorithms, Big Oh notation, linear search, recurrence equations, binary search, differences between quicksort and mergesort, and greedy algorithms. Part B contains 4 longer answer questions worth 12 marks each, asking students to explain asymptotic notation with an example, performance analysis, implement mergesort on a sample list, and write an algorithm to find the minimum and maximum values in a list.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    DAA Internal Test 1

    Uploaded by

    Pushpavalli Mohan
    8 views1 page
    This document is an internal assessment for the course Design & Analysis of Algorithms. It has two parts: Part A contains 7 short answer questions worth 2 marks each about algorithms, Big Oh notation, linear search, recurrence equations, binary search, differences between quicksort and mergesort, and greedy algorithms. Part B contains 4 longer answer questions worth 12 marks each, asking students to explain asymptotic notation with an example, performance analysis, implement mergesort on a sample list, and write an algorithm to find the minimum and maximum values in a list.

    Original Description:

    qp

    Original Title

    DAA Internal Test 1 (Autosaved)

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document is an internal assessment for the course Design & Analysis of Algorithms. It has two parts: Part A contains 7 short answer questions worth 2 marks each about algorithms, Big Oh notation, linear search, recurrence equations, binary search, differences between quicksort and mergesort, and greedy algorithms. Part B contains 4 longer answer questions worth 12 marks each, asking students to explain asymptotic notation with an example, performance analysis, implement mergesort on a sample list, and write an algorithm to find the minimum and maximum values in a list.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as doc, pdf, or txt
    8 views1 page

    DAA Internal Test 1

    Uploaded by

    Pushpavalli Mohan
    This document is an internal assessment for the course Design & Analysis of Algorithms. It has two parts: Part A contains 7 short answer questions worth 2 marks each about algorithms, Big Oh notation, linear search, recurrence equations, binary search, differences between quicksort and mergesort, and greedy algorithms. Part B contains 4 longer answer questions worth 12 marks each, asking students to explain asymptotic notation with an example, performance analysis, implement mergesort on a sample list, and write an algorithm to find the minimum and maximum values in a list.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as doc, pdf, or txt
    of 1

    INTERNAL ASSESSMENT -I CS 2251- DESIGN & ANALYSIS OF ALGORITHM (Department of Computer Science and Engineering) Date: 19.02.

    2013 Maximum: 50 marks Time: 01 Hr 30 mins

    Part-A: 1. What is Algorithm?

    (Answer All Questions)

    (7*2=14)

    2. Properties of Big Oh Notation? 3. What is meant by Linear Search? 4. What is Recurrence Equation? 5. What is binary search algorithm list out the drawbacks? 6. Difference between Quick sort and Merge sort algorithm? 7. What is Greedy algorithm?

    Part B:

    (Answer Any Three Questions)

    (3*12=36)

    1. Explain Asymptotic Notation with example? 2. Explain performance analysis? 3. Write an algorithm to sort a given list of elements using merge sort, show the operation of the algorithm on the list 18,29,68,32,43,37,87,24,47,50 4. Write an algorithm for min-max and finding the minimum and maximum of the given list 50, 40,-9,-5, 45, 90,65,25,75

    *******ALL THE BEST *******

    You might also like