StudentShare
Contact Us
Sign In / Sign Up for FREE
Search
Go to advanced search...

Algorithm Visualization - Book Report/Review Example

Comments (0) Cite this document
Summary
Shaffer, Cooper and Edwards (2007) embarked on a journey to ascertain the state of the field of algorithm visualization. Their study was concerned with seeking answers to questions such as how content is distributed among topics, who created algorithm visualizations and when, the overall quality of available visualizations, and how visualizations are disseminated…
Download full paperFile format: .doc, available for editing
GRAB THE BEST PAPER92.3% of users find it useful
Algorithm Visualization
Read TextPreview

Extract of sample "Algorithm Visualization"

Download file to see previous pages This interest in the field can be attributed to a perception that algorithm visualizations can provide a powerful alternative to static written presentations (from textbooks) or verbal descriptions supported by illustrations (from lectures). Perhaps the authors expected that the interest in the subject have generated a wealth of literature and a good number of animated algorithms.
The study can also be said to be animated by the contradiction in studies that are concerned with evaluating the pedagogical usefulness of animated algorithm. Some studies have shown that there is no significant difference between traditional and animated approach while some studies have shown that algorithm visualizations can indeed improve understanding of the fundamental data structures and algorithms. The goal of the study was not to determine which of them are correct but is essentially an investigation of the status of algorithm animation in the contemporary and past setting.
The ideas mentioned in the previous paragraph indicates that there was an effort to test whether the field of algorithm visualization has improved and ascertain to what degree it has benefitted from the dearth of literature it has generated. For this particular study, there was an effort to present a picture of what has been done and what is currently going on in the field of algorithm animation.
4.0 Contribution to theory
With regards to the contribution of the study to the notion to the idea of improving the field of algorithm visualization, the researchers provide a good overview of the health status of the field which can serve as a jump off point for future developments. The study was able to find that most existing algorithm visualizations are of low quality and that the content coverage covers mostly easier topics. Effective repositories or organized collection are not readily available. The authors found that the field appears in need of improvement in dissemination of materials, informing potential developers about what is needed, and propagating known best practices for creating new visualizations. (line 11-18 of p. 150)
5.0 Paradigm
The researchers join in the shift of paradigm from traditional teaching to animated algorithms though not in a direct manner. Instead of an experiment that aimed at establishing that there are significant gains in using animated visualizations, the study offered facts that could help precipitate further interest in the field. Examples of facts include the revelation that relatively few of algorithm animation are pedagogically useful and that the majority of the visualizations cannot be made to work easily. It was also found that only half of the animated visualizations are actually animated and that most of it does not offer the subjects pace control. (line 17-29, p. 152)
6.0 Research Methods adopted
With regards to the research method used, the study employed the survey type as it conducted such an activity to determine 'what's out there' (line 1, p. 151) with regards to animated visualizations. In the search for 'what's out there', the researchers made use of a number of search techniques such as listing all ...Download file to see next pagesRead More
Cite this document
  • APA
  • MLA
  • CHICAGO
(“Algorithm Visualization Book Report/Review Example | Topics and Well Written Essays - 3000 words”, n.d.)
Algorithm Visualization Book Report/Review Example | Topics and Well Written Essays - 3000 words. Retrieved from https://studentshare.org/miscellaneous/1499253-algorithm-visualization
(Algorithm Visualization Book Report/Review Example | Topics and Well Written Essays - 3000 Words)
Algorithm Visualization Book Report/Review Example | Topics and Well Written Essays - 3000 Words. https://studentshare.org/miscellaneous/1499253-algorithm-visualization.
“Algorithm Visualization Book Report/Review Example | Topics and Well Written Essays - 3000 Words”, n.d. https://studentshare.org/miscellaneous/1499253-algorithm-visualization.
  • Cited: 0 times
Comments (0)
Click to create a comment or rate a document

CHECK THESE SAMPLES OF Algorithm Visualization

Visualization for Stress Relaxation

