13 views

Uploaded by Milan Antony

- Flowcharts
- g8m1l7- magnitude
- CBSE Class 9 Mathematics Worksheet (2)
- computable_function
- K.L . SIngh and v.R.ramganath
- A Simple and Effective Table Detection System From Document Images
- MDX Expressions
- g8m1l7- magnitude 2
- PropertiesAndMethods
- GE8151 Notes Pspp
- Journal of the Society for Industrial and Applied Mathematics Volume 5 Issue 1 1957 [Doi 10.1137%2F0105003] Munkres, James -- Algorithms for the Assignment and Transportation Problems
- Highly Reactive Decision Making
- Medication Calculation Review 2009
- Cs Life Universe Everything
- 03 Algorithm Properties
- If Staetement Sample Codes
- 13
- DAV-MODEL-SCHOOL-DURGAPUR-WEST-BENGAL.pdf
- Traffic Project Details
- Yuli Pinasthika-12010110126-Teaching Math for Children

You are on page 1of 3

An algorithm is a logical sequence of discrete steps that describe a complete solution to a given problem in a finite amount of time.It is the set of rules that define how a particular problem can be solved in finite number of steps.we can identify five important characteristics of algorithms. Algorithms are well-ordered Since an algorithm is a collection of operations or instructions, we must know the correct order in which to execute the instructions. If the order is unclear, we may perform the wrong instruction or we may be uncertain which instruction should be performed next. This characteristic is especially important for computers. A computer can only execute an algorithm if it knows the exact order of steps to perform. Algorithms have unambiguous operations Each operation in an algorithm must be sufficiently clear so that it does not need to be simplified. Given a list of numbers, you can easily order them from largest to smallest with the simple instruction "Sort these numbers." A computer, however, needs more detail to sort numbers. It must be told to search for the smallest number, how to find the smallest number, how to compare numbers together, etc. The operation "Sort these numbers" is ambiguous to a computer because the computer has no basic operations for sorting. Basic operations used for writing algorithms are known as primitive operations or primitives. When an algorithm is written in computer primitives, then the algorithm is unambiguous and the computer can execute it. Algorithms have effectively computable operations Each operation in an algorithm must be doable, that is, the operation must be something that is possible to do. Suppose you were given an algorithm for planting a garden where the first step instructed you to remove all large stones from the soil. This instruction may not be doable

if there is a four ton rock buried just below ground level. For computers, many mathematical operations such as division by zero or finding the square root of a negative number are also impossible. These operations are not effectively computable so they cannot be used in writing algorithms. Algorithms produce a result In our simple definition of an algorithm, we stated that an algorithm is a set of instructions for solving a problem. Unless an algorithm produces some result, we can never be certain whether our solution is correct. Have you ever given a command to a computer and discovered that nothing changed? What was your response? You probably thought that the computer was malfunctioning because your command did not produce any type of result. Without some visible change, you have no way of determining the effect of your command. The same is true with algorithms. Only algorithms which produce results can be verified as either right or wrong. Algorithms halt in a finite amount of time Algorithms should be composed of a finite number of operations and they should complete their execution in a finite amount of time. Suppose we wanted to write an algorithm to print all the integers greater than 1. Our steps might look something like this: 1. Print the number 2. 2. Print the number 3. 3. Print the number 4. . . . While our algorithm seems to be pretty clear, we have two problems. First, the algorithm must have an infinite number of steps because there are an infinite number of integers greater than one. Second, the algorithm will run forever trying to count to infinity. These problems violate our definition that an algorithm must halt in a finite amount of time. Every algorithm must reach some operation that tells it to stop. 2.Explain the concept of Mathematical expectation in average case analysis.

The concept of mathematical expectation is needed in average case analysis of algorithms. In order to understand the concept better, consider the following example. Example: Suppose, the students of MCA, who completed all the courses in //////////////////////////////////////////////////////// For full Version visit http://smudeassignments.blogspot.com/

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-nd/3.0/ or send a letter to Creative Commons, 444 Castro Street, Suite 900, Mountain View, California, 94041, USA. ///////////////////////////////////////////////////////

