O,T,T,F,F,S,S,E,N,?,?,?,T,F,F,S,S,E,N
- 9 Answers
- 20619 Views
- ADP, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / nishanth
o-1
t-2
t-3
f-4
f-5
s-6
s-7
e-8
n-9
T-10
E-11
T-12
t-13
f-14
.
.
.
.
n-19
it is simply the 1,2,3... order
| Is This Answer Correct ? | 26 Yes | 1 No |
Answer / jacob
1 = One = O
2 = Two = T
3 = Three = T
4 = Four = F
5 = Five = F
6 = Six = S
7 = Seven = S
8 = Eight = E
9 = Nine = N
10 = Ten = T
Just look at the first letter of the number and then that
will be you letter
| Is This Answer Correct ? | 22 Yes | 3 No |
Answer / tom the frog
Just stating the obvious:
T, E, T
Given that they are the first letters of the positive integers.
| Is This Answer Correct ? | 8 Yes | 0 No |
Answer / ranjitha
one - 1
Two - 2
and so on
Nine - 9
Ten - 10
Eleven - 11
twelev - 12
| Is This Answer Correct ? | 5 Yes | 0 No |
Answer / raghavendra reddy
N
O
T
it is reapetedly
like:
O,T,T,F,F,S,S,E,N,n,o,t,T,F,F,S,S,E,N,.....
| Is This Answer Correct ? | 5 Yes | 6 No |
by seeing we can understand that .....N O T fit as the
correct possible
| Is This Answer Correct ? | 1 Yes | 3 No |
Answer / pritam
n-- 1st
o-- 2nd
t-- 3 rd
Series is repeated again.
| Is This Answer Correct ? | 6 Yes | 12 No |
Given an array A[n+m] of n+m numbers, where A[1] ... A[n] is sorted and A[n+1] ... A[n+m] is sorted. Design a linear time algorithm to obtain A[1...n+m] sorted using only O(1) extra space. Time Complexity of your algorithm should be O(n) and Space Complexity O(1).
Differentiate between declaring a variable and defining a variable?
When is a null pointer used?
i want explaination about the program and its stack reprasetaion fibbo(int n) { if(n==1 or n==0) return n; else return fibbo(n-1)+fibbo(n-2); } main() { fibbo(6); }
how we can make 3d venturing graphics on outer interface
How can I sort more data than will fit in memory?
Write a program that his output * *** *****
Function which gives a pointer to a binary trees const an integer value at each code, return function of all the nodes in binary tree.?
Predict the output or error(s) for the following: 25. main() { printf("%p",main); }
when user give a number it multiply with 9 without useing '+' and '*' oprator
Program will then find the largest of three numbers using nested if-else statements. User is prompted to enter three numbers. Program will find the largest number and display it on the screen. All three numbers entered by the user are also displayed. If user enters 21, 33, and 5, the output should be as follows: You entered: 21, 33 and 5. The largest number is 33.
What is an operator?
C 
