Lab46 Wiki

User Tools

Site Tools

You are here: start » notes » discrete » fall2022 » projects » lmr1
notes:discrete:fall2022:projects:lmr1

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
notes:discrete:fall2022:projects:lmr1 [2022/10/27 13:48] – pleblancnotes:discrete:fall2022:projects:lmr1 [2022/10/28 03:55] (current) – [OUTPUT SPECIFICATIONS] dmuck
Line 23: Line 23:
 *For anybody interested in editing the wiki page, here is the dokuwiki user guide: https://www.dokuwiki.org/wiki:syntax#basic_text_formatting -Ash *For anybody interested in editing the wiki page, here is the dokuwiki user guide: https://www.dokuwiki.org/wiki:syntax#basic_text_formatting -Ash
 ====OUTPUT SPECIFICATIONS==== ====OUTPUT SPECIFICATIONS====
-Determine a unified means of output so that all submissions have an identical format. Should get identical output to running non-bitwise versions of the same functions. Ex: your function subtraction of 27 and 3 should output 24 just like  27 - 3 = 24.+Determine a unified means of output so that all submissions have an identical format. Should get identical output to running non-bitwise versions of the same functions.  
 + 
 +Example: your function subtraction of 27 and 3 should output 24 just like  27 - 3 = 24.  
 + 
 +Make sure to be mindful of what numbers you are using in the tests. You should ideally pick numbers that could cause problems in your code, that way you can see if you are missing a case, or maybe a function is incorrect. Other than this, there is no output specification. Show your function does what it's supposed to do.
  
 =====PROGRAM===== =====PROGRAM=====
Line 30: Line 34:
 When it comes to binary division and multiplication, you may want to try using your add and subtract functions to complete the division and multiplication functions. For multiplication, you will want to add a 12-bit array to itself n amount of times based on the other function input. This may require the creation of a binary to int converter for this solution to work. When it comes to binary division and multiplication, you may want to try using your add and subtract functions to complete the division and multiplication functions. For multiplication, you will want to add a 12-bit array to itself n amount of times based on the other function input. This may require the creation of a binary to int converter for this solution to work.
 =====EXAMPLES===== =====EXAMPLES=====
 +====COOL BITWISE TRICKS==== 
 +1. Right-shift is equivalent to dividing by 2\\ 
 +2. Left-shift is equivalent to multiplying by 2\\ 
 +3. AND can be used on the first bit to check for odd/even\\
 =====VERIFICATION===== =====VERIFICATION=====
 Make sure to test multiple different numbers, some numbers may work while others may not. Make sure to test multiple different numbers, some numbers may work while others may not.
Line 55: Line 62:
     bool operator==(int x) { ... }     bool operator==(int x) { ... }
 } }
 +</code>
 Its just a function with some nice syntax! Its just a function with some nice syntax!
  
notes/discrete/fall2022/projects/lmr1.1666878481.txt.gz · Last modified: 2022/10/27 13:48 by pleblanc

Page Tools

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
CC Attribution-Share Alike 4.0 International Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki