Computer Science Illuminated
Computer Science Illuminated
6th Edition
ISBN: 9781284055917
Author: Nell Dale, John Lewis
Publisher: Jones & Bartlett Learning
Question
Book Icon
Chapter 2, Problem 32E
Program Plan Intro

a.

Decimal numbers:

  • A decimal number is a number in which the whole number part and the fractional part is separated by a decimal point.
  • The dot is known as a decimal point of a decimal number.
  • Hence decimal numeral system is a method for representing both integer and non-integer numbers.

Octal numbers:

  • Octal number system is also known as base 8 number system and uses the digits 0 to 7.
  • These are made from binary numerals by grouping consecutive binary digits into three groups starting from the right.
  • Octal numbers also make it easy to write large binary numbers into smaller groups.

Explanation of Solution

b.

Conversion of decimal number 321 into octal value:

  • Since it is octal, divide the number 321 by 8 repeatedly. It returns 40 as quotient and 1 as remainder.
  • Now divide 40 by 8 and it returns 5 as quotient and 0 as remainder.
  • Now divide 5 by 8 and it is not possible as 5 is less than 8...

Explanation of Solution

c.

Conversion of decimal number 1492 into octal number:

  • Since it is octal, divide the number 1492 by 8 repeatedly. It returns 186 as quotient and 4 as remainder.
  • Now divide 186 by 8 and it returns 23 as quotient and 2 as remainder.
  • Now divide 23 by 8 and it returns 2 as quotient and 7 as remainder...

Explanation of Solution

d.

Conversion of decimal number 1066 into octal number:

  • Since it is octal, divide the number 1066 by 8 repeatedly. It returns 133 as quotient and 2 as remainder.
  • Now divide 133 by 8 and it returns 16 as quotient and 5 as remainder.
  • Now divide 16 by 8 and it returns 2 as quotient and 0 as remainder...

Explanation of Solution

e.

Conversion of decimal number 2001 into octal number:

  • Since it is octal, divide the number 2001 by 8 repeatedly. It returns 250 as quotient and 1 as remainder.
  • Now divide 250 by 8 and it returns 31 as quotient and 2 as remainder.
  • Now divide 31 by 8 and it returns 3 as quotient and 7 as remainder...

Blurred answer
Students have asked these similar questions
(a) Algebraically determine the output state |q3q2q1q0> (which is a 4-qubitvector in 16-dimensional Hilbert space). Show all steps of your calculations. (b) Run a Qiskit code which implements the circuit and append threemeasurement gates to measure the (partial) output state |q2q1q0> (which is a 3-qubit vector in 8-dimensional Hilbert space). this is for quantum soft dev class, you can use stuff like Deutsch Jozsa if u want
Write a C++ program that will count from 1 to 10 by 1. The default output should be 1, 2, 3, 4, 5, 6 , 7, 8, 9, 10 There should be only a newline after the last number. Each number except the last should be followed by a comma and a space. To make your program more functional, you should parse command line arguments and change behavior based on their values. Argument Parameter Action -f, --first yes, an integer Change place you start counting -l, --last yes, an integer Change place you end counting -s, --skip optional, an integer, 1 if not specified Change the amount you add to the counter each iteration -h, --help none Print a help message including these instructions. -j, --joke none Tell a number based joke.   So, if your program is called counter counter -f 10 --last 4 --skip 2 should produce 10, 8, 6, 4 Please use the last supplied argument. If your code is called counter, counter -f 4 -f 5 -f 6 should count from 6. You should count from first to last inclusively.…
Write a program that will count from 1 to 10 by 1. The default output should be 1, 2, 3, 4, 5, 6 , 7, 8, 9, 10 There should be only a newline after the last number. Each number except the last should be followed by a comma and a space. To make your program more functional, you should parse command line arguments and change behavior based on their values. Argument Parameter Action -f, --first yes, an integer Change place you start counting -l, --last yes, an integer Change place you end counting -s, --skip optional, an integer, 1 if not specified Change the amount you add to the counter each iteration -h, --help none Print a help message including these instructions. -j, --joke none Tell a number based joke.   So, if your program is called counter counter -f 10 --last 4 --skip 2 should produce 10, 8, 6, 4 Please use the last supplied argument. If your code is called counter, counter -f 4 -f 5 -f 6 should count from 6. You should count from first to last inclusively. You…
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education