This preview shows page 1. Sign up to view the full content.
Unformatted text preview: posted on the Web and to prevent Web fraud, are likely to emerge in the near future. Currently, no standards exist to ensure the accuracy of mate-rial appearing on the Web, but there are things that you can do. Look for a site’s objectives and its author information, check the currency of the site, and cross-reference any information gathered during a Web search. Key Terms Abstract data type (ADT) pg. 276 Array-based implementation pg. 277 Binary search pg. 296 Binary tree pg. 302 Containers pg. 277 Data structure pg. 277 Directed graph (Digraph) pg. 310 Edge (Arc) pg. 310 Generic data type (class) pg. 283 Graph pg. 310 Leaf node pg. 302 Linked implementation pg. 279 Root pg. 302 Sequential search pg. 295 Undirected graph pg. 310 Vertex pg. 310 Exercises 1. Abstract data types , data structures , and containers : a. Define these terms. b. What do they have in common? c. What distinguishes each from the others?...
View Full Document
This note was uploaded on 01/13/2011 for the course CSE 1550 taught by Professor Marianakant during the Fall '10 term at York University.
- Fall '10