Book tickets knowing flight numbers

I’m trying to book a round trip tickets KRR -> SVO -> AMS -> SEA.

I know there is a flight KRR -> SVO departing at 2:30pm however all search engines then end up with results that give me overnight layover in AMS. If I choose later departing flight they do have me staying overnight in SVO but I need to get there earlier in a day.

Any ideas on how I can go about booking the right combination of flights?

Thank you.

How to present a book online?

Hello everyone! First time poster here.

I am looking for some advice on how to "web-ify" a How-To book that I wrote and put it online.

The problem is that it's not practical to have one webpage that is the entire book, but I'm not sure how to split the book up.

This may sound elementary, but I am selling the book and giving people access, so I don't want to split up the book just any way as that will make the web development part difficult.

Does that make sense?

Missing a connection and don’t have money to book next flight

What happens if I miss a connection flight and it’s my fault? Let’s say i got distracted or something. The airline may not book me onto the next flight because it wasn’t their fault. And if I don’t have the money to book another flight i’m stuck in the airport.

What would be the best course of action under these circumstances?

Can I use Accommodation or Hotel Schema markup if customers can’t book it

We sell ferry travel, and want to capture customers browsing holidays to the destinations in order to raise awareness of going by ferry.

On this page we mention the different types of holiday accomm you could book on the islands and give 3 examples of each. 3 hotels, 3 resorts/holiday parks & 3 self catering apartments.

Can we use the accommodation markup schema, or as we don’t mention price and you can’t book would this be pointless?


Why can I not book these flights on Air France?

I’m looking to book a multi-city itinerary on Air France, specifically CDG–>KIX (Paris CDG to Kansai International) and KIX–>LHR (Kansai International to London Heathrow).

Air France operates flights for both these pairs, and it seems I would be able to book them separately without any issue (though very expensive, of course). However, I can’t book them together (for any amount of money). When I search through ITA Matrix, this combination on Air France does not show up (even though both one-ways show up).

When I search on the Air France website, I get a little bit of hope, since on the first page after the search it indeed lists many flights in both directions. However when I select which flights I want, it gives me a strange error message “There are no flights available. Please modify your travel dates.” (even though it just displayed available flights!).

Is there any hope of booking this combination, perhaps through a SkyTeam partner, or does Air France simply disallow this sort of flight combination?

By the way, the combination CDG–>KIX and NRT–>CDG seems to be easily bookable.

What is the compressibility of this simple “book”?

Compressibility is defined as

$ $ C=\frac{2^{HN}}{2^{H_{max}N}}$ $

The book is made up of a simple alphabet of only {a,b,c,d} which occur with probabilities $ $ P(a)=0.2, P(b)=0.4, P(c)=0.1, P(d)=0.3$ $

In class we were given the example of calculating the entropy of a simple string of coin tosses, where $ N$ is the number of coin tosses.

So, for example, we could say that $ P(heads)=0.1$ and $ P(tails)=0.9$ . The entropy of each coin toss is therefore $ H(p=0.9)=0.469$ If we toss the coin 4 times then we end up with a compressibility of: $ $ C=\frac{2^{HN}}{2^{H_{max}N}}=\frac{2^{0.469\cdot4}}{2^{1\cdot 4}}=22.3\%$ $ How do we extend this to the book case?

The entropy of the letter occurance is $ $ H(p=0.2,p=0.4,p=0.1,p=0.3)=1.85$ $

and the maximum entropy is just 2 bits (i.e. we require 2 bits to descibe four characters)

Since this is all the information given in the question, I presume that we just set $ N=4$ and plug in the values for $ H$ and $ H_{max}$ to get the entropy. However, I am struggeling to see why. Why is $ N$ not the number of letters that make up this book?

Confusion about proof of undecidability of REGULAR TM in Sipser’s book

in the book “Introduction to the Theory of Computation” by Michael Sipser there is an example of undecidable languages in which there is a language REGULR_TM which is described as follows :

REGULAR_TM = { <M> | M is a Turing machine and L(M) is regular language }. Well, Sipser says that this is an undecidable language since we cannot have a decider to decide this language. Because if we could, we could create a TM that decides ATM which we know previously that is undecidable. so this could cause a contradiction. Here is the proof from this book :

Proof. We let R be a TM that decides REGULARtm and construct TM S to decide Atm. Then S works in the following manner.

S = “On input , where M is a TM and w is a string:

  1. Construct the following TM M2.

    M2 = “On input x:

      1. If x has the form 0^n 1^n, accept.    2. If x does not have this form, run M on input w and accept if M accepts w." 
  2. Run R on input <M2>.

  3. If R accepts, accept; if R rejects, reject.”

Now my question is, is this kind of constrcuting a TM S correct? the part that is really confusing me is the part that says “run M on input w and accept if M accepts w”. this is the whole question for Atm. If we could answer that question why we need a machine M2 to feed it into the R and output the result of R. We just “run M on w”.

Also for some languages that [we know] are decidable we can have the same argument and conclude that it is not decidable.

Which book is the most definitive, yet elementary, discussion of C? C++? Python?

I in October 2018 completed the MITx course INTRODUCTION TO COMPUTER SCIENCE AND PROGRAMMING USING PYTHON on the web platform by scoring 97% marks.

Besides that, I’ve also read the first few chapters of the book SCHAUM’S OUTLINES OF THEORY & PROBLEMS OF PROGRAMMING WITH C by Byron S. Gottfried back in 2003, but I don’t remember much from that particular book.

For C, I’ve got the book THE C PROGRAMMING LANGUAGE by Kermighan & Richie, 2nd edition 1988. Is this book still current for learning C? If so, is the discussion in it elementary enough for a learner like me? If not, then which is the most up-to-date book on C?

I also have got the book THE C++ PROGRAMMING LANGUAGE by Bjourn Stroustup, 4th edition. Should I read this book for learning C++? I mean is it going to be accessible enough for me?

And, for learning Python, is the book BEGIN TO CODE WITH PYTHON by Rob Miles going to be a good choice? Or, how about Prof. John V. Guttag’s INTRODUCTION TO COMPUTATION AND PROGRAMMING USING PYTHON WITH APPLICATIONS TO DATA SCIENCE, 3rd edition?

One of my aims in learning Python, especially, is to be able to extend the features of the Non-Visual Desktop Access (NVDA) screen-reading program, which has been coded in Python. Please visit