﻿ CS97-quiz1|学霸联盟

# 一站式論文代寫,英国、美国、澳洲留学生Essay代寫—FreePass代写

CS97-quiz1

## Timed quiz 1

Problem 1 (40 pts).

Men, women and yupi live on the planet Alphaomega. Imagine you find yourself in the city Aleph on this planet. You know that a generous yupi lives there who gives a flying car to a person when he first meets this person. You also know that there is a big letter Y on the house of the generous yupi and there are no other houses with this sign. You want to get a flying car but you don’t know where the generous yupi lives and other inhabitants of Aleph cannot help you because you don’t know their language and they don’t know your language. Design an algorithm that will allow you to find the generous yupi if you know that his castle is at one of the intersections in Aleph.

b) Up to 40 pts for an efficient algorithm with estimation of its time complexity.

Problem 2 (30 pts).

Problem 3 (30 pts).

In every instance of the Stable Spaceship Matching, there is a stable matching containing a pair (c, s)

If it is true, give a short explanation and design an algorithm.

If it is false, give a counterexample and explain that it is correct.

Essay_Cheery