Recent content by KongMD

Homework Statement An arithmetic circuit has two select lines S1 and S2 and does the following arithmetic operations using a full adder: [function table] Determine the simplified Boolean functions for Xi and Yi for a single stage of the circuit given inputs A & B are n-bit registers...

Thanks a ton, Mark! It's so helpful to be able to just sit down at the end of a busy day and absorb this material at my own pace. I try and get help from my professor regarding these types of problems, but sometimes those meetings are rushed, and the concepts don't stick as much. Other times our...

I thought as much. I actually had that written down as the work for my problem, but was confused because the RREF'd solution matrix doesn't include a value for x3, since it only has two rows. Does this mean that x3 is "free" and therefore there's no unique solution?

Thanks for fixing up my Latex formatting. I tried fixing more of my original post so it would be cleaner with the Latex, but I just ended up mucking it up more. I've been doing Linear Algebra and Calc II homework for the past 4 hours and my brain is fried. I have the start and end tags in the...

So, was I correct in stating n = 3 and m = 2? Also, I'm still stumped on problem #2. I don't think the Latex formatting came out right in my "attempt at a solution", so I'll post the work I've done on it here. I don't think the syntax is working, so I might just have to scan the physical...

Homework Statement Given A = \left(\begin{array}{ccc}1&-1&1\\0&1&1\end{array}\right) Why isn't Latex working for above array :( Define a transformation as T: \Re^{n} -> \Re^{m} T(\vec{x}) = A \vec{x} 1) a. What is n? b. What is m? 2) Find \vec{x} , if possible, given that...

Homework Statement +35 + -80 with only 8-bits using sign-magnitude representationHomework Equations The Attempt at a Solution Why is this possible? Allowing for one sign bit, the maximum range (in my mind) should be -63 < N < 63. I can see from my notes, however, that the limits of an 8-bit...

Ok, here's what I've done so far. There are three sets in the original question, [-1 1], [2 -2], and [1 0]. I put those in an augmented matrix like so (sorry for crummy formatting): 1 2 1 0 1 -2 0 0 Why won't this format correctly...

Yes. I thought that was the way to solve the problem, at first, but the last row in my solution matrix has the co-efficient matrix equaling 1. Shouldn't it equal 0 if it's consistent, because the solution vector is all zeros, or does consistency not matter?

Hi, everyone. I'm really at a loss as to how to solve these problems. For example, a set S of three vectors is given, and there is a supposedly a linear combination of two of the sets that equals the third set. How do I go about solving a problem like this without writing out multiples of every...