Computing desk
< July 28	<< Jun \| July \| Aug >>	July 30 >

Welcome to the Wikipedia Computing Reference Desk Archives
The page you are currently viewing is an archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages.

July 29

Internet Service System

I’m planning to buy an internet service system in UK. What would you suggest?

Requirement is, an Internet Modem Dongle (with or without a simcard in or with it), ‘line rental’ or ‘pay as you go’ which ever provides unlimited ‘GB’ or ‘TB’ daily, weekly and or monthly. What’s the cheapest available; currently?

Note: I would be constantly relocating accommodation places, whatever you guys think is best, please suggest.

116.58.204.130 (talk) 16:35, 29 July 2017 (UTC)[reply]

If you are regularly on the move, then any of these ... or this if you need 50GB per month should give you internet access in about 95% of the UK, but they have monthly gigabyte limits. In some areas, free WiFi is available in many locations. Unlimited terabytes are rare and very expensive. Dbfirs 21:31, 29 July 2017 (UTC)[reply]

Point noted of Wifi. My question is, I'll be on the move, therefore I won't have a fixed address, I won't be able to get a contract. Isn't there no good deal on the pay as you go? 116.58.201.21 (talk) 16:16, 30 July 2017 (UTC)[reply]

You don't need a fixed address for a dongle, but you might if you are buying a phone on credit. PAYG deals tend to be more expensive per GB of data, but they are available in various forms. If you already have a mobile phone then here is 12GB for £40, valid for a year. The dongle version is slightly more. this website has some advice. Dbfirs 20:11, 30 July 2017 (UTC)[reply]

Concise index

I got a list of words ( something like 250,000 words) and I want to retrive repeatedly some words starting with'a' or some words with an'e' as the 4th letter or a 'p' as the 3rd letter. How would a concise index look like? Do I need an index for each letter and position? — Preceding unsigned comment added by 31.4.145.10 (talk) 17:59, 29 July 2017 (UTC)[reply]

You could use a B-tree or even a binary tree on each letter of the word. However it should be noted that 250,000 words is a pretty small list as these things go. Just doing a linear search would not take very long. On my MacBook with a rather slow 1.7 GHz processor, "grep ^...e" to find all words in a 250,000 word list that have 'e' as the fourth letter takes 120 milliseconds. CodeTalker (talk) 18:21, 29 July 2017 (UTC)[reply]

Yes but the list is growing. Anyways I have more interest in the concept to optimize the search than on the search itself.~~|~~ — Preceding unsigned comment added by B8-tome (talk • contribs) 19:26, 29 July 2017 (UTC)[reply]

I don't think that such an index would pay off unless you are repeatedly doing the same search. Bubba73 ^{You talkin' to me?} 00:45, 30 July 2017 (UTC)[reply]