CS274: Computer Architecture - Bitwise Logical Operators (100 Points)

Assignment Goals

The goals of this assignment are:
  1. To manipulate bitwise variables in the C programming language
  2. To write and use a Makefile

Background Reading and References

Please refer to the following readings and examples offering templates to help get you started:

The Assignment

Overview: Bitwise Operations

Consider the following C program, which computes bitwise logical operations:

#include <stdio.h>

// https://www.codegrepper.com/profile/yasha
void print_bin(unsigned int value)
{
    for (int i = 31; i >= 0; i--)
        printf("%d", (value & (1 << i)) >> i );
    putc('\n', stdout);
}

int main(void) {
  int a = 0xaa;
  int b = 0x55;

  printf("%d: ", a);
  print_bin(a);
  
  printf("%d: ", b);
  print_bin(b);

  print_bin(a & b); // and
  print_bin(a | b); // or
  print_bin(a ^ b); // xor 
  print_bin(~a); // not: note that the upper bits are assumed to be 0, and will be flipped!

  int c = 2;
  printf("%d: ", (c << 1)); // shift left
  print_bin(c << 1);

  printf("%d: ", (c >> 1)); // shift right
  print_bin(c >> 1);
}

In this lab, you will use combinations of these operations to compute several logical bitwise operations on variables that you can set.

What to Do

Write a C program to compute the following using bitwise operators, and submit this program along with a makefile that compiles and runs your code.

  1. Take two integer variable values and determine if they are equal by computing the xor of one value with the other. The xor will produce a 1 in the bit positions that are the same, and a 0 in the ones that are not. Invert this, and check if the value is equal to 0. If so, the values are the same.

  2. Check if a number is negative or positive by extracting only its sign bit (the 32nd bit for a 32-bit integer). If it is a 1, the value is negative, and it is positive or 0 if the most significant bit is 0. (hint: if you shift the value right 31 times, you’ll get the first bit of that value duplicated in all 32 places; you can AND this value with 1 to obtain the single bit, and compare that to 0 or 1).

  3. Compute the bitwise AND of two variables using the & operator. Now, use deMorgan’s law to compute the bitwise AND using only the OR (|) and NOT (~) operators. The formula is A AND B = NOT (NOT A OR NOT B).

  4. Computer network addresses are given in the form 255.255.255.255, which is four octets of 8 bit values (from 0 to 255). Some of these bits correspond to the network address, and some correspond to the specific computer address. The number of bits used in the network portion of the address is known as the netmask. For example, the address 192.168.1.12/24 indicates that the first 24 bits of the address (192.168.1) represent the network address, and the remaining 8 (32-24) bits represent the computer address (12).

Write a program to input an IP address and a netmask, and print out the decimal values of the network address and the computer address using the bitwise logical operators. (hint: if you AND 24 1’s and 8 0’s with a value, you’ll get the first 24 bits of that value). To determine an integer value of an IP address, convert each decimal octet to an 8-bit binary value (for example, 192, 168, 1, and 12). Append these values together. The netmask can be an integer value between 1 and 31. One challenge here is writing a loop that generates a bit sequence of, say, 24 bits (for a 24-bit netmask). Consider a loop that computes the bitwise OR of a value with 1. That shifts in a 1 in the least significant digit place. Then, shift this value left by 1. Repeat, and you’ve shifted in as many 1 bits as you like!

To extract the octets from a 32-bit IP address (i.e., the decimal IP address numbers), you can AND the IP address with 255 (0xFF) to obtain the least significant octet. You can AND it with 0xFF00 to get the next least significant octet, but be sure to shift it right to get rid of the eight 0 bits on the right that result from performing and AND with 0x00. Repeat for the other two octets!

Submission

In your submission, please include answers to any questions asked on the assignment page in your README file. If you wrote code as part of this assignment, please describe your design, approach, and implementation in your README file as well. Finally, include answers to the following questions:
  • Describe what you did, how you did it, what challenges you encountered, and how you solved them.
  • Please answer any questions found throughout the narrative of this assignment.
  • If collaboration with a buddy was permitted, did you work with a buddy on this assignment? If so, who? If not, do you certify that this submission represents your own original work?
  • Please identify any and all portions of your submission that were not originally written by you (for example, code originally written by your buddy, or anything taken or adapted from a non-classroom resource). It is always OK to use your textbook and instructor notes; however, you are certifying that any portions not designated as coming from an outside person or source are your own original work.
  • Approximately how many hours it took you to finish this assignment (I will not judge you for this at all...I am simply using it to gauge if the assignments are too easy or hard)?
  • Your overall impression of the assignment. Did you love it, hate it, or were you neutral? One word answers are fine, but if you have any suggestions for the future let me know.
  • Using the grading specifications on this page, discuss briefly the grade you would give yourself and why. Discuss each item in the grading specification.
  • Any other concerns that you have. For instance, if you have a bug that you were unable to solve but you made progress, write that here. The more you articulate the problem the more partial credit you will receive (it is fine to leave this blank).

Assignment Rubric

Description Pre-Emerging (< 50%) Beginning (50%) Progressing (85%) Proficient (100%)
Algorithm Implementation (60%) The algorithm fails on the test inputs due to major issues, or the program fails to compile and/or run The algorithm fails on the test inputs due to one or more minor issues The algorithm is implemented to solve the problem correctly according to given test inputs, but would fail if executed in a general case due to a minor issue or omission in the algorithm design or implementation A reasonable algorithm is implemented to solve the problem which correctly solves the problem according to the given test inputs, and would be reasonably expected to solve the problem in the general case
Code Quality and Documentation (30%) Code commenting and structure are absent, or code structure departs significantly from best practice, and/or the code departs significantly from the style guide Code commenting and structure is limited in ways that reduce the readability of the program, and/or there are minor departures from the style guide Code documentation is present that re-states the explicit code definitions, and/or code is written that mostly adheres to the style guide Code is documented at non-trivial points in a manner that enhances the readability of the program, and code is written according to the style guide
Writeup and Submission (10%) An incomplete submission is provided The program is submitted, but not according to the directions in one or more ways (for example, because it is lacking a readme writeup) The program is submitted according to the directions with a minor omission or correction needed, and with at least superficial responses to the bolded questions throughout The program is submitted according to the directions, including a readme writeup describing the solution, and thoughtful answers to the bolded questions throughout

Please refer to the Style Guide for code quality examples and guidelines.