Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Consider the problem of reordering a train of railroad cars using a track layout consisting of a main line and a spur line, as shown in Figure below.   Devise an algorithm that reorders the train as required and calculate its complexity. (Hint: As well as using the three stacks indicated above, you might also want to remember which stack currently contains each car.)

Consider the problem of reordering a train of railroad cars using a track layout consisting of a main line and a spur line, as shown in Figure below.   Devise an algorithm that reorders the train as required and calculate its complexity. (Hint: As well as using the three stacks indicated above, you might also want to remember which stack currently contains each car.)

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
100%

Consider the problem of reordering a train of railroad cars using a track layout consisting of
a main line and a spur line, as shown in Figure below.

 

Devise an algorithm that reorders the train as required and calculate its complexity. (Hint:
As well as using the three stacks indicated above, you might also want to remember which
stack currently contains each car.)

Consider the problem of reordering a train of railroad cars using a track layout consisting of a main line and a spur line, as shown in Figure below. main line [2]1[4]3|6|5 input train output train spur • A train consists of n cars, which are numbered 1 through n. The cars of the old train (which are in no particular order) must be individually uncoupled and reordered to produce a new train (in which the cars are in the correct order). • The old train can be viewed as a stack, with its front car as its 'top' element, since cars can only be removed at its front. That stack initially contains the whole old train. • Similarly, the new train can be viewed as a stack, with its rear car as its 'top' element, since cars can only be added at its rear. That stack is initially empty, but eventually it will contain the whole new train. • The row of cars in the spur can also be viewed as a stack. With the given track layout, the following movements are possible: o Move the front car of the old train to the rear of the new train. o Move the front car of the old train to the spur. o Move a car from the spur to the front of the old train. o Move a car from the spur to the rear of the new train. Devise an algorithm that reorders the train as required and calculate its complexity. (Hint: As well as using the three stacks indicated above, you might also want to remember which stack currently contains each car.)
Transcribed Image Text:Consider the problem of reordering a train of railroad cars using a track layout consisting of a main line and a spur line, as shown in Figure below. main line [2]1[4]3|6|5 input train output train spur • A train consists of n cars, which are numbered 1 through n. The cars of the old train (which are in no particular order) must be individually uncoupled and reordered to produce a new train (in which the cars are in the correct order). • The old train can be viewed as a stack, with its front car as its 'top' element, since cars can only be removed at its front. That stack initially contains the whole old train. • Similarly, the new train can be viewed as a stack, with its rear car as its 'top' element, since cars can only be added at its rear. That stack is initially empty, but eventually it will contain the whole new train. • The row of cars in the spur can also be viewed as a stack. With the given track layout, the following movements are possible: o Move the front car of the old train to the rear of the new train. o Move the front car of the old train to the spur. o Move a car from the spur to the front of the old train. o Move a car from the spur to the rear of the new train. Devise an algorithm that reorders the train as required and calculate its complexity. (Hint: As well as using the three stacks indicated above, you might also want to remember which stack currently contains each car.)
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Similar questions
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS