What is importance of algorithm design or specification in software process?
Q. Could anyone give me some references about the importance of algorithm specification in software process or software design?
Asked by Heath-tO - Sun Mar 23 02:14:32 2008 - - 1 Answers - 0 Comments

A. That's a very broad question, I'm not sure exactly what you are asking. But the importance of algorithms in software is usually related to software performance. The classical example is two computer programs used to sort numbers. One uses the bubble sort algorithm and the other uses quicksort. Both programs will accomplish the sort, but the quicksort version will finish much quicker when the list of numbers is very large. Do a websearch on "O-notation" and "quicksort vs. bubblesort".
Answered by drichird - Thu Mar 27 01:07:03 2008

Design algorithm to list all exact divisors of a number?
Q. Design an algorithm in pascal to produce a list of all exact divisors of a given positive integer number ?
Asked by beena a - Wed Oct 29 11:05:43 2008 - - 1 Answers - 0 Comments

A. So, what did you try? How do you think that it should work? You are meant to learn how to do this, because most of us have better things to do than do your homework for you...
Answered by Germann A - Wed Oct 29 11:47:47 2008

What does this sentence from "Algorithm Design" book mean ?
Q. Does anybody have any idea what this sentence means? "Gale and Shapley considered the sort of things that could start going wrong with this process, in the absence of any mechanism to enforce the status quo." This sentence is from the book "Algorithm Design."(Page 2, First line) I don't understand "in the absence of any mechanism to enforce the status quo." please if u know something let me know..it's urgent!! thanks very very much.
Asked by dubelh - Sun Mar 1 17:02:09 2009 - - 1 Answers - 0 Comments

A. "absence of any mechanism to enforce the status quo." The status quo usually refers to the "the existing state of affairs" i.e. there is nothing to ensure that the existing state of affairs is kept. For example the a parked car on a slope does not move because the handbrake is on. The handbrake is preserving the status quo. Gale and Shapley looked at a process and saw what could go wrong. To continue with the car analogy they thought about what would happen if the handbrake wasn't there
Answered by mark r - Sun Mar 1 17:13:43 2009

The considerations involved in choosing between a recursive and iterative approach to algorithm design?
Q. Would be glad if i could get an answer for this. thanks
Asked by mssrtoothpick - Mon May 12 00:30:10 2008 - - 1 Answers - 0 Comments

A. In the vast majority of cases, it is better to use an iterative approach simply because recursive methods are memory intensive. With a recursion, you're pilling lots of method frames on the stack, and have no control other than your base case. If you can design an algorithm that is more efficient recursively and doesn't have a huge risk of causing a stack overflow (good base case) then go for it. Otherwise use an iterative approach. Another good indication that you should be using an iterative approach is if you're algorithm is tail recursive, that is that the very last line is the recursive call. Also, if the problem the algorithm is solving is easy to break down into simpler problems from which the original problem can be solved, a… [cont.]
Answered by C B - Mon May 12 01:17:37 2008

Design algorithm to check give string is palindrome or not palindrome?
Q. Design algorithm to check give string is palindrome or not palindrome?
Asked by ajeet K - Sat Nov 24 23:59:13 2007 - - 2 Answers - 0 Comments

A. One approach, in a pseudo-C notation: if(string length is 0 or 1) return true; if(first character == last character) { return ispalindrome(string minus 1st and last characters) } else return false;
Answered by laurahal42 - Sun Nov 25 00:04:42 2007

How to design a divide and conquer algorithm for the following quesion?
Q. Given an input string x1; x2; : : : ; xn of 0's and 1's of length n, how hard is it to find an index i and a distance d such that xi = xi+d = xi+2d = 1, if there is one? (That is, find three ones spaced equally in the string.) It is clear it can be done in O(n2) time.Describe an O(n log n) algorithm for solving this problem.
Asked by stfs - Wed Oct 14 11:43:59 2009 - - 1 Answers - 0 Comments

A. One method would be to do the comparisons in parallel. Break the string into d-length segments n/d times. Since the string is composed of 0's and 1's, you could convert/input the d-length binary into an unsigned integer of a size less than d (or break them down further to the max. supported size). Then, AND together every three d-length segment in a rolling fashion. If any resulting AND is non-zero, you must find the position of the most significant 1 and calculate an offset into the input string based upon how many d-length segments have been searched. Assuming you're not supplied with value for d, you should loop through searches using the above strategy for d=2 until d=n/3. Once you've located a match, report the values for both i… [cont.]
Answered by rwid - Fri Oct 16 15:01:46 2009

Design an algorithm to determine whether two sets are disjoint?
Q. Design an algorithm to determine whether two sets are disjoint?
Asked by channing - Tue Apr 14 16:10:48 2009 - - 1 Answers - 0 Comments

