Any electronic system that uses a computer chip, but that is not a general-purpose workstation, desktop or laptop computer. Such systems use microcontrollers (MCUs) or microprocessors (MPUs), or they may use custom-designed chips.
Answer:
Explanation:
def the_perfect(n):
try: #exception handling if n is a negative number
n > 0
except: #return -1 if the error is reached
return -1
else:
total = 0
for i in range(1, n): #for loop from 1 to the target number
if n % i == 0:
total += i
return total == n #should return true if number is perfect number
print(perfect_number(8))
Answer: n-ary relationships
Explanation:
n-ary relationships are represented using diamond links . Here we can have n number of entities involved in the relationship. The cardinality ratio for the relationship between the entities can be 1:1, 1:many, many:1, many:many.
Answer:
Yes
Explanation:
Yes, your answer correctly states the difference between RAM and ROM clearly and does not need to be changed. RAM and Cache memory are volatile memory while ROM and HDD are non-volatile memory. That is the main difference and aside from this you went into more detail on each one. Therefore, in this scenario you are correct and the individual stating "bad wrong" is the one that is incorrect, most likely because they did not fully understand the 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