Word Processor all answers (figures or answers that are too awkward to type can be hand-written or hand-drawn but then must be scanned in and included in your submission). Each problem (e.g,. 1a, 1b, 2a, 3b, etc) is worth 5 points. Show your work for a chance at partial credit – if you don’t show your work and you get an answer wrong, you get it all wrong! NOTE: remember to include minus signs for any negative numbers.
1. Convert 10011000 to decimal assuming the number is stored in each of the following representations:
a. Unsigned magnitude b. Signed magnitude c. One’s complement d. Two’s complement
Word Processor all answers (figures or answers that are too awkward to type can be hand-written...
Word Processor all answers (figures or answers that are too awkward to type can be hand-written or hand-drawn but then must be scanned in and included in your submission). Each problem (e.g,. 1a, 1b, 2a, 3b, etc) is worth 5 points. Show your work for a chance at partial credit – if you don’t show your work and you get an answer wrong, you get it all wrong! NOTE: remember to include minus signs for any negative numbers. 2. Convert...
Word Processor all answers (figures or answers that are too awkward to type can be hand-written or hand-drawn but then must be scanned in and included in your submission). Each problem (e.g,. 1a, 1b, 2a, 3b, etc) is worth 5 points. Show your work for a chance at partial credit – if you don’t show your work and you get an answer wrong, you get it all wrong! NOTE: remember to include minus signs for any negative numbers. 4. Using...
(3 pts) Consider an unsigned fixed point decimal (Base10) representation with 8 digits, 5 to the left of the decimal point and 3 to the right. a. What is the range of the expressible numbers? b. What is the precision? c. What is the error? ______________________________________________________________________________ (3 pts) Convert this unsigned base 2 number, 1001 10112, to each base given below (Note: the space in the binary string is purely for visual convenience) Show your work. Using...
Please answer all three parts. And show step-by-step
answers for each part. Draw anything if necessary. And
please don't copy other answers to be at risk being downvoted.
Thank you.
Question 1 (50 POINTS): Given a graph G and the Breadth First Search (BFS) and Depth First Search (DFS) traversal algorithms as follows: BFSG) 1 for each vertex u € G.V – {3} 1 2 u.color = WHITE 3 u.d = 0 4 un = NIL 3 5 S.color =...