A. It would actually pretty easy. You loop through all the elements of the first set, comparing each against each element of the second set. If there are any matches then the sets are not disjoint.
Answered by LoverOfWine - Tue Apr 14 16:15:36 2009

Does anybody know any site or E-BOOK about algorithm design for programming algorithmic problems ?
Q. Does anybody know any site or E-BOOK about algorithm design for programming algorithmic problems ? with C/C++ source codes about each algorithm ,for example source code of a BFS for optimal path.
Asked by Samira K - Fri Oct 27 07:59:03 2006 - - 1 Answers - 0 Comments

A. try to sign up to www.bitsoup.org . there are good ebooks too. i've downloaded a few from there. and you can also try www.torrentz.com and search there for algorithms
Answered by t85us - Fri Oct 27 08:07:57 2006

How to design a c language program and algorithm for implementing merge sort over 16 elements randomly ordered?
Q. integer array, also try to determine how can the complexity of traditional sorting algorithms be improved by applying divide and conquer approach
Asked by Sabika - Fri Nov 27 09:14:38 2009 - - 2 Answers - 0 Comments

A. You can find the code here with a video explanation. Just change the array size in the code.
Answered by prog - Sat Nov 28 19:04:27 2009

String Separation Algorithm Design Puzzle?
Q. Many object-oriented programming languages implement a class for manipulating strings. A primitive operation supported by such languages is to split a string into two pieces. This operation usually involves copying the original string. Hence, a split operation takes n units of time for a string of length n, regardless of the location of the split. However, if we want to split a string into many pieces, the order in which we make the breaks can aect the total running time of all the splits. For example, suppose we want to split a 20-character string at positions 3 and 8. If we make the first cut at position 3, the cost of the rst cut is the length of the string, which is 20. Now the cut at position 8 falls within the second string, whose… [cont.]
Asked by thebeatboxguy - Sat Dec 12 15:17:51 2009 - - 1 Answers - 0 Comments

A. use the Pearson's chi square test
Answered by Etienne de Quercy, Big Pointure! - Wed Dec 16 14:36:36 2009

how can I find free ebook about algorithm design on internet?
Q. how can I find free ebook about algorithm design on internet?
Asked by tizar - Fri May 12 12:32:43 2006 - - 3 Answers - 0 Comments

A. this page has lots of links: my personal favourite (although very academic) book:
Answered by sankymoron - Fri May 12 12:42:47 2006

How can I design a tic tac toe game using javascript + HTML and the design of the webpage be in terms of DOM.?
Q. I need the algorithm design and the functionality.
Asked by DenJ - Fri Dec 5 07:58:13 2008 - - 1 Answers - 0 Comments

A. Well, I won't write out the code for you, but how about this very simple design: Create a table to hold the x's and o's. You can also use functionality of the table to draw the lines between the letters. Create an "X" image, an "O" image, and a blank image. first create the table with each square using a blank image. Add an onClick function to each image. When the onClick function is called it should determine whether X or O is the next option for that square (and test that an X or O doesn't already exist there), and it should change the image from the blank to an X or an O. Voila. Should be that simple. You can add in functionality to maintain a small data structure to check for a winning condition and take some action based on that… [cont.]
Answered by David P - Fri Dec 5 08:34:28 2008

design an algorithm that, given a list of names, finds the longest name in the list?
Q. design an algorithm that, given a list of names, finds the longest name in the list.determine what your solution does if there are several "longest" names in the list. in particular what would your algorithm do if all names had the same length?
Asked by chomi's chick - Sun Apr 20 05:47:13 2008 - - 3 Answers - 0 Comments

A. select the first name to be test entry. count letters of the test entry. compare them with letters of the next entry. if letters are not equal select the next mane to be testentry esle testentry is the longest name.
Answered by fukza - Sun Apr 20 06:39:00 2008

