Options: the root is drawn on the left and is the starting point on the decision sequence, the branch, to be followed, depends on the conditions and decisions, to be made, the nodes represent the conditions, with the right wise of tree listing the actions to be taken, All of the above
Which of the following is not a limitation of binary search algorithm?
Options: a. must use a sorted array b. requirement of sorted array is expensive when a lot of insertion and deletions are needed c. there must be a mechanism to access middle element directly d. binary search algorithm is not efficient when the data elements are more than 1000.
Which of the following technique is used for fragment?
Options: a technique used in best-effort delivery systems to avoid endlessly looping packets, a technique used by protocols in which a lower level protocol accepts a message from a higher level protocol and places it in the data portion of the low level frame, one of the pieces that results when an IP gateway divides an IP datagram into smaller pieces for transmission across a network that cannot handle the original datagram size, All of the above
Options: a . a 16-bit register in the microprocessor that indicate the beginning of the stack memory. b . a register that decodes and executes 16-bit arithmetic expression. c. The first memory location where a subroutine address is stored. d . a register in which flag bits are stored