If you want to use slip days you have to tell us before the deadline (by emailing Sudhanshu Gupta and Shuang Zhai). We won't by default assume slip days for late submissions.
If you code does not compile on the CSUG machine, you get a 0.
The purpose of this assignment is to become more familiar with representing and manipulating data as bits. 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.
You can choose to work individually or in pairs (2 people) on this assignment. In case of the latter, only one submission is needed.
Due Dates11:59 pm, Friday, Jan. 31.
We are providing you with a skeleton code file and testing utilities. To obtain these, type the command:
cp /u/cs252/labs20/datalab/datalab-handout.tar .which copies the files to your current directory on the CSUG machine. Then type the command:
tar xvf datalab-handout.tarto the shell. This will cause twelve files to be created in your directory:
The only file you will be modifying is
make btestto generate the test code and run it with the command:
Looking at the file
! ~ & ^ | + << >>A few of the functions further restrict this list. See the comments in
Your code will be compiled with
The 15 puzzles you must solve have been given a difficulty rating
between 1 and 4, such that their weighted sum totals to 43. We
will evaluate your functions using the test arguments in
Regarding performance, our main concern at this point in the course is that you get the right answer. However, we want to instill in you a sense of keeping things as short and simple as you can. Furthermore, some of the puzzles can be solved by brute force, but we want you to be more clever. Thus, for each function we've established a maximum number of operators that you are allowed to use for each function. This limit is very generous and is designed only to catch egregiously inefficient solutions. You will receive two points for each function that satisfies the operator limit.
Finally, we've reserved 5 points for a subjective evaluation of the style of your solutions and your commenting. Your solutions should be as clean and straightforward as possible. Your comments should be informative, but they need not be extensive.
Part I: Bit Manipulations
The table above describes a set of functions that manipulate and test sets of bits. The "rating" field gives the difficulty rating (and thus 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.
Part II: Two's Complement Arithmetic
The table above describes a set of functions that make use of the two's complement representation of integers. The "rating" and "max ops" fields have the same meaning as in Part I.
Part III: Floating Point Operations
The table above describes a set of functions that operate on the bit-level representations of (single-precision) floating-point numbers. The "rating" and "max ops" fields have the same meaning as in Part I.
In this section, you are allowed to use standard control structures
(conditionals, loops, and you may use both
You can use
You are welcome to do your code development using any system or compiler you choose. Just make sure that the version you turn in compiles and runs correctly on the CSUG Linux machines. If it doesn't compile, we can't grade it.
./dlc -e bits.cThe program runs only on the CSUG Linux machines.
Check the file
./btest -f bitXor
What/how to turn in
First make sure you are in the directory that contains
/u/cs252/bin/TURN_IN .Note that there's a dot in that command! Watch Blackboard for any clarifications or revisions to the assignment.