Reputation: 0 Apprentice
- Active Posts:
- 31 (0.1 per day)
- 13-February 13
- Profile Views:
- Last Active:
- Feb 27 2013 01:12 PM
- Dream Kudos:
Posts I've Made
Posted 26 Feb 2013Great.. so it was just all about the answers. />
haha if you put it like that then i'm purposely going to come to this forum whenever I have a programming query but i'm afraid I would face a programming query when i'm programming for a cwk...then i Feel like i might be accused of making ppl do my homework :S lol
Posted 26 Feb 2013
Posted 26 Feb 2013Assuming they're looking for truncation error it'd be A as truncation error is the difference between the actual value and the representative value.
yh thanks one of my freind's got the same answer..on the truncation error is this explanation correct to describe it because I wanted my freind to read something onit just want to know if we can trust the source:
"In computing applications, truncation error is the discrepancy that arises from executing a finite number of steps to approximate an infinite process."
Posted 26 Feb 2013
hmm are you serious?..exam? I don't understand I was asking for help this forum says Theory help as well..all I'm doing is presenting questions and trying to find the answer? never knew that wasn't allowed..I thought novice CS members could find help..without being accused..and ive actually presented an answer if i'm wrong you could just tell me what I am doing wrong the method I used to solve the above was:
using this example:
Two's complement is not a complicated scheme and is not well served by anything lengthly. Therefore, after this introduction, which explains what two's complement is and how to use it, there are mostly examples.
Two's complement is the way every computer I know of chooses to represent integers. To get the two's complement negative notation of an integer, you write out the number in binary. You then invert the digits, and add one to the result.
Suppose we're working with 8 bit quantities (for simplicity's sake) and suppose we want to find how -28 would be expressed in two's complement notation. First we write out 28 in binary form.
Then we invert the digits. 0 becomes 1, 1 becomes 0.
Then we add 1.
That is how one would write -28 in 8 bit binary.
I saw how he got -28 and applied it to this question to get -89 all i wanted to do is assure myself of the answer.
sorry if im doing anything wrong just tel me and I will stop =]
Posted 26 Feb 2013The question is asking for the exact number of names looked at, so you can't just look at the complexity for an answer. You have to actually work it out and it is 7.
There are implementations of the search that would result in 8 (if the recursion includes mid), but I think you should assume that it is the normal implementation.
thank you for your responses =] you don't understand how much this is helping me because once I have all the answers i'm going to work through the techniques and methods =] ... hopefully can ace the exam
- Member Title:
- New D.I.C Head
- Age Unknown
- Birthday Unknown
k.s110 hasn't added any friends yet.