HACKATHON HUSTLE(ROUND 1)

which of the following python code gives output 9?(a=5,b=4)

• data = a & b

  a = a ^ b

  b = data << 1

• data = a & b

  a = a ^ b

  b = data >> 1

• data = a ^ b

  a = a & b

  b = data << 1

• data = a >> b

  a = a & b

  b = a^b

Is python supports multi-threading?

• No
• Yes

which of the following code will replaces space with a given character in python?

• string = "Hello World"
  character = "-"
  new_string = string.replace(" ", character)
  print(new_string)

• string = "Hello World"
  character = "-"
  table = str.maketrans(" ", character)
  new_string = string.translate(table)
  print(new_string)

• Both 1 &2

• None

If two lists containing the same elements at different positions are called

(ex: silent and listen)

What does URL stand for?

• Uniform Resource Locator
  

• Uniform Resource Location

• Uniform Reset Locator

• Unified Resource Locator

1. Which of the following is a graph traversal algorithm?

• Breadth first search

• Depth first search

• Dijkstra's algorithm

• All of the above

What is the output of the following program?

from math import *

a = 2.13

b = 3.7777

c = -3.12

print(int(a), floor(b), ceil(c), fabs(c))

• 2 3 -4 3

• 2 3 -3 3.12

• 2 4 -3 3

• 2 3 -4 3.12 

What is the time complexity for checking if an undirected graph with E edges and V vertices is Bipartite, given its adjacency matrix?

• O(E)

• O(V*V)

• O(E*E)

• O(V)

An unrestricted use of the "goto" statement is harmful because

• It reduces the risk of errors
• It improves code readability
• It makes debugging easier
• It can make the code difficult to understand and maintain.

Which of the following statements are CORRECT?

1) Static allocation of all data areas by a compiler makes it impossible to implement recursion.

2) Automatic garbage collection is essential to implement recursion.

3) Dynamic allocation of activation records is essential to implement recursion.

4) Both heap and stack are essential to implement recursion.

• 1 and 2 only

• 2 and 3 only

• 3 and 4 only

• 1 and 3 only