Essentials of Computer Organization and Architecture
Essentials of Computer Organization and Architecture
5th Edition
ISBN: 9781284123036
Author: Linda Null
Publisher: Jones & Bartlett Learning
Expert Solution & Answer
Book Icon
Chapter 2, Problem 12E

a)

Explanation of Solution

Converting “110001.10101 to decimal equivalent:

Step 1: First separate the given binary fractions into two parts, left binary part and right binary fractions.

Step 2: To convert the binary fraction into decimal number, multiply the left part of the binary number with the positive integers for base 2.

Step 3: Multiply the right part of the binary number with the negative integers for base 2.

Step 4: Add all the values to get the final result.

110001.10101    =1x25+1x24+0x23+0x22+0x21+1x20+1x21+0x22+1x23+0x24+1x25 =32+16+0+0+0+1+0.5+0+0.125+0+0.03125 =49.65625

Thus, the decimal equivalent of 10001.10101 is “49.6562510”.

b)

Explanation of Solution

Converting “111001.001011” to decimal equivalent:

Step 1: First separate the given binary fractions into two parts, left binary part and right binary fractions.

Step 2: To convert the binary fraction into decimal number, multiply the left part of the binary number with the positive integers for base 2.

Step 3: Multiply the right part of the binary number with the negative integers for base 2.

Step 4: Add all the values to get the final result.

111001.001011  =1x25+1x24+1x23+0x22+0x21+1x20+0x21+0x22+1x23+0x24+1x25+1x26 =32+16+8+0+0+1+0+0+0.125+0+0.03125+0.015625 =57.171875

Thus, the decimal equivalent of 111001.001011 is “57.17187510”.

c)

Explanation of Solution

Converting “1001001.10101 to decimal equivalent:

Step 1: First separate the given binary fractions into two parts, left binary part and right binary fractions.

Step 2: To convert the binary fraction into decimal number, multiply the left part of the binary number with the positive integers for base 2.

Step 3: Multiply the right part of the binary number with the negative integers for base 2.

Step 4: Add all the values to get the final result.

1001001.10101=1x26+0x25+0x24+1x23+0x22+0x21+1x20+1x21+0x22+1x23+0x24+1x25 =64+0+0+8+0+0+1+0.5+0+0.125+0+0.03125 =73.65625

Thus, the decimal equivalent of 1001001.10101 is “73.6562510”.

d)

Explanation of Solution

Converting “11101001.110001 to decimal equivalent:

Step 1: First separate the given binary fractions into two parts, left binary part and right binary fractions.

Step 2: To convert the binary fraction into decimal number, multiply the left part of the binary number with the positive integers for base 2.

Step 3: Multiply the right part of the binary number with the negative integers for base 2.

Step 4: Add all the values to get the final result.

11101001.110001=1x27+1x26+1x25+0x24+1x23+0x22+0x21+1x20+1x21+1x22+0x23+0x24+0x25+1x26 =128+64+32+0+8+0+0+1+0.5+0.25+0+0+0+0.015625 =233.765625

Thus, the decimal equivalent of 11101001.110001 is “233.76562510”.

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
Whentheuserenters!!,themostrecentcommandinthehistoryisexecuted.In the example above, if the user entered the command: Osh> !! The ‘ls -l’ command should be executed and echoed on user’s screen. The command should also be placed in the history buffer as the next command. Whentheuserentersasingle!followedbyanintegerN,theNthcommandin the history is executed. In the example above, if the user entered the command: Osh> ! 3 The ‘ps’ command should be executed and echoed on the user’s screen. The command should also be placed in the history buffer as the next command. Error handling: The program should also manage basic error handling. For example, if there are no commands in the history, entering !! should result in a message “No commands in history.” Also, if there is no command corresponding to the number entered with the single !, the program should output "No such command in history."
Activity No. Activity Time (weeks) Immediate Predecessors 1 Requirements collection 3 2 Requirements structuring 4 1 3 Process analysis 3 2 4 Data analysis 3 2 5 Logical design 50 3,4 6 Physical design 5 5 7 Implementation 6 6 c. Using the information from part b, prepare a network diagram. Identify the critical path.
2. UNIX Shell and History Feature [20 points] This question consists of designing a C program to serve as a shell interface that accepts user commands and then executes each command in a separate process. A shell interface gives the user a prompt, after which the next command is entered. The example below illustrates the prompt osh> and the user's next command: cat prog.c. The UNIX/Linux cat command displays the contents of the file prog.c on the terminal using the UNIX/Linux cat command and your program needs to do the same. osh> cat prog.c The above can be achieved by running your shell interface as a parent process. Every time a command is entered, you create a child process by using fork(), which then executes the user's command using one of the system calls in the exec() family (as described in Chapter 3). A C program that provides the general operations of a command-line shell can be seen below. #include #include #define MAX LINE 80 /* The maximum length command */ { int…

