Codestorm - Kriya 2025

Which of the following algorithms is used to find the shortest path in a graph with negative edge weights but no negative cycles?

• Dijkstra's Algorithm

• Bellman-Ford Algorithm

• Prim's Algorithm

• Kruskal's Algorithm

In a scenario where a sequence of digits is arranged in ascending order, which of the following options, when subjected to a binary operation of addition followed by a subtraction of the smallest digit, results in the smallest possible non-negative value?

• The largest digit added to the smallest digit

• The smallest digit subtracted from the largest digit

• The sum of all digits minus the smallest digit

• The sum of the smallest and second smallest digits

Consider the following Python code:

What will be the output when the code is executed?

• 4

• 10

• 24

• 16

Consider the following Python code: What will be the output when the code is executed?

• 12

• 42

• 15

• 27

Consider the following Python code: What will be the output when the code is executed?

• 2

• 3

• 4

• 5

Consider the following Python code: What will be the output when the code is executed?

• 20

• 31

• 38

• 40

Consider the following Python code: What will be the output when the code is executed?

• 6

• 8

• 9

• 11

In the Java Memory Model, which of the following statements accurately describes the relationship between the volatile keyword and the visibility of changes made to a variable across multiple threads?

• Declaring a variable as volatile ensures that changes to the variable are immediately visible to all threads, but it does not guarantee atomicity of operations on the variable

• import java.util.ArrayList; A volatile variable ensures that changes made to it by one thread are visible to other threads only if they use synchronized blocks to access the variable.

• Using volatile guarantees both visibility and atomicity of operations on the variable, making it a replacement for synchronized blocks in all cases.

• The volatile keyword guarantees visibility of changes to the variable across threads, but it does not ensure that any reads and writes to the variable are atomic.

A condition that is caused by a run-time error in a computer program is known as:

• Syntax error

• Fault

• Semantic error

• Exception

Consider the following Python code: def tricky_function(a, b): result = 0 while b > 0: if b % 2 == 1: result += a a = a << 1 b = b >> 1 return result output = tricky_function(7, 13) print(output) What will be the output when the code is executed?

• 70

• 84

• 91

• 100