-
Importance of Algorithms
What is the importance of algorithms in the field of computer science?
kbjarnason
- Jul 2nd, 2010
An algorithm is nothing more than a defined series of steps to achieve a goal. For example adding a value to the value in a memory location works something like this: load existing value f...
-
Advantages of Circular Queue
Bring out the advantages of circular queue over linear queue
dharmraj
- Sep 5th, 2010
In CQ we utilize memory efficiently. because in queue when we delete any element only front increment by 1, but that position is not used later. so when we perform more add and delete operation, m...
-
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?
-
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...
-
-
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; */ &...
-
-
Write an algorithm to find the minimum of numbers where N is any arbitary natural number. N is given to you by the user as the first value.
jjtharappel
- Nov 24th, 2011
The one I posted on Nov23 will not sork. A slight modification. Below is the working code "cobol ACCEPT WS-SYSIN-DATA FROM SYSIN IF WS-SYSIN-NUM IS NUMERIC C...
jjtharappel
- Nov 23rd, 2011
I = N / 10
J = I * 10
K = N - J
min_num = K
If I > 10
Do while I < 10
N = I
I = N / 10
j = I * 10
K = N - J
if K < min_num
min_num = K
end-if
end-do
Prinf "Minimum number is " min_num
Return -
Algorithm Characteristics
List out the characteristics of an algorithm
Sandhya.Kishan
- Mar 7th, 2012
1.It should be simple.
2.Generally written in simple language.
3.It involves finite number of steps.
4.should be executed in short period of time.
5.Output of algorithm should be unique. -
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.
-
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."
Sorted Matrix
You are given a matrix. The matrix elements are such that they are sorted both horizontally and vertically. Given an element of the matrix, your job is to obtain its position in an efficient manner.Example: 10 20 30 15 35 98 48 76 110Input: 76Output: 3rd row, 2nd column.
sandy
- Mar 24th, 2013
I assume you can do it in the following way: "python class Coordinate: def __init__(self,x=0,y=0): self.x = x self.y = y def findElement(a,n): if a == Non...
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;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();
}
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:
CodeDuplicate Elements Array
You have an array of size '2n' of these, 'n+1' elements are distinct and 1 element is repeated 'n' times. You must find the repeated element and say how many times it has repeated. Your solution must use minimum no. of comparisons. Also, say how many comparisons your solution will make in the worst case?
cullensun
- Sep 23rd, 2013
1st, 2nd, 3rd,......, (n-1)th, (n)th, (n+1)th, (n+2)th, ...... (2n)th Focus: Identify the the repeated element 1. take the 1st element to compare with the rest one by one, worst case: compare wi...
shankar
- Oct 16th, 2012
Since an element is repeated more than half the occurance of the array, for every two didtinct elements discard them from the array. At the end of the loop, the most repeated element will be left.
This is O(n)Compute Average of Two Scores
Describe an algorithm to compute the average of two scores obtained by each of the 100 students
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...
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)
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.
Ans