interest, Data Structure & Algorithms

I =PR/12
Numbers of years .Interest rate
up to 1yrs . 5.50
up to 5yrs . 6.50
More than 5 yrs . 6.75
design an algorithm based on the above information to calculate the interest earned by a customer.
Posted Date: 4/3/2013 6:44:46 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

Following are some of the drawback of sequential file organisation: Updates are not simply accommodated. By definition, random access is impossible. All records should be

(a) Write (delay ) as a special form for (lambda () ) and (force ), as discussed in class. (b) Write (stream-cons x y) as a special form, as discussed in class. (c) Write

Define what an algorithm is and outline the characteristics of a good algorithm.

Q. Take an array A[20, 10] of your own. Suppose 4 words per memory cell and the base address of array A is 100. Find the address of A[11, 5] supposed row major storage.

Define Hashing. Store the following values in a hash table of table size 11 using division method: 25, 42, 96, 101, 102, 162, and 197. In case of collision, use other hash functio

Implementation of queue using a singly linked list: While implementing a queue as a single liked list, a queue q consists of a list and two pointers, q.front and q.rear.

Explain the term - Branching There are two common ways of branching: case of ..... otherwise ...... endcase  if ..... then ..... else ..... endif   case of

Given a number that is represented in your data structure, you will need a function that prints it out in base 215 in such a way that its contents can be checked for correctness. Y

In the book the following methods are presented: static void selectionSort(Comparable[] list) static void insertionSort(Comparable[] list) static boolean linearSearch(Comparable