Chapter 2 Solutions

Essentials of Computer Organization and Architecture

Ch. 2 - Prob. 11RETCCh. 2 - Prob. 12RETCCh. 2 - Prob. 13RETCCh. 2 - Prob. 14RETCCh. 2 - Prob. 15RETCCh. 2 - Prob. 16RETCCh. 2 - Prob. 17RETCCh. 2 - Prob. 18RETCCh. 2 - Prob. 19RETCCh. 2 - Prob. 20RETCCh. 2 - Prob. 21RETCCh. 2 - Prob. 22RETCCh. 2 - Prob. 23RETCCh. 2 - Prob. 24RETCCh. 2 - Prob. 25RETCCh. 2 - Prob. 26RETCCh. 2 - Prob. 27RETCCh. 2 - Prob. 28RETCCh. 2 - Prob. 29RETCCh. 2 - Prob. 30RETCCh. 2 - Prob. 31RETCCh. 2 - Prob. 32RETCCh. 2 - Prob. 33RETCCh. 2 - Prob. 34RETCCh. 2 - Prob. 1ECh. 2 - Prob. 2ECh. 2 - Prob. 3ECh. 2 - Prob. 4ECh. 2 - Prob. 5ECh. 2 - Prob. 6ECh. 2 - Prob. 7ECh. 2 - Prob. 8ECh. 2 - Prob. 9ECh. 2 - Prob. 10ECh. 2 - Prob. 11ECh. 2 - Prob. 12ECh. 2 - Prob. 13ECh. 2 - Prob. 14ECh. 2 - Prob. 15ECh. 2 - Prob. 16ECh. 2 - Prob. 17ECh. 2 - Prob. 18ECh. 2 - Prob. 19ECh. 2 - Prob. 20ECh. 2 - Prob. 21ECh. 2 - Prob. 22ECh. 2 - Prob. 23ECh. 2 - Prob. 24ECh. 2 - Prob. 25ECh. 2 - Prob. 26ECh. 2 - Prob. 27ECh. 2 - Prob. 29ECh. 2 - Prob. 30ECh. 2 - Prob. 31ECh. 2 - Prob. 32ECh. 2 - Prob. 33ECh. 2 - Prob. 34ECh. 2 - Prob. 35ECh. 2 - Prob. 36ECh. 2 - Prob. 37ECh. 2 - Prob. 38ECh. 2 - Prob. 39ECh. 2 - Prob. 40ECh. 2 - Prob. 41ECh. 2 - Prob. 42ECh. 2 - Prob. 43ECh. 2 - Prob. 44ECh. 2 - Prob. 45ECh. 2 - Prob. 46ECh. 2 - Prob. 47ECh. 2 - Prob. 48ECh. 2 - Prob. 49ECh. 2 - Prob. 50ECh. 2 - Prob. 51ECh. 2 - Prob. 52ECh. 2 - Prob. 53ECh. 2 - Prob. 54ECh. 2 - Prob. 55ECh. 2 - Prob. 56ECh. 2 - Prob. 57ECh. 2 - Prob. 58ECh. 2 - Prob. 59ECh. 2 - Prob. 60ECh. 2 - Prob. 61ECh. 2 - Prob. 62ECh. 2 - Prob. 63ECh. 2 - Prob. 64ECh. 2 - Prob. 65ECh. 2 - Prob. 66ECh. 2 - Prob. 67ECh. 2 - Prob. 68ECh. 2 - Prob. 69ECh. 2 - Prob. 70ECh. 2 - Prob. 71ECh. 2 - Prob. 72ECh. 2 - Prob. 73ECh. 2 - Prob. 74ECh. 2 - Prob. 75ECh. 2 - Prob. 76ECh. 2 - Prob. 77ECh. 2 - Prob. 78ECh. 2 - Prob. 79ECh. 2 - Prob. 80ECh. 2 - Prob. 81ECh. 2 - Prob. 82E
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