Scribd Logo
Upload

Welcome to Scribd!

  • DAA Lab2

    Uploaded by

    0129SHIBALIK DHARA
    9 views4 pages
    Shibalik Dhara is asked to write programs to test prime numbers and calculate greatest common divisors (GCD) using different algorithms. For prime numbers, the program takes 10 inputs from the keyboard and times each algorithm to determine which is faster. For GCD, programs are to be written using Euclid's algorithm, consecutive integer checking, and finding common prime factors. Time complexities and a comparison graph are required.

    Original Description:

    Original Title

    2005129 DAA lab2

    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
    Shibalik Dhara is asked to write programs to test prime numbers and calculate greatest common divisors (GCD) using different algorithms. For prime numbers, the program takes 10 inputs from the keyboard and times each algorithm to determine which is faster. For GCD, programs are to be written using Euclid's algorithm, consecutive integer checking, and finding common prime factors. Time complexities and a comparison graph are required.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    9 views4 pages

    DAA Lab2

    Uploaded by

    0129SHIBALIK DHARA
    Shibalik Dhara is asked to write programs to test prime numbers and calculate greatest common divisors (GCD) using different algorithms. For prime numbers, the program takes 10 inputs from the keyboard and times each algorithm to determine which is faster. For GCD, programs are to be written using Euclid's algorithm, consecutive integer checking, and finding common prime factors. Time complexities and a comparison graph are required.

    Copyright:

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

    Name- Shibalik Dhara

    Roll- 2005129
    Section- CSE 14
    Branch- CSE
    Q2.1) Write a program to test whether a number n, entered
    through keyboard is prime or
    not by using different algorithms you know for atleast 10 inputs
    and note down the time
    complexity by step/frequency count method for each algorithm &
    for each input.
    Finally make a comparision of time complexities found for different
    inputs, plot an
    appropriate graph & decide which algothm is faster.
    Output:
    Q2.2) Write a program to find out GCD (greatest common divisor)
    using the following three
    algorithms.
    a) Euclid’s algorithm
    b) Consecutive integer checking algorithm.
    c) Middle school procedure which makes use of common prime
    factors.
    Output:

    You might also like