Algorithm Interview Questions & Answers  Learning Mode  
COOLINTERVIEW.COM
ALGORITHM INTERVIEW QUESTIONS QUESTIONS & ANSWERS  LEARNING MODE


Algorithm Interview Questions & Answers  Learning ModeAn algorithm (pronounced ALgorithum) is a procedure or formula for solving a problem. The word derives from the name of the mathematician, Mohammed ibnMusa alKhwarizmi, who was part of the royal court in Baghdad and who lived from about 780 to 850. An algorithm is a sequence of unambiguous instructions for solving a problem, i.e., for obtaining a required output for any legitimate input in a finite amount of time. Algorithm can be defined as an outline of the essence of procedure represented in step by step instructional manner. When you implement this algorithm using any programming language, then it is said to be a program. A certain problem can be solved using many different algorithms. 

Try Algorithm Interview Questions & Answers  Exam Mode  
Algorithm Interview Questions & Answers  Learning Mode 
Try Algorithm Interview Questions & Answers  Exam Mode 
Question: Explain the depth of recursion?
Answer: This is another recursion procedure which is the number of times the procedure is called recursively in the process of enlarging a given argument or arguments. Usually this quantity is not obvious except in the case of extremely simple recursive functions, such as FACTORIAL (N), for which the depth is N. Source: CoolInterview.com 
Question: Define and describe an iterative process with general steps of flow chart?
Answer: There are four parts in the iterative process they are Initialization: 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. Source: CoolInterview.com 
Question: Given a system of N equations whose coefficient matrix A is triangular and is stored in a vector R and the right hand side vector B, this algorithm obtains the solution vector X. Sum is a temporary variable. I am M are integer variables. How to follow the algorithm?
Answer: The algorithm is easy to follow. X1 is first computed from the first equation and then substituted in the second to obtain X2 and so on. Another common application is one in which most of the elements of a large matrix are zeros. In such a case, only the non zero elements need to be stored along with their row and column sub scripts. Source: CoolInterview.com 
Question: Explain about the algorithm ORD_WORDS?
Answer: This algorithm constructs the vectors TITLE, KEYWORD and T_INDEX. Source: CoolInterview.com 
Question: How to find median of a BST?
Answer: Find the no. of elements on the left side. If it is n1 the root is the median. If it is more than n1, then it has already been found in the left subtree. Else it should be in the right subtree. Source: CoolInterview.com 
Question: How can an inductive definition be realized?
Answer: An inductive definition of a set can be realized by using a given finite set of elements A and the following three clauses. 1) Basis Clause 2) Inductive clause 3) External clause Source: CoolInterview.com 
Question: What are the two ways through which the Markov algorithm terminates?
Answer: A Markov algorithm terminates in one of the two ways. 1) The last production is not applicable 2) A terminal production is applicable A terminal production is a statement of the form x map to y., where x and y represent the strings in V* and the symbol ?.? Immediately follows the consequences. Source: CoolInterview.com 
Question: Give the difference of format between an algorithm and a sub algorithm?
Answer: The format used is the same as for algorithms except that a return statement replaces an exit statement and a list of parameters follows the sub algorithms name. Although sub algorithms may invoke each other and that a sub algorithm may also invoke itself recursively. Source: CoolInterview.com 
Question: Define and state the importance of sub algorithm in computation and its relation ship with main algorithm?
Answer: A sub algorithm is an independent component of an algorithm and for this reason is defined separately from the main algorithm. The purpose of a sub algorithm is to perform some computation when required, under control of the main algorithm. This computation may be performed on zero or more parameters passed by the calling routine. Source: CoolInterview.com 
Question: Explain the function SUB in algorithmic notation?
Answer: In the algorithmic notation rather than using special marker symbols, generally people use the cursor position plus a substring 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. Source: CoolInterview.com 
Question: Name any three skills which are very important in order to work with generating functions.
Answer: The three most important skills which are used extensively while working with generating functions are 1)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 Source: CoolInterview.com 
Question: In Algorithmic context how would you define ?book keeping operations??
Answer: Usually when a user wants to estimate time he isolates the specific function and brands it as active operation. The other operations in the algorithm, the assignments, the manipulations of the index and the accessing of a value in the vector, occur no more often than the addition of vector values. These operations are collectively called as ?book keeping operations?. Source: CoolInterview.com 
Question: How do you apply Binary Search on 2D array supposed you have 2D array with integers sorted both horizontally and vertically. If you find any occurrence of the value you are looking for you return true else false. What is the complexity? For example the 2D array could look like the following 1 4 5 6 2 5 7 9 Answer: search diagonally. diag 1 = 1 diag2 = 2,4 ?. for example given the number 7 we take the bounds of each diagonal and check wether the number will fall in that range else move farward. here diagonal selection is sequential but the number search is binary. Source: CoolInterview.com 
Question: The most basic tool used to express generating functions in closed form is the closed form expression for the geometric series, which is an expression of the form a+ar+ar2++arn. It can either be terminated or extended indefinitely. What are the restrictions for this geometric series?
Answer: If a and r represents numbers, r must not equal1 in the finite case.In the infinite case the absolute value of r must be less than 1.These restrictions don?t come into play with Generating functions. Source: CoolInterview.com 
Question: Explain about procedural body and computation boxes?
Answer: The procedural body contains two computation boxes namely, the partial and final computational boxes. The partial computation box is combined with the procedure call box. The test box determines whether the argument value is that for which explicit definition of the process is given. Source: CoolInterview.com 
Question: What is the general strategy for Markov Algorithm?
Answer: The general strategy in a Markov Algorithm is to take as input a string x and, through a number of steps in the algorithm, transform x to an output string y. this transformation process is generally performed in computers for text editing or program compilation. Source: CoolInterview.com 
Question: What are the arguments present in pattern matching algorithms?
Answer: These are the following arguments which are present in pattern matching Algorithms. 1) Subject, 2) Pattern 3) Cursor 4) MATCH_STR 5) REPLACE_STR 6) REPLACE_FLAG Source: CoolInterview.com 
Question: State recursion and its different types?
Answer: Recursion 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 concerns recursively defined function and the second type of recursion is the recursive use of a procedure. Source: CoolInterview.com 
Question: State the problems which differentiate between recursive procedure and nonrecursive procedure?
Answer: A recursive procedure can be called from within or outside itself, and to ensure its proper functioning, it has to save in same order the return address so that it return to the proper location will result when the return to a calling statement is made. The procedure must also save the formal parameters, local variables etc. Source: CoolInterview.com 
Question: Define string in an algorithmic notation and an example to support it?
Answer: In the algorithmic notation, a string is expressed as any sequence of characters enclosed in single quote marks. E.g. a single quote contained within a string is represented by two single quotes. Therefore, the string ?It is John`s program.? is represented as ?IT IS JOHN?S PROGRAM.?. Source: CoolInterview.com 
India News Network 