Nobody downloaded yet

Algorithm design as it relates to time complexity problems like reducing fractions without using the euclidean algorithm for GCD - Research Paper Example

Comments (0) Cite this document
(Your name) (Instructor's name) (Course) (Date) Abstract This report provides an insight into Algorithm design. Two Algorithms have been covered which include Euclid’s and stein’s Algorithm. The report covers basics (mathematical approach) about the algorithms, procedures of each and implementation advantages and disadvantages…
Download full paperFile format: .doc, available for editing
GRAB THE BEST PAPER93.1% of users find it useful
Algorithm design as it relates to time complexity problems like reducing fractions without using the euclidean algorithm for GCD
Read TextPreview

Extract of sample "Algorithm design as it relates to time complexity problems like reducing fractions without using the euclidean algorithm for GCD"

Download file to see previous pages The main difference of Algorithms both circuit implementation, testing and results expected. Modern processors that perform calculations need Algorithm design for present and future programmers. The paper also explains some key terms as used in the text in relation to computer design. It covers the need to maintain optimal code for future programmers due to complexity of testing circuits. Key words: Euclid’s Algorithm, Stein’s Algorithm, Built-In-Self-Test and Linear Feedback Shift Register. Algorithm Design Review of steps involved in solving time complexity problems 1. Euclidean algorithm Euclidean algorithm is an ancient efficient method used in computing the greatest common divisor (GCD) of two integers. The simplest Euclid’s algorithm starts with two positive integers. This then form a new pair that consists of the smaller number and the difference between the smaller and larger numbers. The process repeats until the numbers are equal. The resultant number then is the greatest common divisor of the original two integers. Euclid algorithm is described as GCD(a, 0) = a GCD(a, b) = GCD(b, a mod b) If and b>0, then GCD(a, a) = a GCD(a, b) = GCD(a - b, b) ; if b < a GCD(a, b) = GCD(a, b - a) ; if a < b For example, GCD(20, 0) is 20. Similarly, GCD(20, 10) is same as GCD((20-10), 10) = GCD(10, 10) = 10. 2. Stein’s Algorithm This algorithm is also a binary GCD algorithm. It computes the greatest common divisor of two nonnegative integers (Purdy, 1983). It is more efficient over the ancient Euclidean algorithm because it replaces multiplication and divisions with shifts, which are cheaper when operating on the binary representation used by modern computers. This is critical on embedded platforms available that do not have direct processor support for calculations of division. Stein’s algorithm is described as GCD(0, v) = v GCD(u, 0) = u GCD(0, 0) = 0 When v and u are even, then GCD(u, v) = 2.GCD(u/2, v/2) For an even u and an odd v, then GCD(u, v) = GCD(u/2 v) Similarly, if v is even and u is odd, then GCD(u, v) = GCD(u, v/2) In case, v and u are both odd, and if u ? v, then GCD(u, v) = GCD((u – v)/2, v) In case, both are odd, and u < v, then GCD(u, v) = GCD((v – u)/2, u) When initially solving a problem, how might one detect that a solution needs extra attention with respect to an efficient algorithm vs standard solutions where a highly efficient solution may be indistinguishable from an inefficient one? Identification of a problem is the first step towards solving a given mathematical equation. It involves examining for complexity to be able to simplify before any other complex operations take place. Time requirements spell complexity and attention are hence worth considering. Built-In Self Test (BIST) Modern computers have a built in IC for testing. This technique integrates the functionality of an automated test system within a chip. It is a Design where testing is accomplished by the help of built in hardware features. BIST has test controller, response verification and test generator. Test generator is responsible for generating test address sequence that compares the output from memory with the expected correct data. The BIST controller can be either hardwired logic, microcode controller or based on processor (Rekha Devi, 2011). Specifically discuss the potential tradeoff between an easy to understand inefficient solution vs a difficult to follow efficient solution. By employing Linear Feedback Shift ...Download file to see next pagesRead More
Cite this document
  • APA
  • MLA
(“Algorithm design as it relates to time complexity problems like Research Paper”, n.d.)
Algorithm design as it relates to time complexity problems like Research Paper. Retrieved from
(Algorithm Design As It Relates to Time Complexity Problems Like Research Paper)
Algorithm Design As It Relates to Time Complexity Problems Like Research Paper.
“Algorithm Design As It Relates to Time Complexity Problems Like Research Paper”, n.d.
  • Cited: 0 times
Comments (0)
Click to create a comment or rate a document

CHECK THESE SAMPLES OF Algorithm design as it relates to time complexity problems like reducing fractions without using the euclidean algorithm for GCD

Adaptive Portfolio Management using Evolutionary Algorithm

...the trade. In this research all the execution rules will be complete and do not require fine-tuning. Each portfolio selection strategy will have an execution rule that is known to deliver best performance. III. Risk management rules Apart from selection execution strategies for portfolio management, traders also use various risk management rules to reduce their exposure to risks. Rules such as ‘not to trade beyond a certain percentage of the portfolio budget at a time’ or ‘reduce position sizes after a drawdown of X%’ are some of the most common criteria. Most of the risk management rules need to be fine-tuned and improvised. The evolutionary algorithmic...
9 Pages(2250 words)Essay

Blowfish Encryption Algorithm

.... UNIX based operating systems facilitates the deployment of password authentication mechanisms associated with hashing functions. Likewise, the operating system design provides a choice for different algorithms for deployment along with options to extend capabilities of the authentication mechanism for supporting technological evolution. Operating systems supporting and providing options for enhancements of encryption algorithms is a significant advantage, as the network world add new threats on daily basis, old cryptographic algorithms may become obsolete on detecting even a single vulnerability that may led to the failure of using such encryption...
8 Pages(2000 words)Essay

Hashing Algorithm find two different inputs; for that reason the hashing algorithms are used to determine the reliability and effectiveness of data (comprising digital signatures, authentication and so on). In some cases, these hash values are also acknowledged as a "message digest". In the past few years, the use of hashing algorithms in every walk of science has increased to massive extent. In fact, hashing algorithms are believed to be the most important technique in data structures and randomized algorithms, within a wide variety of applications and fields like that complexity theory, information retrieval, data...
10 Pages(2500 words)Research Paper

Pollard Rho Algorithm

... Pollard’s Rho algorithm Pollard’s Rho algorithm is an algorithm which requires a computation driven solution which is well addressed beneath a multi-core architecture. As the number of digits in number increases, more cores are needed to factorize the number. The most significant application of this algorithm is with Discrete Logarithmic Problem (DLP). It is a probabilistic algorithm which works by sequential iterations of a random quadratic function. Random coefficients are selected for a standard quadratic function which generates numbers, which are reduced modulo the composite number. Sequential iterations of the random quadratic function based on a randomly selected initial number generate a series which starts looping after... a...
3 Pages(750 words)Essay

Algorithm Visualization

.... These data banks contained huge collections gathered through the submission of members of the computer science society. These collections didn't turn out to be useful. (line 23-27, 2nd column of page 153) 7.0 Relevance to Practitioners IS/SE educators could benefit from the effort of the authors to establish a wiki or a repository containing animated algorithms that can provide value to the community. This can help overcome the major impediment that most educators have of knowing what makes a significant difference in learning outcomes and facilitate their synthesis of course material. The students can also benefit from the availability of a site where they can access course material...
12 Pages(3000 words)Book Report/Review

Temporally-Ordered Routing Algorithm

...control message propagation from the rate of topological changes. Such messaging is typically localized to a very small set of nodes near the change without having to resort to a dynamic, hierarchical routing solution with its attendant complexity. (Park and Corson, 1997, p.2) The basic idea is as follows. When a node loses its last downstream link (i.e. becomes a local minimum) as a result of a link failure, the node selects a new height such that it becomes a global maximum by defining a new "reference level". By design, when a new reference level is defined, it is higher than any previously defined reference level. (Park and Corson, 1997, p.4) Detailed Description It is based on the...
13 Pages(3250 words)Essay

FMS Optimisation using Discrete Event Simulation and Genetic Algorithm

...Genetic Algorithms are found to provide solutions for real-time problems in various operations. It has been used conveniently for researchers for various search and optimization problems. Owing to the problems associated with FMS optimization using Genetic algorithm and discrete simulation system this present project is initiated. Kazuhiro Saitou et al. (2002) presented a robust design of FMS using colored Petri nets and genetic algorithm. In their work it was found that the resource allocation and operation schedule were modelled as colored Petri nets....
4 Pages(1000 words)Essay

Hash Algorithm and Secure Hash Algorithm

..., for the protection of sensitive unclassified information. FIPS PUB 180-1 also encouraged adoption and use of SHA-1 by private and commercial organizations. A prime motivation for the publication of the Secure Hash Algorithm was the Digital Signature Standard, in which it is incorporated. The SHA hash functions have been used as the basis for the SHACAL block ciphers."10 "Cryptographic hash ciphers are designed to quickly process large quantities of data; for example, to hash data and append hashes to packet headers on the fly as the packets are sent over the network. The processing rate of cryptographic hash ciphers in MB/sec is generally comparable to the...
12 Pages(3000 words)Essay


...element in the selected half. In the below algorithm lower half is selected. Algorithm: Complexity analysis: As the computation involves halving the array x [1...n] at each round, the running time T (n) = T (n/2) + Θ (n) = Θ (n). 3. Reconstructing a corrupted document using a dictionary: Dynamic Programming algorithm to check if string contains valid words Given: String of n characters s [1...n] Dictionary function dict (w) Sub-problem definition: x (i) is w (i) is the position in s [1...n] of a valid work ending at position i. Solution: We can say that x (i) is true if and only if there exist a ‘j’ (1≤j≤i)...
7 Pages(1750 words)Assignment

Critical Chain Project Management Based Heuristics Algorithm

...was organized and managed by few resources and tackled the unattractive behavior. The project’s execution was supervised by the centralized management of the project buffer extent. Critical chain technology considers both the issues of cognitive and psychological resources-restrained, and the effect in the duties of the next and the former firm relation restriction (Hong and Ji-hai 331). The Steps of Critical Chain Technology The steps include work breakdown structure establishment; activity definition; network chart drawing; constraints-critical chain identification; the employment of restraint, which include the project time estimate activities, feeding buffer and project buffer, and resource buffer;...
2 Pages(500 words)Essay
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 Research Paper on topic Algorithm design as it relates to time complexity problems like reducing fractions without using the euclidean algorithm for GCD for FREE!

Contact Us