Prim's Algorithm

Powerful Essays
Topics: Ethics
Early in the information technology revolution Richard Mason suggested that the coming changes in information technologies would necessitate rethinking the social contract (Mason 1986). What he could not have known then was how often we would have to update the social contract as these technologies rapidly change. Information technologies change quickly and move in and out of fashion at a bewildering pace. This makes it difficult to try to list them all and catalog the moral impacts of each. The very fact that this change is so rapid and momentous has caused some to argue that we need to deeply question the ethics of the process of developing emerging technologies (Moor 2008). It has also been argued that the ever morphing nature of information technology is changing our ability to even fully understand moral values as they change. Lorenzo Magnani claims that acquiring knowledge of how that change confounds our ability to reason morally “…has become a duty in our technological world” (Magnani 2007, 93). The legal theorist Larry Lessig warns that the pace of change in information technology is so rapid that it leaves the slow and deliberative process of law and political policy behind and in effect these technologies become lawless, or extralegal. This is due to the fact that by the time a law is written to curtail, for instance, some form of copyright infringement facilitated by a particular file sharing technology, that technology has become out of date and users are on to something else that facilitates copyright infringement (Lessig 1999).
The more specific term “computer ethics” has been used to refer to applications by professional philosophers of traditional Western theories like utilitarianism, Kantianism, or virtue ethics, to ethical cases that significantly involve computers and computer networks. “Computer ethics” also has been used to refer to a kind of professional ethics in which computer professionals apply codes of ethics and standards of good



References:  Stephen Haag, Maeve Cummings and Donald J. McCubbrey. Management Information Systems: For the Information Age, 4th ed. New York, NY: McGraw-Hill, 2003.  Deborah G. Johnson, Computer Ethics, 3rd ed. Upper Saddle River, NJ: Prentice Hall, 2001.

You May Also Find These Documents Helpful

  • Good Essays

    Prim's Algorithm

    • 625 Words
    • 3 Pages

    Prim’s algorithm Prim’s algorithm is an algorithm used to find out the minimum spanning tree. The cost or value of all the paths should be positive. For a given source vertex, this algorithm calculates the minimum distance that should be taken to all the nodes from the source vertex. Algorithm of Prim’s algorithm: 1. Initialize two sets S and V-S, where the set S will have the start vertex and V-S will have all the remaining vertexes. 2. Starting from the source vertex, traverse the adjacent…

    • 625 Words
    • 3 Pages
    Good Essays
  • Satisfactory Essays

    algorithm

    • 1449 Words
    • 6 Pages

    Algorithms Homework – Fall 2000 8.1-1 Using Figure 8.1 as a model, illustrate the operation of PARTITION on the array A = 13 19 9 5 12 8 7 4 11 2 6 21 i j  j 6 19 9 5 12 8 7 4 11 2 13 21 i  i j  j 6 2 9 5 12 8 7 4 11 19 13 21…

    • 1449 Words
    • 6 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Algorithms

    • 324 Words
    • 1 Page

    In computer science, the analysis of algorithms is the determination of the amount of resources (such as time and storage) necessary to execute them. Most algorithms are designed to work with inputs of arbitrary length. Usually, the efficiency or running time of an algorithm is stated as a function relating the input length to the number of steps (time complexity) or storage locations (space complexity). Algorithm analysis is an important part of a broader computational complexity theory, which…

    • 324 Words
    • 1 Page
    Satisfactory Essays
  • Satisfactory Essays

    Algorithm

    • 506 Words
    • 3 Pages

    INFORMATION TECHNOLOGY ASSIGNMENT ON ALGORITHM Done by Densil Hamilton INTRODUCTION This Assignment was done to show the methods of algorithm. It outlines the meaning of algorithm and steps to be carried out to complete a give problem. Examples were also shown for the methods of representing algorithm. What is an Algorithm? An algorithm consists of a set of explicit and unambiguous finite steps which, when carried out for a given set of initial conditions, produce the corresponding…

    • 506 Words
    • 3 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Algorithm

    • 371 Words
    • 2 Pages

    Algorithm is a list of instructions for carrying out some process step by step Flowchart is a diagram representing the logical sequence in which a combination of steps or operations is to be performed Types of Flowcharts Program Flowchart – describes graphically in detail the logical operations and steps within a program and sequence in which these steps are to be executed for the transformation of data to produce the needed output System Flowchart – is a graphic representation of the…

    • 371 Words
    • 2 Pages
    Satisfactory Essays
  • Powerful Essays

    Genetic Algorithm

    • 3320 Words
    • 14 Pages

    2010 A Secure Steganography Method based on Genetic Algorithm Shen Wang, Bian Yang and Xiamu Niu School of Computer Science and Technology Harbin Institute of Technology 150080, Harbin, China shen.wang@ict.hit.edu.cn; bian.yang@ict.hit.edu.cn; xiamu.niu@hit.edu.cn Received April 2009; revised August 2009 Abstract. With the extensive application of steganography, it is challenged by steganalysis. The most notable steganalysis algorithm is the RS attack which detects the steg-message by the…

    • 3320 Words
    • 14 Pages
    Powerful Essays
  • Powerful Essays

    Apriori Algorithm

    • 2095 Words
    • 9 Pages

    APRIORI Algorithm Professor Anita Wasilewska Lecture Notes The Apriori Algorithm: Basics The Apriori Algorithm is an influential algorithm for mining frequent itemsets for boolean association rules. Key Concepts : • Frequent Itemsets: The sets of item which has minimum support (denoted by Li for ith-Itemset). • Apriori Property: Any subset of frequent itemset must be frequent. • Join Operation: To find Lk , a set of candidate k-itemsets is generated by joining Lk-1 with itself. The Apriori…

    • 2095 Words
    • 9 Pages
    Powerful Essays
  • Good Essays

    Gps Algorithm

    • 1700 Words
    • 7 Pages

    Lab Report for Computer Assignment #2 GPS Algorithm Introduction In order to guide each object correctly on the earth, the GPS satellites need to locate them very accurately. The goal of the assignment is to use some optimization methods to locate an object with given pseudo-range data. The signals which are sent from satellites to the target are not accurate because the systematic errors caused by inaccurate receiver clock and some other random noise. The un-accurate range is known as pseudo-range…

    • 1700 Words
    • 7 Pages
    Good Essays
  • Good Essays

    Euclidean algorithm

    • 714 Words
    • 3 Pages

    Euclidean algorithm In mathematics, the Euclidean algorithm, or Euclid's algorithm, is a method for computing the greatest common divisor (GCD) of two (usually positive) integers, also known as the greatest common factor (GCF) or highest common factor (HCF). It is named after the Greek mathematician Euclid, who described it in Books VII and X of his Elements. The GCD of two positive integers is the largest integer that divides both of them without leaving a remainder (the GCD of two integers in…

    • 714 Words
    • 3 Pages
    Good Essays
  • Good Essays

    Algorithms and Flowcharts

    • 738 Words
    • 3 Pages

    Algorithm The term algorithm is often used to refer to the logic of a program It is a step-by step description of how to arrive at the solution of the given problem. It may be formally defined as a sequence of instructions, designed in a manner that, if the instructions are executed in the specified sequence, the desired results will be obtained. In order to qualify as an algorithm, a sequence of instructions must possess the following characteristics: Sample Algorithms 50 Students in a class…

    • 738 Words
    • 3 Pages
    Good Essays