1

2

3

4

5

6

What is a Generic Data Structure? A data structure that can store any kind of node and can be used in an application A data structure that could not only be used to store the data for a telephone listing application but also an employee record application, a store inventory application or OB. any other type of data application without modifying its code OCA and B Od none of above Program spend a lot of the execution time searching through memory to locate the data they process. True False Logarithmic Speed Complexity is worse that Linear Speed Complexity True False 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 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 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