100% tevredenheidsgarantie Direct beschikbaar na je betaling Lees online óf als PDF Geen vaste maandelijkse kosten 4,6 TrustPilot
logo-home
Tentamen (uitwerkingen)

COMSC 260 FINAL PRACTICE Exam Questions With Correct Answers 2025

Beoordeling
-
Verkocht
-
Pagina's
221
Cijfer
A+
Geüpload op
14-01-2025
Geschreven in
2024/2025

COMSC 260 FINAL PRACTICE Exam Questions With Correct Answers 2025 What is the *largest UN*signed number that you can make with five (5) bits? ----------------------------- *31* 32 16 15 - Answer*31* When adding binary numbers together in a column, what two steps are performed if their sum is greater than 1? 1. What you put down in the column is calculated by the formula: _ 2. Carry a 1 over to the next column HINT: 1 + 1 = 10 1 + 1 + 1 = 11 ----------------------------- 1. sum = 2 mod sum 1. sum = 1 mod sum 1. sum = sum mod 1 ©BRIGHSTARS 2024/2025 ALL RIGHTS RESERVED. 2 | P a g e *1. sum = sum mod 2* - Answer*1. sum = sum mod 2* Suppose we have the following *UN*signed binary number: 10 And we want to *sign-extend* this binary number to four binary bits. The binary number *MUST* have the same value, but now it will be four binary bits rather than two. Which of the options below is correct? ----------------------------- 0110 *0010* 1010 1110 - Answer*0010* Suppose we want to represent the decimal number *65* as an *UN*signed binary number using the *least* number of bits possible. Which of the options below is correct? ----------------------------- 0 *1000001* - Answer*1000001* Suppose n = number of hexadecimal symbols. Which of the options below is the correct formula that will give you the largest UNsigned hexadecimal number that you can represent for a given number of hexadecimal symbols? ----------------------------- 16^(n-1) - 1 16^(n)+ 1 16^(n+1) + 1 *16^(n) - 1* - Answer*16^(n) - 1* ©BRIGHSTARS 2024/2025 ALL RIGHTS RESERVED. 3 | P a g e What is the *UN*signed hexadecimal number 80 converted to decimal? ----------------------------- -128 -256 *128* 256 - Answer*128* Which of the following options below describes the correct algorithm for converting an *UN*signed decimal number to binary? 1. Divide the number by 2 2. Calculate and store the quotient 3. Calculate and store the remainder 4. Set number = _ 5. If the _ is not equal to 0, go back to step 1, else go to step 6 6. The binary number is stored in the remainder ----------------------------- 4. remainder 5. quotient 4. quotient 5. remainder 4. remainder 5. remainder

Meer zien Lees minder
Instelling
Comsc 260
Vak
Comsc 260

Voorbeeld van de inhoud

©BRIGHSTARS 2024/2025 ALL RIGHTS RESERVED.




COMSC 260 FINAL PRACTICE Exam
Questions With Correct Answers 2025


What is the *largest UN*signed number that you can make with five (5) bits?


-----------------------------
*31*
32
16

15 - Answer✔*31*
When adding binary numbers together in a column, what two steps are performed if their sum is
greater than 1?


1. What you put down in the column is calculated by the formula: _


2. Carry a 1 over to the next column


HINT:
1 + 1 = 10
1 + 1 + 1 = 11


-----------------------------
1. sum = 2 mod sum
1. sum = 1 mod sum
1. sum = sum mod 1
1|Page

, ©BRIGHSTARS 2024/2025 ALL RIGHTS RESERVED.

*1. sum = sum mod 2* - Answer✔*1. sum = sum mod 2*
Suppose we have the following *UN*signed binary number: 10
And we want to *sign-extend* this binary number to four binary bits. The binary number
*MUST* have the same value, but now it will be four binary bits rather than two.


Which of the options below is correct?


-----------------------------
0110
*0010*
1010

1110 - Answer✔*0010*
Suppose we want to represent the decimal number *65* as an *UN*signed binary number using
the *least* number of bits possible. Which of the options below is correct?


