# Programming Algorithms Interview Questions

1.
What are the arguments present in pattern matching algorithms?
2.
Explain the function SUB in algorithmic notation?
3.
In Algorithmic context how would you define book keeping operations?
4.
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?
5.
Define and describe an iterative process with general steps of flow chart?
6.
State recursion and its different types?
7.
How can an inductive definition be realized?
8.
Explain about procedural body and computation boxes?
9.
Explain the depth of recursion?
10.
State the problems which differentiate between recursive procedure and non-recursive procedure?
11.
How do I rotate a 2D point?
12.
How do I generate a bezier curve that is parallel to another bezier?
13.
How do I find a t value at a specific point on a bezier?
14.
How do I rotate a 3D point?
15.
What is ARCBALL?
16.
17.
Write a function that finds the last instance of a character in a string
18.
Return Nth the node from the end of the linked list in one pass.
19.
Counting set bits in a number
20.
Define and state the importance of sub algorithm in computation and its relation ship with main algorithm?
21.
Give the difference of format between an algorithm and a sub algorithm?
22.
What is the general algorithm model for any recursive procedure?
23.
Explain the function of KWIC_Create?
24.
25.
Name any three skills which are very important in order to work with generating functions.
26.
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?
27.
What is the general strategy for Markov Algorithm?
28.
What are the two ways through which the Markov algorithm terminates?
29.
Define string in an algorithmic notation and an example to support it?
30.
How to find median of a BST?
31.
What are the arguments present in pattern matching algorithms?
32.
Explain the function SUB in algorithmic notation?
33.
In Algorithmic context how would you define book keeping operations?
34.
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?
35.
Define and describe an iterative process with general steps of flow chart?
36.
State recursion and its different types?
37.
How can an inductive definition be realized?
38.
Explain about procedural body and computation boxes?
39.
Explain the depth of recursion?
40.
State the problems which differentiate between recursive procedure and non-recursive procedure?
41.
How do I rotate a 2D point?
42.
How do I generate a bezier curve that is parallel to another bezier?
43.
How do I find a t value at a specific point on a bezier?
44.
How do I rotate a 3D point?
45.
What is ARCBALL?
46.
47.
Write a function that finds the last instance of a character in a string
48.
Return Nth the node from the end of the linked list in one pass.
49.
Counting set bits in a number
50.
Define and state the importance of sub algorithm in computation and its relation ship with main algorithm?
51.
Give the difference of format between an algorithm and a sub algorithm?
52.
What is the general algorithm model for any recursive procedure?
53.
Explain the function of KWIC_Create?
54.
55.
Name any three skills which are very important in order to work with generating functions.
56.
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?
57.
What is the general strategy for Markov Algorithm?
58.
What are the two ways through which the Markov algorithm terminates?
59.
Define string in an algorithmic notation and an example to support it?
60.
How to find median of a BST?
Interview Questions
Exams for Intermediate
Exams for Professional
Exams for Newcomers
Recent Exam
more..