5. (a) A small car ferry operating between two islands has three lanes, each 20 m long on its car deck. On one trip, the vehicles waiting to use the ferry are: vehicle car 1 car 2 car with caravan car with trailer camper van lorry 1 lorry 2 van length [m] 4 4 10 7 6 10 12 7 (i) Calculate the lower bound for the number of lanes required. Based on l, could all vehicles fit on the ferry on one trip? (ii) Use the first fit decreasing algorithm to estimate the minimum number of lanes to fit all vehicles. Does the first fit decreasing algorithm give an optimal solution? (b) You have received the following 7+4 bit Hamming encoded message (the Hamming bits are underlined): 11110110000 Assume the message has been corrupted by at most single bit errors per symbol. Correct the message if necessary.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
5. (a) A small car ferry operating between two islands has three lanes, each 20 m long
on its car deck. On one trip, the vehicles waiting to use the ferry are:
vehicle
car 1
car 2
car with caravan
car with trailer
camper van
lorry 1
lorry 2
van
length [m]
4
4
10
7
6
10
12
7
(i) Calculate the lower bound for the number of lanes required. Based on l,
could all vehicles fit on the ferry on one trip?
(ii) Use the first fit decreasing algorithm to estimate the minimum number of
lanes to fit all vehicles. Does the first fit decreasing algorithm give an optimal
solution?
11110110000
(b) You have received the following 7+4 bit Hamming encoded message (the Hamming
bits are underlined):
Assume the message has been corrupted by at most single bit errors per symbol.
Correct the message if necessary.
Transcribed Image Text:5. (a) A small car ferry operating between two islands has three lanes, each 20 m long on its car deck. On one trip, the vehicles waiting to use the ferry are: vehicle car 1 car 2 car with caravan car with trailer camper van lorry 1 lorry 2 van length [m] 4 4 10 7 6 10 12 7 (i) Calculate the lower bound for the number of lanes required. Based on l, could all vehicles fit on the ferry on one trip? (ii) Use the first fit decreasing algorithm to estimate the minimum number of lanes to fit all vehicles. Does the first fit decreasing algorithm give an optimal solution? 11110110000 (b) You have received the following 7+4 bit Hamming encoded message (the Hamming bits are underlined): Assume the message has been corrupted by at most single bit errors per symbol. Correct the message if necessary.
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,