Shop
Showing 5761–5772 of 10642 results
-
CSE222 – GTU Department of Computer Engineering Solved
$ 24.99 -
CSE222 – GTU Department of Computer Engineering Solved
$ 29.99 -
CSE222 – GTU Department of Computer Engineering Solved
$ 24.99 -
CSE222 – GTU Department of Computer Engineering Solved
$ 20.99 -
CSE222 – GTU Department of Computer Engineering Solved
$ 29.99 -
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. Solved
$ 35.00 -
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. Solved
$ 20.00 -
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. Solved
$ 30.00 -
CSE222-505 – Solved
$ 20.99 -
CSE222-505 – GTU Department of Computer Engineering Solved
$ 24.99 -
CSE222-505 – GTU Department of Computer Engineering Solved
$ 20.99 -
CSE222-505 – GTU Department of Computer Engineering Solved
$ 20.99