阅读理解Howmanycoinshaveyougotinyourpocketrightnow?Three?Two?orOne?Withaphonecardyoucanmakeupto200callswithoutanychangeatall.1.Whatdoyoudowithit?Gotoatelephoneboxmar
阅读理解 How many coins have you got in your pocket right now? Three? Two? or One? With a phonecard you can make up to 200 calls without any change at all. 1. What do you do with it? Go to a telephone box marked“Phonecard”. Put in your card to start, make your call and when you've finished, a screen tells you how much is left on your card. It costs no extra for the cards, and the calls cost l0p per unit, the same as any other payphone call. You can buy them in units of 10,20,40,100 or 200. 2. Now appearing in a shop near you Near each cardphone place you'll find a shop where you can buy one. They're at bus, train and city tube stations. At many universities, hospitals and clubs, restaurants and gas stations on the highway and shopping centers. At airports and seaports. 3. No more broken payphones Most broken payphones are like that because they've been damaged. There are no coins in a cardphone to excite thieves' interest in it. So you're not probably to find a broken one. Get a phonecard yourself and try it out. Or get a bigger wallet. 1.The passage is most probably ________. [ ]
2.There are three sections in the passage. Which one do you think is about why phonecards are good? [ ]
3.Which statement of the following is right by inference? [ ] A.Using a phonecard will cost you less money than payphone call . B.Phonecards are easier to carry. C.If a thief steals your phonecard, he can't use it any more . D.When you finish your call, take out your card first and then you will see how many calls you can still make. 4.According to the information you get from the passage, how much does a card with 200 units cost? [ ]
|
在一个长度为n的顺序表的表位插入一个新元素的渐进时间复杂度为( )。A.O(n)B.O(1)C.O( 2020-05-23 …
在一个长度为n的顺序表的表尾插入一个新元素的渐进时间复杂度为A.O(n)B.O(1)C.O(n2)D 2020-05-23 …
从二叉搜索树中查找一个元素时,其时间复杂度大致为______。A.O(n)B.O(1)C.O(log 2020-05-23 …
在一个长度为n的顺序表的表尾插入一个新元素的渐进时间复杂度为A.O(n)B.O(1)C.O(n2)D 2020-05-24 …
A.O(n2)和O(1)B.O(nlog2n)和O(1)C.O(nlog2n)和O(n)D.O(n2 2020-05-26 …
A.O(1),O(1)B.O(n),O(1)C.O(n2),O(1)D.O(n),O(n) 2020-05-26 …
一个长度为n的顺序表的表尾插入一个新元素的渐进时间复杂度为(35)。A.O(n)B.O(1)C.O( 2020-05-26 …
A.O(e)B.O(e-1)C.O(e2)D.O(e+10) 2020-05-26 …
已知正方体ABCDA'B'C'D',O是底ABCD对角线的交点,求证:(1)C'O//面AB'D'( 2020-11-02 …
数据结构试题一、单项选择题(10)1、若长度为n的线性表采用顺序存储结构,在其第i个位置插入一个新元 2021-01-14 …