Short answer: yes.
Go to your System Preferences, then Spotlight:
You can disable and/or reorder the items in this list. By dragging Applications to the top, "Saf" will match Safari first (because it's an App, regardless of it's location).
If, on the other hand, there's a Folder(s) or Drive(s) that you want to explicitly exclude from Spotlight until you change your mind, turn onto the Privacy Tab (on top of that panel) and click the (+) button to browse for a folder.
This window also accepts Drag and Drop of Folders or Drives (Volumes). In my Sshot, you can see that I exclude Clone (my weekly clone drive) from Spotlight so when I search for something I don't come up with duplicated results (one from the main drive and one from the backup).
I also have added a Public Folder where a lot of ppl drops stuff and I don't care about it nor I want it in my search results.
If you want to restore it, you can always remove it from this list (and give spotlight time to re-index it).
You can't (as far as I know) exclude by File type.
Note: in order to drag a "drive" just go go the finder, click on your Mac OS Volume and then press ⌘↑ (the up arrow) to go back to the "root", you will see your volumes there (among other things). Drag it and drop it onto this Privacy tab and voilá.
Flipping
Byte flip and word flip will swap bytes or words.
Technically it works like this:
Let's say we have a two byte value (hexadecimal): 0x3344
The number consists of two bytes, the lower one is 0x44, and the higher one is 0x33, so let's put them into two imaginary cells of one byte size:
[33][44]
Now, flip the cells:
[44][33]
Therefore byte flipped value will be 0x4433
Same way with words, considering word consists of two bytes.
Let's assume we have a two-word value: 0x12345678
Split them into two imaginary cells, now containing one word (2 bytes) each:
[1234][5678]
Now, flip the cells:
[5678][1234]
Therefore word flipped value will be 0x56781234
Shifting
Shifting shifts values bitwise.
What does it mean?
Let's take a very simple decimal number: 5
Then, let's convert it to its binary representation: 101
Then, let's shift it left by 1:
[101] << [1010]
We basically moved the whole binary sequence left one position and filled the empty space with zero.
Now do the same, but with shifting right:
[101] >> [010]
our number is 10 now. The lower 1 is lost by shifting right. The zero on the left is just for display and has no value.
// Technically there's a CPU flag which indicates that the bit was lost, but it is not relevant to the calculator.
Rotating
Rotating works absolutely same as shifting with one exception: bits are never lost.
So, we take the same decimal value 5 and its binary representation 101.
Then we rotate it right within a byte:
[00000101] ROR [10000010]
As you can see, the [1] which was lost on the shifting right was carried on the beginning of our byte.
Same with shifting left, let's perform series of rotations by 1 bit left until we carry one bit:
[00000101] ROL [00001010]
[00001010] ROL [00010100]
[00010100] ROL [00101000]
[00101000] ROL [01010000]
[01010000] ROL [10100000]
[10100000] ROL [01000001]
Best Answer
Simply add a d to the trigonometric function and it should work.
Example: sin(x) > sind(x). sin(1)=0.8414... sind(1)=0.0174...