Answer:
Direct Mapped Cache
Explanation:
Given that a Direct Mapped Cache is a form of mapping whereby each main memory address is mapped into precisely one cache block.
It is considered cheaper compared to the associative method of cache mapping, and it is faster when searching through it. This is because it utilizes a tag field only.
Hence, The method of mapping where each memory location is mapped to exactly one location in the cache is "Direct Mapped Cache"
Answer:
The correct option is A
Explanation:
In project management, earliest finish time for activity A refers to the earliest start time for succeeding activities such as B and C to start.
Assume that activities A and B comes before C, the earliest finish time for C can be arrived at by computing the earliest start-finish (critical path) of the activity with the largest EF.
That is, if two activities (A and B) come before activity C, one can estimate how long it's going to take to complete activity C if ones knows how long activity B will take (being the activity with the largest earliest finish time).
Cheers!
The pen drive was invented in 1998 by IBM
Answer:
I am writing a python program for this.
def deal3(input_list, index):
list = []
for x in range(len(input_list)):
if x != index:
list.append(input_list[x])
print('list ->',list)
input_list = [10, 20, 30, 40, 50]
index = 2
deal3(input_list, index)
Explanation:
- The first line of code defines a function deal3 which has two parameters. input_list which is an input list and index is the position of elements in the input list.
- next statement list=[] declares a new list that will be the output list.
- next statement for x in range(len(input_list)): is a loop which the loop variable x will traverse through the input list until the end of the input list is reached.
- the next statement if x != index: checks if x variable is equal to the position of the element in the list.
- Next statement list.append(input_list[x]) appends the elements of input list to list( new list that will be the output list). Now the output list will contain all the elements of the input list except for the element in the specified position (index variable).
- this statement print('list ->',list) prints the list (new output list).
- this statement input_list = [10, 20, 30, 40, 50] insert elements 10 20 30 40 50 in the input list.
- index=2 specifies the second position (3rd element) in the list that is to be removed.
- deal3(input_list, index) So the function is called which will remove 3rd element of the input list and prints output array with same elements as that in input array except for the element at the specified position.