- FlowchartsUploaded bykallady
- g8m1l7- magnitudeUploaded byapi-276774049
- CBSE Class 9 Mathematics Worksheet (2)Uploaded byIshaan
- computable_functionUploaded byNur Yavuz
- K.L . SIngh and v.R.ramganathUploaded byBaran Yeter
- A Simple and Effective Table Detection System From Document ImagesUploaded byAnukriti Bansal
- MDX ExpressionsUploaded bygargarvind
- g8m1l7- magnitude 2Uploaded byapi-276774049
- PropertiesAndMethodsUploaded bysedmondsbrown
- GE8151 Notes PsppUploaded byaswin
- Journal of the Society for Industrial and Applied Mathematics Volume 5 Issue 1 1957 [Doi 10.1137%2F0105003] Munkres, James -- Algorithms for the Assignment and Transportation ProblemsUploaded byWenderson Cirilo
- Highly Reactive Decision MakingUploaded byRobert Hill
- Medication Calculation Review 2009Uploaded bysangkeny
- Cs Life Universe EverythingUploaded bynaomictchoi3254
- 03 Algorithm PropertiesUploaded byWondwesen Feleke
- If Staetement Sample CodesUploaded bySinclair Chinyoka
- 13Uploaded byDaniel Hastay
- DAV-MODEL-SCHOOL-DURGAPUR-WEST-BENGAL.pdfUploaded bysoumit thakur
- Traffic Project DetailsUploaded byShekhar Imvu
- Yuli Pinasthika-12010110126-Teaching Math for ChildrenUploaded byYuli Pinasthika
- Computer ArithmeticUploaded byshankar_mn1743
- 286.cuttingclothUploaded bySaik Al Maruf
- Class8 Math Unit16 NCERT TextBook English EditionUploaded bybikramhijam
- 1Uploaded bysanooppm
- Maths Exemplar Ix FullUploaded bymahender
- TILTED WINDOW DETECTION FOR GONDOLATYPED FACADE ROBOTUploaded byijctcmjournal
- Recursion in Distributed Computing - Gafni, RajsbaumUploaded byomx
- TD06_002Uploaded byapi-26622648
- JUBILEE OF “GAMMA” JOURNALUploaded byDon Hass
- Michael Keane- Does the Cantor set contain irrational algebraic numbers?Uploaded byNine000

- Logic Design 1Uploaded byMilan Antony
- BT0072 Computer Networks -1Uploaded byMilan Antony
- BT0088 Cryptography and Network Security1Uploaded byMilan Antony
- Fundamentals of IT(1)Uploaded byMilan Antony
- Logic Design 2Uploaded byMilan Antony
- Database Management System-2Uploaded byMilan Antony
- Fundamentals of IT(2)Uploaded byMilan Antony
- BT0072 Computer Networks -2Uploaded byMilan Antony
- BT0072 Computer Networks -1Uploaded byMilan Antony
- C Programming and Data Structures-2Uploaded byMilan Antony
- BT0088 Cryptography and Network Security2Uploaded byMilan Antony
- BT0062 Fundamentals of IT(2)Uploaded byMilan Antony
- Database Management System-1Uploaded byMilan Antony
- C Programming and Data Structures-1Uploaded byMilan Antony
- BT9002 Grid Computing-2Uploaded byMilan Antony
- OOPS With Java-2Uploaded byMilan Antony
- Computer Organization and Architecture-1Uploaded byMilan Antony
- Rdbms With Mysql-2Uploaded byMilan Antony
- Multimedia Systems 1Uploaded byMilan Antony
- Multimedia Systems 2Uploaded byMilan Antony
- Computer Networks 2Uploaded byMilan Antony
- Computer Networks 1Uploaded byMilan Antony
- Rdbms With Mysql-1Uploaded byMilan Antony
- Website Design 2Uploaded byMilan Antony
- Operating Systems 2Uploaded byMilan Antony
- Operating Systems 1Uploaded byMilan Antony
- Computer Organization and Architecture-2Uploaded byMilan Antony
- TCP-IP-2Uploaded byMilan Antony
- OOPS With Java-1Uploaded byMilan Antony
- TCP-IP-1Uploaded byMilan Antony

- 265AH DNV-RP-F101 Corroded PipelinesUploaded byPaul Ong
- Matrix iteration repear, modal constirbutions and static correctionUploaded byJose Leonardo Quintero Güell
- Calculations in Chemistry - CH. 13-14Uploaded byCarlos Domani
- bfitUploaded bywaffle_copter
- Astable MultivibratorUploaded bysantovaron123
- Plasma & BoseUploaded bysunma12345
- Slugs AparicionUploaded byYesi Matos
- 14-15 trans syllabusUploaded byapi-234915782
- 30526-30545-1-PBUploaded byCarlos Infante Moza
- CH10.docUploaded byAndrea Robinson
- Handout 8Uploaded byAnum Nadeem Gill
- Assessment of Learning DisabilityUploaded bynesuma
- Topology Optimization of an Additive Layer Manufactured Aerospace PartUploaded byAltairEnlighten
- me-brc_courselisting.pdfUploaded bydavidwongbx
- Ch 14 ansers.pdfUploaded byAhsan Sani
- GREPUploaded byirshad
- XIIth Maths Practice Questions 2014-15Uploaded byGokul Nath
- HJM ModelsUploaded byPrateek Sabharwal
- GATE-Electrical-Engineering-2007.pdfUploaded byAyan
- conveyor structure designUploaded byAizaz Shaikh
- Mandatory Portfolio Disclosure, Stock Liquidity, And Mutual Fund PerformanceUploaded bymnhasan150
- Predictive Drivers of Students Satisfaction in Open Distance Learning in Sri LankaUploaded byIJARP Publications
- Project MatlabUploaded byKriss_Ps
- 2004-224-finalUploaded bySuraj Kumar
- Secure Data Collection in Wireless Sensor NetworksUploaded byJega Deesan
- Writing an Interpreter in Go Thorsten Ball7262(Www.ebook Dl.com)Uploaded byAditya Singh
- 4024_y18_syUploaded byjesudassaj
- 7a Hw-rational NumbersUploaded byEric Morales
- Chapter 5 ForecastingUploaded byimnotactive
- hypoDD45Uploaded byblacklotus21