Scribd Logo
Upload

Welcome to Scribd!

  • 114 views

    Adaq 1

    Uploaded by

    Vinay Kanasu
    The document is a past examination paper for Computer Science from the 5th semester of a BCA program given in December 2010. It contains 16 questions across 2 sections - Section A contains 8 short answer questions worth 3 marks each, and Section B contains 4 long answer questions worth 14 marks each. The questions cover a range of algorithm analysis and design topics including asymptotic notations, algorithms for sorting, searching and matrix operations, greedy algorithms, minimum spanning trees, NP-complete problems, backtracking, and short notes on optimal storage, ordered searching and Kurskul's algorithm.

    Copyright:

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

    Adaq 1

    Uploaded by

    Vinay Kanasu
    114 views2 pages
    The document is a past examination paper for Computer Science from the 5th semester of a BCA program given in December 2010. It contains 16 questions across 2 sections - Section A contains 8 short answer questions worth 3 marks each, and Section B contains 4 long answer questions worth 14 marks each. The questions cover a range of algorithm analysis and design topics including asymptotic notations, algorithms for sorting, searching and matrix operations, greedy algorithms, minimum spanning trees, NP-complete problems, backtracking, and short notes on optimal storage, ordered searching and Kurskul's algorithm.

    Original Description:

    project for bca

    Original Title

    adaq1

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document is a past examination paper for Computer Science from the 5th semester of a BCA program given in December 2010. It contains 16 questions across 2 sections - Section A contains 8 short answer questions worth 3 marks each, and Section B contains 4 long answer questions worth 14 marks each. The questions cover a range of algorithm analysis and design topics including asymptotic notations, algorithms for sorting, searching and matrix operations, greedy algorithms, minimum spanning trees, NP-complete problems, backtracking, and short notes on optimal storage, ordered searching and Kurskul's algorithm.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    114 views2 pages

    Adaq 1

    Uploaded by

    Vinay Kanasu
    The document is a past examination paper for Computer Science from the 5th semester of a BCA program given in December 2010. It contains 16 questions across 2 sections - Section A contains 8 short answer questions worth 3 marks each, and Section B contains 4 long answer questions worth 14 marks each. The questions cover a range of algorithm analysis and design topics including asymptotic notations, algorithms for sorting, searching and matrix operations, greedy algorithms, minimum spanning trees, NP-complete problems, backtracking, and short notes on optimal storage, ordered searching and Kurskul's algorithm.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    tlmltI]ffiilililtlllt oB-81

    V Semester B.C.A. Examination, December 2010


    (New Scheme)
    COMPUTER SCIENCE
    Analysis and Design of Algorithm (5 BCA 2)

    Time : 3 Hours Max. Marks : 80

    Instruction : Answer all Sections.

    SECTION _ A

    Answer any eight questions : (8x3=24)

    1. Which are the five distinct areas to study of Algorithm ?

    2. Define Asymptotic Q (omega) notation. Show that 100 n + 5 A (n).


    3. Write an algorithm for Bubble Sort.

    4. Explain divide and conquer design technique.

    5. What is the Control Abstraction for greedy method ?

    6. What is the worst case, best case and average case of linear search ?
    7. Write the difference between divide, conquer and dynamic programming.
    8. Write an algorithm for binary search.

    9. What are Np-Complete and Np-Hard problem ?

    10. Explain the constraints that are used in Backtracking.

    SECTION _ B

    Answer any four questions : (14x4=56)

    11. a) Write a note on Asymtotic Notations.


    b) Explain Horner's method of evaluating a polynomial at a given point. (6+8)
    P.T.O.
    oB-81 m;ffiffi
    LZ. a) Explain merge sort with an algorithm.
    b) Multiply the two.mafices usiqg Strassen,s ma0jx mtltiplication.

    e=[''-l"=['
    L3 4)
    1l
    (8+6)
    2) lz
    13. a) ,Find the optimal solution for the given constraints using Greedy Knapask
    problem.

    m=40, n=4 Weights :20,25,10, 15

    Profits : 2A, 40,35, 45


    b) Explain Prim's Algorithm to find given directed graph. : ' :

    (7+7)

    14. a) Explain Prim's Algorithm to find minimum spanning,tree.


    b) Find the optimal comb.ination of chained matrix mukiplication given.
    ffit=24x13,mr=13x55
    ffi3=55x72,m0=72x19
    andn=4 (7+7\
    15. a) Explain how backtacking is used to solve Four eueen,s problem.
    b) Explain sum of subsei problem. (8+6)
    16. .Write short note on the following :

    a) Optimal storage on tapes.


    b) Ordered searching in compration ffees.
    c) Kurskul's algorithm. l4

    You might also like