Advertisements

Algorithm Interview Questions

Below we have listed all the **Algorithm Interview Questions** and answers. Feel free to comment on any **Algorithm Interview Questions** or answer by the comment feature available on the page.

To buy an eBook containing 30,000 Interview Questions, with Answers, **Click Here**.

View All **Algorithm Interview Questions & Answers** - **Exam Mode** /
**Learning Mode**

An algorithm (pronounced AL-go-rith-um) is a procedure or formula for solving a problem. The word derives from the name of the mathematician, Mohammed ibn-Musa al-Khwarizmi, 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.

Explain the depth of recursion? | |||

Define and describe an iterative process with general steps of flow chart? | |||

Name any three skills which are very important in order to work with generating functions. | |||

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? | |||

Define string in an algorithmic notation and an example to support it? | |||

Give the difference of format between an algorithm and a sub algorithm? | |||

Explain the function of KWIC_Create? | |||

Define and state the importance of sub algorithm in computation and its relation ship with main algorithm? | |||

How can an inductive definition be realized? | |||

Explain the function SUB in algorithmic notation? | |||

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 |
|||

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? | |||

Explain about procedural body and computation boxes? | |||

What are the arguments present in pattern matching algorithms? | |||

What are the two ways through which the Markov algorithm terminates? | |||

State recursion and its different types? | |||

Explain about the algorithm ORD_WORDS? | |||

How to find median of a BST? | |||

State the problems which differentiate between recursive procedure and non-recursive procedure? | |||

What is the general strategy for Markov Algorithm? |

India News Network |