MENU
last data update:
Website loading time
during the test: 2.75 s
cable connection (average): 3.99 s
DSL connection (average): 5.23 s
modem (average): 70.83 s
HTTP headers
HTTP/1.0 200 OK
Content-Type: text/html; charset=UTF-8
Expires: Sat, 15 Oct 2011 08:28:05 GMT
Date: Sat, 15 Oct 2011 08:28:05 GMT
Cache-Control: private, max-age=0
Last-Modified: Fri, 14 Oct 2011 10:01:52 GMT
ETag: "139dac19-b310-43b1-a999-f84396326880"
X-Content-Type-Options: nosniff
X-XSS-Protection: 1; mode=block
Server: GSE
Information about DNS servers
aimforhigh.blogspot.com | CNAME | blogspot.l.google.com | IN | 3600 |
Received from the first DNS server
Request to the server "aimforhigh.blogspot.com"
Received 41 bytes from address 216.69.185.5#53 in 13 ms
Request to the server "aimforhigh.blogspot.com"
You used the following DNS server:
DNS Name: ns09.domaincontrol.com
DNS Server Address: 216.69.185.5#53
DNS server aliases:
Host aimforhigh.blogspot.com not found: 5(REFUSED)
Received 41 bytes from address 216.69.185.5#53 in 13 ms
Received from the second DNS server
Request to the server "aimforhigh.blogspot.com"
Received 41 bytes from address 208.109.255.5#53 in 13 ms
Request to the server "aimforhigh.blogspot.com"
You used the following DNS server:
DNS Name: ns10.domaincontrol.com
DNS Server Address: 208.109.255.5#53
DNS server aliases:
Host aimforhigh.blogspot.com not found: 5(REFUSED)
Received 41 bytes from address 208.109.255.5#53 in 13 ms
Subdomains (the first 50)
compared |
Typos (misspells)
zimforhigh.blogspot.com simforhigh.blogspot.com wimforhigh.blogspot.com qimforhigh.blogspot.com aumforhigh.blogspot.com ajmforhigh.blogspot.com akmforhigh.blogspot.com aomforhigh.blogspot.com a9mforhigh.blogspot.com a8mforhigh.blogspot.com ainforhigh.blogspot.com aikforhigh.blogspot.com aijforhigh.blogspot.com aimdorhigh.blogspot.com aimcorhigh.blogspot.com aimvorhigh.blogspot.com aimgorhigh.blogspot.com aimtorhigh.blogspot.com aimrorhigh.blogspot.com aimfirhigh.blogspot.com aimfkrhigh.blogspot.com aimflrhigh.blogspot.com aimfprhigh.blogspot.com aimf0rhigh.blogspot.com aimf9rhigh.blogspot.com aimfoehigh.blogspot.com aimfodhigh.blogspot.com aimfofhigh.blogspot.com | aimfothigh.blogspot.com aimfo5high.blogspot.com aimfo4high.blogspot.com aimforgigh.blogspot.com aimforbigh.blogspot.com aimfornigh.blogspot.com aimforjigh.blogspot.com aimforuigh.blogspot.com aimforyigh.blogspot.com aimforhugh.blogspot.com aimforhjgh.blogspot.com aimforhkgh.blogspot.com aimforhogh.blogspot.com aimforh9gh.blogspot.com aimforh8gh.blogspot.com aimforhifh.blogspot.com aimforhivh.blogspot.com aimforhibh.blogspot.com aimforhihh.blogspot.com aimforhiyh.blogspot.com aimforhith.blogspot.com aimforhigg.blogspot.com aimforhigb.blogspot.com aimforhign.blogspot.com aimforhigj.blogspot.com aimforhigu.blogspot.com aimforhigy.blogspot.com imforhigh.blogspot.com | amforhigh.blogspot.com aiforhigh.blogspot.com aimorhigh.blogspot.com aimfrhigh.blogspot.com aimfohigh.blogspot.com aimforigh.blogspot.com aimforhgh.blogspot.com aimforhih.blogspot.com aimforhig.blogspot.com iamforhigh.blogspot.com amiforhigh.blogspot.com aifmorhigh.blogspot.com aimofrhigh.blogspot.com aimfrohigh.blogspot.com aimfohrigh.blogspot.com aimforihgh.blogspot.com aimforhgih.blogspot.com aimforhihg.blogspot.com aaimforhigh.blogspot.com aiimforhigh.blogspot.com aimmforhigh.blogspot.com aimfforhigh.blogspot.com aimfoorhigh.blogspot.com aimforrhigh.blogspot.com aimforhhigh.blogspot.com aimforhiigh.blogspot.com aimforhiggh.blogspot.com aimforhighh.blogspot.com |
Location
IP: 209.85.175.132
continent: NA, country: United States (USA), city: Mountain View
Website value
rank in the traffic statistics: 4
There is not enough data to estimate website value.
Basic information
website build using CSS
code weight: 476.56 KB
text per all code ratio: 23 %
title: Aim For High
description:
keywords:
encoding: UTF-8
language: en
Website code analysis
one word phrases repeated minimum three times
Phrase | Quantity |
---|---|
the | 625 |
is | 511 |
of | 439 |
to | 254 |
and | 227 |
in | 224 |
a) | 171 |
c) | 171 |
b) | 170 |
d) | 161 |
what | 124 |
on | 111 |
be | 103 |
output? | 101 |
int | 94 |
as | 83 |
for | 79 |
are | 76 |
that | 71 |
which | 71 |
one | 65 |
following | 64 |
data | 62 |
not | 59 |
if | 58 |
an | 56 |
or | 56 |
will | 55 |
none | 50 |
with | 47 |
list | 45 |
1, | 44 |
ans: | 44 |
this | 43 |
was | 42 |
any | 41 |
linked | 40 |
from | 40 |
key | 40 |
CY | 39 |
wht | 37 |
then | 36 |
it | 35 |
can | 35 |
0, | 34 |
you | 34 |
char | 33 |
used | 33 |
by | 33 |
node | 33 |
value | 33 |
execution | 32 |
so | 31 |
number | 31 |
8085 | 29 |
first | 28 |
NF | 28 |
DBMS | 28 |
error | 27 |
no | 26 |
based | 26 |
out | 26 |
asked | 26 |
questions | 26 |
placement, | 25 |
when | 25 |
like | 25 |
all | 25 |
after | 25 |
INDEX | 25 |
do | 24 |
access | 24 |
know | 23 |
else | 23 |
CSC | 23 |
at | 23 |
memory | 23 |
OR | 23 |
program | 23 |
were | 23 |
more | 23 |
search | 22 |
port | 22 |
very | 22 |
store | 22 |
The | 22 |
main(){ | 22 |
instruction | 22 |
process | 22 |
user | 22 |
address | 22 |
true | 22 |
has | 22 |
find | 22 |
said | 22 |
MVI | 21 |
vpointer | 21 |
MPU | 21 |
functional | 21 |
its | 21 |
status | 21 |
dependency | 21 |
code | 20 |
have | 20 |
given | 20 |
double | 20 |
round | 20 |
full | 20 |
CREATE | 20 |
AND | 20 |
roll_idx | 20 |
type | 20 |
stack | 19 |
ques | 19 |
replacement | 19 |
dimension | 19 |
flag | 19 |
next | 19 |
attribute | 18 |
void | 18 |
how | 18 |
qstns | 18 |
query | 17 |
he | 17 |
end | 17 |
• | 17 |
register | 17 |
a. | 17 |
question | 17 |
AC | 17 |
pointers | 17 |
single | 16 |
linkedlist | 16 |
structure | 16 |
ur | 16 |
about | 16 |
done | 16 |
1. | 16 |
order | 16 |
microprocessor | 15 |
me | 15 |
some | 15 |
ON | 15 |
node. | 15 |
such | 15 |
use | 15 |
methods | 15 |
your | 15 |
context | 15 |
MOV | 15 |
using | 15 |
replacement, | 15 |
computer | 15 |
#define | 14 |
both | 14 |
stored. | 14 |
WE | 14 |
there | 14 |
recursive | 14 |
Cycle | 14 |
determines | 14 |
algorithm | 14 |
interrupt | 14 |
actions | 14 |
defined | 14 |
waiting | 14 |
swaped | 14 |
point | 14 |
but | 14 |
10 | 14 |
terminal | 14 |
thn | 14 |
state | 14 |
valued | 14 |
HLT | 14 |
incomplete | 14 |
gate | 14 |
(program | 14 |
book | 14 |
part | 14 |
clock | 14 |
stored | 14 |
DCR | 14 |
each | 14 |
chunk | 14 |
primary | 13 |
a)1 | 13 |
20 | 13 |
does | 13 |
hav | 13 |
processor | 13 |
3. | 13 |
two | 13 |
much | 13 |
new | 13 |
d)none | 13 |
PC | 13 |
HR | 13 |
must | 13 |
same | 12 |
wich | 12 |
40 | 12 |
program. | 12 |
To | 12 |
file | 12 |
trap | 12 |
door | 12 |
software | 12 |
NAND | 12 |
operation | 12 |
action | 12 |
instructions | 12 |
puts | 12 |
nodes | 12 |
known | 12 |
INTERVIEW | 12 |
foreign | 12 |
printf(“%d”,i); | 12 |
link | 12 |
current | 11 |
result | 11 |
2. | 11 |
last | 11 |
function | 11 |
between | 11 |
request | 11 |
where | 11 |
my | 11 |
none. | 11 |
every | 11 |
should | 11 |
5. | 11 |
=45 | 11 |
functions | 11 |
array | 11 |
serves | 11 |
loop | 11 |
required | 11 |
TRUE | 11 |
least | 11 |
Allocated | 11 |
extern | 11 |
kind | 10 |
available | 10 |
function. | 10 |
100 | 10 |
many | 10 |
connection | 10 |
established | 10 |
before | 10 |
Analysis | 10 |
student, | 10 |
rollno; | 10 |
=20; | 10 |
item | 10 |
transmission | 10 |
NULL | 10 |
compiler | 10 |
normal | 10 |
stores | 10 |
4. | 10 |
had | 10 |
nd | 10 |
input | 10 |
registers. | 10 |
results | 10 |
external | 10 |
only | 10 |
returing | 10 |
without | 10 |
return | 10 |
*ptr | 10 |
-1 | 10 |
speed | 10 |
give | 9 |
name | 9 |
SP | 9 |
paper | 9 |
other | 9 |
abt | 9 |
TECHNICAL | 9 |
second | 9 |
while | 9 |
gate. | 9 |
converted | 9 |
a)2 | 9 |
main() | 9 |
called | 9 |
real | 9 |
switch | 9 |
sub | 9 |
binary | 9 |
into | 9 |
property | 9 |
FALSE | 9 |
they | 9 |
class | 9 |
under | 8 |
completing | 8 |
processer | 8 |
decremented | 8 |
incremented | 8 |
price | 8 |
placed | 8 |
above | 8 |
third | 8 |
always | 8 |
code. | 8 |
XOR | 8 |
compile | 8 |
line | 8 |
area | 8 |
test | 8 |
positive | 8 |
easy | 8 |
similar | 8 |
error. | 8 |
float | 8 |
cannot | 8 |
web | 8 |
control | 8 |
towards | 8 |
null | 8 |
way | 8 |
traversal | 8 |
most | 8 |
exception | 8 |
previous | 8 |
would | 8 |
technical | 8 |
For | 8 |
printf | 8 |
1) | 8 |
steps | 8 |
saving | 8 |
needs | 8 |
atomicity | 8 |
worry | 8 |
keeps | 8 |
out. | 8 |
Technical | 8 |
b)preorder | 8 |
go | 8 |
tree | 8 |
written | 8 |
If | 8 |
Transparent | 8 |
time | 8 |
need | 7 |
fetched | 7 |
38.when | 7 |
bytes | 7 |
ALE | 7 |
CALL | 7 |
performed | 7 |
subdivision | 7 |
39.what | 7 |
cycle. | 7 |
machine | 7 |
A,B | 7 |
B,FFH | 7 |
HAPPY | 7 |
JNC | 7 |
CMA | 7 |
37.A | 7 |
begins | 7 |
generated | 7 |
pulse | 7 |
going | 7 |
period. | 7 |
T- | 7 |
event | 7 |
repeated | 7 |
46.The | 7 |
ADD | 7 |
occur | 7 |
cpu | 7 |
activity | 7 |
productive | 7 |
engaged | 7 |
A,C | 7 |
AEC4H | 7 |
All | 7 |
Machine | 7 |
Instruction | 7 |
State | 7 |
40.At | 7 |
code, | 7 |
B, | 7 |
LXI | 7 |
flags. | 7 |
SADDY | 7 |
JNZ | 7 |
cHarpointer; | 7 |
*)vpointer); | 7 |
&j; | 7 |
&cHar; | 7 |
+3); | 7 |
if(FALSE) | 7 |
push | 7 |
dont | 7 |
lines | 7 |
40; | 7 |
*cHarpointer | 7 |
10.5 | 7 |
dbl | 7 |
10.5; | 7 |
fl | 7 |
if(fl | 7 |
==dbl) | 7 |
cHar | 7 |
vpointer; | 7 |
STAND | 7 |
31.purpose | 7 |
counter)in | 7 |
delay? | 7 |
execute | 7 |
frequency,will | 7 |
2MHz | 7 |
B,38H | 7 |
HAPPY: | 7 |
SADDY: | 7 |
FFH | 7 |
C, | 7 |
35.An | 7 |
dual | 7 |
word) | 7 |
PSW | 7 |
microprocess | 7 |
executed | 7 |
33.The | 7 |
adding----gate(s)to | 7 |
8051microcontroller | 7 |
34.In | 7 |
NOT | 7 |
during | 7 |
period,and | 7 |
d)5 | 7 |
c)3 | 7 |
b)2 | 7 |
candidate | 7 |
_________sub | 7 |
easily | 7 |
parent | 7 |
references | 7 |
contains | 7 |
identified | 7 |
XY,X | 7 |
constraints | 7 |
relation | 7 |
multi | 7 |
hold | 7 |
means | 7 |
schema | 7 |
BCNF | 7 |
additional | 7 |
satisfies | 7 |
___________and | 7 |
columns | 7 |
_________ | 7 |
sort | 7 |
tell | 7 |
false | 7 |
c. | 7 |
This | 7 |
confident | 7 |
HR: | 7 |
system | 7 |
write | 7 |
values | 7 |
FOR | 7 |
,WHERE | 7 |
correlated | 7 |
A) | 7 |
clause | 7 |
nested | 7 |
,SELECT | 7 |
super | 7 |
personal | 7 |
60) | 7 |
removal | 7 |
___________dependency | 7 |
algorithms | 7 |
transctions.this | 7 |
undoing | 7 |
transctions.DBMS | 7 |
load | 7 |
common | 7 |
(or | 7 |
fit,best | 7 |
fit,next | 7 |
effect | 7 |
Questions | 7 |
47. | 7 |
busy | 7 |
completion. | 7 |
progress | 7 |
physical | 7 |
hidden | 7 |
are.users | 7 |
carried | 7 |
48.Either | 7 |
process) | 7 |
accommodate | 7 |
reversible | 7 |
implementations | 7 |
Aptitude | 7 |
condition. | 7 |
involves | 7 |
calls | 7 |
XY | 7 |
technique | 7 |
backing | 7 |
interrupt,usually | 7 |
8. | 7 |
50.Trap | 7 |
placement | 7 |
partions | 7 |
program.The | 7 |
secret | 7 |
undocumented | 7 |
Ques | 7 |
grant | 7 |
entry | 7 |
block | 7 |
ensures | 7 |
five | 7 |
ans | 7 |
than | 6 |
floating | 6 |
printf(“%c”,*(char*)vpointer); | 6 |
printf(“%d”,*(int | 6 |
increase | 6 |
previliged | 6 |
running | 6 |
round. | 6 |
numbers | 6 |
‘g’, | 6 |
“GOOGLE”; | 6 |
e) | 6 |
56.which | 6 |
55.in | 6 |
gates | 6 |
negative | 6 |
nand | 6 |
language | 6 |
sum | 6 |
error: | 6 |
static | 6 |
record | 6 |
Ans: | 6 |
allocation | 6 |
printf(“%s”,(char*)vpointer | 6 |
6. | 6 |
ask | 6 |
per | 6 |
b)10 | 6 |
flow | 6 |
RULE”) | 6 |
printf(“DIVIDE | 6 |
sequence | 6 |
acknowledge | 6 |
STAND”); | 6 |
retransmission | 6 |
58. | 6 |
remember | 6 |
table | 6 |
happen | 6 |
correctly. | 6 |
59)a | 6 |
printf(“UNITED | 6 |
tht | 6 |
people | 6 |
doesn’t | 6 |
identify | 6 |
45 | 6 |
accumulator | 6 |
20; | 6 |
them | 6 |
until | 6 |
57.piggy | 6 |
follow | 6 |
traverse | 6 |
c)10 | 6 |
public | 6 |
authentication.A | 6 |
--->there | 6 |
either | 6 |
phase | 6 |
router | 6 |
bridge | 6 |
PROCESS | 6 |
4) | 6 |
combines | 6 |
--->one | 6 |
speak | 6 |
creating | 6 |
3) | 6 |
sit | 6 |
ascending | 6 |
32.conditional | 6 |
CLICK | 6 |
2) | 6 |
symbol | 6 |
=15 | 6 |
36.In | 6 |
b)S | 5 |
*a, | 5 |
*b){ | 5 |
d)120 | 5 |
a)S | 5 |
d)S | 5 |
easy) | 5 |
%d | 5 |
swap(int | 5 |
,CY | 5 |
c)100.5 | 5 |
b)114.5 | 5 |
,------has | 5 |
NOR | 5 |
simple | 5 |
*b; | 5 |
diff | 5 |
*a^ | 5 |
RD | 5 |
*b^=*a, | 5 |
*ip/*jp; | 5 |
102.3 | 5 |
*a^=*b, | 5 |
15; | 5 |
18.int | 5 |
DIMension(int | 5 |
array[]){ | 5 |
j=2; | 5 |
Error:unresolved | 5 |
JMP | 5 |
17.main(){ | 5 |
=10, | 5 |
i; | 5 |
STA | 5 |
sizeof(array/sizeof(int);} | 5 |
arr[10]; | 5 |
HOLD | 5 |
45, | 5 |
WR | 5 |
stack. | 5 |
swap(); | 5 |
----- | 5 |
*ip | 5 |
&I | 5 |
,*jp | 5 |
=&j; | 5 |
swap(&x,&y); | 5 |
base | 5 |
*++ptr=2; | 5 |
*str | 5 |
29.Memory | 5 |
28.what | 5 |
&i; | 5 |
=300; | 5 |
21.main(){ | 5 |
variables | 5 |
initializers | 5 |
26.For | 5 |
=str; | 5 |
=127; | 5 |
inputes | 5 |
memory, | 5 |
just | 5 |
circuit | 5 |
output,f | 5 |
ind | 5 |
output. | 5 |
1MB | 5 |
while(*ptr++) | 5 |
(*ptr | 5 |
declared | 5 |
a[4] | 5 |
---- | 5 |
instruction. | 5 |
24.void | 5 |
23.Declare | 5 |
TOS(top | 5 |
stack) | 5 |
section | 5 |
15, | 5 |
characters. | 5 |
count | 5 |
Processor | 5 |
8085MPU? | 5 |
*iptr | 5 |
=&i; | 5 |
*)iptr+1)); | 5 |
started | 5 |
=257; | 5 |
30.What | 5 |
comment | 5 |
interrupted | 5 |
20.main(){ | 5 |
taken | 5 |
27.There | 5 |
list. | 5 |
c.base | 5 |
b.component | 5 |
d.derived | 5 |
phases | 5 |
belongs | 5 |
OF | 5 |
container | 5 |
up | 5 |
hybrid | 5 |
devise | 5 |
(rollno); | 5 |
profit | 5 |
objects | 5 |
represents | 5 |
Back-end. | 5 |
Lexical | 5 |
b.false | 5 |
context_free | 5 |
non-empty | 5 |
L,do | 5 |
item>x,then | 5 |
Ans-a | 5 |
My | 5 |
_sensitive | 5 |
dey | 5 |
b.Syntax | 5 |
Optimization | 5 |
d.Intermediate | 5 |
Representation. | 5 |
features | 5 |
a)router | 5 |
Inorder | 5 |
c)post | 5 |
emulation | 5 |
adapter | 5 |
pretend | 5 |
student( | 5 |
index | 5 |
ROLLNO | 5 |
statement | 5 |
use? | 5 |
table.which | 5 |
STUDENT | 5 |
colume | 5 |
allows | 5 |
rollno); | 5 |
crucial | 5 |
SDLC | 5 |
61) | 5 |
d)brouter | 5 |
b)bridge | 5 |
c)hub | 5 |
generation | 5 |
design | 5 |
datagram | 5 |
,connection | 5 |
packet | 5 |
send | 5 |
student | 5 |
Be | 5 |
Return | 5 |
dead | 5 |
lock | 5 |
b)a | 5 |
sophisticated | 5 |
.Each | 5 |
It | 5 |
points | 5 |
.this | 5 |
friendly | 5 |
provides | 5 |
capabilities | 5 |
cross | 5 |
languages. | 5 |
---------.The | 5 |
links | 5 |
/or | 5 |
beginning | 5 |
right | 5 |
primitive | 5 |
=0 | 5 |
0,AC | 5 |
original | 5 |
direction | 5 |
,the | 5 |
,one | 5 |
circular | 5 |
,u | 5 |
begin | 5 |
interface | 5 |
management. | 5 |
heap | 5 |
A. | 5 |
make | 5 |
satisfy | 5 |
------------- | 5 |
conditions | 5 |
child | 5 |
c)smallest | 5 |
a)largest | 5 |
represents:- | 5 |
b)smallest | 5 |
b)false. | 5 |
a)true | 5 |
examples | 5 |
fit.--------- | 5 |
qts | 5 |
Aggregation | 5 |
mainly | 5 |
simplest | 5 |
,which | 5 |
company | 5 |
9. | 5 |
association | 5 |
gave | 5 |
of___________ | 5 |
49.------ | 5 |
PALCEMENT | 5 |
integrity. | 5 |
XCHG | 5 |
TRAP | 5 |
searched | 5 |
engine. | 5 |
directly | 5 |
fields, | 5 |
d)linkage | 5 |
RULE | 5 |
c)DIVIDE | 5 |
subnet | 5 |
we | 5 |
small | 5 |
cache | 5 |
immediate | 5 |
include | 5 |
file, | 5 |
accumulator(){ | 5 |
11.#define | 5 |
5; | 5 |
_AX | 5 |
if(ivar) | 5 |
large | 5 |
7.main(){ | 5 |
13.main() | 5 |
sound | 5 |
picture | 5 |
accumulator(); | 5 |
database, | 5 |
z; | 5 |
6, | 5 |
retail | 5 |
everyday. | 5 |
systems,seen | 5 |
identification | 5 |
barcode | 5 |
6.main(){ | 5 |
a)g40GLE | 5 |
c)g0GLE | 5 |
d)g4GOO | 5 |
replied | 5 |
b)g40GOOGLE | 5 |
som | 5 |
objects,which | 5 |
automatically | 5 |
clrscr()); | 5 |
internal | 5 |
d)0 | 5 |
12.main() | 5 |
=5,j= | 5 |
network | 5 |
network, | 5 |
waves | 5 |
b)UNITED | 5 |
radio | 5 |
DMZ | 5 |
internet. | 5 |
main(); | 5 |
ivar | 5 |
10.main() | 5 |
15.main(){ | 5 |
9..#define | 5 |
:j:j; | 5 |
error:L | 5 |
associated | 5 |
i++; | 5 |
=3; | 5 |
for(; | 5 |
16.main(){ | 5 |
clrscr(); | 5 |
required. | 5 |
10, | 5 |
clrscr() | 5 |
i++=0;) | 5 |
,j?(i,j)?i | 5 |
webservices. | 5 |
select | 5 |
=0; | 5 |
while(+(+i--)!= | 5 |
i- | 5 |
iExtern; | 5 |
14.main() | 5 |
etc | 5 |
containing | 5 |
8.main() | 5 |
what's | 5 |
}what | 5 |
iExtern | 5 |
0) | 5 |
price: | 4 |
Abstract | 4 |
(2times) | 4 |
implementation | 4 |
65) | 4 |
5) | 4 |
heavier | 4 |
66.In | 4 |
modem | 4 |
comes | 4 |
64)a | 4 |
Pointer | 4 |
printf(“%d | 4 |
two word phrases repeated minimum three times
three word phrases repeated minimum three times
B tags
U tags
I tags
images
headers
H1
H2
H3
H4
H5
H6
internal links
external links