Time store and top K

Questions 1 to 5 of 8

1. 1. Which statements about TimeMap are true? Select all that apply.

   Pick every answer that is true.

   upper_bound returns the first position whose time is greater than the query timeFinding the answer takes about log base 2 of n steps for n versions of one keylower_bound gives the right answer at an exact match, so it works just as wellAdding versions with push_back keeps the list sorted only when times arrive in increasing orderA key that was never set makes get return the last value set for any key
2. 2. Which statements about the two top-K methods are true? Select all that apply.

   Pick every answer that is true.

   A heap of size K over u distinct words costs about O(u log k)The bucket method needs buckets numbered 0 to n, so it has n + 1 bucketsThe bucket method works unchanged for weights such as pricesA max-heap of every distinct word is the only correct methodThe tie rule sits inside the heap comparison, so the same input gives the same output
3. 3. What does this program print? ``cpp #include <algorithm> #include <iostream> #include <iterator> #include <string> #include <vector> struct Version { int time; std::string value; }; std::string get_upper(const std::vector<Version>& v, int t) { auto after = std::ranges::upper_bound(v, t, {}, &Version::time); if (after == v.begin()) return ""; return std::prev(after)->value; } int main() { std::vector<Version> theme = {{2, "light"}, {6, "dark"}}; std::cout << get_upper(theme, 1) << '|' << get_upper(theme, 5) << '|' << get_upper(theme, 6) << '\n'; } ``

   light light dark|light|dark|dark|darklight|dark|dark
4. 4. What does this program print? ``cpp #include <iostream> #include <string> #include <unordered_map> #include <vector> using namespace std; int main() { int n = 8; unordered_map<string, int> counts = {{"the", 3}, {"and", 2}, {"cat", 1}, {"dog", 1}, {"bird", 1}}; vector<vector<string>> buckets(n + 1); for (const auto& [word, c] : counts) buckets[c].push_back(word); cout << buckets.size() << ' ' << buckets[1].size() << ' ' << buckets[4].size() << '\n'; } ``

   9 3 09 1 08 3 09 3 1
5. 5. A store has color set to red at time 1, blue at time 5 and green at time 9. What does get("color", 4) return?

   bluegreenredan empty string