-
Time Complexity
How to find time complexity?
adnan15110
- Jan 3rd, 2010
Time complexity usually expressed by asymptotic notation.To find out time complexity we need to see the growth of function of that algorithm. Which means to identify how the loops or comparisons behav...
-
Quicksort Algorithm
Demonstrate the quicksort algorithm to sort a list of data elements
adnan15110
- Jan 3rd, 2010
Pick an element, called a pivot from the list. Reorder the list so that all elements which are less than the pivot come before the pivot and so that all elements greater than the pivo...
-
Traverse Binary Tree in Inorder
Design a conventional iterative algorithm to traverse a binary tree represented in linked lists in inorder.
ChrisL216
- Dec 14th, 2009
Void display(){ System.out.print(lnr(root));}void lnr(Node p){ // left node right if(p == null) return; lnr(p.left); System.out.print(p.key); lnr(p.right);}
-
How can we multiply an integer by 7 by using bitwise operators
-
Conventional Iterative Algorithm
Design a conventional iterative algorithm to traverse a binary tree represented in linked lists in postorder.
trivial
- Aug 19th, 2009
We define int visit[SIZEOFTREE] such that visit[i]=1 if i th node is visited=0 otherwise visit[NULL]=1 alwaysvoid posttrav_ite...
-
Algorithm to Traverse Binary Tree
Design a conventional iterative algorithm to traverse a binary tree represented in linked lists in preorder.
ratanlal
- Aug 14th, 2009
Preorder(node root)if root=NULL;returnelsedoprint "root->data" preorder(root->left)preorder(root->right)end else
-
Cyclic Directed Graph
What is the complexity of a algorithm of finding the Cyclic Directed Graph?
-
Validation of an Algorithm
What is validation of an algorithm?
osoriri2004
- Dec 20th, 2008
The process of measuring the effectiveness of an algorithm before it is coded to know the algorithm is correct for every possible input.This process is called validation.
-
Algorithm Profiling
What is meant by algorithm profiling?
gautam958
- Sep 12th, 2008
In recent years, several very efficient exact optimization algorithms have been developed in the computer science community. Examples are maximum flow algorithms, minimum-cost flow techniques, mat...
-
Sub matrix
U are given a n*n square matrix where each element is either 0 or 1....u have to find the square submatrix with the largest length such that all the elements along the border of that square submatrix matrix is 1 ....
revcs2k546
- Aug 19th, 2008
You can find de length of the side of square by using your procedure. but how can you find the position?
cyrano_says
- Jul 26th, 2008
You go through one element at a time and figure out whats the maximum lenght along one side that has all 1's. Eg starting with (1,1). Keep looking along the vertical. (1,2),(1,3)....Once you hit a...
-
Algorithm
Bring out the importance of Algorithms in the field of Computer Science?
vkumbaji
- Jun 16th, 2009
In simple terms algorithms are a blue print and logic design for building functionality with programming languages. Write the algorithm..Validate the algorithm, check the characteristics of the algori...
-
A(x) + a(y) = M
Given a1, a2, .... a(n) integers & M, return true or false if there exist a(x) + a(y) = MOnce you're done, do it using a hash table.
guitarfox
- Jun 19th, 2008
a(x) + a(y) = MGiven a1, a2, .... a(n) integers & M, return true or false if there exist a(x) + a(y) = MOnce you're done, do it using a hash table.actually using a hash there is a better solut...
tashageek
- Jun 7th, 2008
Actually using a hash there is a better solution . you inititate the hash with all values from a. and then you go over a again and check if the complementry of a[j] ie M-a[j] is in the hash. this way the complexity is O(n) and not O(M+n)
-
How many trees are now left in Granada National Park?
Peter has a method for solving quadratic equations. For example, Peter solves 6x2
+ x – 2 = 0 as follows:
(a) Peter multiplies the leading coefficient (6) by the constant coefficient (2)
to get x2 + x – 12 = 0 to get (x+4)(x-3) = 0
(b) Peter then replaces each x by 6x (x times the leading coefficient) to get
(6x+4)(6x-3) = 0
(c) Peter then simplifies this equation to get (3x+2)(2x-1) = 0, which solves
the original equation.
Prove or disprove that Peter’s method always works.
">Two mathematicians were surveying the damage done to Granada National Park by Hurricane Ivan. “It could have been worse,” said one. “Less than one third of the trees were lost.” His friend replied, “Yes, in fact if you multiply by 10 the number formed by taking the last two digits of the number of trees there used to be, and add to this the number formed by removing the last two digits of the number of trees there used to be, then you obtain the number of trees there is now". Not to be outdone, the first mathematician said “And if you take the number of trees that were lost, and reverse the order of the last two digits, and then insert a zero in front of the last two digits, then you get the number of trees that there used to be plus the number of trees that there are now”.How many trees are now left in Granada National Park? Peter has a method for solving quadratic equations. For example, Peter solves 6x2+ x – 2 = 0 as follows:(a) Peter multiplies the leading coefficient (6) by the constant coefficient (2)to get x2 + x – 12 = 0 to get (x+4)(x-3) = 0(b) Peter then replaces each x by 6x (x times the leading coefficient) to get(6x+4)(6x-3) = 0(c) Peter then simplifies this equation to get (3x+2)(2x-1) = 0, which solvesthe original equation.Prove or disprove that Peter’s method always works.
raviji
- Dec 16th, 2007
Answer is 1188 for total trees, so that lost trees are 297 and trees still left are 891.Peter is always correct since he is merely multiplying whole equation by the leading coefficient.
-
Algorithm Questions
Ans