Computer Science Quiz

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

Which two java statements, added independently at the beginning of the program, allow the code to compile?

• import java.util.Hash*;

• import java.util.HashSet;

• import java.util.ArrayList;

• import java.util.Collections;

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: What will be the output when the code is executed?

• 70

• 84

• 91

• 100