Algorithms

For a general positive integer n, show that the left-to-right binary method for computing requires between log2n and 2log2n multiplications. Textbook: Algorithms: Sequential, Parallel, and Distributed

Algorithms

Show that computing x15 by either the right-to-left binary method or the left-to-right binary method requires six multiplications, and demonstrate that it can be done using only five multiplications.

Java: Palindrome Using BufferedReader

Write a program that reads in strings of characters and determines if each string is a palindrome. Each string appears on a separate input line. Echo-print each string, followed by " Is a palindrome" if the string is a palindrome or "Is not a palindrome" if the stringis not a palindrome. For example, given the input string Ab ...continues

Algorithms

Trace the action of the algorithm BabylonianSQRT for the following input values of a and error = 0.001: a. a = 6 b. a = 23 c. a = 16

Algorithms

Trace the action of the algorithm NaiveGCD for the following input pairs. a. (24,108) b. (23,108) c. (89,144) d. (1953,1937) Exercise 1.8: Repeat Exercise 1.7 for the algorithm EuclidGCD.

Algorithms - Design and Analysis Fundamentals

a. Design a recursive algorithm whose input is a decimal integer and whose output is the binary representation of the input. b. Design a recursive algorithm that computes the reverse of the result in (a) - that is, converts a binary integer to its decimal equivalent.

Algorithms - Design and Analysis Fundamentals - Recursion - Fibonacci sequence

Prove by induction that fib(1) + fib(2) + ... + fib(n) = fib(n + 2) - 1.

Algorithms - Analyzing Algorithm Performance

Design an algorithm that tests whether or not two input lists of size n have at least one element in common. Give formulas for B(n) and W(n) for your algorithm.

Algorithms - Data Structures and Algorithm Design

Given a linked list, create a linked list with the same elements but in the reverse direction.

Analyzing Some Basic Comparison - Based Algorithms

Given a list L[0:n – 1], one way of maintaining a sorted order of L is to use an auxiliary array Link[0:n – 1]. The array Link[0:n – 1] serves as a linked list determining the next highest element in L, so the elements of L can be given in nondecreasing order by L[Start], L[Link[Start]], L[Link[Link[Start]]], and so forth. The ...continues