Answer:
D.Open Addressing.
Explanation:
It is a technique to handle collision in the hashmap. According to the design of the hash function if the location provided to the element is already full or not empty then the next free location is searched and the key is inserted at that location.So it searches for an unused location in hash table so the answer is Open addressing.
Answer:
depends on which flash drive
Explanation:
32GB-1000 photos
Im alright not the best but I have done national competitions with it and linux
Answer:
Check the explanation
Explanation:
CODE:
static int findEvenQueue(Queue<Integer> numbers)
{
//loop runs till the queue has atleast one element
while(numbers.size() > 0)
{
//Checking the head of the queue whether it is even
int temp = numbers.peek();
if(temp % 2 == 0)
{
//if the head is even then return it
return temp;
}
else
{
//else remove the number at head
int removed = numbers.poll();
}
}
//if no even number present in the Queue then return -1
return -1;
}