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 and produces some value (or set of values) as output. In summary, it can be seen as a sequence of computational steps that transform the input into the output.
2. What are the arguments present in the pattern matching algorithms?
These are the following arguments that are present in Pattern Matching Algorithms.
1) Subject,
2) Pattern
3) Cursor
4) MATCH_STR
5) REPLACE_STR
6) REPLACE_FLAG
3. Explain the SUB function in algorithmic notation?
In algorithmic notation, instead of using special marker symbols, people usually use the cursor position plus a substring length to isolate a substring. The name of the function is SUB.
SUB returns a value of the SUBJECT substring that is specified by the parameters i and j and an assumed value of j.
4. In the algorithmic context, how would you define accounting operations?
In general, when a user wants to estimate the time, it isolates the specific function and qualifies it as an active operation. The other operations in the algorithm, assignments, manipulations of the index and access to a value in the vector, occur more frequently than the addition of vector values. These operations are collectively called accounting operations.
5. Define and describe an iterative process with general flow chart steps?
There are four parts in the iterative process that are
Initialization: -The decision parameter is used to determine when to exit the loop.
Decision: -The decision parameter is used to determine whether to remain in the cycle or not.
Calculation: - The required calculation is done in this part.
Update: - The decision parameter is updated and transferred to the next iteration.
6. The recursion of the state and its different types?
Recursivity is the name given to the technique of defining a set or a process in terms of itself. There are essentially two types of recursion. The first type refers to the function defined recursively and the second type of recursion is the recursive use of a procedure.
7. Define and declare the importance of the subalgorithm in computing and its relation with the main algorithm?
A subalgorithm is an independent component of an algorithm and, for this reason, is defined separately from the main algorithm. The purpose of a secondary algorithm is to perform some calculations when necessary, under the control of the main algorithm. This calculation can be performed on zero or more parameters passed by the call routine.
8. Name three skills that are very important to work with generating functions.
The three most important skills that are widely used when working with generating functions are
1) Manipulates expressions of sum and their indices.
2) Solve algebraic equations and manipulate algebraic expressions, including partial decompositions of functions.
3) Identify sequences with their generating functions
9. What is the general strategy for the Markov algorithm?
The general strategy in a Markov algorithm is to take as input an xy string, through a series of steps in the algorithm, transform x into an output string y. This process of transformation is usually done in computers for the edition of texts or the compilation of programs.
10. Define string in an algorithmic notation and an example to support it?
In algorithmic notation, a string is expressed as any sequence of characters in single quotes.