-----------------------------
10000001
010000001
01000001

*1000001* - Answer✔*1000001*
Suppose n = number of hexadecimal symbols. Which of the options below is the correct formula
that will give you the largest UNsigned hexadecimal number that you can represent for a given
number of hexadecimal symbols?


-----------------------------
16^(n-1) - 1
16^(n)+ 1
16^(n+1) + 1

*16^(n) - 1* - Answer✔*16^(n) - 1*


2|Page

, ©BRIGHSTARS 2024/2025 ALL RIGHTS RESERVED.

What is the *UN*signed hexadecimal number 80 converted to decimal?


-----------------------------
-128
-256
*128*

256 - Answer✔*128*
Which of the following options below describes the correct algorithm for converting an
*UN*signed decimal number to binary?


1. Divide the number by 2
2. Calculate and store the quotient
3. Calculate and store the remainder
4. Set number = _
5. If the _ is not equal to 0, go back to step 1, else go to step 6
6. The binary number is stored in the remainder




-----------------------------
4. remainder
5. quotient


4. quotient
5. remainder


4. remainder
5. remainder




3|Page

, ©BRIGHSTARS 2024/2025 ALL RIGHTS RESERVED.

*4. quotient*

*5. quotient* - Answer✔*4. quotient*
*5. quotient*
Suppose n = number of bits. Which of the options below is the correct formula that will give you
the *largest UN*signed binary number that you can represent for a given number of bits?


-----------------------------
2^(n-1) - 1
2^(n) + 1
*2^(n) - 1*

2^(n+1) + 1 - Answer✔*2^(n) - 1*
How many bits are in a byte?


-----------------------------
32
*8*
16

64 - Answer✔*8*
Which of the options below is the *largest UN*signed hexadecimal number that you can make
with two (2) hexadecimal symbols


-----------------------------
8F
7F
0F

*FF* - Answer✔*FF*
Suppose we want to represent the decimal number *19* as a *SIGNED* binary number using
the least number of bits possible. Which of the options below is correct?



4|Page

Geschreven voor

Instelling
Comsc 260
Vak
Comsc 260

Documentinformatie

Geüpload op
14 januari 2025
Aantal pagina's
221
Geschreven in
2024/2025
Type
Tentamen (uitwerkingen)
Bevat
Vragen en antwoorden

Onderwerpen

Maak kennis met de verkoper

Seller avatar
De reputatie van een verkoper is gebaseerd op het aantal documenten dat iemand tegen betaling verkocht heeft en de beoordelingen die voor die items ontvangen zijn. Er zijn drie niveau’s te onderscheiden: brons, zilver en goud. Hoe beter de reputatie, hoe meer de kwaliteit van zijn of haar werk te vertrouwen is.
Brightstars Havard School
Bekijk profiel
Volgen Je moet ingelogd zijn om studenten of vakken te kunnen volgen
Verkocht
218
Lid sinds
1 jaar
Aantal volgers
7
Documenten
12914
Laatst verkocht
2 dagen geleden
VERIFIED EXAMS AND STUDY GUIDES.

Here, you will find Study Notes, Exam answer packs 100% Guarenteed success.

3.2

33 beoordelingen

5
10
4
4
3
8
2
3
1
8

Populaire documenten

Recent door jou bekeken

Waarom studenten kiezen voor Stuvia

Gemaakt door medestudenten, geverifieerd door reviews

Kwaliteit die je kunt vertrouwen: geschreven door studenten die slaagden en beoordeeld door anderen die dit document gebruikten.

Niet tevreden? Kies een ander document

Geen zorgen! Je kunt voor hetzelfde geld direct een ander document kiezen dat beter past bij wat je zoekt.

Betaal zoals je wilt, start meteen met leren

Geen abonnement, geen verplichtingen. Betaal zoals je gewend bent via iDeal of creditcard en download je PDF-document meteen.

Student with book image

“Gekocht, gedownload en geslaagd. Zo makkelijk kan het dus zijn.”

Alisha Student

Veelgestelde vragen