User Tools

Site Tools


Sidebar

projects

wcp1 (due 20240828)
wcp2 (due 20240904)
pct0 (bonus; due 20240905)
pct1 (bonus; due 20240905)
pct2 (due 20240905)
abc0 (due 20240906)
gtf0 (due 20240911)
pct3 (bonus; due 20240911)
wcp3 (due 20240911)
dtr0 (due 20240918)
pct4 (due 20240918)
wcp4 (due 20240918)
pct5 (bonus; due 20240926)
stl0 (due 20240926)
wcp5 (due 20240926)
gfo0 (due 20241002)
pct6 (due 20241002)
stl1 (due 20241002)
wcp6 (due 20241002)
pct7 (bonus; due 20241009)
stl2 (due 20241009)
wcp7 (due 20241009)
bwp1 (bonus; due 20241016)
pct8 (due 20241016)
ptb0 (due 20241016)
wcp8 (due 20241016)
pct9 (bonus; due 20241023)
ptb1 (due 20241023)
wcp9 (due 20241023)
gfo1 (due 20241030)
pctA (due 20241030)
ptb2 (due 20241030)
wcpA (due 20241030)
pctB (bonus; due 20241106)
wcpB (due 20241106)
wus0 (due 20241106)
pctC (due 20241113)
wcpC (due 20241113)
wus1 (due 20241113)
pctD (bonus; due 20241120)
wcpD (bonus; due 20241120)
wus2 (due 20241120)
bwp2 (bonus; due 20241204)
gfo2 (due 20241204)
pctE (bonus; due 20241204)
wcpE (bonus; due 20241204)
EoCE (due 20241216)
haas:fall2024:c4eng:projects:stl2

Corning Community College

ENGR1050 C for Engineers

PROJECT: Seeing The Light (STL2)

OBJECTIVE

Time to explore optimizing our logic further, through the use of a loop and demonstrating the effectiveness of our logic by scaling up the number of LEDs in our counter (to at least 8).

PROCESS

Do note, the productive way to go about this project involves taking the following steps:

  • starting early
  • reading the project page
  • asking questions regarding things you do not know, are not clear on, or are confused about
  • as information, concepts, processes become clear, that is something you can contribute to the project documentation (so you can better remember)

If you start too late, and do not ask questions, and do not have enough time and don't know what is going on, you are not doing the project correctly.

TASK

After exploring, assembling, and testing the intended circuit (8+ LEDs), adapt the provided C code to use the bank of connected LEDs to count in binary from 00000000 to at least 11111111 (0 to 255).

Using the current value of count, your task is to make use of ONE if statement and copious use of bitwise logic to determine from an ongoing count the state of the individual bits.

It is your task to write a C program that interfaces successfully with the eight or more independently connected LED circuits, arranged in some orientation to ascertain an order or positioning, where your program will (in endless fashion, or until being manually interrupted) display a count (in binary) of values from 0 to at least 255 (then rollover, or reset).

If “1” means the LED in that position is ON, and “0” means the LED in that position is OFF, then you want to write a program that performs the following progression (over and over again):

0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1
0 0 0 0 0 0 1 0
0 0 0 0 0 0 1 1
0 0 0 0 0 1 0 0
0 0 0 0 0 1 0 1
0 0 0 0 0 1 1 0
0 0 0 0 0 1 1 1
0 0 0 0 1 0 0 0
. . .
1 1 1 1 1 0 0 1
1 1 1 1 1 0 1 0
1 1 1 1 1 0 1 1
1 1 1 1 1 1 0 0
1 1 1 1 1 1 0 1
1 1 1 1 1 1 1 0
1 1 1 1 1 1 1 1   <-- 255, the maximum value to display when there are 8 bits/LEDs
0 0 0 0 0 0 0 0   <-- 0, we "roll over" and start again
0 0 0 0 0 0 0 1
0 0 0 0 0 0 1 0
. . .

GRABIT

To assist with consistency across all implementations, data files for use with this project are available on lab46 via the grabit tool. Be sure to obtain it and ensure your implementation properly works with the provided data.

lab46:~/src/SEMESTER/DESIG$ grabit DESIG PROJECT

Components and wiring

An example of one way to wire up the LED bar:

EDIT

You will want to go here to edit and fill in the various sections of the document:

STL2

loops

A “for” loop is a top driven loop that will test the condition of a statement before the loop begins to see if it is true. It is a control flow statement that is less “messy” than other types, as while it needs more conditions in order to run, it needs less input code in order to run. An example of a “for” loop is as follows:

for (index=0;index<10;index=index+1) {

fprintf (stdout,"%\n", index);

}

The looping variable is “index”, the loop starts when index=0, will continue to loop as the index increases by a value of 1 for each loop, and will stop/end when index=10, with the value stored in “index”.

for loop

A type of control flow statement that allows you to execute a desired task a specified number of times. The general form we see is as follows:

if(initialization; condition; update)

{task we wish to execute}

Initialization: Typically used to initialize a loop control variable (we used “index” in class). Condition: This part is evaluated at the start of each successive loop. If the condition is “true,” the loop is run and the code is executed. If the condition is “not true,” then the loop is terminated. Update: Executed after each iteration, this term is used to update the loop control variable>

while loop

A type of control flow statement that will continue to run whatever code is written in the body as long as the predetermined condition is met. For example, in this class, we see the while loops with the condition (1) which simply means “true.” This means that as long as the condition is true (1) the loop will continue to run until it is interrupted by the user. The format we see in this class is

