Book Your slot
X
ONLINE BOOKING
BOOK NOW
OFFLINE BOOKING
Call or WhatsApp 7993732682 (WhatsApp Now), 9177341827 (WhatsApp Now)
search
Menu Login home
  • Questions

  • Library

  • University Updates

  • Informatives

  • Technology Lines

  • Training & Internships

  • X
    Menu
  • Home
  • Privacy Policy
  • Legal Disclaimer
  • Terms & Conditions
  • Return Policy
  • About Us
  • Need any help?? write to us at

    support@engineershub.co

    Follow Us

    X
    LOGIN
    Login to access posts, links, updates, question papers, materials, one liners!
    Use Your Email Address/Mobile and Password to Login
    Forgot Password?
    Not a member? Sign Up
    LOGIN WITH EMAIL/MOBILE
    Forgot Password?
    Go Back
    FORGOT PASSWORD
    Go Back
    RESET PASSWORD
    Go Back
    Continue with LinkedIn
    OR
    Fill Up a Simple Form
    Already a Member? Login
    SIGN UP
    Fill all the below details correctly and click on Next
    Go Back
    Define algorithm? - EngineersHub
    Go Back
    Question
    Anandam Lokesh
    4 months ago
    1 Answer(s) posted Write an answer 201
    Answer
    Read Mode
    Answer posted by Lalitha Chandra Mythily Manogna Koduri
    3 months ago

    Definition: A method of representing the step – by – step logical procedure for solving a problem in natural language (like English, etc.) is called an algorithm.

    Algorithm can also be defined as an ordered sequence of well-defined and effective operations that, when executed, will always produce a result and eventually terminate in a finite amount of time. Note: Algorithm written in English language is called Pseudo code.

    Properties an Algorithm should possess:
    a. Generality: The algorithm must be complete in itself so that it can be also used to solve all problems of a specific type for any input data.
    b. Input / Output: Each algorithm can take zero; one or more input data and must produce one or more output values.
    c. Optimization: Unnecessary steps should be eliminated so as to make the algorithm terminate an infinite number of steps.
    d. Effectiveness: Each step must be effective in the sense that it should be primitive (easily convertible into a program statement) and can be performed exactly in a finite amount of time.
    e. Definiteness: Each step of the algorithm should be precisely and unambiguously stated.

    Users Joined

    sathvika
    1 day ago
    Ajay Kumar
    1 day ago
    Samarth Kulkarni
    2 days ago
    Vaishu
    2 days ago
    Noohi Sadiya
    2 days ago
    X
    Define algorithm?
    X
    Define algorithm?

    Definition: A method of representing the step – by – step logical procedure for solving a problem in natural language (like English, etc.) is called an algorithm.

    Algorithm can also be defined as an ordered sequence of well-defined and effective operations that, when executed, will always produce a result and eventually terminate in a finite amount of time. Note: Algorithm written in English language is called Pseudo code.

    Properties an Algorithm should possess:
    a. Generality: The algorithm must be complete in itself so that it can be also used to solve all problems of a specific type for any input data.
    b. Input / Output: Each algorithm can take zero; one or more input data and must produce one or more output values.
    c. Optimization: Unnecessary steps should be eliminated so as to make the algorithm terminate an infinite number of steps.
    d. Effectiveness: Each step must be effective in the sense that it should be primitive (easily convertible into a program statement) and can be performed exactly in a finite amount of time.
    e. Definiteness: Each step of the algorithm should be precisely and unambiguously stated.

    EngineersHub Logo
    x
    Loading...