Maurice Tutor

(5)

$15/per page/Negotiable

About Maurice Tutor

Levels Tought:
Elementary,Middle School,High School,College,University,PHD

Expertise:
Algebra,Applied Sciences See all
Algebra,Applied Sciences,Biology,Calculus,Chemistry,Economics,English,Essay writing,Geography,Geology,Health & Medical,Physics,Science Hide all
Teaching Since: May 2017
Last Sign in: 304 Weeks Ago, 5 Days Ago
Questions Answered: 66690
Tutorials Posted: 66688

Education

  • MCS,PHD
    Argosy University/ Phoniex University/
    Nov-2005 - Oct-2011

Experience

  • Professor
    Phoniex University
    Oct-2001 - Nov-2016

Category > Computer Science Posted 26 Aug 2017 My Price 14.00

`computer stores

Question 1

a) Determine the value of base x if (211)x= (152)8 [2 marks]

b) A computer stores all integers in 8 bits. The computer also uses 2's complement method for representing negative numbers and IEEE 754 single precision representation for storing floating point values. Please show how the following values(in decimal) would be stored in the computer: [2+2=4 marks]

i) -35

ii) -22.625

Question 2.

a) Express the switching circuit shown in the figure below in binary logic notation: [2 marks]

b) Write Boolean expressions and construct the truth table describing the outputs of the circuit depicted by the following logic diagram: [2+2=4 marks]

c) Using basic Boolean algebra identities for Boolean variables A, B and C, prove that ABC+ ABC' + AB'C + A'BC = AB + AC + BC. Please show all steps and mention the identities used. [3]

Rationale

This assessment task covers topic 2 and 3, and has been designed to ensure that you are engaging with the subject content on a regular basis. More specifically it seeks to assess your ability to:

  • be able to apply an understanding of data representations and calculations to practical situations;
  • be able to apply Boolean algebra and digital logic to design and interpret complex digital circuits;

Marking criteria

Questions Fail ( Pass (50% - 64%) Credit (65% - 74%) Distinction (75% - 84%) High Distinction (>84%)
Question 1 (a,b) Neither the answers are correct nor the steps. The answer is not correct, but the steps are correct. The answer is correct or there were only a few slip of pen, or a step or two were missing. Answer is correctAll steps were shown.
Question 2 (a,b) The Boolean equation and the truthtables are incorrect and they do not conform to the question. Boolean expression is not correct, however the steps are correct. Few errors in the truth table The Boolean expression is correct but not minimised. Steps are correct. Minor mistakes in the Boolean algebra. The Boolean expression is correct and minimised. All steps are explained. The truth table is correct.
Question 2(c) Neither the answers nor the steps are correct Answer is not correct, but the steps are correct. Answers are all correct but there are only few mistakes in the steps. Answer s are all correct and complete. All steps are shown and identities are listed

Answers

Maurice Tutor
(5)
Status NEW Posted 26 Aug 2017 10:08 PM My Price 14.00

Hel-----------lo -----------Sir-----------/Ma-----------dam-----------Tha-----------nk -----------You----------- fo-----------r u-----------sin-----------g o-----------ur -----------web-----------sit-----------e a-----------nd -----------and----------- ac-----------qui-----------sit-----------ion----------- of----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n.P-----------lea-----------se -----------pin-----------g m-----------e o-----------n c-----------hat----------- I -----------am -----------onl-----------ine----------- or----------- in-----------box----------- me----------- a -----------mes-----------sag-----------e I----------- wi-----------ll

Not Rated(0)