KRG Technologies Interview Questions and Answers

The dimensions of the output image will be 998 x 998.

• Output image dimensions = (input image dimensions - filter dimensions + 1) / stride

• In this case, (1000 - 3 + 1) / 1 = 998

• Therefore, the output image will be 998 x 998

Branch and bound provides a feasible solution for puzzle problems compared to backtracking.

• Branch and bound is more efficient in finding optimal solutions by pruning branches that cannot lead to a better solution.

• Backtracking explores all possible solutions before finding the optimal one, which can be inefficient for large puzzle problems.

• For example, in the traveling salesman problem, branch and bound can be used to find the shortest route by systematically exploring and eli...read more

Greedy algorithm divides the domain, while Dynamic Programming divides the data.

• Greedy algorithm focuses on making the best choice at each step without considering the overall solution, dividing the domain into subproblems.

• Dynamic Programming breaks down a problem into smaller subproblems and solves each subproblem only once, dividing the data into overlapping subproblems.

• Example: In the Knapsack problem, Greedy algorithm would choose items based on immediate benefit, while D...read more

AVL Trees are used in databases to efficiently store and retrieve data in a balanced manner.

• AVL Trees help maintain balance in database indexes, ensuring efficient search and retrieval operations.

• They are commonly used in database management systems like MySQL and Oracle.

• AVL Trees are particularly useful for range queries and ordered traversal of data in databases.

• They provide faster search times compared to unbalanced binary search trees.

• In database applications, AVL Trees h...read more

Linear data structures store data in a sequential manner, while non-linear data structures allow for more complex relationships between data points.

• Linear data structures include arrays, linked lists, queues, and stacks.

• Non-linear data structures include trees, graphs, and heaps.

• Linear data structures have a simple, one-dimensional layout, while non-linear data structures can have multiple dimensions and complex relationships between elements.

Topological sorting is a linear ordering of vertices in a directed acyclic graph where for every directed edge uv, vertex u comes before vertex v.

• Topological sorting is used in scheduling tasks with dependencies, such as in project management.

• It can be implemented using depth-first search algorithm.

• Example: In a course prerequisite graph, topological sorting can help determine the order in which courses should be taken.