Programmable Logic Controllers
Programmable Logic Controllers
5th Edition
ISBN: 9780073373843
Author: Frank D. Petruzella
Publisher: McGraw-Hill Education
Question
Book Icon
Chapter 3, Problem 4RQ
Program Plan Intro

Octal number system:

  • Octal number system is also known as base-8 number system
  • It is because eight distinct elements from 0 to 7 are used to represent a level.
  • It means, in total, octal system has 8 numbers.

Binary number system:

  • In binary system, the numbers “0” and “1” are only used.
  • It means, in total, binary system has only 2 numbers.
  • Therefore, the base used for binary numbering system is 2.

Explanation of Solution

b.

Conversion of octal number 130 to its equivalent binary number:

  • Given, octal number is 130.
  • Each digit of the octal number is converted into three bit binary equivalent.
  • A group of three bit binary refers to its corresponding octal digit.
  • Finally, the binary notation of the given octal number is noted.
  • The following diagram describes the binary notation of the octal number 130...

Explanation of Solution

c.

Conversion of octal number 250 to its equivalent binary number:

  • Given, octal number is 250.
  • Each digit of the octal number is converted into three bit binary equivalent.
  • A group of three bit binary refers to its corresponding octal digit.
  • Finally, the binary notation of the given octal number is noted.
  • The following diagram describes the binary notation of the octal number 250...

Explanation of Solution

d.

Conversion of octal number 1510 to its equivalent binary number:

  • Given, octal number is 1510.
  • Each digit of the octal number is converted into three bit binary equivalent.
  • A group of three bit binary refers to its corresponding octal digit.
  • Finally, the binary notation of the given octal number is noted.
  • The following diagram describes the binary notation of the octal number 1510.

Explanation of Solution

e.

Conversion of octal number 2551 to its equivalent binary number:

  • Given, octal number is 2551.
  • Each digit of the octal number is converted into three bit binary equivalent.
  • A group of three bit binary refers to its corresponding octal digit.
  • Finally, the binary notation of the given octal number is noted.
  • The following diagram describes the binary notation of the octal number 2551.

Explanation of Solution

f.

Conversion of octal number 2634 to its equivalent binary number:

  • Given, octal number is 2634.
  • Each digit of the octal number is converted into three bit binary equivalent.
  • A group of three bit binary refers to its corresponding octal digit.
  • Finally, the binary notation of the given octal number is noted.
  • The following diagram describes the binary notation of the octal number 2634.

Blurred answer
Students have asked these similar questions
6. What is Race condition? How to prevent it? [2 marks] 7. How many synchronization methods do you know and compare the differences. [2 marks] 8. Explain what are the “mutual exclusion”, “deadlock”, “livelock”, and “eventual entry”, with the traffic intersection as an example like dinning philosophy. [2 marks] 9. For memory allocation, what are the difference between internal fragmentation and external fragmentation. Explain with an example. [2 marks] 10. How can the virtual memory map to the physical memory. Explain with an example. [2 marks]
Your answers normally have 50 words. Less than 50 words will not get marks. 1. What is context switch between multiple processes? [2 marks] 2. Draw the memory layout for a C program. [2 marks] 3. How many states does a process has? [2 marks] 4. Compare the non-preemptitve scheduling and preemptive scheduling. [2 marks] 5. Given 4 process and their arrival times and next CPU burst times, what are the average times and average Turnaround time, for different scheduling algorithms including: a. First Come, First-Served (FCFS) Scheduling [2 marks] b. Shortest-Job-First (SJF) Scheduling [2 marks] c. Shortest-remaining-time-first [2 marks] d. Priority Scheduling [2 marks] e. Round Robin (RR) [2 marks] Process Arrival Time Burst Time P1 0 8 P2 1 9 P3 3 2 P4 5 4
a database with multiple tables from attributes as shown above that are in 3NF, showing PK, non-key attributes, and FK for each table? Assume the tables are already in 1NF. [Hint: 3 tables will result after deducing 1NF -> 2NF -> 3NF]
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
Text book image
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Text book image
Np Ms Office 365/Excel 2016 I Ntermed
Computer Science
ISBN:9781337508841
Author:Carey
Publisher:Cengage
Text book image
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Text book image
Enhanced Discovering Computers 2017 (Shelly Cashm...
Computer Science
ISBN:9781305657458
Author:Misty E. Vermaat, Susan L. Sebok, Steven M. Freund, Mark Frydenberg, Jennifer T. Campbell
Publisher:Cengage Learning
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage