Scribd Logo
Upload

Welcome to Scribd!

  • 29 views

    Shiv Nadar University CSD101: Introduction To Computing and Programming Lab #3 Number Based Basic C Programs

    Uploaded by

    Ansh Sagroha
    This document contains instructions for 3 programming assignments: 1) Write programs that calculate integer division and remainder without operators, and count even/odd digits in a number. 2) Write programs that determine if a number is prime, print the first n primes, and print the first n pairs of twin primes. 3) Write a program that takes a monetary amount as input and outputs the minimum number of coins/notes needed to make change using Indian denominations of 1, 2, 5, 10, 20, 50, 100, 200, 500, 2000.

    Copyright:

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

    Shiv Nadar University CSD101: Introduction To Computing and Programming Lab #3 Number Based Basic C Programs

    Uploaded by

    Ansh Sagroha
    29 views1 page
    This document contains instructions for 3 programming assignments: 1) Write programs that calculate integer division and remainder without operators, and count even/odd digits in a number. 2) Write programs that determine if a number is prime, print the first n primes, and print the first n pairs of twin primes. 3) Write a program that takes a monetary amount as input and outputs the minimum number of coins/notes needed to make change using Indian denominations of 1, 2, 5, 10, 20, 50, 100, 200, 500, 2000.

    Original Title

    lab3

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains instructions for 3 programming assignments: 1) Write programs that calculate integer division and remainder without operators, and count even/odd digits in a number. 2) Write programs that determine if a number is prime, print the first n primes, and print the first n pairs of twin primes. 3) Write a program that takes a monetary amount as input and outputs the minimum number of coins/notes needed to make change using Indian denominations of 1, 2, 5, 10, 20, 50, 100, 200, 500, 2000.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    29 views1 page

    Shiv Nadar University CSD101: Introduction To Computing and Programming Lab #3 Number Based Basic C Programs

    Uploaded by

    Ansh Sagroha
    This document contains instructions for 3 programming assignments: 1) Write programs that calculate integer division and remainder without operators, and count even/odd digits in a number. 2) Write programs that determine if a number is prime, print the first n primes, and print the first n pairs of twin primes. 3) Write a program that takes a monetary amount as input and outputs the minimum number of coins/notes needed to make change using Indian denominations of 1, 2, 5, 10, 20, 50, 100, 200, 500, 2000.

    Copyright:

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

    Shiv Nadar University

    CSD101: Introduction to Computing and Programming


    Lab #3
    Number based basic C programs

    Max marks: 80.


    Due on/before:17.00, 11-Sep-2021. 4-Sep-2021

    1. (a) Write a program that reads two integers m and n (either or both could be negative) and prints the
    quotient and the remainder when m is divided by n. The remainder should be always positive. The
    division should not be done using built in C operators but by repeated subtraction.
    (b) Write a program that reads an integer n and prints out the number of even digits and odd digits in the
    number. For example, if n = 8793421 then the output should be Even=3, Odd=4, if n = 1000001 then
    Even=5, Odd=2
    [15,15=30]

    2. This question is on prime numbers.


    (a) A prime number is one that is divisible by 1 and itself. The smallest prime is 2. By convention 1 is not
    considered a prime. Write a program that reads in a number and outputs ”Prime” if it is a prime and
    ”Not Prime” if it is not.
    (b) Using the above as a function write a program that reads a positive integer, say n, and prints out the
    first n primes.
    (c) Twin primes are pairs of primes whose difference is 2. For example, the first few twin primes are:
    (3, 5), (5, 7), (11, 13), (17, 19), (29, 31) . . .. The twin prime conjecture states that there are infinitely many
    such twin primes. Assuming this conjecture is true (it is yet to be proved) write a program to read a
    positive integer n and print the first n twin prime pairs.
    [10,10,10=30]

    3. Consider the problem of creating change for a certain amount of money by using the minimum number of
    coins/notes. So, assuming we have coins/notes of the following denominations1, 2, 5, 10, 20, 50, 100, 200, 500, 2000
    (as we do in India) write a program that reads in a positive number as amount and then outputs the minimum
    number of notes/coins and their denominations that will make up the amount.
    So, if we had to make up the amount 63, we have 63 = 50 + 10 + 2 + 1 and the output should be:
    Number: 4
    Denominations: 50=1 10=1 2=1 1=1
    To make up 3295 we have 3295 = 2000 + 500 + 500 + 200 + 50 + 20 + 20 + 5 so the output should be:
    Number=8
    Denominations: 2000=1 500=2 200=1 50=1 20=2 5=1
    Think about why you believe your program uses the minimum number of notes/coins. [20]

    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