卷別

資料結構與演算法

選擇

國立臺灣大學 2023 · 考試 · 第 10 題

(5 points) Heap applications: Which one(s) of the following applications may involve the use of heaps to increase time efficiency?

(A)
Find the k largest numbers from a given stream of numbers.
(B)
Given a stream of numbers coming one after another, calculate the median of the currently received set of numbers.
(C)
Compute the page rank of a given set of web pages
(D)
Detect appropriate "buy" and "sell" requests to create transactions in stock market
(E)
Identify the next timing for collisions in event-driven simulation for molecular dynamics

標準解析

AI 已複查