multiple choice questions

true and false questions

When using an array to implement a list ADT, what is the time complexity (Big-Oh) for finding an element in the list with N elements? 1. 2. If we enqueue 'C', 'O', M', and 'P' onto a queue, what letter will be returned when we perform the operations cout next-head; head = new node; B. head = new node; node->next node->next head; head; new new head = new node; delete new node; new headnew node; C. = D. node->next head->next ; = 1. A data structure is a particular way of organizing data in a computer, and it is how we implement the data in an abstract data type. 2. Given two algorithms with growth rate functions f(N)-(N+N)/3 and g(N) 100N log2 N, the algorithm with growth rate g(N) grows faster than the algorithm with growth rate f (N)