Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Rearranging Trains - Computer Engineering - Lecture Slides, Slides of Computer Science

Some concept of Computer Engineering are Binary Search, Byzantine Generals, Euclid Sequences, Houses and Utilities, Malfunction Diagnosis. Main points of this lecture are: Rearranging Trains, Sorted Order, Engine, Track, Train Cars, Stub or Lead, Data Structure, Ordering, Devising a Sorting Algorithm, Pulled

Typology: Slides

2012/2013

Uploaded on 04/30/2013

naji
naji 🇮🇳

4.3

(6)

88 documents

1 / 4

Toggle sidebar

Related documents


Partial preview of the text

Download Rearranging Trains - Computer Engineering - Lecture Slides and more Slides Computer Science in PDF only on Docsity! Rearranging Trains B A D C Stub or lead B A D C Sorted order B A D C Stub or lead Stack or LIFO data structure in CE B A D C Stub or lead Question: Is there an ordering that cannot be sorted using a stub? Devising a sorting algorithm B A D C Siding Queue or FIFO B A D C Track Train cars Engine Docsity.com Delivering Train Cars in a Specific Order 1 B A D C 2 3 Cars in the train below have been sorted according to their delivery points. However, it is still nontrivial to deposit car A in stub 1, car B in stub 2, and car C in siding 3. Cars can be pulled or pushed by the engine. 1 2 3 1 2 3 Is there a better initial ordering of the cars for the deliveries in this puzzle? Docsity.com