c - Reading characters on a bit level -


I would like to be able to enter a character from the keyboard and for this I would like to display the binary code for the key in 00000001 format for example.

In addition to this, I would like to read the bits in such a way that would allow me to output at right or wrong.

For example 

  01010101 = false, true, false, true, false, true, false, true

I I will post the idea how I tried to do this but I do not know at all, I am still experimenting with C and this is my first taste of programming at such a low level level.

Thankyou

This code is C89: 

 < Code> / * We require exit * / #include & lt; Stdlib.h & gt; / * We require this CHAR_BIT * / #include & lt; Limits.h & gt; / * We require fgetc and printf * / #include & lt; Stdio.h & gt; Int main () / We need everything * / int input, index; Unsigned entry mask; Four enrichment; / * To collect an array, we tell the value of individual bits. There are approximately (8) 8 bits in a four, but it does not hurt to bring good habits in a hurry, and in C, basic types of sizes vary on different platforms. I CHAR_BIT We have a bits in bits Indicates the number of * / int bits [CHAR_BIT]; / * The easiest way to read a single character is fgetc, but keep in mind that the user should keep pressing "Return", because input is usually buffered * / input = fgetc (stdin); Printf ("% d \ n", input); / * Check the errors In C, we must always check errors / (/ input == EOF) {printf ("do not read any letters \ n"); Exit (1); } / * Type to Type To Type, type it. Strictly not necessary, we can check the bits of an int or a four, but here's how it is done. * / Inputchar = input; / * The most common way to check individual bits in a price is to use the "mask" - in this case we have only 1 bit set, which is the most important bit of all four * / mask = 1 & lt; & Lt; (CHAR_BIT - 1); / * This is a loop, takes every value of CHAR_BIT-1 from index 0, and we will read the most significant bits from the most importantly for I * / (index = 0; index & lt; CHAR_BIT ; ++ index) {/ * BitWind- & Operator & amp; How do we use the mask "Vocal and mask" will be 0 if the bit corresponding to the mask is 0, and zero if zero is 1: Ternary conditional operator and in C when you use the integer value in the boolean reference, zero -Write value is true, so why are we converting any non-zero values ​​into 1. * / bit [index] = (ink and mask)? 1: 0; / * What we have done, * / printf ("index% d, value% u \ n", index, index and mask); / * Next bit * / mask = mask & gt; & Gt; Need a new mask for 1; } / * For each bit as 0 or 1 * / (index = 0; index  CHAR_BIT; ++ index) {printf ("% d", bits [index]); } Printf ("\ n"); / * Output for each bit "true" or "false" * / (index = 0; index; lt; CHAR_BIT; ++ index) {printf (bits [index]? "True": "wrong"); / * Fiddly part - We want a comma between each bit, but not at the end * / if (index! = CHAR_BIT - 1) printf (","); } Printf ("\ n"); Return 0; }

You do not need three loops - if you want you can combine them together, and if you are doing one of only two types of output, then you You will not need an array, you can just use each bit value because you turn it off. But I think it keeps things separate and easy to understand.


Comments

Post a Comment

Popular posts from this blog

sql - dynamically varied number of conditions in the 'where' statement using LINQ -

I am using my first project LINQ (in mvc), so maybe there's something very simple that I remember. However, a day of searching and experimenting does not work, so it works. I am trying to write a LINQ query (Linux to SQL) in which in many cases where the statement is different from an OR or an AND. We do not know how many conditions are going in the query till runtime. This search is for filter control, where the user can choose multiple criteria for filtering. Select from table where table.col = 1 or table.col = 2 or table.col = 7 .... 'Other number of conditions Before I just create the SQL query as a string, while looping over all the situations. However, it seems that there should be a good way to do this in LINQ. I tried to use Expression trees, but they had a second thought for this moment on my head, where the lambda function was to be executed inside the statement such as: values ​​for matchingRows = matchingRows for each value Where (function (row) row.c...
Read more

asp.net mvc - Dynamically Generated Ajax.BeginForm -

I have a problem with ASP.NET MVC Ajax forms. I generate many Ajax form in a table such as: & Lt; Input type = "submit" name = "activity" value = "add activity" / & gt; & Lt;%}% & gt; & Lt; / TD & gt; & Lt; / TR & gt; & Lt;%}% & gt; So far so good. When I post one of those forms, it gives a partial view in a div, and in this new partial view a new Ajax Beginnform (which is not in Genesis form) This second Ajax Beginnorf is exactly like the ones I got on the table, but when I post it, I do not get the "Ajax Post", but a normal post that sends me to a new page, I do not know whether the two Ajax forms What is the reason for the difference between, why is it the "dynamically generated" Ajax form behaves like a normal HTML form? By the way, I know that I can do it in different ways using javascript, but I would like to understand whether it can only be done using MVC helplars and Ajax lib...
Read more

Debug on symbian -

I am using trk for phone debug This works well for the Holorld project But when I start the project in phone debug mode 1) the load failed 2) TrkProtocolPlugin: to target the specified file Failure (please verify If any body understands what problem I am experiencing, then this problem helps me Pre-release If the application has the privileges assigned (with the appropriate certificate) itemprop = "text" > In your case, I will check: / li> If there is no conflict of application ID with any other application of device If there are problematic commands in the installation package (for example copy copy for non-accessible directories)
Read more