...?Visualization for stress regulation The paper is a proposal for a pretend that I would be giving to the college on the stress reliving skill called visualization. I would be the instructor for this class that will be held for one hour a week for eight consecutive weeks. Space for the class will be provided by the college. The students will be educated free of cost. The fundamental purpose of conducting this class for me will be to help out all fellow students with learning an efficient, natural and cost-effective stress relieving technique. One of the most fundamental skills that every individual requires in order to spend a happy life is stress management. Effective management of the stress enables an individual to optimize on his/her...
4 Pages(1000 words)Essay

Hashing Algorithm

...?HASHING ALGORITHMS Hashing Algorithms Affiliation Introduction Hashing algorithms are used to translate the input of any size to a smaller output of fixed extent by making use of the hash function. In this scenario, this output value is known as the hash value. Basically, this hash value consists of a distinctive and very condensed mathematical illustration of a portion of data. This process of translation from input to output is a compressed mapping, to be precise, the space that is taken by the hash value is a great deal smaller than that of the input. In fact, any value or even a single letter is changed in the input; then the values of hash value will also be changed. Additionally, same hash value can be used in calculation in order...
10 Pages(2500 words)Research Paper

Digital tools and architectural visualization

...? Digital tools and architectural visualization Sur Lecturer Architects are experts in the world of building and formulatingdesigns of the same. They have been known as artists because of their use of the pen to draw. In recent times, computer technologies have been democratized and as a result, a significant change has been felt in the architectural visualization. This is attributed to the availability of digital media which predominantly promotes computer visualization, and the use of architectural design in information systems. In this report the researcher took a study on how technology has affected the world of architecture. The report has found out that technology has changed the way designing used to be done. There is a whole lot...
12 Pages(3000 words)Term Paper

Temporally-Ordered Routing Algorithm

...Temporally-Ordered Routing Algorithm (TORA) The Temporally-Ordered Routing Algorithm (TORA) is an algorithm for routing data across Wireless Mesh Networks or Mobile ad-hoc networks (MANET). It was developed by Vincent Park at the University of Maryland, College Park and the Naval Research Laboratory. Park has patented his work, and owns Nova Engineering, who are marketing a wireless router product based on Parks algorithm. (Wikipedia, 2005, para.1-2) Park and Corson (1997, p.1) name the TORA protocol as one of a family of protocols which they term "link reversal" algorithms. The protocol's reaction is structured as a temporally-ordered sequence of diffusing computations; each computation consisting of a sequence of directed link reversals...
13 Pages(3250 words)Essay

Hash Algorithm and Secure Hash Algorithm

...Your first and sur Your Due Hash Algorithm and Secure Hash Algorithm ""A hash function is a reproducible method of turning some kind of data into a (relatively) small number that may serve as a digital "fingerprint" of the data. The algorithm "chops and mixes" (i.e., substitutes or transposes) the data to create such fingerprints. The fingerprints are called hash sums, hash values, hash codes or simply hashes. (Note that hashes can also mean the hash functions.) Hash sums are commonly used as indices into hash tables or hash files. Cryptographic hash functions are used for various purposes in information security applications.""1 "Hash functions are designed to be fast and to yield few hash collisions in expected input domains. In hash...
12 Pages(3000 words)Essay

Association Rule Mining - Apriori Algorithm

...: generating candidate sets of large items and generating sets of frequent items. Those sets of items which have the level of support exceeding a certain threshold are known as large or frequent sets of items. Those sets of items that are likely to become large or frequent in future are known as candidate sets of items [5]. The algorithms may generate extremely large number of association rules, very often in thousands or even in millions. The association rules themselves are fairly large. As a result it becomes almost impossible for users to understand and validate the complex association rules. This limits the usefulness of the association mining rules [2]. One of the most well known algorithm for generating association mining rules...
7 Pages(1750 words)Case Study

A* Search Algorithm: Artificial Intellegence

