interest, Data Structure & Algorithms

I=PR/12
numbers of years : Interest Rate
up to 1 years : 5.50
Up to 5 years : 6.50
More than 5 year : 6.75
please design an algorithm based on the above information to calculate the interest earned by a customer.
Posted Date: 4/3/2013 8:04:42 PM | Location : Tonga







Related Discussions:- interest, Assignment Help, Ask Question on interest, Get Answer, Expert's Help, interest Discussions

Write discussion on interest
Your posts are moderated
Related Questions
Determine about the unreachable code assertion An unreachable code assertion is an assertion that is placed at a point in a program that shouldn't be executed under any circum

Step 1: Declare array 'k' of size 'n' i.e. k(n) is an array which stores all the keys of a file containing 'n' records Step 2: i←0 Step 3: low←0, high←n-1 Step 4: while (l

what is queues? how it work? and why it used? i want an assignment on queue .....

What is the difference between a grounded header link list and a circular header link list? A header linked list is a linked list which always having a special node, known as t

One of the main problems with the linear queue is the lack of appropriate utilization of space. Assume that the queue can store 100 elements & the complete queue is full. Thus, it

How memory is freed using Boundary tag method in the context of Dynamic memory management? Boundary Tag Method to free Memory To delete an arbitrary block from the free li

In the array implementation of lists, elements are stored into continuous locations. In order to add an element into the list at the end, we can insert it without any problem. But,

Count Scorecards(30 points) In a tournament, N players play against each other exactly once. Each game results in either of the player winning. There are no ties. You have given a

Q. Write down an algorithm to insert a node in between any two nodes in a linked list         Ans. Insertion of a the node after the given element of the listis as follows

(i)  Consider a system using flooding with hop counter. Suppose that the hop counter is originally set to the "diameter" (number of hops in the longest path without traversing any