Scribd Logo
Upload

Welcome to Scribd!

  • C

    Uploaded by

    Yogeswaran
    2 views1 page
    The document contains instructions for an exam with 4 coding challenges. Challenge 1 asks to write an algorithm, pseudocode, and flowchart to check if a number is a Niven number, which is divisible by the sum of its digits. Challenge 2 asks to write a program that reads an integer and displays its smallest factors in increasing order. Challenge 3 asks to create a function that takes a tuple of tuples and returns a new tuple containing the third element of each inner tuple. Challenge 4 asks to write a function that takes a list and returns a new list containing words starting with "a".

    Original Description:

    Python prob

    Original Title

    C(1)

    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
    The document contains instructions for an exam with 4 coding challenges. Challenge 1 asks to write an algorithm, pseudocode, and flowchart to check if a number is a Niven number, which is divisible by the sum of its digits. Challenge 2 asks to write a program that reads an integer and displays its smallest factors in increasing order. Challenge 3 asks to create a function that takes a tuple of tuples and returns a new tuple containing the third element of each inner tuple. Challenge 4 asks to write a function that takes a list and returns a new list containing words starting with "a".

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    2 views1 page

    C

    Uploaded by

    Yogeswaran
    The document contains instructions for an exam with 4 coding challenges. Challenge 1 asks to write an algorithm, pseudocode, and flowchart to check if a number is a Niven number, which is divisible by the sum of its digits. Challenge 2 asks to write a program that reads an integer and displays its smallest factors in increasing order. Challenge 3 asks to create a function that takes a tuple of tuples and returns a new tuple containing the third element of each inner tuple. Challenge 4 asks to write a function that takes a list and returns a new list containing words starting with "a".

    Copyright:

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

    MIT CAMPUS, ANNA UNIVERSITY

    GE 5161 - PROBLEM SOLVING AND PYTHON PROGRAMMING LABORATORY


    DEPARTMENT OF ELECTRONICS ENGINEERING
    END SEMESTER EXAM

    DATE: BATCH: ECE_SS SYSTEM NO:


    REG NO: SERIAL NO:

    Write an Algorithm, pseudocode and draw a flow chart to check whether given
    number is Niven number or not.
    Note:
    C1 A Niven number is any whole number that is divisible by the sum of its digits. 25

    For example, 126 is a Niven number because, the sum of its digits 1+ 2 + 6, is 9,
    and 9 goes into 126 exactly 14 times

    Write a program that reads an integer and displays all its smallest factors in
    increasing order.
    C2 For example: 25
    if the input integer is120, the output should be as follows: 2,2,2,3,5

    Create a function called check_third_element that takes in a tuple of tuples, tups as


    a parameter. Tuples must have at least 3 items. Return a new tuple that contains the
    third element of each tuple.
    C3 25
    For example:
    check_third_element(((1,2.2,3.3),(-1,-2,-3),(0,0,0))) would return (3.3, -3, 0).

    Write a function called listarg that takes in list as a parameter and returns a new list
    with the words from list that start with “a”.

    C4 For example: 25
    listarg(["alphabet", "apple", "banana", "coding", "amazing"]) would
    return ["alphabet", "apple", "amazing"].

    You might also like