Scribd Logo
Upload

Welcome to Scribd!

  • 1 views

    ct ddddd

    Uploaded by

    prathy1018
    reference

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    ct ddddd

    Uploaded by

    prathy1018
    1 views5 pages
    reference

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    reference

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    1 views5 pages

    ct ddddd

    Uploaded by

    prathy1018
    reference

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 5

    CT- DAA SET – 1 (TWO MARK WITH ANS)

    1. What is the need for studying algorithms?


    Studying algorithms is essential because they provide the ultimate
    framework for solving problems efficiently. Understanding
    algorithms helps optimize processes, improve performance, and
    enables innovation in technology.

    2. Define program?
    A program is the expression of an algorithm m a programming
    language.

    3. What is performance measurement?


    Performance measurement is concerned with obtaining the space and
    the time requirement of a particular algorithm.

    4. Write the for loop general format?


    The general form of a for loop is
    For available:=value 1 to value 2 step
    Step do
    {
    <Statement 1>
    <Statement n>
    }
    5. Draw the notation of the algorithm?

    probelm

    Alogoritm

    Input Computer output

    6. Define brute force?


    "Brute force" refers to a straightforward approach that relies on
    sheer power or effort to achieve a goal, often without considering
    efficiency. In computing, it specifically describes a method of
    solving problems, like cracking passwords, by systematically
    trying all possible combinations until the correct one is found.

    7. Define exhaustive search?


    Exhaustive search is a problem-solving technique that involves
    systematically exploring all possible options or configurations to
    find a solution.

    8. What is knapsack?
    The "knapsack problem" is a classic optimization problem in
    combinatorial mathematics and computer science.
     0/1 Knapsack Problem
     Fractional Knapsack Problem
     Unbounded Knapsack Problem
    9. What is assignment problem?
    It one of the fundamental combinatorial optimization problem in
    the branch of optimization or operation research in mathematics.
    10. What is binary search?
    If q is always chosen such that a is the middle element (that is, q =
    [(n+1)/2)] then the research searching algorithm is known as
    binary search.

    CT- DAA SET – 2 (TWO MARK WITH ANS)


    1. What are the steps processing in algorithm?
     Problem
     Algorithm
     Computer
     Input
     Output

    2. What are the different problem types?


     Shorting
     Searching
     Shortest paths in a graph
     Chess
    3. What is the worst case efficiency?
    In worst case efficiency of an algorithm it is efficiency for the
    worst case input of size n, which is an input of size n is longest
    among all possible input of the size.
    4. What is space complexity?
    It is the amount of memory it need to run to the completion.
    5. What are the orders of growth?

    6. What is the internal node?


    The circular node is called the internal nodes.
    7. Define external path length?
    The internal path length is the sum of the distance of all internal
    node the root
    8. Define heap short?
    Heap sort is the sorting algorithm it has two stage
     Heap construction a heap for a given array of element
    Maximum deletion apply the root deletion operation n-1 times
    to remaining heap.
    9. Define convex hull method?
    The convex hull of a set S of point is the smallest convex set
    containing S.
    10. What different between quick short and merge short?
    Both quick short and mergeshort use the divide and conquer
    technique in which the given array is partitioned into subarrays
    and solved.the different lies in the techniques that the arrays are
    partitioned.

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy