# In _______________ copy, the base address of the objects are copied. In _______________ copy, the base address of the objects are not copied.

1.  deep. shallow

2.  memberwise, shallow

3.  shallow, deep

4.  deep, memberwise

4

shallow, deep

Explanation :
No Explanation available for this question

# The nested list undergoes shallow copy even when the list as a whole undergoes deep copy.

1.  True

2.  False

2

True

Explanation :
No Explanation available for this question

# What will be the output of the following Python code and state the type of copy that is depicted l1=[2, 4, 6, 8] l2=[1, 2, 3] l1=l2 l2

1.  [2, 4, 6, 8], shallow copy

2.  [2, 4, 6, 8], deep copy

3.  [1, 2, 3], shallow copy

4.  [1, 2, 3], deep copy

4

[1, 2, 3], shallow copy

Explanation :
No Explanation available for this question

# What will be the output of the following Python code l1=[10, 20, 30] l2=l1 id(l1)==id(l2) l2=l1.copy() id(l1)==id(l2)

1.  False, False

2.  False, True

3.  True, True

4.  True, False

4

True, False

Explanation :
No Explanation available for this question

# What will be the output of the following Python code l1=[1, 2, 3, [4]] l2=list(l1) id(l1)==id(l2)

1.  True

2.  False

3.  Error

4

False

Explanation :
No Explanation available for this question

# What will be the output of the following Python code l1=[10, 20, 30, [40]] l2=copy.deepcopy(l1) l1[3][0]=90 l1 l2

1.  [10, 20, 30, [40]][10, 20, 30, 90]

2.  Error

3.  [10, 20, 30 [90]][10, 20, 30, [40]]

4.  [10, 20, 30, [40]][10, 20, 30, [90]]

4

[10, 20, 30 [90]]
[10, 20, 30, [40]]

Explanation :
No Explanation available for this question

# In ____________________ copy, the modification done on one list affects the other list. In ____________________ copy, the modification done on one list does not affect the other list.

1.  shallow, deep

2.  memberwise, shallow

3.  deep, shallow

4.  deep, memberwise

4

shallow, deep

Explanation :
No Explanation available for this question

# What will be the output of the following Python code l1=[1, 2, 3, (4)] l2=l1.copy() l2 l1

1.  [1, 2, 3, (4)][1, 2, 3, 4]

2.  [1, 2, 3, 4][1, 2, 3, (4)]

3.  [1, 2, 3, 4][1, 2, 3, 4]

4.  [1, 2, 3, (4)][1, 2, 3, (4)]

4

[1, 2, 3, 4]
[1, 2, 3, 4]

Explanation :
No Explanation available for this question

# What will be the output of the following Python code def check(n): if n < 2: return n % 2 == 0 return check(n - 2) print(check(11))

1.  False

2.  True

3.  1

4.  An exception is thrown

4

False

Explanation :
No Explanation available for this question

# What is the base case in the Merge Sort algorithm when it is solved recursively

1.  n=0

2.  n=1

3.  A list of length one

4.  An empty list

4