Problem:
Showing all 5 resultsSorted by popularity
-
[SOLVED] Cse222 – problem: suppose you are given a set of boxes, each specified by their height, width and depth in centimeters. all three side lengths of every box is strictly between 10 cm and 20 cm. as you should expect, one box can be placed in another if the first box can be rotated so that its height, width, and depth are respectively smaller than the height, width, and depth of the second box. boxes can be nested recursively. we call a box visible if it is not inside another box.
another $25 Add to cart -
[SOLVED] Cse222 – problem: let g = (v, e) be a directed acyclic graph with two specified vertices s and t. a vertex v ∈{/ s, t} is called an (s, t)-cut vertex if every path from s to t passes through v. if g has n vertices and m edges, then design a polynomial-time algorithm that computes all the (s, t)-cut vertices of g.
acyclic $25 Add to cart -
[SOLVED] Cse222 – problem: you have mined a large slab or marble from a quarry. for simplicity, suppose the marble slab is a rectangle measuring n centimeters in height and m centimeters in width. you want to cut the slab into smaller rectangles of integral pieces (i.e. every small rectangle piece should be a cm by b cm dimension for positive integers a and b) of various sizes. you have a marble saw that can make either horizontal or vertical cuts across any rectangular slab. at any time, you can query the spot price p[x, y] by an x cm by y cm marble rectangle in o(1)-time, for any positive integers x and y.
(i.e. $25 Add to cart -
[SOLVED] Cse222 – problem: you are given three sorted arrays a, b, and c each having n numbers. you can assume that you can compare two elements from a∪b∪c in o(1)-time. let k be an integer. design an algorithm that outputs the k-th smallest element of a∪b∪c. the running time of your algorithm must be faster than o(n). try to optimize the running time of your algorithm as much as possible.
Algorithm $25 Add to cart -