Answer:
Explanation:
Circle(centerX, centerY, radius, fill='black', border=None,
borderWidth=2, opacity=100, rotateAngle=0, dashes=False,
align='center', visible=True)
Answer:
The program only runs 5 five since the for loop statement is limited to loop only five times.
Explanation:
In programming, a for-loop statement is used to repeat a collection of events a definite number of times. The number of loops is specified and compared with a variable to execute a block of code.
The for-loop statement in the code above declares and initializes a variable "i" to zero, runs the block of code, and increments by one if it is less than 5.
To make it run eight times, the value five should be changed to 8 instead.
Yoooo whattt?? I don’t get this but idek
Answer:
The correct answer to the following question will be Option C (Volatile type of memory).
Explanation:
Random Access Memory, a variety of computer's memory which could be retrieved accidentally i.e., some memory can be obtained without any of the previous bytes being touched.
- Volatile memory is a type of a storage in computer that only retains its information or data while powering the appliance.
- Almost all of the RAM used in Pc's for the primary storage is unstable storage.
So, Option C is the right answer.
Answer:
- def check_subset(l1, l2):
- status = False
- count = 0
- if(len(l1) > len(l2)):
- for x in l2:
- for y in l1:
- if x == y:
- count += 1
-
- if(count == len(l2)):
- return True
- else:
- return False
-
- else:
- for x in l1:
- for y in l2:
- if x==y:
- count += 1
-
- if(count == len(l1)):
- return True
- else:
- return False
-
- print(check_subset([1,4,6], [1,2,3,4,5,6]))
- print(check_subset([2,5,7,9,8], [7,8]))
- print(check_subset([1, 5, 7], [1,4,6,78,12]))
Explanation:
The key idea of this solution is to create a count variable to track the number of the elements in a shorter list whose value can be found in another longer list.
Firstly, we need to check which list is shorter (Line 4). If the list 2 is shorter, we need to traverse through the list 2 in an outer loop (Line 5) and then create another inner loop to traverse through the longer list 1 (Line 6). If the current x value from list 2 is matched any value in list 1, increment the count variable by 1. After finishing the outer loop and inner loop, we shall be able to get the total count of elements in list 2 which can also be found in list 1. If the count is equal to the length of list 2, it means all elements in the list 2 are found in the list 1 and therefore it is a subset of list 1 and return true (Line 10-11) otherwise return false.
The similar process is applied to the situation where the list 1 is shorter than list 2 (Line 15-24)
If we test our function using three pairs of input lists (Line 26-28), we shall get the output as follows:
True
True
False
