Proposal for a sticky of exercises for N00bZ

[Celius]

I think the simple AND/OR/XOR table would do just fine for begginers:

0 AND 0 = 0
0 AND 1 = 0
1 AND 0 = 0
1 AND 1 = 1

0 OR 0 = 0
0 OR 1 = 1
1 OR 0 = 1
1 OR 1 = 1

0 XOR 0 = 0
0 XOR 1 = 1
1 XOR 0 = 1
1 XOR 1 = 0

[Laserbeak43]

thanks Blarrg. this will be posted as "advanced boolean logic"

and as for the garlic, you guys are woosies i eat raw garlic cloves at least once a month! it's good for your blood!!! an old trick my grandmother preached to me on a daily basis as a small child.

you guys haven't eaten scotch bonnet peppers if you think garlic is hot. go eat at a jamaican family table one night. you'll know what i'm talking about. that stuff is so hot, it's like a macho contest or something. when i go to my mothers house, i'm like "mmm curry!!!(uh oh i see some scotch bonnet in there, oh s#!t.....).

[Laserbeak43]

somehow i feel like the same guy kept voting "no" until the poll was over.

-edit-
poll or no poll, i'll do it if memblers says it's ok.

[jargon]

thanks Blarrg. this will be posted as "advanced boolean logic"

and as for the garlic, you guys are woosies i eat raw garlic cloves at least once a month! it's good for your blood!!! an old trick my grandmother preached to me on a daily basis as a small child.

you guys haven't eaten scotch bonnet peppers if you think garlic is hot. go eat at a jamaican family table one night. you'll know what i'm talking about. that stuff is so hot, it's like a macho contest or something. when i go to my mothers house, i'm like "mmm curry!!!(uh oh i see some scotch bonnet in there, oh s#!t.....).

Mexican food is not hot to me at all, in fact i can guzzle a Tobasco sauce bottle straight with no ill outcome minus utter diarrhea and the stuff not tasting good at all to me in the first place.

I grew up with hot peppers etcetera, being third generation Arizonan and all.

The only peppers i find hot are those translucent yellow ones from central America and those bright turquoise ones from south America.

[jargon]

