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:stl1

Corning Community College

ENGR1050 C for Engineers

PROJECT: Seeing The Light (STL1)

OBJECTIVE

We continue our explorations of the electronics kit, by adding additional LEDs to control them in unison with a C program on our pi, having them count in binary.

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 (4 LEDs), adapt the provided C code to use the bank of connected LEDs to count in binary from 0000 to 1111 (0 to 15).

Using the current value of count, your task is to make use of if statements and 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 four 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 15 (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 1
0 0 1 0
0 0 1 1
0 1 0 0
0 1 0 1
0 1 1 0
0 1 1 1
1 0 0 0
1 0 0 1
1 0 1 0
1 0 1 1
1 1 0 0
1 1 0 1
1 1 1 0
1 1 1 1   <-- 15, the maximum value to display
0 0 0 0   <-- 0, we "roll over" and start again
0 0 0 1
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

EDIT

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

STL1

REVIEW OF BITWISE LOGIC

Relational Operators
BITWISE AND

A logical operation that compares 2 operands and returns a 1 if both are the same or a 0 if they are not. In the case of binary numbers, the operations compares the 2 numbers digit by digit. For example, 0=0 would return 1, 1=1 would return 1, but 1=0 would return 0. In the case of 2 strings of numbers, like 111000 and 000000 the operator would return 000111 since the first through third digits match, but digits 4 through 6 are different.

USING BINARY
LIGHT PATTERN
BITWISE INCLUSIVE OR

Bitwise inclusive OR operator compared the bits of two operands and returns a value of “1” if the bit from either of the operands is a “1.” For example, comparing 1100110 and 0101010 would return 1101110. Looking at bother operands bit by bit and comparing them, any location that has at least one “1” will return a 1. This operator will also return a “1” if both operands contains a “1” at the same bit.

BITWISE EXCLUSIVE OR

Similar to the bitwise inclusive OR operator, the bitwise exclusive OR operator will also compare the individual values of 2 operands bit-by-bit to compare the. However, unlike the inclusive variety, the exclusive OR will only return a 1 is ONE OF THE TWO BITS CONTAINS 1. For example, comparing 10101 and 11111 would return 01010.

BITWISE NOT

SELECTION STRUCTURES: IF

If statements can be used to run a program by presenting the computer with a choice (or decision), as long as the “condition” the “if” is referring to is “true.” For example, if you used the statement: if (score⇐50), then the computer will run the code that follows it in the “box” if the data it is connected to does possess a “score” of below or equal to 50. If the “score” is higher than 50, the program will respond with an error. If this erroneous function is followed by another if statement, say “if (!score⇐50) the computer will present the data should the initial statement be “false.”

Another way to have the data presented, should there be an error, is to use “else.” If the statement doesn't match or agree with what the computer thinks of as “true,” the “else statement will allow the data to be presented as long as another statement is written. For example, if the statement of “if (condition) doesn't compute, adding a box after the first box starting with the command “else” followed by a different (condition), the computer will present the data referred to by the “else” command after skipping the “false” “if” statement.

Note: The more “if” statements you make in a program, the longer it will take for the computer to run the instructions, so it is best to have “else” statements ready, as the computer will merely skip any “false” “if” or “else” statements until it comes upon a “true” statement in the worst-case scenario, and ignore them should the first “if” statement be true.

 

STRATEGY

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

SET COUNTER TO ZERO
REPEAT:
    SHOULD THE ONE'S POSITION HAVE A ONE:
        ACTIVATE THE ONE'S PLACE
    OTHERWISE:
        DEACTIVATE THE ONE'S PLACE

    SHOULD THE TWO'S POSITION HAVE A ONE:
        ACTIVATE THE TWO'S PLACE
    OTHERWISE:
        DEACTIVATE THE TWO'S PLACE

    SHOULD THE FOUR'S POSITION HAVE A ONE:
        ACTIVATE THE FOUR'S PLACE
    OTHERWISE:
        DEACTIVATE THE FOUR'S PLACE

    SHOULD THE EIGHT'S POSITION HAVE A ONE:
        ACTIVATE THE EIGHT'S PLACE
    OTHERWISE:
        DEACTIVATE THE EIGHT'S PLACE

    PAUSE FOR HUMAN PERCEPTION

    LET THE COUNTER BE INCREMENTED BY ONE

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:

78:stl1:final tally of results (78/78)
*:stl1:used grabit to obtain project by the Sunday prior to duedate [13/13]
*:stl1:clean compile, no compiler messages [13/13]
*:stl1:program conforms to project specifications [39/39]
*:stl1: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/stl1.txt · Last modified: 2024/09/09 21:27 by 127.0.0.1