  ### Question 41127  Verified

Data Science

Given the start vertex s = a in the weighted directed graph below, use the following table to show the result of Dijkstra’s Algorithm (reference Section 8.4).(12 Points)

### Question 41126  Verified

Data Science

Briefly describe the two different ways to find a path given the start vertex and the end vertex in a graph. (6 Points)

### Question 41125  Verified

Data Science

Given a graph G=(V, E), what is its adjacent matrix and what is its incident matrix? (8Points)

### Question 41124  Verified

Data Science

Assume that an array has n elements. Prove that the complexity of the binary search isO(log. n). (10 Points)

### Question 41123  Verified

Data Science

Assume that an array has n elements. Prove that the complexity of the sequential search isO(n). (10 Points)

### Question 41122  Verified

Data Science

Assume that the elements in the integer array a are in ascending order. Complete the recursive binary search function below that returns the index of the target value t: (10Points)

### Question 41121  Verified

Data Science

a) What is a priority queue?A priority queue takes item's priority into account. When items in the queue are accessed, the item with the highest priority is accessed first.

. Answer the following questions: (12 Points)

b) What is a binary search tree?

c) What is a heap?

### Question 41120  Verified

Data Science

3. Complete the integer queue class defined below: (12 Points)

### Question 41119  Verified

Data Science

Complete the integer stack class defined below: (10 Points)

### Question 41118  Verified

Data Science

1. Assume that f(n) = 2n² + 3n +1. Figure out M, N>0, when n>N, |f(n)|<M|n²l, i.e.f(n)=O(n³). (10 Points)

### Submit query        