while (1)

{task we wish to repeat here}

do-while loop

bitwise operations

bitwise AND

A bitwise AND is one of the multiple different bitwise functions that can be used not only to strengthen code but also to shorten code and make the code more succinct and more efficient. A bitwise AND is represented by the “&” symbol. A bitwise AND compares the two different values that it is given in order to create an answer. The bitwise AND compares the values to see which portions of each value are matching, because a bitwise AND will only output a 1 (AKA a success) if the two values are the same. For example if you were to bitwise AND the values 1010 and 0010, the response created would be 0010 because the second place of both of the values was the only place where both values had a 1. bitwise AND's are extremely useful for stl2 in order to allow for easier comparison between the current counter (or number) value that the program is on as well as the place calculator known as mask. The comparison of number and mask allows for our code to more easily tell what place we are currently in and whether that place needs to be on or off.

logical left shift

A bitwise operation that moves all bits in an operand to the left by a specific number of positions. What does this mean? In C, we use « to represent a left shift of one place. We could also do «# to left shift that specific number of places. In practice, this would shift the ones place to the twos place, the twos place to the fours place, the fours place to the eights place, and so on so fourth. In the context of this project, when used in a loop, this operation would allow us to perform sequential operations on a specific value of multiple bits by successively shifting the value one place to the left with each loop.

 

STRATEGY

The general flow of the process (one way of going about it, anyway) can be described as follows:

SET COUNTER TO ZERO
REPEAT INFINITELY:
    SET PLACE TO ONE
    REPEAT UNTIL PLACE IS GREATER THAN EIGHT:
        SHOULD THE PLACE POSITION HAVE A ONE:
            ACTIVATE THE PLACE’S LED
        OTHERWISE:
            DEACTIVATE THE PLACE’S LED

        LET PLACE BECOME THE NEXT PLACE POSITION
    KEEP GOING

    PAUSE FOR HUMAN PERCEPTION
    LET THE COUNTER BE INCREMENTED BY ONE
KEEP GOING

SUBMISSION

To be successful in this project, the following criteria (or their equivalent) must be met:

  • Project must be submit on time, by the deadline.
    • Late submissions will lose 33% credit per day, with the submission window closing on the 3rd day following the deadline.
  • All code must compile cleanly (no warnings or errors)
    • Compile with the -Wall and –std=gnu18 compiler flags
    • all requested functionality must conform to stated requirements (either on this document or in a comment banner in source code files themselves).
  • Executed programs must display in a manner similar to provided output
    • output formatted, where applicable, must match that of project requirements
  • Processing must be correct based on input given and output requested
  • Output, if applicable, must be correct based on values input
  • Code must be nicely and consistently indented
  • Code must be consistently written, to strive for readability from having a consistent style throughout
  • Code must be commented
    • Any “to be implemented” comments MUST be removed
      • these “to be implemented” comments, if still present at evaluation time, will result in points being deducted.
      • Sufficient comments explaining the point of provided logic MUST be present
  • No global variables (without instructor approval), no goto statements, no calling of main()!
  • Track/version the source code in your lab46 semester repository
  • Submit a copy of your source code to me using the submit tool (make submit on lab46 will do this) by the deadline.

Submit Tool Usage

Let's say you have completed work on the project, and are ready to submit, you would do the following (assuming you have a program called uom0.c):

lab46:~/src/SEMESTER/DESIG/PROJECT$ make submit

You should get some sort of confirmation indicating successful submission if all went according to plan. If not, check for typos and or locational mismatches.

RUBRIC

I'll be evaluating the project based on the following criteria:

91:stl2:final tally of results (91/91)
*:stl2:used grabit to obtain project by the Sunday prior to duedate [13/13]
*:stl2:clean compile, no compiler messages [13/13]
*:stl2:program conforms to project specifications [13/13]
*:stl2:uses at least eight LEDs for the binary counter [13/13]
*:stl2:program uses only one selection structure in loop to do task [26/26]
*:stl2:code tracked in lab46 semester repo [13/13]

Pertaining to the collaborative authoring of project documentation

  • each class member is to participate in the contribution of relevant information and formatting of the documentation
    • minimal member contributions consist of:
      • near the class average edits (a value of at least four productive edits)
      • near the average class content change average (a value of at least 256 bytes (absolute value of data content change))
      • near the class content contribution average (a value of at least 1kiB)
      • no adding in one commit then later removing in its entirety for the sake of satisfying edit requirements
    • adding and formatting data in an organized fashion, aiming to create an informative and readable document that anyone in the class can reference
    • content contributions will be factored into a documentation coefficient, a value multiplied against your actual project submission to influence the end result:
      • no contributions, co-efficient is 0.50
      • less than minimum contributions is 0.75
      • met minimum contribution threshold is 1.00

Additionally

  • Solutions not abiding by spirit of project will be subject to a 50% overall deduction
  • Solutions not utilizing descriptive why and how comments will be subject to a 25% overall deduction
  • Solutions not utilizing indentation to promote scope and clarity or otherwise maintaining consistency in code style and presentation will be subject to a 25% overall deduction
  • Solutions not organized and easy to read (assume a terminal at least 90 characters wide, 40 characters tall) are subject to a 25% overall deduction
haas/fall2024/c4eng/projects/stl2.txt · Last modified: 2024/10/07 10:55 by wedge