Python Round 4

What is the time complexity of the following C code snippet?

for (int i = 0; i < n; i++) {

    for (int j = 0; j < n; j++) {

        printf("%d, %d\n", i, j);

    }

}

• O(n)

• O(n log n)

• O(n^2)

• O(2^n)

In a C++ program, if you have a loop that iterates through an array of size 'n' and performs a constant number of operations inside the loop, what is the time complexity of this operation?

• O(1)

• O(n)

• O(log n)

• O(n^2)

Consider the following C++ code snippet:

cpp

for (int i = 0; i < n; i++) {

    for (int j = 0; j < m; j++) {

        // Constant time operations

    }

}

What is the time complexity of this code snippet?

• O(n)

• O(m)

• O(n + m)

• O(n * m)

You need to store a potentially very large number of records, with data being added as it arrives. You must retrieve a record by its primary key, which arrives randomly. Records may be deleted randomly, and all modifications need to be completed promptly after submission. The dataset size is unknown, and the implementation needs to be ready in a few weeks. Who is designing the program, but a co-op student will do the programming.

Which data structure would be most suitable for this scenario?

• Ordered array

• Heap

• Hash table

• Binary search tree

• Unordered

You need to store a potentially very large number of records, with data being added as it arrives. You must retrieve a record by its primary key, which arrives randomly. Records may be deleted randomly, and all modifications need to be completed promptly after submission. The dataset size is unknown, and the implementation needs to be ready in a few weeks. Who is designing the program, but a co-op student will do the programming.

Which data structure would be most suitable for this scenario?

• Unordered

• Ordered array

• Heap

• Hash table

• Binary seach tree

Optimize the given code using for loop instead of if else :-

def factorial(n):

    if n == 0:

        return 1

    else:

        return n * factorial(n - 1)

 

num = 5

result = factorial(num)

print(f"Factorial of {num} is: {result}")

Optimize the given code using for loop instead of if else :-

def factorial(n):

    if n == 0:

        return 1

    else:

        return n * factorial(n - 1)

 

num = 5

result = factorial(num)

print(f"Factorial of {num} is: {result}")