...A* Search algorithm - Artificial Intelligence A heuristic resembles an algorithm except that it has a difference of a key. Heuristic is a rule of thumb that can be of help in order to solve a given problem. It considers the knowledge of the problem to aid the search process. (Jones, 2008) and aims at minimizing the number of nodes. A* Search is an uninformed search method which in similarity with the best-search method uses a heuristic function. The major type of heuristic involved in A * search is the admissible heuristic. The A* search uses a heuristic function that is a distance-plus-cost which in turn is a sum of a path-cost function (g(x)) which may not necessarily be heuristic and an admissible heuristic (h(x)). An admissible...
1 Pages(250 words)Assignment

Aerodynamic shape optimization for morphing multi-element airfoil based on CFD by using adjoint method algorithm

...Aerodynamic shape optimization for morphing multi-element airfoil based on CFD by using adjoint method algorithm Issues in aerodynamic design The design of any aerodynamic components involved application of optimization approaches towards attaining very efficient systems. The general steps involved in any aircraft design process are conceptual design, preliminary design and detail design. These steps are explained here considering an aircraft that could be classified as a medium sized vehicle. The conceptual design step requires a manpower support to the tune of 20 to 25 personals and a definite time line could not be stated (McGill, n.d.). As the concept creation is the most vital part in the design process and all the subsequent steps...
6 Pages(1500 words)Dissertation

Algorithm in Todays World

...Algorithm in Today’s World This is a definition essay aimed at understanding the definition, origin and current use of the word ‘algorithm’. Oxford dictionary defines algorithm as a set of rules are instructions which are well defined in order to find a solution to a specific problem (Oxford, 2004). In simple words, algorithm can be defined as a predefined procedure to be followed to arrive at a specific solution for a problem. An algorithm is best illustrated by the concept of a recipe. Like a recipe, algorithm is a procedure with definite steps which if followed will result in an answer or a solution to a problem if there is one (MobileReference, 2007). The origin of the word algorithm is in the name of an Arab mathematician, Muhammad...
1 Pages(250 words)Research Paper

Algorithm

...Algorithm Design, Analysis and Implementation Assignment 3 To find the longest palindrome in the sequence x n Using LCS (Longest Common Subsequence) Definition: Palindromes are sequences 1...n that remain unchanged even if we reverse the order to n...1 and, hence, palindromic subsequence in the given sequence would be a common subsequence between the original array and the reversed array. Solution: The longest palindrome can be found by first finding the longest common subsequence of the given array, and then checking if it satisfies the conditions for palindrome. If not satisfied, the process is repeated with the longest common subsequence as the new array. The algorithm can be summed up as: Algorithm: Complexity Analysis: LCS...
7 Pages(1750 words)Assignment

Critical Chain Project Management Based Heuristics Algorithm

... Critical Chain Project Management Based Heuristics Algorithm This paper is a summary of the article Critical Chain Project Management Based Heuristic Algorithm for Multiple Resources-Constrained Project by Liu Jian-bing Ren Hong and Liu jian-bing Xie Ji-hai. According to the article, critical chain is a new form of technique of project management proposed in 1997 by Dr. El Goldratt (Hong and Ji-hai 330). The paper is divided into six parts which contain different sub-sections that explain the Critical Chain Project Management Based Heuristic Algorithm for Multiple Resources-Constrained Project, a conclusion, and a brief discussion. The Critical Chain Technology Dr. Goldratt utilized TOC in project management in 1997. The project schedule...
2 Pages(500 words)Essay

Data Descriptive Statistics and Visualization

The average GDP of the OECD countries in the year 2011 was USD1,310 billion and vary from the mean by about USD 2,714 billion. About half of the OECD country’s GDP was greater than USD 378 billion. The range of GDP was USD 15,522 billion, with maximum GDP is USD 15,534 billion in the United States and minimum GDP is USD 12.19 billion in Iceland. The distribution of GDP is highly positively skewed (Skew = 4.66). Figure 2 shows the histogram of GDP for the OECD countries in the year 2011. Figure 2 also confirms that the distribution of GDP is highly positively skewed. The average unemployment rate in the OECD countries in the year 2011 was 8.27% and vary from the mean by about 4.09%. About half of the OECD country’s unem...
9 Pages(2250 words)Assignment

Planning and visualization (civil engineering )

