1. What is the output of the following code?

x = [1, 2, 3]
y = x
y.append(4)
print(x)

2. Which of the following data types is immutable in Python?
A) List
B) Dictionary
C) Set
D) Tuple

3. Write a Python program to reverse a string without using built-in functions.

4. What will be printed by this code?

def func(a, b=[]):
    b.append(a)
    return b

print(func(1))
print(func(2))

5. Explain the difference between == and is operators in Python.

6. How do you handle exceptions in Python? Provide an example.

7. What is the output of:

print(2 ** 3 ** 2)

8. Which keyword is used to define a function in Python?
A) def
B) function
C) func
D) define

9. Write a program to find the factorial of a number using recursion.

10. What does the *args parameter do in a function?

11. What will be the output of:

list1 = [1, 2, 3]
list2 = list1.copy()
list2[0] = 10
print(list1)

12. Explain the concept of list comprehension with an example.

13. What is the purpose of the __init__ method in a Python class?

14. Write a program to check if a given string is a palindrome.

15. What is the output of:

a = [1, 2, 3]
b = a[:]
b[0] = 10
print(a)

16. Describe how Python manages memory (garbage collection).

17. What will be printed by:

x = "hello"
y = "world"
print(x + y)

18. Write a Python program to generate the first n Fibonacci numbers.

19. What is the difference between range() and xrange() in Python 2?

20. What is the use of the lambda function in Python? Give an example.

#PythonQuiz #CodingTest #ProgrammingExam #MultipleChoice #CodeOutput #PythonBasics #InterviewPrep #CodingChallenge #BeginnerPython #TechAssessment #PythonQuestions #SkillCheck #ProgrammingSkills #CodePractice #PythonLearning #MCQ #ShortAnswer #TechnicalTest #PythonSyntax #Algorithm #DataStructures #PythonProgramming

By: @DataScienceQ 🚀

1. What is the output of the following code?

import numpy as np
a = np.array([[1, 2], [3, 4]])
b = a.T
b[0, 0] = 99
print(a)

2. Which of the following functions is used to create an array with values spaced at regular intervals?
A) np.linspace()
B) np.arange()
C) np.logspace()
D) All of the above

3. Write a function that takes a 1D NumPy array and returns a new array where each element is squared, but only if it’s greater than 5.

4. What will be printed by this code?

import numpy as np
x = np.array([1, 2, 3])
y = x.copy()
y[0] = 5
print(x[0])

5. Explain the difference between np.meshgrid() and np.mgrid in generating coordinate matrices.

6. How would you efficiently compute the outer product of two vectors using NumPy?

7. What is the result of np.sum(np.eye(3), axis=1)?

8. Write a program to generate a 5x5 matrix filled with random integers from 1 to 100, then find the maximum value in each row.

9. What happens when you use np.resize() on an array with shape (3,) to resize it to (5,)?

10. Which method can be used to flatten a multi-dimensional array into a 1D array without copying data?

11. What is the output of this code?

import numpy as np
arr = np.array([[1, 2, 3], [4, 5, 6]])
result = arr[[0, 1], [1, 2]]
print(result)

12. Describe how np.take() works and provide an example using a 2D array.

13. Write a function that calculates the Euclidean distance between all pairs of points in a 2D array of coordinates.

14. What is the purpose of np.frombuffer() and when might it be useful?

15. How do you perform matrix multiplication using np.matmul() and @ operator? Are they always equivalent?

16. Write a program to filter out all elements in a 2D array that are outside the range [10, 90].

17. What does np.nan_to_num() do and why is it important in numerical computations?

18. How can you efficiently transpose a large 3D array of shape (100, 100, 100) using np.transpose() or swapaxes()?

19. Explain the concept of "views" vs "copies" in NumPy and give an example where a view leads to unexpected behavior.

20. Write a function that computes the covariance matrix of a dataset represented as a 2D NumPy array.

#NumPy #AdvancedPython #DataScience #InterviewPrep #PythonLibrary #ScientificComputing #MachineLearning #CodingChallenge #HighLevelNumPy #PythonDeveloper #TechnicalInterview #DataAnalysis

By: @DataScienceQ 🚀

Advanced Competitive Programming Interview Test (20 Questions)

1. Which of the following time complexities represents the most efficient algorithm?
A) O(n²)
B) O(2ⁿ)
C) O(log n)
D) O(n log n)

2. What will be the output of the following code?

   def mystery(n):
       if n <= 1:
           return 1
       return n * mystery(n - 1)
   print(mystery(5))
   

3. Write a function to find the longest increasing subsequence in an array using dynamic programming.

4. Explain the difference between BFS and DFS in graph traversal, and when each is preferred.

5. Given a sorted array of integers, which algorithm can be used to find a target value in O(log n) time?
A) Linear search
B) Binary search
C) Bubble sort
D) Merge sort

6. What is the time complexity of the following code snippet?

   for i in range(n):
       for j in range(i, n):
           print(i, j)
   

7. Write a program to implement Dijkstra's algorithm for finding the shortest path in a weighted graph.

8. What does the term "greedy choice property" refer to in greedy algorithms?

9. Which data structure is most suitable for implementing a priority queue efficiently?
A) Stack
B) Queue
C) Binary heap
D) Linked list

10. What will be the output of this code?

    import sys
    sys.setrecursionlimit(10000)
    def f(n):
        if n == 0:
            return 0
        return n + f(n-1)
    print(f(999))
    

11. Implement a recursive function to compute the nth Fibonacci number with memoization.

12. Describe the concept of divide and conquer with an example.

13. What is the space complexity of quicksort in the worst case?
A) O(1)
B) O(log n)
C) O(n)
D) O(n²)

14. Write a function that checks whether a given string is a palindrome using recursion.

15. In the context of competitive programming, what is the purpose of using bit manipulation?

16. What will be the output of the following code?

    s = "abc"
    print(s[1:3] + s[0])
    

17. Design a solution to find the maximum sum subarray using Kadane’s algorithm.

18. Explain the concept of backtracking with an example (e.g., N-Queens problem).

19. Which of the following problems cannot be solved using dynamic programming?
A) Longest common subsequence
B) Matrix chain multiplication
C) Traveling Salesman Problem
D) Binary search

20. Given two strings, write a function to determine if one is a permutation of the other using character frequency counting.

#CompetitiveProgramming #Algorithms #InterviewPrep #CodeForces #LeetCode #ProgrammingContest #DataStructures #AlgorithmDesign

By: @DataScienceQ 🚀