Which statement is false?
a. insertions and deletions are made only at one end of a queue, its tail.
b. linked lists are collections of data items "lined up in a row"-- insertions and deletions can be made anywhere in a linked list.
c. binary trees facilitate high-speed searching and sorting of data.
d. insertions and deletions are made only at one end of a stack, its top.

The answer to the given question is the option "A".

Explanation:

In the Queue, there are two ends. one end is used to data insertion(enqueue) and other end-use to data deletion(dequeue). It follows the FIFO methodology that means first in first out. and all option are correct that can be described as:

That's why the answer to this question is the option "A".

solution:

this situation is called an ip conflict.

data from a server is sent in small bits called packets. in an ip conflict, some packets will end up in one computer while some other packets will end up in another computer.

so…overall none of the computers get the data as the original message or picture being sent by the server cannot be retrieved with only half the packets. so it will show up as an error.

thus the final answer is d.

solution:

the right option is a

to adding   a new row to a table we   have to do process last table cell and pressing tab.

this is the process to add new row in the cell:

* to add a row below the cell, click insert below in the rows and columns group.

thus this is the required right answer.