I finally understand this table!. Each square covers a different logic function, of the 16 possible functions involving two boolean inputs (including ones which don't even examine the inputs). The result is shown in two ways, graphically and as a binary value. The function is also expressed in two ways, as a named binary operator and as an expression involving the common operators ! (NOT), | (OR), & (AND), and ^ (XOR).

Graphically, it's fairly simple. There are two fruits with some overlap, and a background. The left (apple) represents A, the right (orange) B. This forms four regions: neither A nor B (the water background), A only (the non-overlapped part of the apple), B only (the non-overlapped part of the orange), and A and B (the overlapping part). Each of these regions can be either colored or outlined; when colored, the function is true in this case, otherwise it's false.

The four bit binary value is the least obvious. It represents the same information as the image. The bits correspond to the following inputs being true: AB, A, B, (none). So with OR you get 1110 (true as long as either A or B is true), with AND you get 1000 (true only when both A and B are true).

To summarize each function (sorry, challenge not included):

Code: Select all

1 1 0 0  A   Inputs
1 0 1 0  B
--------------------
0 0 0 0  FALSE
0 0 0 1  NOR
0 0 1 0  JUST B
0 0 1 1  NOT A
0 1 0 0  JUST A
0 1 0 1  NOT B
0 1 1 0  A XOR  B
0 1 1 1  A NAND B
1 0 0 0  A AND  B
1 0 0 1  A XNOR B
1 0 1 0  B
1 0 1 1  A IMP  B
1 1 0 0  A
1 1 0 1  A LIMP B
1 1 1 0  A OR   B
1 1 1 1  TRUE

To summarize each boolean operator (with my tiny corrections and extra info):

Code: Select all

1 1 0 0    Input A
1 0 1 0    Input B
------------------
0 0 0 0    FALSE   (aka    NULL  )
0 0 0 1  A   NOR B
0 0 1 0     JUST B (aka A  NIMP B) (aka A NLIMP B)
0 0 1 1      NOT A
0 1 0 0     JUST A (aka A NRIMP B)
0 1 0 1      NOT B
0 1 1 0  A   XOR B (aka A  NEQV B) (aka A   EOR B)
0 1 1 1  A  NAND B
1 0 0 0  A   AND B
1 0 0 1  A  XNOR B (aka A   EQV B) (aka A  ENOR B)
1 0 1 0  B
1 0 1 1  A   IMP B (aka A  RIMP B)
1 1 0 0  A
1 1 0 1  A  LIMP B
1 1 1 0  A    OR B
1 1 1 1     TRUE   (aka  Identity)

Here is the best suited names for the polarization (endian inversal) of the binary truth tables, though not being the most common set of naming convention:

Code: Select all

1 1 0 0    Input A
1 0 1 0    Input B
------------------
0 0 0 0    FALSE
0 0 0 1  A   NOR B
0 0 1 0  A NLIMP B
0 0 1 1      NOT A
0 1 0 0  A NRIMP B
0 1 0 1      NOT B
0 1 1 0  A  NEQV B
0 1 1 1  A  NAND B

1 0 0 0  A   AND B
1 0 0 1  A   EQV B
1 0 1 0          B
1 0 1 1  A  RIMP B
1 1 0 0          A
1 1 0 1  A  LIMP B
1 1 1 0  A    OR B
1 1 1 1     TRUE

Code: Select all

BOOLEAN YIN/YANG CHART
=======================
1 1 0 0  Input A
1 0 1 0  Input B
=======================
0 0 0 0  NOT (  TRUE  )
0 0 0 1  NOT (A   OR B)
0 0 1 0  NOT (A LIMP B)
0 0 1 1  NOT (A       )
0 1 0 0  NOT (A RIMP B)
0 1 0 1  NOT (       B)
0 1 1 0  NOT (A  EQV B)
0 1 1 1  NOT (A  AND B)
-----------------------
1 0 0 0      (A  AND B)
1 0 0 1      (A  EQV B)
1 0 1 0      (       B)
1 0 1 1      (A RIMP B)
1 1 0 0      (A       )
1 1 0 1      (A LIMP B)
1 1 1 0      (A   OR B)
1 1 1 1      (  TRUE  )
=======================

notice with this last table, the endian inversion symmetry is clearly evident. this just happens to be my boolean yin/yang chart.

[jargon]

As follows is Logiclrd's variation of the boolean yin/yang chart:

Code: Select all

1 1 0 0    Input A 
1 0 1 0    Input B 
---------------------
0 0 0 0    NOT TRUE
0 0 0 1  A NOT   OR B 
0 0 1 0  A NOT LIMP B 
0 0 1 1  A NOT
0 1 0 0  A NOT RIMP B 
0 1 0 1    NOT      B 
0 1 1 0  A NOT  EQV B 
0 1 1 1  A NOT  AND B 
- - - - - - - - - - -
1 0 0 0  A      AND B 
1 0 0 1  A      EQV B 
1 0 1 0             B 
1 0 1 1  A     RIMP B 
1 1 0 0  A 
1 1 0 1  A     LIMP B 
1 1 1 0  A       OR B 
1 1 1 1        TRUE

[Memblers]

Well I can see the idea doesn't have overwhelming support, but really I think the ones who'd be voting yes are the people that aren't even here yet. Personally, I'd like to see it lead to a flood of newbies. It seemed like when I started this site, I was the only person around with no programming experience trying to do stuff with the NES (I probably almost was).

But I support the idea, just to be clear, Laserbeak can be in charge, I'll edit the thread possibly. tepples is a moderator and a good coder so I'd say edit info into the thread if you want, tepples.

Anyone else just post a reply there, and it could be edited into the main post.

[Laserbeak43]

thanks a lot for the support memblers