Scribd Logo
Importer

Bienvenue sur Scribd !

  • Quiz CHPT 3 and Logic Design - S16 Computer Architec - Organization Sections 01Y PDF

    Transféré par

    Mohamed
    409 vues4 pages
    This document summarizes a quiz on computer architecture and logic design taken by a student. It includes 10 multiple choice questions on topics like combinational vs sequential logic, flip-flops, multiplexors, ALUs, and Boolean logic. The student scored 6.6 out of 10, completing the quiz in one attempt within 16 minutes.

    Description originale:

    Titre original

    Quiz Chpt 3 and Logic Design_ S16 Computer Architec_Organization Sections 01Y.pdf

    Copyright

    © © All Rights Reserved

    Formats disponibles

    PDF, TXT ou lisez en ligne sur Scribd

    Avez-vous trouvé ce document utile ?

    Ce contenu est-il inapproprié ?

    Signaler ce document
    This document summarizes a quiz on computer architecture and logic design taken by a student. It includes 10 multiple choice questions on topics like combinational vs sequential logic, flip-flops, multiplexors, ALUs, and Boolean logic. The student scored 6.6 out of 10, completing the quiz in one attempt within 16 minutes.

    Droits d'auteur :

    © All Rights Reserved
    Téléchargez comme PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    409 vues4 pages

    Quiz CHPT 3 and Logic Design - S16 Computer Architec - Organization Sections 01Y PDF

    Transféré par

    Mohamed
    This document summarizes a quiz on computer architecture and logic design taken by a student. It includes 10 multiple choice questions on topics like combinational vs sequential logic, flip-flops, multiplexors, ALUs, and Boolean logic. The student scored 6.6 out of 10, completing the quiz in one attempt within 16 minutes.

    Droits d'auteur :

    © All Rights Reserved
    Téléchargez comme PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    sur 4

    6/18/2016

    QuizChpt3andLogicDesign:S16ComputerArchitec/OrganizationSections01Y

    QuizChpt3andLogicDesign
    Points 10

    Due May1at11:59pm
    TimeLimit 20Minutes

    Questions 10

    AttemptHistory
    LATEST

    Attempt

    Time

    Score

    Attempt1

    16minutes

    6.6outof10

    Correctanswersarehidden.
    Scoreforthisquiz:6.6outof10
    SubmittedMay2at9:48pm
    Thisattempttook16minutes.

    1/1pts

    Question1

    Logicblockswithoutstate(memory)arecalled
    blockswithstate(memory)arecalled

    sequential

    combinational

    andlogic

    Answer1:
    Combinational
    Answer2:
    sequential

    Partial

    Question2

    https://foothillcollege.instructure.com/courses/1034/quizzes/3492

    0.6/1pts

    1/4

    6/18/2016

    QuizChpt3andLogicDesign:S16ComputerArchitec/OrganizationSections01Y

    Abitofstateiscapturedinamemorydevicecalleda?
    register
    flipflop
    Dregister
    latch
    Dlatch

    Question3

    1/1pts

    Amultiplexorisalsoandmoredescriptivelycalledadata

    selector

    Question4

    1/1pts

    TotransformaMIPSregisterfieldfrombinary,2n,encodingtoonehot
    encodingyouwouldusea?

    decoder

    Question5

    https://foothillcollege.instructure.com/courses/1034/quizzes/3492

    1/1pts

    2/4

    6/18/2016

    QuizChpt3andLogicDesign:S16ComputerArchitec/OrganizationSections01Y

    ALUstandsfor

    ArithmeticLogicUnit

    Question6

    1/1pts

    AbinarystatemachinewithNbitsofstoragehashowmanypossiblestates?
    N
    2N
    N2
    2xN

    Incorrect

    Question7

    0/1pts

    FortheMooresMagicAdder(MMA)designtechnique(lotsoftransistors
    andbinaryreduction),moreproperlyknownaCarrySelectAdder,ifthetime
    todoa64bitaddis64nsec(nanoseconds)andassumingthatthetechnique
    canbeappliedideally(itkeepsworkinguntilthereisnofurtherdivisibility
    possible),howmanynsecwillthefullyoptimized64bitaddtake?

    4096

    Incorrect

    Question8

    https://foothillcollege.instructure.com/courses/1034/quizzes/3492

    0/1pts

    3/4

    6/18/2016

    QuizChpt3andLogicDesign:S16ComputerArchitec/OrganizationSections01Y

    IfthestartingMoore'sLaw64bitadderhas641bitFulladders,howmany
    1bitFulladderswilltheMMAadderhave?

    32

    Incorrect

    Question9

    0/1pts

    ForaMoore'sLawmultiplier,akaanarraymultiplier,howmanyfulladders,
    FAs,aretraversedtodojustthearrayportionofa4x4multiply,thatis,ignore
    thefinalcombinatorialadd?

    Question10

    1/1pts

    ~AOR~B=~(AANDB)isknownas
    DeBroglie'sLaw
    DeMorgan'sLaw
    DeYoung'sLaw
    DeNiro'sLaw

    QuizScore:6.6outof10

    https://foothillcollege.instructure.com/courses/1034/quizzes/3492

    4/4

    Vous aimerez peut-être aussi