Computer Science 220
Assembly Language & Computer Architecture
Fall 2011, Siena College
Lecture 0x02: Logical and Bitwise Operations
Date: Tuesday, September 13, 2011
Agenda
- Announcements
- Lecture assignment guidance: last year the total lecture
assignment points available was 150, so a lecture assigment point
will likely correspond to about 0.1 final average points.
- Lab 0 is in, should be graded soon
- Lab 1 this week: some C programming
- Lecture assignment 0x01 recap
- Bitwise and logical operations
Lecture Assignment 0x02
Due at the start of class, Thursday, September 15.
Please submit answers to these questions
either as a hard copy (typeset or handwritten are OK) or by email to
jteresco AT siena.edu by the start of class. Please use a clear subject line
when submitting by email (e.g., CS 220 Lecture
Assignment 0x02, Joe Student). We will discuss these
questions at the start of class, so no late submissions are
accepted.
- True or false: The signed product of two signed n-bit numbers
can always be correctly expressed as a signed 2n-bit number.
Justify your answer. (2 points)
- Compute each of the following assuming all numbers are stored as
6-bit 2's complement values: (5 points, 1 each)
7 << 2
-13 << 2
5 & -17
5 | -17
~17
Examples
- shiftyproduct (will go over this one in lab)