1

2

3

4

5

Which of the following prototypes are valid inheritance/child class Client of the parent class Person ? public class client inherits Person public class client extends Person public class Client public class Client child Person How do you calculate the memory complexity? OA. = information bytes / total bytes B = infomation bytes / (information bytes + overhead bytes) c. = total bytes OD. = information bytes Which of the statements below are valid statements about queue? In a queue, you can delete the node from the bottom of the stack (that been in the structure the longest time) B.Queues have a linear O(n) speed complexity In a queue, you can fetch the node from the top of the stack (that been in the structure the shortest time) Queue have a constant (1) speed complexity OD Which of the statements below are valid statements about stacks? A In a stack, you can fetch the node from the top of the stack (that been in the structure the shortest time) Stacks have a constant (1) speed complexity Stacks have a linear O(n) speed complexity In a stack, you can delete the node from the bottom of the stack (that been in the structure the longest time) Which of the statements below are valid statements about unsorted-optimized array-based structures? Fetch operation is slower than the sorted array . n B. Have a linear O(n) speed complexity All values are optimized in sorted order of the key field The Insert method is the same as the unsorted array, but Fetch, Delete and Update are optimized