...Construction project management Explain why identification of the critical path is important? A critical path specifies all tasks which impact on the completion date of the project. If any of the tasks are late, then entire project will be extended by a similar duration. More often than not, there are task not on the critical path due to project schedule slacks. It is therefore important to identify critical path and hence prioritize completion of tasks with the impact of any delays well-known. Changes to the Critical Path, if the project is developed using As Late as Possible (ALAP) method A critical pat incorporates all tasks, which if delayed, will constitute, a similar period of delay for the entire project. Consequently... project...
8 Pages(2000 words)Assignment

In networking protocol,open shortest path first(OSPF)protocol is better than routing information protocol(RIP)because,it converges the network faults,uses the shortest path first(SPF) algorithm and error detection

...Open Shortest Path First (OSPF) compared to Routing Internet Protocol (RIP) due: Open Shortest Path First (OSPF) and Routing Information Protocol (RIP) In computer networking, there are various techniques used. This includes but not limited to, open shortest path first (OSPF) as well as routing internet protocol (RIP). The protocols makeup an all rounded, complete, wireless network. The two protocols form the main algorithms for routing. Each of the protocols has its own benefits and drawbacks. Routing is the process of selecting a path through which to send data in network traffic. Routing can be applied in various ways such as internet protocols, for sending packet data or even in telephones. The OSPF and the RIP are some...
5 Pages(1250 words)Research Paper

The Art of Data Visualization

... The Art of Data Visualization Golan Levin uses an artistic approach called the visualization of data. In this approach he, systematically or unsystematically, collects data and arranges them according to their shape, size or general semblance onto a computer. Different programs can be used to arrange data based upon preference like shape, color, size, etc. Joshua Davis on the other hand works on a patterned set of figures. These figures could be anything from circles, boxes or flowers. His creativity lies in the fact that how simple figures can be changed with just a single click of a button from the mouse. For example, rotating and rearranging flowers on Photoshop could add a new meaning in art. Both artists use a similar technique...
2 Pages(500 words)Essay

Data Visualization

...Data Visualization al Affiliation Data Visualization The current paper aims to present crucial information regarding campus crime statistics in The University of Findlay and to compare the statistics with three universities located in the Ohio area. The following report details the information which was found on the U.S. Department of Education site (The Campus Saftety and Security Data Analysis Tool). The universities were selected according to the number of enrollees: those with more than 15,000 enrollees (Ohio State University, University of Dayton, and Cleveland State University) versus those with less than 5,000 enrollees (Central State University, Shawnee State University and Wittenberg University). For simplicity, the following...
2 Pages(500 words)Essay

Data Structures and Algorithm Lesson Plan

...Data Structures and Algorithm Lesson Plan Data Structures and Algorithm Lesson Plan : Lesson Title: Data Structures and Algorithm Grade Level: College/University Level Technology Standard (NETS-S) ISTE Standards for Students Subject Area/Content Standard: Information Technology. Technology tool/software: Object Oriented Language i.e. .Java Preparation Prerequisites: 1) Computer Fundamentals: Basic competencies for application of a computer to everyday tasks using standard packages. 2) Introduction to programming: is to enable the student apply high level language for solution of simple scientific problems, and for this purpose to manipulate the inputs/outputs of a computer. 3) Communication skills: equip a student...
6 Pages(1500 words)Essay

False Consensus Basic Algorithm

Various psychologists have come up with numerous studies on the false consensus effect. In doing so, they have given several interpretations of the definition of such a concept. However, the most prevalent definition associated with the false consensus effect is that used by Mullen et al (1985):

False consensus refers to an egocentric bias that occurs when people estimate consensus for their own behaviors. Specifically, the false consensus hypothesis holds that people who engage in a given behavior will estimate that behavior to be more common than it is estimated to be by people who engage in alternative behaviors.

Basically, the false consensus effect is the tendency for individuals to put too much weight on the...

18 Pages(4500 words)Term Paper
sponsored ads
We use cookies to create the best experience for you. Keep on browsing if you are OK with that, or find out how to manage cookies.

Let us find you another Book Report/Review on topic Algorithm Visualization for FREE!

Contact Us