Programming Logic

Trace this pseudocode:

SET result = 0
FOR i FROM 1 TO 5
    result = result + i
ENDFOR
PRINT result

What is the output?

SET x = 10
WHILE x > 0
    PRINT x
    x = x - 3
ENDWHILE

What does this pseudocode compute?

FUNCTION mystery(n)
    IF n == 0 RETURN 1
    RETURN n * mystery(n - 1)
END FUNCTION
PRINT mystery(5)

Trace this pseudocode:

SET a = 1, b = 1
FOR i FROM 3 TO 7
    c = a + b
    a = b
    b = c
ENDFOR
PRINT b

What is printed?

SET count = 0
FOR i FROM 1 TO 20
    IF i MOD 3 == 0 OR i MOD 5 == 0
        count = count + 1
ENDFOR
PRINT count

What is the value of result after this pseudocode runs?

SET arr = [3, 1, 4, 1, 5, 9, 2, 6]
SET result = arr[0]
FOR i FROM 1 TO 7
    IF arr[i] > result
        result = arr[i]
ENDFOR
PRINT result

What is the output of this pseudocode?

SET n = 153
SET temp = n, sum = 0
WHILE temp > 0
    digit = temp MOD 10
    sum = sum + digit^3
    temp = temp DIV 10
ENDWHILE
IF sum == n THEN PRINT "Armstrong" ELSE PRINT "Not Armstrong"

What does this find?

SET a = 12, b = 8
WHILE b != 0
    temp = b
    b = a MOD b
    a = temp
ENDWHILE
PRINT a

A flowchart has these steps: START → Set x=1 → [x ≤ 5?] YES → Print x → x = x+2 → back to [x ≤ 5?] → NO → STOP What values are printed?

A flowchart processes input N: START → Read N → [N > 0?] YES → Print "Positive" → STOP; NO → [N < 0?] YES → Print "Negative" → STOP; NO → Print "Zero" → STOP If N = 0, what is printed?

A flowchart: START → count=0, i=1 → [i ≤ N?] YES → [i%2==0?] YES → count++ → i++ → back to loop; NO → i++ → back to loop; NO → Print count → STOP For N=10, what is count?

What is the time complexity of Binary Search?

Which sorting algorithm has the best average-case time complexity?

What is the space complexity of a recursive function that calls itself n times without any other data structure?

A function runs nested loops:

for i in range(n):
    for j in range(i, n):
        # O(1) operation

What is the time complexity?

Which data structure is most efficient for implementing a LIFO (Last In, First Out) operation?

What is the recurrence relation for Merge Sort, and what does the Master Theorem give as its complexity?

What is the difference between == and === in JavaScript?

What is the output?

int x = 5;
System.out.println(x++);
System.out.println(x);

What does the `static` keyword mean for a class method in Java?

What is the difference between a shallow copy and a deep copy of an object?

What is a NULL pointer exception and when does it occur?

What does DRY stand for in software development?

What is the output?

x = 10
if x > 5:
    print("A")
elif x > 8:
    print("B")
else:
    print("C")

What is the output?

for i in range(5):
    if i == 3:
        break
    print(i)

What is the output?

for i in range(5):
    if i == 3:
        continue
    print(i)

What is printed by this switch-like code (Java)?

int n = 2;
switch(n) {
    case 1: System.out.print("one ");
    case 2: System.out.print("two ");
    case 3: System.out.print("three ");
    default: System.out.print("done");
}

What is the length of the string "Hello World"?

What is the output?

s = "TCS NQT 2024"
words = s.split()
print(words[1])

What is the result of:

"Python"[2:5]

Which data structure works on FIFO (First In, First Out) principle?

What is the time complexity of searching an element in an unsorted array?

In a Binary Search Tree (BST), what is the time complexity of search, insert, and delete in the average case?

What is the minimum number of nodes in a complete binary tree with height 3?

What is the output?

x = True
y = False
print(x and y)
print(x or y)
print(not x)

What is wrong with this code intended to find if a number is prime?

def is_prime(n):
    for i in range(2, n):
        if n % i == 0:
            return False
    return True

What does this code do?

def f(lst):
    return [x for x in lst if x > 0]

What is the output of this code?

d = {"a": 1, "b": 2, "c": 3}
for k, v in d.items():
    if v % 2 == 0:
        print(k)

What is the result of 5 AND 3 (bitwise)?

What does x << 2 do for x = 3?

What is polymorphism in OOP?

What is the difference between an abstract class and an interface in Java?

What is encapsulation in OOP?

Find the bug:

def sum_list(lst):
    total = 0
    for i in range(len(lst)):
        total += lst[i]
    return total

result = sum_list([1, 2, 3, 4])
print(result)

Find the bug in this binary search:

def binary_search(arr, target):
    left, right = 0, len(arr)
    while left < right:
        mid = (left + right) // 2
        if arr[mid] == target:
            return mid
        elif arr[mid] < target:
            left = mid + 1
        else:
            right = mid - 1
    return -1

What pattern does this code implement?

def solve(n):
    if n <= 1:
        return n
    if memo[n] != -1:
        return memo[n]
    memo[n] = solve(n-1) + solve(n-2)
    return memo[n]

What is the time complexity of this code?

n = 100
i = 1
while i < n:
    i *= 2

What does this pseudocode return for input [5, 2, 8, 1, 9]?

FUNCTION process(arr)
    SET result = arr[0]
    FOR each x in arr
        IF x < result THEN result = x
    RETURN result
END

What is the output?

def outer():
    x = 10
    def inner():
        nonlocal x
        x += 5
        return x
    return inner

f = outer()
print(f())
print(f())

What is the purpose of a try-except block in Python?