<s>
An	O
unsorted	B-Algorithm
list	I-Algorithm
is	O
one	O
"	O
in	O
which	O
data	O
items	O
are	O
placed	O
in	O
no	O
particular	O
order	O
with	O
respect	O
to	O
their	O
content	O
;	O
the	O
only	O
relationships	O
between	O
data	O
elements	O
consist	O
of	O
the	O
list	O
predecessor	O
and	O
successor	O
relationships	O
"	O
.	O
</s>
<s>
A	O
word	O
list	O
is	O
a	O
list	O
of	O
the	O
lexicon	B-Application
of	O
a	O
language	O
(	O
generally	O
sorted	O
by	O
frequency	O
of	O
occurrence	O
either	O
by	O
levels	O
or	O
as	O
a	O
ranked	O
list	O
)	O
within	O
some	O
given	O
text	O
corpus	O
,	O
serving	O
the	O
purpose	O
of	O
vocabulary	O
acquisition	O
.	O
</s>
<s>
Writer	O
Julie	O
Morgenstern	O
suggests	O
"	O
do	O
's	O
and	O
don'ts	O
"	O
of	O
time	B-Application
management	I-Application
that	O
include	O
mapping	O
out	O
everything	O
that	O
is	O
important	O
,	O
by	O
making	O
a	O
task	O
list	O
.	O
</s>
<s>
The	O
traditional	O
method	O
is	O
to	O
write	O
these	O
on	O
a	O
piece	O
of	O
paper	O
with	O
a	O
pen	O
or	O
pencil	B-Device
,	O
usually	O
on	O
a	O
note	O
pad	O
or	O
clip-board	O
.	O
</s>
<s>
Numerous	O
digital	O
equivalents	O
are	O
now	O
available	O
,	O
including	O
personal	B-Application
information	I-Application
management	I-Application
(	O
PIM	O
)	O
applications	O
and	O
most	O
PDAs	B-Application
.	O
</s>
<s>
A	O
completely	O
different	O
approach	O
which	O
argues	O
against	O
prioritizing	O
altogether	O
was	O
put	O
forward	O
by	O
British	O
author	O
Mark	O
Forster	O
in	O
his	O
book	O
"	O
Do	O
It	O
Tomorrow	O
and	O
Other	O
Secrets	O
of	O
Time	B-Application
Management	I-Application
"	O
.	O
</s>
