diff --git a/Doc/faq/design.rst b/Doc/faq/design.rst
index 2e56fbc..5d8f3a5 100644
--- a/Doc/faq/design.rst
+++ b/Doc/faq/design.rst
@@ -495,11 +495,7 @@
 to 1142331976.  The hash code is then used to calculate a location in an
 internal array where the value will be stored.  Assuming that you're storing
 keys that all have different hash values, this means that dictionaries take
-constant time -- O(1), in computer science notation -- to retrieve a key.  It
-also means that no sorted order of the keys is maintained, and traversing the
-array as the ``.keys()`` and ``.items()`` do will output the dictionary's
-content in some arbitrary jumbled order that can change with every invocation of
-a program.
+constant time -- O(1), in computer science notation -- to retrieve a key.
 
 
 Why must dictionary keys be immutable?
diff --git a/Doc/faq/programming.rst b/Doc/faq/programming.rst
index 1a2f582..d986ab6 100644
--- a/Doc/faq/programming.rst
+++ b/Doc/faq/programming.rst
@@ -1315,11 +1315,6 @@
 Dictionaries
 ============
 
-How can I get a dictionary to store and display its keys in a consistent order?
--------------------------------------------------------------------------------
-
-Use :class:`collections.OrderedDict`.
-
 I want to do a complicated sort: can you do a Schwartzian Transform in Python?
 ------------------------------------------------------------------------------