-
Degree Operations
Design an algorithm to show the different operations on degree
Prince Mishra
- Jan 4th, 2011
Can you be a little more explicit on what kind of degree?Is that related to exponentiation?
-
Distinct palindromic sub strings
I want to calculate number of DISTINCT palindromic substrings in a string.How to do it?
Like if aba is string the their are 3 distinct palindromic subsrings:{a,aba,b}
length of string could be 10^5 range.So i dont think O(n^2) solution will work.I want a algorithm to do this in less than O(n^2). -
Algorithm help
Create the flowchart and algorithm for a module that will prompt the user to enter the amount of cash they have in their pocket. The program should output “Not Enough” ($0 - $0.64), “Vending Machine” ($0.65 - $1.99), “Fast Food” ($2.00 - $4.99), “Cafeteria” ($5.00 - $14.99) or “Steak House” ($15 and up) depending on what the user can afford for lunch.
-
Calculate Number of Oil Pipes Required
Pipes are laid by an oil company. If the company has to laid down 3 km of pipe and each pipe is 25 metres long, calculate and print the number of pipes needed to cover the distance.
-
Read the Day and the Weather
A club plays cricket only on Sundays and only if it is not raining. Read the day and the weather and "Game on" if the weather is good and the day is Sunday, or "Play Suspended" if it is not Sunday and it is raining.
-
-
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;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...
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)
Recursion
What is recursion? Which data structure is used for recursion
Jitendra Chittoda
- Sep 4th, 2011
Stack data structure is used to maintain the information about the recursive functions.
kbjarnason
- Jul 2nd, 2010
Recursion occurs when a function, either directly or indirectly, calls itself. An example might be a factorial function:unsigned fact(unsigned n){ /* 0! is by definition 1; */ &...
Compute Average of Two Scores
Describe an algorithm to compute the average of two scores obtained by each of the 100 students
Calculate Money Paid to Each Worker
A carpenter is paid a contract fee of $2000.00 for 3 days work. He hires 3 workers who work for the 3 days at $75.00 a day: calculate and print the amount of money paid to each worker; the total paid to all workers and the amount the carpenter is left with.
To calculate distance between two text strings
Give an algorithm that calculates the distance between two text strings (only operations you can have are: delete, add, and change, one by one).
rrc_83
- Jun 20th, 2010
In python - # Input is string s1 and string s2# Check which string is bigger (compares ascii value)if s1 > s2: b, s = s1, s2else : b, s = s2, s1# Covert string to listl1, l2 = lis...
yzesong
- Aug 9th, 2009
The distance of two strings, like "car" and "cat", is 1. So all we need to do is, compare two strings one character by one character and get the distance value. The complexity is O(max(m,n)), m, n are the length of each string.
Pseudocodes and flowcharts
When twice a certain number is subtracted from five times itself, the result equals 60. Find the number by using the try and error method. Use both pseudocode and flowchart.
Ans