Kruskal's algorithm

    Page 1 of 7 - About 70 Essays
  • PICT Case Study

    support constarint in their algorithm. CTWeb is a combinational testing tool for web application. The relationship between CTWeb and PROW is, CTWeb implemented PROW algorithm along with other algorithms in their development. Test parameter and parameter value was insert into CTWeb in two ways, manually or upload the value file. CTWeb also support constraints and weight where the value can be defined by CTWeb user. Another additional features of CTWeb is its ability to set base test suite where a list of test case was used as base for PROW algorithm. Having all information needed, CTWeb execute PROW algorithm for the second times to reduce pairs obtained from the first execution. Then, the result will be sorted according to the weight of each pairs. Considered general PROW algorithm while ignoring the pre and post PROW algorithm. The complexity of PROW algorithm can be calculated as O(n) for while statement in line 2 since it iterate until specified value is meet. Then, in for loop the maximum number is when no more remaining pair is found, n. Since the second for loop also have same maximum number, Big-O notation for this for loop is O(n2). Thus, the lower bound and final result of Big-O notation is…

    Words: 1546 - Pages: 7
  • Essay On Cyberspace

    Computers and technology at large have change the lives of many people in the world both positively and negatively. Computers have unveiled many things which have greatly influenced our lives. This has made many teachers and students to adopt their use in classrooms. However, the use of computers in our classrooms have been characterized by over reliance on them. Cyber space have also played key roles in our lives. For instance there is increase in the number of research paper done each day…

    Words: 935 - Pages: 4
  • Math Personal Statement

    A relationship with numbers and codes is my fate. I learned math for an Olympic Mathematics Competition that I’ve been involved in since I was 9 years old. I became familiar with algorithms like congruence, Horner algorithm and graph theory before I could use a computer. Now as a senior in the school of mathematics at XX University, one of the top three mathematical schools in China. I chose math as my major to build a good mathematical foundation to thoroughly learn about computer science. With…

    Words: 835 - Pages: 4
  • Zappos's Core Values

    With a computer science degree from Harvard, Tony knew how to write code, and he decided to try a similarly algorithmic approach to creating culture. He devised a Ten-Commandments-type list (Exhibit III) that included such tenets as, “Be Humble”, “Create fun and a little weirdness” and “Build open and honest relationships with communication.” From that moment, those core values have driven all key decisions – from hiring to customer relationships to, most recently, downsizing. Tony explained,…

    Words: 1451 - Pages: 6
  • Travelling Salesman Problem Analysis

    A COMPARITIVE STUDY OF NEAREST NEIGHBOUR ALGORITHM AND GENETIC ALGORITHM IN SOLVING TRAVELLING SALESMAN PROBLEM Ajaz Ahmed Khan Electronics and communication department SSGI FET Bhilai, India ajz70277@gmail.com Mrs. Himani Agrawal Electronics and communication department SSGI FET Bhilai, India Abstract—In this paper, we have used two algorithms, i.e. the Nearest Neighbor algorithm and Genetic Algorithm to solve the Travelling Salesman problem. The Travelling Salesman…

    Words: 1906 - Pages: 8
  • Why I Chose Computer Science Essay

    My chosen major is Computer Science with a business concentration. I have always had an affinity for computers. It seems like on some level they speak to me and I wanted to learn how to speak back in their language. I also am a pretty big gamer and learning how to write and design games is something I have wanted to learn since I was about thirteen years old. Another reason I want to major in computer science is the ongoing proliferation of Internet connected devices and devices with single chip…

    Words: 725 - Pages: 3
  • Outliers Rhetorical Analysis Essay

    In the book, Outliers: The Story of Success, by Malcolm Gladwell, the author is challenging our views of how people become successful. He is saying that to get to where you want to be you can’t rely solely on hard work or determination. It takes much more than that, something that many of us don’t get; opportunities. If you want to be successful, you need a series of opportunities that present themselves to you at the right time, to put you ahead of everyone else. He proves this idea in chapter…

    Words: 1564 - Pages: 7
  • The Secret Of A Successful Job Essay

    The Secret Of A Successful Job There is one of the most important ways to make your job better, and doing a special work. The way to do a successful job is to love what you do. Successful people love what they work on. For example: Steve Jobs is one of powerful people, he always says, “The only way to do great work is to love what you do”. In my own experience, I studied Computer Science for two years at University of Kuwait. Then, I worked at a petroleum company called KJO, which is one…

    Words: 1214 - Pages: 5
  • Initial Needs Assessment Paper

    Presenting Needs and Initial Intake: Our holistic work with community members begins with our Direct Service Network. Upon arrival at the Panacea Institute for Equality in Education, families are greeted with a “pre-screen” process to determine their presenting need. At this initial entry point, education challenges supersede all other family challenges. The support staff responsible for the prescreening process will determine the severity of the educational challenge and will determine how…

    Words: 2066 - Pages: 8
  • Summary: The Imitation Game

    Movie: The Imitation Game Internet The imitation game is a movie about Alan Turing and the Enigma-code. He is a mathematical. The movie takes place in the WO2. The Germans had decrypted all their massages so that the American and the British army can’t understand and read the massages. Alan Turing should cracking the code. Under time pressure, he makes a machine who can crack the codes. After two years it finely worked. Now it was possible to read every massages. The Germans…

    Words: 1034 - Pages: 5
  • Previous
    Page 1 2 3 4 5 6 7

Related Topics:

Popular Topics: