[SOLVED] COMP 201 - Assignment 1 - Data Lab - Manipulating Bits

30.00 $

Category:

Description

5/5 - (3 votes)

1          Introduction

The purpose of this assignment is to become more familiar with bit-level representations of integers and floating point numbers. You’ll do this by solving a series of programming “puzzles.” Many of these puzzles are quite artificial, but you’ll find yourself thinking much more about bits in working your way through them.

2          Logistics

This is an individual project. All handins are electronic. Clarifications and corrections will be announced on Blackboard.

3          Handout Instructions

3.1     How to start

  • Accept the GitHub Classroom assignment using the link: https://classroom.github.com/a/1lzbJayA
  • Clone the GitHub repository created for you to a Linux machine in which you plan to do your work (We advice you to do your work on our linux servers [linuxpool.ku.edu.tr]. See Section 8 for details.) :

$ git clone https://github.com/COMP201-Fall/comp201-fall20-assign1-USER.git (Replace USER with your GitHub username that you use to accept the assignment)

3.2     Task

There are a number of files in the directory. The only file you will be modifying and turning in is bits.c.

The bits.c file contains a skeleton for each of the 15 programming puzzles. Your assignment is to complete each function skeleton using only straightline code for the integer puzzles (i.e., no loops or conditionals) and a limited number of C arithmetic and logical operators. Specifically, you are only allowed to use the following eight operators:

! ˜ & ˆ | + << >>

A few of the functions further restrict this list. Also, you are not allowed to use any constants longer than 8 bits. See the comments in bits.c for detailed rules and a discussion of the desired coding style.

4          The Puzzles

This section describes the puzzles that you will be solving in bits.c.

4.1      Bit Manipulations

Table 1 describes a set of functions that manipulate and test sets of bits. The “Rating” field gives the difficulty rating (the number of points) for the puzzle, and the “Max ops” field gives the maximum number of operators you are allowed to use to implement each function. See the comments in bits.c for more details on the desired behavior of the functions. You may also refer to the test functions in tests.c. These are used as reference functions to express the correct behavior of your functions, although they don’t satisfy the coding rules for your functions.

Name Description Rating Max Ops
isZero(x) Is x == 0? 1 2
implication(x,y) x -> y in propositional logic[1] 2 5
twoDigitNumberInBaseFour(x,y)[2] Integer equivalent of (xy)4 2 4
multThreeEighths(x) Multiply x by 3/8 rounding toward 0 3 12
bang(x) Compute !n without using ! operator 4 12

Table 1: Bit-Level Manipulation Functions.

4.2      Two’s Complement Arithmetic

Table 2 describes a set of functions that make use of the two’s complement representation of integers. Again, refer to the comments in bits.c and the reference versions in tests.c for more information.

Name Description Rating Max Ops
tmax() Most positive two’s complement integer 1 4
isOppositeSigns(x,y) Do x and y have different signs? 3 6
conditional(x,y,z) Same as x ? y : z 3 16

Table 2: Two’s Complement Arithmetic Functions

4.3      Floating-Point Operations

For this part of the assignment, you will implement some common single-precision floating-point operations. In this section, you are allowed to use standard control structures (conditionals, loops), and you may use both int and unsigned data types, including arbitrary unsigned and integer constants. You may not use any unions, structs, or arrays. Most significantly, you may not use any floating point data types, operations, or constants. Instead, any floating-point operand will be passed to the function as having type unsigned, and any returned floating-point value will be of type unsigned. Your code should perform the bit manipulations that implement the specified floating point operations.

Table 3 describes a set of functions that operate on the bit-level representations of floating-point numbers. Refer to the comments in bits.c and the reference versions in tests.c for more information.

Name Description Rating Max Ops
float_abs(uf) Compute |f| 2 10
float_f2i(uf) Compute (int) f 4 30

Table 3: Floating-Point Functions. Value f is the floating-point number having the same bit representation as the unsigned integer uf.

Functions float_abs and float_f2i must handle the full range of possible argument values, including not-a-number (NaN) and infinity. The IEEE standard does not specify precisely how to handle NaN’s, and the IA32 behavior is a bit obscure. We will follow a convention that for any function returning a NaN value, it will return the one with bit representation 0x7FC00000.

The included program fshow helps you understand the structure of floating point numbers. To compile fshow, switch to the handout directory and type:

$ make

You can use fshow to see what an arbitrary pattern represents as a floating-point number:

$ ./fshow 2080374784

Floating point value 2.658455992e+36

Bit Representation 0x7c000000, sign = 0, exponent = f8, fraction = 000000 Normalized. 1.0000000000 X 2ˆ(121)

You can also give fshow hexadecimal and floating point values, and it will decipher their bit structure.