Time
Showing all 24 resultsSorted by popularity
-
[SOLVED] Comp311 – it’s time to put our knowledge of combinational logic, sequential logic, timing, and memory to the test! in part 1 of this lab you will be designing a 4 bit alu that can perform addition, subtraction, and logical operations (and and or). in part 2 of this lab you will be designing a digital ram component that can read in a memory address, and either write or read to/from that address.
addition $25 Add to cart -
[SOLVED] Comp311 – now that we’re familiar with digital software simulator and combinational logic circuit design techniques, e.g., truth tables, sum of product (sop) expressions, and sop simplification using karnaugh maps, and it’s time to take things to the next level! in this lab you’re going to be wiring up a 7-segment led display!
(SOP) $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