-
Finding a 'circle' in a linked list
You have n numbrer Node objects - could be 1,000,000 for all you know. Each Node has a getNext() method that returns the next Node (a linked list).But the chain of n number of Node objects linked together by the getNext() method, somewhere in the chain, points back to a Node earlier in the chain so if you keep calling getNext() to walk the chain you will never get to the last Node - it will loop forever.What...
Beniskickbutt
- Dec 22nd, 2014
P1 == p2->next will only work if your circle only encompasses 2 elements of your list.
Also, S == p2 will never be true (causing an infinite loop) if you dont have a circular list to begin withkaushurtz
- Mar 2nd, 2010
There are many ways to find loops in linked list but the best one is known as tortoise and hare algorithm.In this we take 2 nodes say slow and fast node. Then we move the slow node by one shift ie sta...
-
-
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...
-
Characteristics of an Algorithm
List out the characteristics of an algorithm
Hiral
- Nov 26th, 2018
Characteristics of algorithm :
1.Unambiguous
2.Input
3.Output
4.Finiteness
5.Independent
6.Effectivenessosoriri2004
- Dec 20th, 2008
Should have the following five characteristics:1. Input2. Output3. Definiteness4. Effectiveness5. Termination
-
Post Order Binary Tree Traverse
Design a conventional iterative algorithm to traverse a binary tree represented in two dimensional array in postorder.
Shikhar Singhal
- Jun 10th, 2013
When tree is implemented using linked list rather than 2-d array
Code- span style="color: #ff0000;">"%d",&head);
- }
Sandhya.Kishan
- Mar 10th, 2012
In Postorder traversal sequence we first look for the left node then the right node and then the root. Algorithm:
Code -
Read the heights in inches and wieght in pounds
Read the heights in inches and wieght in pounds of an individual and compute and print their BMI=((weight/height)/height)*703
Shikhar Singhal
- Jun 10th, 2013
Code- #include
- "enter height and weight");
- scanf("%d", &height);
- scanf("%d""the calculated bmi = %d", bmi);
- }
Sandhya.Kishan
- Apr 18th, 2012
#include
#include
void main
{
int h,w,bmi;
clrscr();
printf{"Enter your height in inches:"};
scanf{"%d",&h};
printf{"Enter your weight in pounds:"}
scanf{"%d",&w};
bmi=((w/h)/h)*703;
printf{"BMI=%d",&bmi};
getch();
}
-
A car rental firm leases its cars for $250 per day.
A car rental firm leases its cars for $250 per day. The manager gives a discount based on the number of days that the car is rented. If the rental period is greater than or equal to 7 days then a 25% discount is given. Read the period and print the discount given
Michael Loofburrow
- Jun 12th, 2012
Here it is in C++
Code- span style="color: #666666;">"How many days has the car been rented?""The discount is " >> discount >> " dollars."
Compute Average of Two Scores
Describe an algorithm to compute the average of two scores obtained by each of the 100 students
yogishsanjeeva
- Jan 18th, 2011
Struct student{int scoreone;int scoretwo;};student st[10];void average(){int result,sum; for(int count=0; count < 10; count++) { sum = st[i].scoreone + st[i].scoretwo; result = sum/2; }}
travisdavies
- Aug 24th, 2010
Lets assume an array called Array, of type Student.Each student contains 3 data members. they are: String name;int scoreOne;int scoreTwo;for(int i = 0; i < Array.length; i++){ int...
Compute the sum of integers Algorithm
Write an algorithm to compute the sum of integers from 1 to 50 ? please write the answer in descriptive way to solve this ?
Shikhar Singhal
- Jun 10th, 2013
Algorithm-
int sum =0
for i= 1 to 50
sum= sum +i;
print sum;Python - How to Write a function
How to Write a function kinda_format ( ) that take three arguments (each of which positive int ) - a,b,c- and tests whether the equality a^n +b^n=c^n holds for each n{2,3,...,10}. The function should return false if the equality does not hold for any value of n in the given range, and if there is a value of n for which the equality holds, the lowest such value (as in int)
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
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...
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...
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...
Cyclic Directed Graph
What is the complexity of a algorithm of finding the Cyclic Directed Graph?
Algorithm Profiling
What is meant by algorithm profiling?
anks1987
- Jun 25th, 2010
Profiling is the process of executing a correct program on different data sets to measure the time and space that is takes to compute the results.Thanks!
Prime Integer
Suggest two different methods of knowing if a given integer is prime and analyse them.
rrc_83
- Jun 22nd, 2010
Prime Integer can be calculated as follows - if n < 2: return Falseif n == 2 : return True // Only even number thats Primeif (n % 10) in [0, 2, 4, 5, 6, 8]: return False&nb...
Importance of Algorithm
What is the importance of algorithms in the field of computer science?
Sandhya.Kishan
- Mar 7th, 2012
Algorithms are blue prints of a program which gives all the details and functionality involved in finding the solution to a problem.It is important as we can build a program on any platform with the help of an algorithm.
Ans