Appeal No. 2002-2237 Page 9
Application No. 09/336,046
We agree with the examiner (answer, page 6) that a linked
list is in effect a simplified tree structure, and we take notice
of this fact2. We further find that in the stored network
displayed in figure 3, the addresses have pointers that point to
a previous entry. For example, address 8 includes pointer 7,
which points to address 7. In addition, address 7 includes
pointer 6, which points to address 6. Address 6 includes pointer
0, which points to address 0. Claim 1 recites "(b.1) searching a
content addressable memory, which contains at least a portion of
the second entry, for a reference to the first entry in the
linked list." It is unclear as to how the stored network of
figure 3 is implemented in a content addressable memory; i.e., it
unclear as to whether figure 3 is a content addressable memory.
In addition, it is unclear as to whether figure 3 discloses
searching a content addressable memory, which contains at least a
portion of a second entry, for a reference to a first entry in a
linked list.
From our review of the portions of Holtz relied upon by the
examiner (col. 6, line 34 through col. 7, line 58) we find no
support for the examiner's position that the reference suggests
2 Pascal Plus, Data Structures, Second Edition, © 1988 D.C. Heath and
Company, page 393. A copy of the pertinent page is enclosed with the
Decision.
Page: Previous 1 2 3 4 5 6 7 8 9 10 11 12 13 Next
Last modified: November 3, 2007