cse-110-homework-2-2

cse-110-homework-2-2 - (NOT A) AND (B XOR C) 3. Write a for...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Name: Student ID # CSE 110 Homework 2 Due: Monday, October 18, at the start of class. Homework 2 should be turned in on paper . This assignment is worth a total of 12 points. You must show all work in order to receive any credit for your solutions. 1. Decode the following bit pattern using the following Foating-point format: 1 sign bit, 8 bits of exponent (the bias is 127), and 23 bits of mantissa. (3 points) 1100 0010 0100 1011 0000 0000 0000 0000 2. Draw a diagram that uses Boolean gates to implement the following expression: (3 points)
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: (NOT A) AND (B XOR C) 3. Write a for loop in Java that prints the integer values from 1 up through n , counting by inc . or example, if n is 25 and inc is 5, the loop would print the sequence 1 6 11 16 21 You may assume that the integer variables n and inc have already been declared and assigned values. Just write the code for the for loop! (4 points) 4. Translate -32 (base 10) into 8-bit two s complement representation. (2 points)...
View Full Document

This note was uploaded on 12/06/2011 for the course CSE 110 taught by Professor Shaunakpawagi during the Fall '08 term at SUNY Stony Brook.

Ask a homework question - tutors are online