Crowdly

Додати до Chrome

Університети
learning.monash.edu
FIT2004 Algorithms and data structures - S2 2026

FIT2004 Algorithms and data structures - S2 2026

Шукаєте відповіді та рішення тестів для FIT2004 Algorithms and data structures - S2 2026? Перегляньте нашу велику колекцію перевірених відповідей для FIT2004 Algorithms and data structures - S2 2026 в learning.monash.edu.

Отримайте миттєвий доступ до точних відповідей та детальних пояснень для питань вашого курсу. Наша платформа, створена спільнотою, допомагає студентам досягати успіху!

Consider the undirected graph below and Kruskal's algorithm for computing a minimum spanning tree. In which order are the edges added to the solution?

graph

4th edge

7th edge

5th edge

2nd edge

6th edge

1st edge

8th edge

3rd edge

Переглянути це питання

Consider the undirected graph below and Prim's algorithm for computing a minimum spanning tree using node S as the source node. In which order are the edges added to the solution?

graph

4th edge

7th edge

5th edge

2nd edge

6th edge

1st edge

8th edge

3rd edge

Переглянути це питання

A binary search tree holding

n keys, built by inserting the keys in already-sorted order, has height of order:

O(n)

$O(\log n)$ O(\log n)

❌

$O(n \log n)$ O(n \log n)

O(1)

Переглянути це питання

Using the convention that height is the number of edges on the longest root-to-leaf path: how many nodes in total does a perfect binary tree of height

3 contain?

Переглянути це питання

Using the convention that height is the number of edges on the longest root-to-leaf path: a perfect binary tree of height

3 has how many LEAF nodes?

Переглянути це питання

A code has

2 positions, and each position is filled independently by one of

26 symbols (repetition allowed). How many different codes are possible?

Переглянути це питання

Consider

factorial(k): if

k = 0 return 1, else return $k \cdot factorial(k-1)$ k \cdot factorial(k-1). How many times is factorial invoked in total (counting the initial call and the base-case call) to compute

factorial(7)?

Переглянути це питання

Consider a directed, weighted graph G with |V| vertices and |E| edges. What is the worst-case time complexity of finding the vertex with the greatest number of edges, counting incoming and outgoing together, if G is implemented using an adjacency matrix?

θ(|E|)

θ(1)

θ(|V|+|E|)

θ(|V|^2)

θ(|V| log |V|)

θ(|E| log |E|)

θ(|E|^2)

θ(|V|)

Переглянути це питання

Consider a directed, weighted graph G with |V| vertices and |E| edges. What is the worst-case time complexity of listing all the outgoing edges of the vertex that has the most outgoing edges, if G is implemented using an unsorted adjacency list?

θ(|E|)

θ(1)

θ(|V|+|E|)

θ(|V|^2)

θ(|V| log |V|)

θ(|E| log |E|)

θ(|E|^2)

θ(|V|)

Переглянути це питання

Consider a directed, weighted graph G with |V| vertices and |E| edges. What is the worst-case time complexity of determining whether G contains an edge between vertices u and v (in either direction), if G is implemented using an unsorted adjacency list?

θ(|E|)

❌

θ(1)

θ(|V|+|E|)

θ(|V|^2)

θ(|V| log |V|)

θ(|E| log |E|)

θ(|E|^2)

θ(|V|)

Переглянути це питання