Scribd Logo
Upload

Welcome to Scribd!

  • DAA Assignment - 4 - Tut 2

    Uploaded by

    megha.garg1
    6 views2 pages
    This document contains a tutorial sheet for the subject Design and Analysis of Algorithms. It covers computational geometry topics like lower bound theory, modular arithmetic, and the Chinese Remainder Theorem. The tutorial sheet contains three sections with multiple choice and written response questions worth various point values totaling 64 marks. Questions assess understanding of concepts like the greatest common divisor, modular inverse, lower bound theory, algorithms for GCD and sorting, Las Vegas vs Monte Carlo algorithms, minimum set cover, vertex cover, and using the Chinese Remainder Theorem to solve a system of congruences.

    Original Description:

    Original Title

    DAA Assignment_4 - Tut 2

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains a tutorial sheet for the subject Design and Analysis of Algorithms. It covers computational geometry topics like lower bound theory, modular arithmetic, and the Chinese Remainder Theorem. The tutorial sheet contains three sections with multiple choice and written response questions worth various point values totaling 64 marks. Questions assess understanding of concepts like the greatest common divisor, modular inverse, lower bound theory, algorithms for GCD and sorting, Las Vegas vs Monte Carlo algorithms, minimum set cover, vertex cover, and using the Chinese Remainder Theorem to solve a system of congruences.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    6 views2 pages

    DAA Assignment - 4 - Tut 2

    Uploaded by

    megha.garg1
    This document contains a tutorial sheet for the subject Design and Analysis of Algorithms. It covers computational geometry topics like lower bound theory, modular arithmetic, and the Chinese Remainder Theorem. The tutorial sheet contains three sections with multiple choice and written response questions worth various point values totaling 64 marks. Questions assess understanding of concepts like the greatest common divisor, modular inverse, lower bound theory, algorithms for GCD and sorting, Las Vegas vs Monte Carlo algorithms, minimum set cover, vertex cover, and using the Chinese Remainder Theorem to solve a system of congruences.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 2

    B.Tech.

    (Computer Science and Engineering)


    Semester-V
    Subject: Design and Analysis of Algorithms
    Subject code BCO023A
    Marks: 64

    CO3: Computational geometry, like Lower bound theory, modular arithmetic and CRT.

    UNIT #4 Tutorial sheet 2


    Sec-A (5x2=10marks)

    1. [CO4]- Define Modular Inverse? [2 marks]


    2. [CO4]- Find out GCD of 60 and 36. [2 marks]
    3. [CO4]- Define Modular addition. [2 marks]
    4. [CO4]- What do you mean by Lower bound theory [2 marks]
    5. [CO4]-Find out GCD of 468 and 24. [2 marks]

    Sec-B
    /* Note: Each question may have one or two parts */ (3x7=21 marks)

    6. [CO4]-Write algorithm of GCD. [7 marks]

    7. [CO4]- Differentiate between quick sort and random quick sort. [7 marks]

    8. [CO4]- Differentiate between Las Vegas and Monte Carlo algorithm. [7 marks]

    Sec-C
    /* Note: Each question may have one, two, or three parts */ [3*11=33 marks]

    9. [CO4] Find Minimum set cover [11 marks]

    10. [CO4] - Find Vertex cover from below diagram. [11 marks]
    11. [CO4]- State chinese remainder theorem. Solve the following congruence. [11 marks]
    x ≡ 1 (mod 5)
    x ≡ 1 (mod 7)
    x ≡ 3 (mod 11)

    You might also like