- To do this project, you must obtain a copy of the prepared
files with EGTAPI
Use project code hw7
You will have create a hw7 folder containing these program files:
Makefile Makefile for homework 7 LinkedBitArray.h Header file containing: (1) the struct definition for segment (2) the typedef of BitArray (3) function headers in LinkedBitArray.c LinkedBitArray.c C Project file for hw7 where you write 6 functions to implement a linked Bit Array "class" (object) sieve.c C Project file for hw7 where you use the bit array object to write the Sieve of Eratsothenes test1.c Test program for the Allocate() function test2.c Test program for the clrAll() function test3.c Test program for the setAll() function test4.c Test program for the clrBit() function test5.c Test program for the setBit() function test6.c Test program for the testBit() function
sieve.c C project file for the bonus part test7.c Test program for the bonus part
- As you know from Java,
a class (object)
consists of:
- (Instance) variables (= data structure)
- (Instance) methods (= algorithm) to maintain the variables
Since C does not have classes to organize = (package) the variables (= data structure) and methods (= algorithm) into a coherent unit (= "class"), I like to show you how this is done in C programming with a header file and a C program file
HW7 basically introduces software engineering in C, i.e.: how do you define a object "class" (= struct) in C and write functions that manipulate objects of that "class".
I use "class" loosely here because C does not have classes.
-
Take a look at the
header file
LinkedBitArray.h.
- The bits[ ] array in the
first segment will
contains the first segment
of the bit array
I.e.: the first segment will accommodate the bit indexes from 0 to SIZE_OF_SEG*sizeof(int)*8 (= # int variables * # bytes in an int variable * 8 bits in the int variable = # bits in a segment)
- BitArray Allocate(int N): Allocates a bit array (= linked list of segments) that have at least N bits (total) and return the pointer to the first segment
- void clrAll(BitArray A): Clear all bits (to 0) in all array elements in the bits[ ] array that starts at A
- void setAll(BitArray A): Set all bits (to 1) in all array elements in the bits[ ] array that starts at A
- void clrBit(BitArray A, int k): Clear (only) bit k in bitarray that starts at A
- void setBit(BitArray A, int k): Set (only) bit k in bitarray that starts at A
- int testBit(BitArray A, int k): Test bit k in bitarray that starts at A. Return 0 if bit k is reset, otherwise return a non zero value
#define SIZE_OF_SEG 256 // # int variables in one segment
#define BITS_PER_SEG (SIZE_OF_SEG*sizeof(int)*8) // # bits in one segment
struct segment
{
int bits[SIZE_OF_SEG]; // bit array stored in one segment
struct segment *next; // Link to the next segment
};
typedef struct segment * BitArray;
|
The header file: LinkedBitArray.h contains the definitions of the struct segment "object" that you will need to maintain.
The struct segment "object" consists of (1) an integer array bits[ ] (that will be used as a bit array) and (2) a link variable next:
The int array bits[ ] consists of SIZE_OF_SEG variables (and SIZE_OF_SEG is defined as 256). This array will be used as a bit array. The way we use an int array to represent a bit array has been discussed in the lectures and you have used it in homework 5, so I will not repeat it here again. There is - however - a twist in this implementation (see next pargraph).
Unlike in homework 5 where we define a large array, you will create a dynamic bit array by chaining a number of struct segment objects into a linked list as follows:
Suppose the variable A points to the first struct segment; then the next variable of this segment will point to the next segment; and so on.
Furthermore:
|
|
For your convenience, the header file LinkedBitArray.h contains the BITS_PER_SEG constant which is equal to the # bits in one segment
You will need to implement the following 6 functions used to maintain the linked bit array data structure:
|
|
Note: you may noticed that Allocate() returns a BitArray type and wonder what that is. The answer is inside the LinkedBitArray.h header file:
typedef struct segment * BitArray;
|
- In order to grade HW7 in a
piece meal fashon, I have include
my solution in
a compiled
C program file:
sol.o
- In each of the test C program file,
(except in test1.c),
I will use
my solution to
create linked list of
struct segment and
then test
your implementation of the
function.
Therefore, each part can be worked on independently
- Part 1: (30 pts)
- Write the function
BitArray Allocate(int N)
that allocates a bit array that have
at least (>=)
N bits
Recall there are BITS_PER_SEG bits in one segment. You must allocated sufficient segments for a total of N bits (and you need to link the segments into a linked list)
- Write the function
BitArray Allocate(int N)
that allocates a bit array that have
at least (>=)
N bits
- How to
compile and
test your
insertAt() function:
- Use test1.c to
test your Allocate( ) function.
- To compile
the test1 program
make test1
- To run
the test1 program,
type this command:
test1
- Use test1.c to
test your Allocate( ) function.
- Part 2: (15 pts)
- Write the function
clrAll(BitArray A)
that clear
all bits
(to 0) in all array elements
in the bits[ ] array
that starts at
A
You need to traverse all the segment in the bit array and clear all elements in the bits[ ] array in each segment
You must clear an int variable with 1 assignment statement; do not use a loop to clear individual bits
- Write the function
clrAll(BitArray A)
that clear
all bits
(to 0) in all array elements
in the bits[ ] array
that starts at
A
- How to
compile and
test your
clrAll() function:
- Use test2.c to
test your clrAll( ) function.
It will use my my_Allocate()
to allocate a bit array and
then call your
clrAll() to clear
all the bits.
- To compile
the test2 program
make test2
- To run
the test2 program,
type this command:
test2
- Use test2.c to
test your clrAll( ) function.
It will use my my_Allocate()
to allocate a bit array and
then call your
clrAll() to clear
all the bits.
- Part 3: (15 pts)
- Write the function
setAll(BitArray A)
that set
all bits
(to 1) in all array elements
in the bits[ ] array
that starts at
A
You need to traverse all the segment in the bit array and set all elements in the bits[ ] array in each segment
You must set an int variable with 1 assignment statement; do not use a loop to set individual bits
- Write the function
setAll(BitArray A)
that set
all bits
(to 1) in all array elements
in the bits[ ] array
that starts at
A
- How to
compile and
test your
setAll() function:
- Use test3.c to
test your setAll( ) function.
It will use my my_Allocate()
to allocate a bit array and
then call your
setAll() to clear
all the bits.
- To compile
the test3 program
make test3
- To run
the test3 program,
type this command:
test3
- Use test3.c to
test your setAll( ) function.
It will use my my_Allocate()
to allocate a bit array and
then call your
setAll() to clear
all the bits.
- Part 4: (15 pts)
- Write the function
clrBit(BitArray A, int k)
that clear
bit k
(to 0) in the bit array that start at
A
You need to traverse to the correct segment in the linked list and then clear the correct bit in the correct array element bits[ ]
Remember that the first segment is used for the first BITS_PER_SEG bits in the bit array.
- Write the function
clrBit(BitArray A, int k)
that clear
bit k
(to 0) in the bit array that start at
A
- How to
compile and
test your
clrBit() function:
- Use test4.c to
test your clrBit( ) function.
It will use my my_Allocate()
to allocate a bit array,
set all the bits to 1 with my
my_setAll() and
then call your
clrBit() to clear
some of the bits.
- To compile
the test4 program
make test4
- To run
the test4 program,
type this command:
test4
- Use test4.c to
test your clrBit( ) function.
It will use my my_Allocate()
to allocate a bit array,
set all the bits to 1 with my
my_setAll() and
then call your
clrBit() to clear
some of the bits.
- Part 5: (15 pts)
- Write the function
setBit(BitArray A, int k)
that set
bit k
(to 1) in the bit array that start at
A
You need to traverse to the correct segment in the linked list and then set the correct bit in the correct array element bits[ ]
Remember that the first segment is used for the first BITS_PER_SEG bits in the bit array.
- Write the function
setBit(BitArray A, int k)
that set
bit k
(to 1) in the bit array that start at
A
- How to
compile and
test your
setBit() function:
- Use test5.c to
test your setBit( ) function.
It will use my my_Allocate()
to allocate a bit array,
clear all the bits to 0 with my
my_clrAll() and
then call your
setBit() to clear
some of the bits.
- To compile
the test5 program
make test5
- To run
the test5 program,
type this command:
test5
- Use test5.c to
test your setBit( ) function.
It will use my my_Allocate()
to allocate a bit array,
clear all the bits to 0 with my
my_clrAll() and
then call your
setBit() to clear
some of the bits.
- Part 6: (10 pts)
- Write the function
testBit(BitArray A, int k)
that test
bit k
in the bit array that start at
A.
This function must
return 0 if bit
k is
reset,
otherwise it
return a non zero value
You need to traverse to the correct segment in the linked list and then test the correct bit in the correct array element bits[ ]
Remember that the first segment is used for the first BITS_PER_SEG bits in the bit array.
- Write the function
testBit(BitArray A, int k)
that test
bit k
in the bit array that start at
A.
This function must
return 0 if bit
k is
reset,
otherwise it
return a non zero value
- How to
compile and
test your
testBit() function:
- Use test6.c to
test your testBit( ) function.
It will use my my_Allocate()
to allocate a bit array,
clear all the bits to 0 with my
my_clrAll() and
then call your
testBit() to test
some of the bits.
Later, it
set all the bits to 1 with my
my_setAll() and
then call your
testBit() to test
some of the bits.
- To compile
the test6 program
make test6
- To run
the test6 program,
type this command:
test6
- Use test6.c to
test your testBit( ) function.
It will use my my_Allocate()
to allocate a bit array,
clear all the bits to 0 with my
my_clrAll() and
then call your
testBit() to test
some of the bits.
Later, it
set all the bits to 1 with my
my_setAll() and
then call your
testBit() to test
some of the bits.
- If your implementation of the
bit array passes
all the test
above, you may attemp to do the
bonus part of the project;
otherwise, do not try because it will
use your
implementation in the
Sieve of Eratosthenes.
The bonus part is graded using your bit array implementation, so if your implementation is faulty, the bonus part cannot (and will not) be graded !!!
- Bonus: (30 pts)
- Use the file
sieve.c and
write the function
sieveOfE(N)
that
returns
a bit array
containing
the prime numbers for
upto and including the value N
The input parameter N of sieveOfE(N) is an integer
You have to figure out what header files to include, and the return data type of the sieveOfE(N) function.
- Use the file
sieve.c and
write the function
sieveOfE(N)
that
returns
a bit array
containing
the prime numbers for
upto and including the value N
- How to
compile and
test your
sieveOfE() function:
- Use test7.c to
test your sieveOfE( ) function.
- To compile
the test6 program
make test7
- To run
the test6 program,
type this command:
test7
- Use test7.c to
test your sieveOfE( ) function.
- Crashes:
- A C program
can crash without giving you any
hint on which statement causes
the crash
- If your C program crashes, you must use a debugger to locate the crash site (= the statement that causes the crash)
I have discussed how to use the gdb debugger in class and you can find my gdb slides here: click here
- A C program
can crash without giving you any
hint on which statement causes
the crash
Use EGTAPI to turn in your LinkedBitArray.c program file with assignment code hw7
If you have done the bonus part, you can turn in your sieve.c program file with assignment code hw7-a
- Use EGTAPI
to request an extension
with the assignment code
hw7
You must make the extenion request before the deadline of the homework
Your request will be successful if you have not exceeded the maximum number of "free" (no-questions-asked) requests allowed