LogicMaster - Set I

What will be the output of the following logic?

1. Take a number N as input.

2. If N is even, divide it by 2.

3. If N is odd, multiply it by 3 and add 1.

4. Repeat the process until N becomes 1.

What is the sequence if N = 7?

• 7 → 22 → 11 → 34 → 17 → 52 → 26 → 13 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → 2 → 1

• 7 → 21 → 10 → 5 → 16 → 8 → 4 → 2 → 1

• 7 → 3 → 10 → 5 → 1

• 7 → 14 → 28 → 56 → 1

If a number X is passed through the following steps:

1. 1. Multiply by 3

2. 2. Subtract 4

3. 3. Divide by 2

4. 4. Add 5

What is the output if X = 6?

• 11

• 12

• 13

• 14

A program runs without errors but produces incorrect output in certain cases. What type of bug is this?

• Syntax Error

• Runtime Error

• Logical Error

• Compiler Error

How to efficiently find the unique number in an array where every number appears twice except one?

• Sort the array and check adjacent pairs

• Use a hash table to store occurrences

• Perform a bitwise XOR operation across all elements

• Use two nested loops to compare each element

You are writing a function that sorts a nearly sorted array, where each element is at most 5 positions away from its correct place. What sorting algorithm will be the most efficient?

• Quick Sort

• Bubble Sort

• Heap Sort

• Insertion Sort

There are N people standing in a circle, and every k-th person is eliminated. The process continues until only one person remains. What is the best approach to solve this problem?

• Brute force simulation

• Recursion

• Mathematical formula

• Both (b) and (c)

   int x = 5;

   x = x++;

print(x);

What value of x will be printed?

• 5

• 6

• 7

• 8

In a binary tree, what is the most efficient way to find the height of the tree?

• Iterative traversal

• Pre-order traversal

• Recursive traversal

• Level order traversal

What will be the output of the following code snippet?

for(int i = 0; i < 5; i++) {
   if(i == 3) continue;
   System.out.print(i + " ");
}

What will be printed?

• 0 1 2

• 1 2 3 4

• 0 1 2 4

• 0 1 2 3 4

Which algorithm is best suited for finding the shortest path in a weighted graph?

• Dijkstra's Algorithm

• Breadth-First Search

• Depth-First Search

• Prim's Algorithm