answersLogoWhite

0


Best Answer

E. Eight.

User Avatar

Wiki User

16y ago
This answer is:
User Avatar
More answers
User Avatar

Aarti Shah

Lvl 2
3y ago

I want answer

This answer is:
User Avatar

User Avatar

Wiki User

12y ago

E

This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: The next letter in the sequence O T T F F S S?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Computer Science

What kind o f ip address is 161.13.5.15?

Public network


Why zero in computer has a slash?

A normal zero '0' could be confused with the letter 'O' and to avoid confusion, a diagonal slash is often used. Otherwise, you would need to decide whether O is a letter or the number 0, by the shape of the character.


What words can you make out of these letters c g g o k s m n s o you l?

Using each letter only once per word: Cook Kiss Moon So Sun Sum Suck Mock Num Cog Soon And many more but I can't think of any others.


What are the disadvantages of using a Binary Search?

The primary advantage of a binary search algorithm is that searching a sequence can be achieved in logarithmic time. The primary disadvantages are that the data must be in sorted order. Arrays are the ideal container for binary searches as they provide constant-time random-access and are therefore trivial to both sort and search efficiently. Sorted binary trees can also be used, however for optimal performance they must be totally balanced (e.g., red/black binary tree). Constant-time random-access is not a requirement of binary trees, however the cost of maintaining balance during construction of the tree has to be taken into account. With a linear search, we start at one end of the sequence and traverse through the sequence one element at a time until we find the value we're looking for, or we reach the element one-past-the-end of the sequence (in which case the element we're looking for does not exist). For a sequence of n elements, the worst case is O(n). Linear search is ideal for forward lists (singly-linked lists) and lists (doubly-linked lists) as neither provides nor requires constant-time random-access. With binary search, we locate the middle element in the sequence. If that's not the value we are looking for, we can easily determine which half of the sequence contains our value because the elements are in sorted order. So we eliminate the other half and repeat the algorithm with the remaining half. As such, each failure to find the value reduces the number of elements to be searched by half (plus the middle element). If there are no elements in the remaining half then the value does not exist. The worst case is therefore O(log n).


Is 666 a code number of the beast computer?

Take each letter making up the word "COMPUTER" and find its placement in the alphabet. For example C=3 (third letter of the alphabet) and O=15. Add up this total and multiply by the number of cycles a computer ran, which is SIX. The answer you will get is 666 which equals the number of the BEAST and why some mathemeticians in the 1970's considered the computer the DEVIL.