design an algorithm? ...I need help with my assignment =(?
Q. Hey I am so new in this (I understand nothing) , if anyone is familiar with this please help. Design an algorithm to find an employes weekly wages, hourly payrate of 24,75$ normal work hour is 40.0 overtime payrate factor of 1.5 yes I am using C++ Thanx
Asked by moonlight gurl - Sun Sep 28 09:57:29 2008 - - 1 Answers - 0 Comments

A. You are using c++? weeklywages = 0 hourlyPayrate = 24,75 hoursWorked = (what ever hours the employee worked) weeklywages = hourlyPayrate * hoursWorked + 1.5*(hoursWorked-40);
Answered by Tasm - Sun Sep 28 10:14:45 2008

Algorithm Design, please give me idea...Help...please?
Q. Suppose you live in big house with a lot of friends.One of you pays for an expense shared by some subset of the housemates with the expectation that you will settle up later. For example, one of you may pay the whole phone bill in a given month, another will occasionally make a run to the grocery store... At the end on year and you want to settle up. There are n housemates and for each ordered pair (i,j) there s an amount aij that i owes j, accumulated over the course of year. We will require that for any two people i and j at least one of the quantities aij or aji is zero. This can be easily made to happen as follow: if it turns out that i owes j a positive amount x and j owes i a positive amounts y[cont.]
Asked by Kleihe Z - Tue Jun 5 19:45:04 2007 - - 0 Answers - 0 Comments

A. Some observations that may help: 1. You ONLY need to determine the net amount at the time you have to reconcile the amounts. That way, you can require that all ordered pairs are non-negative. If i owes j $15, then f(i,j) = 15. If j owes i $10, then f(j,i) = 10. Only when you reconcile do you require a $5 check from i to j. -or- 1. Every time there is a change, the calculation is performed and values adjusted. If that's the case, then you guarantee that your matrix always has 0 in almost half of the entries --- 2. it's not clear what your algorithm is trying to accomplish. Are you trying to describe how the reconciliation is performed, assuming the internal adjustments? 3. is this meant to be a linear programming type of problem? … [cont.]
Answered by steve s - Wed Jun 13 13:52:45 2007

Using pseudo-code, design an algorithm that will accept any list of numbers and output total of these numbers?
Q. Using pseudo-code, design an algorithm that will accept any list of numbers and output total of these numbers?
Asked by Asadullah Q - Sat Feb 14 15:40:04 2009 - - 1 Answers - 0 Comments

A. Pseudo coding is fairly easy actually. You just write down the steps you'd take to complete your task. For your example you'd do the following: initialize total to 0 loop: ask for input get input is it a number? no is it the signal to quit? yes, print out total no, print out an error message and ask for input again yes, add number to total go back to loop and start over The nice thing is that once you've got that and start writing code, you just write around that and use your pseudo code as comments. Hope that helps!
Answered by Simon R - Sat Feb 14 15:55:43 2009

help me with this algorithm design and analysis!!!?
Q. can some body help me with this problem? An array A[1..n] is unimodal if it consists of an increasing sequence followed by a decreasing sequence, or more precisely, it there is an index m E 1, 2 ...,n such that -> A[i] A[i]>A[i+1] for all m<=i Asked by cutie_boy - Sun Dec 9 01:52:02 2007 - - 1 Answers - 0 Comments

A. Follow the well-known idea of the binary search (as You surely know it's quicker - O(lg n), than sequential - O(n)): 1) Set LI = 1; UI = n; // lower and upper indexes 2) Take the middle index M = (UI + LI) div 2 and examine A[M]: if A[M-1] < A[M] > A[M+1] then A[M] is the maximal element; terminate work; else if A[M-1] < A[M] < A[M+1] the required element is in the 2nd half of the original array; set LI=M and go to 2); else if A[M-1] > A[M] > A[M+1] the required element is in the 1st half of the original array; set UI=M and go to 2). Don't forget to range-check M-1 and M+1 to be in bounds (cases M=1 or M=n), avoiding very dangerous attempts to read the memory outside the array with unpredictable results. Also this algorithm will work… [cont.]
Answered by Duke - Sun Dec 9 07:16:41 2007

how to write this algorithm (pseudcode ) or logic design?
Q. this is the question i don't how do it , its may first day in programing,, what i want is LOGIC design this is the question 1) write algorithm to swap two numbers.. 2) write and algorithm that takes three value FOUR,MINUTES,and Seconds as argument , as return the equivalents time in seconds ..
Asked by da_one - Tue Nov 10 13:12:22 2009 - - 2 Answers - 0 Comments

A. 1) to swap A and B temp := A A := B B := temp 2) to convert H, M, S to seconds seconds := H * 3600 + M * 60 + S
Answered by Paul - Tue Nov 10 13:19:05 2009

design a algorithm to implement the computation of a moving average of N-samples?
Q. design a algorithm to implement the computation of a moving average of N-samples?
Asked by ayomide j - Tue Jan 2 07:53:59 2007 - - 2 Answers - 0 Comments

A. average = (sample_i + sample_i+1 + ... +sample_N-1 )/N you can move the i
Answered by gjmb1960 - Tue Jan 2 08:40:53 2007

Design a recursive algorithm to sort a list of elements using quick sort and hand simulate on a data set of at
Q. Question related to Algorithms
Asked by Shaan - Sat Nov 24 13:10:00 2007 - - 1 Answers - 0 Comments

A. Just google "quicksort demo" and you'll find all sorts of applets demonstrating how quicksort works.
Answered by macharoni - Sat Nov 24 13:56:19 2007