http://www.categories.acsl.org/wiki/index.php?action=history&feed=atom&title=My_test_page 2026-04-23T16:57:02Z Revision history for this page on the wiki MediaWiki 1.37.1 http://www.categories.acsl.org/wiki/index.php?title=My_test_page&diff=651&oldid=prev 2020-07-28T18:27:13Z

<p>Created page with &quot;This is a &#039;&#039;&#039;bold&#039;&#039;&#039; statement and here is another &#039;&#039;&#039;very bold&#039;&#039;&#039; two words. Each contest in the Elementary Division consists of 5 short answer questions covering one topic...&quot;</p> <p><b>New page</b></p><div>This is a &#039;&#039;&#039;bold&#039;&#039;&#039; statement and here is another &#039;&#039;&#039;very bold&#039;&#039;&#039; two words.<br /> <br /> Each contest in the Elementary Division consists of 5 short answer questions covering one topic each contest; the topic for each contest is listed below. The time limit for the 5-question test is 30 minutes. More information about this division is available in this presentation.<br /> <br /> ​== This is section header==<br /> <br /> <br /> <br /> Each contest in the Junior, Intermediate, and Senior Divisions has two parts: a take home 72-hour time limit programming problem and a set of short answer questions. Each short answer test consists of 2 questions on each of the first two topics listed below and 1 question on the third topic for a total of 5 questions. The time limit for the 5 question test is 30 minutes.<br /> <br /> === THis is a subsectino ===<br /> <br /> Mastering this topic is essential for systems programming, programming in assembly language, optimizing code, and hardware design.<br /> <br /> == Operators ==<br /> <br /> === Bitwise Operators ===<br /> <br /> The logical operators are &#039;&#039;&#039;not&#039;&#039;&#039; (~ or $\neg$), &#039;&#039;&#039;and&#039;&#039;&#039; (&amp;), &#039;&#039;&#039;or&#039;&#039;&#039; (|), and &#039;&#039;&#039;xor&#039;&#039;&#039; ($\oplus$). These operators should be familiar to ACSL students from the [[Boolean Algebra]] and [[Digital Electronics]] categories.<br /> <br /> * &#039;&#039;&#039;not&#039;&#039;&#039; is a unary operator that performs logical negation on each bit. Bits that are 0 become 1, and those that are 1 become 0. For example: ~101110 has a value of 010001.<br /> <br /> * &#039;&#039;&#039;and&#039;&#039;&#039; is a binary operator that performs the logical &#039;&#039;&#039;and&#039;&#039;&#039; of each bit in each of its operands. The &#039;&#039;&#039;and&#039;&#039;&#039; of two values is 1 only if both values are 1. For example, &#039;&#039;&#039;1011011 and 011001&#039;&#039;&#039; has a value of &#039;&#039;&#039;001001&#039;&#039;&#039;. The &#039;&#039;&#039;and&#039;&#039;&#039; function is often used to isolate the value of a bit in a bit-string or to clear the value of a bit in a bit-string.<br /> <br /> * &#039;&#039;&#039;or&#039;&#039;&#039; is a binary operator that performs the logical &#039;&#039;&#039;or&#039;&#039;&#039; of each bit in each of its operands. The &#039;&#039;&#039;or&#039;&#039;&#039; of two values is 1 only if one or both values are 1. For example, &#039;&#039;&#039;1011011 or 011001&#039;&#039;&#039; has a value of &#039;&#039;&#039;111011&#039;&#039;&#039;. The &#039;&#039;&#039;or&#039;&#039;&#039; function is often use to force the value of a bit in a bit-string to be 1, if it isn&#039;t already.</div>

Marc