Dale - Computer Science Illuminated 340

Dale - Computer Science Illuminated 340 - posted on the Web...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Exercises 313 censor the Web, many individuals assume the responsibility of moni- toring what can and cannot be accessed on their computers. Some people choose to use blocking and filtering systems, but these censoring tech- niques are not entirely effective, and often block either too much or not enough, material. Another potential solution to this problem is the instal- lation of programs that use rating systems to determine what material to block. These filtering systems have developed standard content labels that Web sites can give themselves and each other. Then the users can choose what pages to block based on these content labels. While many people praise filtering programs, others argue that countries could use this filtering system to prevent their citizens from accessing specific mate- rial, for example, from viewing Web sites that contain information that conflicts with their governmental ideals. Laws that not only attempt to control access to pornography and other indecent material, but also to monitor the accuracy of information
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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.

Ask a homework question - tutors are online