100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
COMSC 260 FINAL PRACTICE Exam Questions With Correct Answers 2025 $11.49
Add to cart

Exam (elaborations)

COMSC 260 FINAL PRACTICE Exam Questions With Correct Answers 2025

 1 view  0 purchase
  • Course
  • Comsc 260
  • Institution
  • Comsc 260

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 i...

[Show more]

Preview 4 out of 221  pages

  • January 14, 2025
  • 221
  • 2024/2025
  • Exam (elaborations)
  • Questions & answers
  • Comsc 260
  • Comsc 260
avatar-seller
Brightstars
©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

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller Brightstars. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for $11.49. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

56880 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy study notes for 15 years now

Start selling
$11.49
  • (0)
Add to cart
Added