Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
3 views

Algorithm checkup

An algorithm is a well-defined computational procedure that transforms input values into output values. Key concepts include pattern matching arguments, bookkeeping operations, iterative processes, recursion types, and sub algorithms, which are essential for computation. Additionally, skills for generating functions and the strategy for Markov Algorithms are highlighted, along with the definition of strings in algorithmic notation.

Uploaded by

ishimwelukaku08
Copyright
© © All Rights Reserved
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
3 views

Algorithm checkup

An algorithm is a well-defined computational procedure that transforms input values into output values. Key concepts include pattern matching arguments, bookkeeping operations, iterative processes, recursion types, and sub algorithms, which are essential for computation. Additionally, skills for generating functions and the strategy for Markov Algorithms are highlighted, along with the definition of strings in algorithmic notation.

Uploaded by

ishimwelukaku08
Copyright
© © All Rights Reserved
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 1

1. Define the concept of an algorithm.

An algorithm is any well-defined computational procedure that takes some value (or
set of values) as input andproduces some value (or set of values) as output. In
short, it can be seen as a sequence of computational steps thattransform the input
into the output.
2.What are the arguments present in pattern matching algorithms?
These are the following arguments which are present in pattern matching
Algorithms.1) Subject,2) Pattern3) Cursor 4) MATCH_STR5) REPLACE_STR6) REPLACE_FLAG
3. Explain the function SUB in algorithmic notation?
In the algorithmic notation rather than using special marker symbols, generally
people use the cursor position plus asubstring length to isolate a substring. The
name of the function is SUB.SUB returns a value the sub string of SUBJECT that is
specified by the parameters i and j and an assumed value of j.
4. In Algorithmic context how would you define book keeping operations?
Usually when a user wants to estimate time he isolates the specific function and
brands it as active operation. Theother operations in the algorithm, the
assignments, the manipulations of the index and the accessing of a value in
thevector, occur no more often than the addition of vector values. These operations
are collectively called as “bookkeeping operations”.
5. Define and describe an iterative process with general steps of flow chart?
There are four parts in the iterative process they areInitialization: -The decision
parameter is used to determine when to exit from the loop.Decision: -The decision
parameter is used to determine whether to remain in the loop or not.Computation: -
The required computation is performed in this part.Update: - The decision parameter
is updated and a transfer to the next iteration results.
6. State recursion and its different types?
Recursion is the name given to the technique of defining a set or a process in
terms of itself. There are essentiallytwo types of recursion. The first type
concerns recursively defined function and the second type of recursion is
therecursive use of a procedure.
7. Define and state the importance of sub algorithm in computation and its relation
ship with mainalgorithm?
A sub algorithm is an independent component of an algorithm and for this reason is
defined separately from the mainalgorithm. The purpose of a sub algorithm is to
perform some computation when required, under control of the mainalgorithm. This
computation may be performed on zero or more parameters passed by the calling
routine.
8. Name any three skills which are very important in order to work with generating
functions.
The three most important skills which are used extensively while working with
generating functions are1)Manipulate summation expressions and their
indices.2)Solve algebraic equations and manipulate algebraic expressions, including
partial function decompositions.3)Identify sequences with their generating
functions
9. What is the general strategy for Markov Algorithm?
The general strategy in a Markov Algorithm is to take as input a string x and,
through a number of steps in thealgorithm, transform x to an output string y. this
transformation process is generally performed in computers for textediting or
program compilation.
10. Define string in an algorithmic notation and an example to support it?
In the algorithmic notation, a string is expressed as any sequence of characters
enclosed in single quote mar

You might also like