Mca4040 analysis and design of algorithm

Mca4040 analysis and design of algorithm

• 1.
  Dear students getfully solved assignments Send your semester & Specialization name to our mail id : help.mbaassignments@gmail.com or call us at : 08263069601 ASSIGNMENT PROGRAM MCA(REVISED FALL 2012) SEMESTER FOURTH SUBJECT CODE & NAME MCA4040- ANALYSIS AND DESIGN OF ALGORITHM CREDIT 4 BK ID B1480 MARKS 60 Answer all questions Q1 . List and explain the properties of Algorithms. Answer: Data structure - Define an algorithm.What are the propertiesof an algorithm? - Feb 27, 2010, 11:15 am by RajmeetGhai Define analgorithm.Whatare the propertiesof analgorithm?Whatare the typesof algorithms? An algorithmisaseriesof stepsor methodologyto solve aproblem. Propertiesof analgorithm:- It iswritteninsimple English. Each stepof an algorithmisunique andshouldbe self explanatory. An algorithmmusthave atleastone input. An algorithmmusthave atleastone output. Q2. Write a note on sequential search. Answer: When data items are stored in a collection such as a list, we say that they have a linear or sequentialrelationship.Eachdata item is stored in a position relative to the others. In Python lists, these relative positions are the index values of the individual items. Since these index values are
• 2.
  ordered,itis possible forus to visit them in sequence. This process gives rise to our first searching technique, the sequential search. Q3. Explain topological sort with an example. Answer: In computer science, a topological sort (sometimes abbreviated topsort or toposort) or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering. For instance, the verticesof the graphmay representtaskstobe performed,andthe edgesmayrepresentconstraints that one task mustbe performedbefore another; in this application, a topological ordering is just a valid sequence for the tasks. A topological ordering is possible if and only if the graph has no directed cycles, that is, if it is a directed acyclic Q. 4. Explain good-suffix and bad-character shift in Boyer-Moore algorithm. Answer: In computer science, the Boyer–Moore string search algorithm is an efficient string searching algorithm that is the standard benchmark for practical string search literature. It was developed by Robert S. Boyer and J Strother Moore in 1977. The algorithm preprocesses the string beingsearchedfor(the pattern),butnotthe stringbeingsearchedin(the text).Itisthuswell-suited for applications in which the pattern is much shorter than the text or where it persists across multiple searches. The Boyer-Moore algorithm uses information gathered during the preprocess step to skip sections of the text, resulting in a Q5. Explain Lower – Bound Arguments? What are the methods help to make an algorithm more efficient? Answer: If two algorithmfor solving the problem where discovered and their times differedby an order of magnitude, the one with the smaller order was generally regarded assuperior. THE PURPOSE OF LOWER BOUND THEORY Is to find some techniques that havebeen used to establish that a given alg is the most efficient possible. THE SOLUTION OR TECHNIQUE Q6. Write an approximation algorithms for NP – Hard Problems. Answer : In computer science and operations research, approximation algorithms are algorithms usedto findapproximate solutions to optimization problems. Approximation algorithms are often associated with NP-hard problems; since it is unlikely that there can ever be efficient polynomial-
• 3.
  time exact algorithmssolving NP-hard problems, one settles for polynomial-time sub-optimal solutions. Unlike heuristics, which usually only find Dear students get fully solved assignments Send your semester & Specialization name to our mail id : help.mbaassignments@gmail.com or call us at : 08263069601