Simulating a portion of a car using control software Program plan: Create a class “Door”, In the body of “main()” method, create the object for “Scanner” class to get the input from the user. Display the portion of a car with values. Get the dashboard left and right switch, child lock, master unlock, inside and outside left handles, inside and outside right handles and gear shift inputs using “next()” method. Declare and initialize the Boolean variables for the state of left and right doors. Check whether the value of master unlock is “1” and child lock is “0”, If it is “true”, check the values of dash board left is “1” and child lock is “0” or both inside and outside left handles are “1”, then assign the opening state of left door as “true”. check the values of dash board right is “1” and child lock is “0” or both inside and outside right handles are “1”, then assign the opening state of right door as “true”. Check, if the opening state of left door is “true”, and then print “The left door of car opens”. Check, if the opening state of right door is “true”, and then print “The right door of car opens”. Else, Print “Both left and right doors of a car stay closed”.

Question

Want to see the full answer?

Answer 1

Question

Chapter 5, Problem 17PP

Program Plan Intro

Simulating a portion of a car using control software

Program plan:

Create a class “Door”,

In the body of “main()” method, create the object for “Scanner” class to get the input from the user.

Display the portion of a car with values.

Get the dashboard left and right switch, child lock, master unlock, inside and outside left handles, inside and outside right handles and gear shift inputs using “next()” method.

Declare and initialize the Boolean variables for the state of left and right doors.

Check whether the value of master unlock is “1” and child lock is “0”,

If it is “true”, check the values of dash board left is “1” and child lock is “0” or both inside and outside left handles are “1”, then assign the opening state of left door as “true”.

check the values of dash board right is “1” and child lock is “0” or both inside and outside right handles are “1”, then assign the opening state of right door as “true”.

Check, if the opening state of left door is “true”, and then print “The left door of car opens”.

Check, if the opening state of right door is “true”, and then print “The right door of car opens”.

Else,

Print “Both left and right doors of a car stay closed”.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Design a dynamic programming algorithm for the Longest Alternating Subsequence problem described below: Input: A sequence of n integers Output: The length of the longest subsequence where the numbers alternate between being larger and smaller than their predecessor The algorithm must take O(n²) time. You must also write and explain the recurrence. Example 1: Input: [3, 5, 4, 1, 3, 6, 5, 7, 3, 4] Output: 8 ([3, 5, 4, 6, 5, 7, 3, 4]) Example 2: Input: [4,7,2,5,8, 3, 8, 0, 4, 7, 8] Output: 8 ([4, 7, 2, 5, 3, 8, 0,4]) (Take your time with this for the subproblem for this one)

Design a dynamic programming algorithm for the Coin-change problem described below: Input: An amount of money C and a set of n possible coin values with an unlimited supply of each kind of coin. Output: The smallest number of coins that add up to C exactly, or output that no such set exists. The algorithm must take O(n C) time. You must also write and explain the recurrence. Example 1: Input: C24, Coin values = = [1, 5, 10, 25, 50] Output: 6 (since 24 = 10+ 10+1+1 +1 + 1) Example 2: Input: C = 86, Coin values = [1, 5, 6, 23, 35, 46, 50] Output: 2 (since 86 = 46+35+5)

Design a dynamic programming algorithm for the Longest Common Subsequence problem de- scribed below Input: Two strings x = x1x2 xm and y = Y1Y2... Yn Output: The length of the longest subsequence that is common to both x and y. . The algorithm must take O(m n) time. You must also write and explain the recurrence. (I want the largest k such that there are 1 ≤ i₁ < ... < ik ≤ m and 1 ≤ j₁ < ... < jk ≤ n such that Xi₁ Xi2 Xik = Yj1Yj2 ··· Yjk) Example 1: Input: x = 'abcdefghijklmnopqrst' and y = 'ygrhnodsh ftw' Output: 6 ('ghnost' is the longest common subsequence to both strings) Example 2: Input: x = 'ahshku' and y = ‘asu' Output: 3 ('asu' is the longest common subsequence to both strings)