Question

CS 20A: batar Santa Monica College Spring 2019 Namen Multiple Choice: Circle the answer that fits best and write out your letter choice into the provided Suppose that items A, B, C, D, and E are pushed, in that order, onto an initially empty stack. Then the stack is popped four times, each time an item as popped it is ther inserted into an initially empty queue. If two itemns are then popped from the queue, space. what is the next item that will be removed from the queue at d. D e. E Consider the following function: 2. int recurse(int a, int b) ( 2) return a if (axb else - b); return recurse(a + b, a What is returned by the call recurse(7,2)? a. 5 b. 7 c. 9 d. 10 14 e. Suppose the following values were inserted into a binary search tree: 6, 7, 10 24, 8, 27, 30, 31, 33, 42, and 63. How would you classify such a tree's comple 3. N)O b. 0(N) a. c. 0(log, N) 0(N log, N)

Answer 1

1) Stack input

E

D

C

B

A

AFTER POPPED

A

QUEUE INSERTION: E D C B

QUEUE POPPED: E D

QUEUE CONTAINS : C B

1) c. C Since we can see next item will be C

2) e. 14

Solution:

(7,2)

7%2 = 1 != 2

therefore else condition run recurse(9,5)

Again:

9%5 = 1!=2

therefore else condition run recurse(14,4)

14%4 = 2==2 return a=14;

therefore Ans 14

3.c log N

Since,, insertion complexity is O(h) where h is height of tree and h = log N

/* Please Upvote (thank you in advance) */