This week's book giveaway is in the OO, Patterns, UML and Refactoring forum. We're giving away four copies of Refactoring for Software Design Smells: Managing Technical Debt and have Girish Suryanarayana, Ganesh Samarthyam & Tushar Sharma on-line! See this thread for details.
I was just working thru some practice problems that involved shifters and some binary operators (|,~,^,&) on some pretty large numbers ie: 0x80000000 Are you expected to be able to perform those calculations by hand or will most of the questions have small enough numbers? And if calculators are allowed, just it matter what kind?
If you would know how to crack those the concepts you learn will be more stronger however it is NOT required if you aim to pass the exam. I dont think they expect something like thsi from you. This is my personal opinion.
On the 5.0 exam you don't need to worry about this stuff at all.
On the 1.4 exam understanding bit repesentations is a minor topic, and mostly you need to understand two-s complement and binary representaions in general, so that you know a big number, or a small number, or a negative number, when you see one. You don't have to be able to calculate 2^N where N is say bigger than maybe 4
Spot false dilemmas now, ask me how!
(If you're not on the edge, you're taking up too much room.)
Joined: Aug 12, 2004
Thanks bert bates. Keith my problem is not with conversion, but the scale on which I will be converting, lol. The converting from one number type to the other is easy, but I'm worried about having to figure out the binary of 7654325634654 on paper. It will be too time consuming imo.
Joined: Feb 07, 2005
I don't think you would ever get a number like that. What I was referring to was a number like 0x80000000, where its easy to get the bit representation.