Business Driven Technology
7th Edition
ISBN: 9781259567322
Author: Paige Baltzan Instructor
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter B, Problem B9.8MBD
Explanation of Solution
Listing business department and its environmental issues:
- Accounting and finance department
- Issues
- This department has the issues in computer updates and usage of energy.
- Globalization and the weight for standardization.
- Issues
- Marketing department
- Issues
- The papers are wasted in the marketing campaigns.
- Any kind of devices they use to invite business such as bouncing balls or staplers with the company logo.
- Issues in computer use and energy usage.
- Issues
- Sales department
- Issues
- Energy used with travel and sending sales information.
- Cell phones and additional personal digital assistant (PDA) needed to operate the given job.
- Issues
- Manufacturing department
- Issues
- In this department, the huge amount of energy wasted for producing any product.
- More number of materials is used for creating a product.
- Issues
Most e-waste crating department:
- The manufacturing department makes the most e-waste.
- Reasons
- This department consumes more energy for creating product.
- More number of materials is used for creating a product. So it will increase the waste of product.
- Reasons
Solving environmental issues in each department:
- In sales department
- Supporting customers to solve their given issues.
- Offering services to solve customers’ environmental issues...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Create 6 users: Don, Liz, Shamir, Jose, Kate, and Sal.
Create 2 groups: marketing and research.
Add Shamir, Jose, and Kate to the marketing group.
Add Don, Liz, and Sal to the research group.
Create a shared directory for each group.
Create two files to put into each directory:
spreadsheetJanuary.txt
meetingNotes.txt
Assign access permissions to the directories:
Groups should have Read+Write access
Leave owner permissions as they are
“Everyone else” should not have any access
Submit for grade:
Screenshot of /etc/passwd contents showing your new users
Screenshot of /etc/group contents showing new groups with their members
Screenshot of shared directories you created with files and permissions
⚫ your circuit diagrams for your basic bricks, such as AND, OR, XOR gates and 1 bit multiplexers,
⚫ your circuit diagrams for your extended full adder, designed in Section 1 and
⚫ your circuit diagrams for your 8-bit arithmetical-logical unit, designed in Section 2.
1 An Extended Full Adder
In this Section, we are going to design an extended full adder circuit (EFA). That EFA takes 6 one bit inputs: aj, bj,
Cin, Tin, t₁ and to. Depending on the four possible combinations of values on t₁ and to, the EFA produces 3 one bit
outputs: sj, Cout and rout.
The EFA can be specified in principle by a truth table with 26 = 64 entries and 3 outputs. However, as the EFA
ignores certain inputs in certain cases, it is easier to work with the following overview specification, depending only
on t₁ and to in the first place:
t₁ to Description
00
Output Relationship
Ignored
Inputs
Addition Mode
2 Coutsjaj + bj + Cin, Tout= 0
Tin
0 1
Shift Left Mode
Sj = Cin,
Cout=bj, rout = 0
rin, aj
10
1 1
Shift Right…
Show the correct stereochemistry
when needed!!
mechanism:
mechanism:
Show the correct stereochemistry when needed!!
Br
NaOPh
diethyl ether
substitution
Chapter B Solutions
Business Driven Technology
Ch. B - Prob. B1.1MBDCh. B - Prob. B1.2MBDCh. B - Prob. B1.3MBDCh. B - Prob. B1.4MBDCh. B - Prob. B1.5MBDCh. B - Prob. B1.6MBDCh. B - Prob. B2.1MBDCh. B - Modeling a Business Process Do you hate waiting in...Ch. B - Prob. B2.3MBDCh. B - Prob. B2.4MBD
Ch. B - Prob. B2.5MBDCh. B - Prob. B3.1MBDCh. B - Prob. B3.2MBDCh. B - Prob. B4.1MBDCh. B - Prob. B4.2MBDCh. B - Prob. B4.3MBDCh. B - Prob. B4.4MBDCh. B - Prob. B4.5MBDCh. B - Prob. B4.6MBDCh. B - Prob. B4.7MBDCh. B - Prob. B4.8MBDCh. B - Prob. B4.9MBDCh. B - Prob. B4.10MBDCh. B - Prob. B4.11MBDCh. B - Prob. B5.1MBDCh. B - Prob. B5.2MBDCh. B - Prob. B5.3MBDCh. B - Prob. B5.4MBDCh. B - Prob. B5.5MBDCh. B - Prob. B5.6MBDCh. B - Prob. B6.1MBDCh. B - Prob. B6.2MBDCh. B - Prob. B6.3MBDCh. B - Prob. B6.4MBDCh. B - Prob. B6.5MBDCh. B - Prob. B7.1MBDCh. B - Prob. B7.2MBDCh. B - Prob. B7.3MBDCh. B - Prob. B7.4MBDCh. B - Prob. B7.5MBDCh. B - Prob. B7.6MBDCh. B - Prob. B7.7MBDCh. B - Prob. B7.8MBDCh. B - Prob. B7.9MBDCh. B - Prob. B7.10MBDCh. B - Prob. B7.11MBDCh. B - Prob. B8.1MBDCh. B - Prob. B8.2MBDCh. B - Prob. B9.1MBDCh. B - Prob. B9.2MBDCh. B - Prob. B9.3MBDCh. B - Prob. B9.4MBDCh. B - Prob. B9.5MBDCh. B - Prob. B9.6MBDCh. B - Prob. B9.7MBDCh. B - Prob. B9.8MBDCh. B - Prob. B9.9MBDCh. B - Prob. B9.10MBDCh. B - Prob. B10.1MBDCh. B - Prob. B10.2MBDCh. B - Prob. B10.3MBDCh. B - Prob. B10.4MBDCh. B - Prob. B10.5MBDCh. B - Prob. B11.1MBDCh. B - Prob. B11.2MBDCh. B - Prob. B11.3MBDCh. B - Prob. B11.4MBDCh. B - Prob. B12.1MBDCh. B - Prob. B12.2MBDCh. B - Prob. B12.3MBDCh. B - Prob. B12.4MBDCh. B - Prob. B12.5MBDCh. B - Prob. B12.6MBD
Knowledge Booster
Similar questions
- In javaarrow_forwardKeanPerson #keanld:int #keanEmail:String #firstName:String #lastName: String KeanAlumni -yearOfGraduation: int - employmentStatus: String + KeanPerson() + KeanPerson(keanld: int, keanEmail: String, firstName: String, lastName: String) + getKeanld(): int + getKeanEmail(): String +getFirstName(): String + getLastName(): String + setFirstName(firstName: String): void + setLastName(lastName: String): void +toString(): String +getParkingRate(): double + KeanAlumni() + KeanAlumni(keanld: int, keanEmail: String, firstName: String, lastName: String, yearOfGraduation: int, employmentStatus: String) +getYearOfGraduation(): int + setYearOfGraduation(yearOfGraduation: int): void +toString(): String +getParkingRate(): double In this question, write Java code to Create and Test the superclass: Abstract KeanPerson and a subclass of the KeanPerson: KeanAlumni. Task 1: Implement Abstract Class KeanPerson using UML (10 points) • Four data fields • Two constructors (1 default and 1 constructor with all…arrow_forwardPlz correct answer by best experts...??arrow_forward
- Q3) using the following image matrix a- b- 12345 6 7 8 9 10 11 12 13 14 15 1617181920 21 22 23 24 25 Using direct chaotic one dimension method to convert the plain text to stego text (hello ahmed)? Using direct chaotic two-dimension method to convert the plain text to stego text?arrow_forward: The Multithreaded Cook In this lab, we'll practice multithreading. Using Semaphores for synchronization, implement a multithreaded cook that performs the following recipe, with each task being contained in a single Thread: 1. Task 1: Cut onions. a. Waits for none. b. Signals Task 4 2. Task 2: Mince meat. a. Waits for none b. Signals Task 4 3. Task 3: Slice aubergines. a. Waits for none b. Signals Task 6 4. Task 4: Make sauce. a. Waits for Task 1, and 2 b. Signals Task 6 5. Task 5: Finished Bechamel. a. Waits for none b. Signals Task 7 6. Task 6: Layout the layers. a. Waits for Task 3, and 4 b. Signals Task 7 7. Task 7: Put Bechamel and Cheese. a. Waits for Task 5, and 6 b. Signals Task 9 8. Task 8: Turn on oven. a. Waits for none b. Signals Task 9 9. Task 9: Cook. a. Waits for Task 7, and 8 b. Signals none At the start of each task (once all Semaphores have been acquired), print out a string of the task you are starting, sleep for 2-11 seconds, then print out a string saying that you…arrow_forwardProgramming Problems 9.28 Assume that a system has a 32-bit virtual address with a 4-KB page size. Write a C program that is passed a virtual address (in decimal) on the command line and have it output the page number and offset for the given address. As an example, your program would run as follows: ./addresses 19986 Your program would output: The address 19986 contains: page number = 4 offset = 3602 Writing this program will require using the appropriate data type to store 32 bits. We encourage you to use unsigned data types as well. Programming Projects Contiguous Memory Allocation In Section 9.2, we presented different algorithms for contiguous memory allo- cation. This project will involve managing a contiguous region of memory of size MAX where addresses may range from 0 ... MAX - 1. Your program must respond to four different requests: 1. Request for a contiguous block of memory 2. Release of a contiguous block of memory 3. Compact unused holes of memory into one single block 4.…arrow_forward
- using r languagearrow_forwardProgramming Problems 9.28 Assume that a system has a 32-bit virtual address with a 4-KB page size. Write a C program that is passed a virtual address (in decimal) on the command line and have it output the page number and offset for the given address. As an example, your program would run as follows: ./addresses 19986 Your program would output: The address 19986 contains: page number = 4 offset = 3602 Writing this program will require using the appropriate data type to store 32 bits. We encourage you to use unsigned data types as well. Programming Projects Contiguous Memory Allocation In Section 9.2, we presented different algorithms for contiguous memory allo- cation. This project will involve managing a contiguous region of memory of size MAX where addresses may range from 0 ... MAX - 1. Your program must respond to four different requests: 1. Request for a contiguous block of memory 2. Release of a contiguous block of memory 3. Compact unused holes of memory into one single block 4.…arrow_forwardusing r languagearrow_forward
- Write a function to compute a Monte Carlo estimate of the Beta(3, 3) cdf, and use the function to estimate F(x) for x = 0.1,0.2,...,0.9. Compare the estimates with the values returned by the pbeta function in R.arrow_forwardWrite a function to compute a Monte Carlo estimate of the Gamma(r = 3, λ = 2) cdf, and use the function to estimate F(x) for x = 0.2, 0.4, . . . , 2.0. Compare the estimates with the values returned by the pgamma function in R.arrow_forwardusing r languagearrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Management Of Information SecurityComputer ScienceISBN:9781337405713Author:WHITMAN, Michael.Publisher:Cengage Learning,
Fundamentals of Information SystemsComputer ScienceISBN:9781337097536Author:Ralph Stair, George ReynoldsPublisher:Cengage Learning
Information Technology Project ManagementComputer ScienceISBN:9781337101356Author:Kathy SchwalbePublisher:Cengage Learning
Principles of Information Systems (MindTap Course...Computer ScienceISBN:9781285867168Author:Ralph Stair, George ReynoldsPublisher:Cengage Learning
Fundamentals of Information SystemsComputer ScienceISBN:9781305082168Author:Ralph Stair, George ReynoldsPublisher:Cengage Learning
Management Of Information Security
Computer Science
ISBN:9781337405713
Author:WHITMAN, Michael.
Publisher:Cengage Learning,
Fundamentals of Information Systems
Computer Science
ISBN:9781337097536
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning
Information Technology Project Management
Computer Science
ISBN:9781337101356
Author:Kathy Schwalbe
Publisher:Cengage Learning
Principles of Information Systems (MindTap Course...
Computer Science
ISBN:9781285867168
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning
Fundamentals of Information Systems
Computer Science
ISBN:9781305082168
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning