Answer saved Marked out of 1 Flag question The array called arr with the elements arr={ 46, 78, 90, 91, 95, 100, 101) and the key element as 100. Find the mid values of First and Second level recursion. 91 and 95 91 and 100 0 90 and 100 90 and 95 Clear my choice Wer saved Marked out of a is a complete tree. Every internal node has exactly k children or no children. Find unbere pas question a(b-1) +1 O (a-1)+1 O (2-1) b-1 ab Clear my choice Tous nage N Which of the Sorting Algorithm does not have a worst case running time of Oly? O Quick Sort Insertion Sort O Merge Sort O Selection Sort Clear my choice chestion Question 15 Answer saved Marked out of 1 P Flag question what does it mean algorithm A is asymptotically more efficient than algorithm B? O A will be the first choice for all inputs than B A will be a better choice for all inputs except for large inputs OB will be the first choice for the small inputs than A O A will be a better choice for all inputs except for small inputs PARA orked out of 1 Heap can be used as Passion O Circular Queue O Double Ended Queue Priority Queue Clear my choice onacci number Int fibonacci(inta) ifac=1 return a return Complete the line O fibonaccia-1) + Fibonacci(+1) fibonaccia). Fibonacci(a) O fibonacci(a-1). Fibonacci(-2) O Fibonacci(a) - Fibonacci(a-1) Clear my choice LO Answer saved Marked out of Flag question The array has elements am={3,4,5,2,1). The number of iterations in selection sorti 1 4 5 O2 Clear my choice Not yet answered Marked out of 1 Question 19 Flag question Consider the Code below and assume that array listed elements are sorted in ascending order: P Flag question Which of the following is true about a doubly linked list? 1. It required more space than a singly linkedlist The insertion and deletion of a node take a bit longer 3. Implementing a doubly linked list is difficult than singly linked list 2 4. We can move in one direction 1, 2, 4 are True 2,3 are True 1, 2, 3 are True O 1,2 are True Answer saved Marked out of 1 Flag question The array called arr with the elements arr={ 46, 78, 90, 91, 95, 100, 101) and the key element as 100. Find the mid values of First and Second level recursion. 91 and 95 91 and 100 0 90 and 100 90 and 95 Clear my choice Wer saved Marked out of a is a complete tree. Every internal node has exactly k children or no children. Find unbere pas question a(b-1) +1 O (a-1)+1 O (2-1) b-1 ab Clear my choice Tous nage N Which of the Sorting Algorithm does not have a worst case running time of Oly? O Quick Sort Insertion Sort O Merge Sort O Selection Sort Clear my choice chestion Question 15 Answer saved Marked out of 1 P Flag question what does it mean algorithm A is asymptotically more efficient than algorithm B? O A will be the first choice for all inputs than B A will be a better choice for all inputs except for large inputs OB will be the first choice for the small inputs than A O A will be a better choice for all inputs except for small inputs PARA orked out of 1 Heap can be used as Passion O Circular Queue O Double Ended Queue Priority Queue Clear my choice onacci number Int fibonacci(inta) ifac=1 return a return Complete the line O fibonaccia-1) + Fibonacci(+1) fibonaccia). Fibonacci(a) O fibonacci(a-1). Fibonacci(-2) O Fibonacci(a) - Fibonacci(a-1) Clear my choice LO Answer saved Marked out of Flag question The array has elements am={3,4,5,2,1). The number of iterations in selection sorti 1 4 5 O2 Clear my choice Not yet answered Marked out of 1 Question 19 Flag question Consider the Code below and assume that array listed elements are sorted in ascending order: P Flag question Which of the following is true about a doubly linked list? 1. It required more space than a singly linkedlist The insertion and deletion of a node take a bit longer 3. Implementing a doubly linked list is difficult than singly linked list 2 4. We can move in one direction 1, 2, 4 are True 2,3 are True 1, 2, 3 are True O 1,2 are True