User-specified memory location, Data Structure & Algorithms

You need to implement a function which will write out a given user-specified memory location to disk in base 10. That means that you have to convert the large number data structure back into base 10 digits before writing them back out to disk. The user will input the file name that the file is supposed to write to along with which memory location.

Your program should be menu driven and contain menu functions for each of the functions that you had to write above. Your code doesn't need to be super optimized, but it does need to be good enough so that any given command takes at most one minute to execute.
The menu should look as follows.
1. Read in a number from a file

2. Print out a large number to the screen

3. Add two large numbers

4. Subtract two large numbers

5. Multiply two large numbers

6. Integer divide two large numbers

7. Location 1 modulo location 2

8. Write to disk in base 10

9. Quit

Choose your option: 1

File name: a.dat

Memory location (number between 1 and 3): 1

Posted Date: 3/20/2013 2:49:59 AM | Location : United States







Related Discussions:- User-specified memory location, Assignment Help, Ask Question on User-specified memory location, Get Answer, Expert's Help, User-specified memory location Discussions

Write discussion on User-specified memory location
Your posts are moderated
Related Questions
#include #include int sumFact(int numb); int calculateFactorial(int digit); main() { int numb, sumfact; do{ printf ("Enter a number 1 to 9999\n"); scanf("%

Q. Define the terms data type and abstract data type. Comment upon the significance of both these.   Ans: We determine the total amount of memory to reserve by determining

A queue is a, FIFO (First In First Out) list.

In this unit, we will describe a data structure called Graph. Actually, graph is a general tree along no parent-child relationship. In computer science, Graphs have several applica

What are circular queues?  Circular queue: Static queues have a very large drawback that once the queue is FULL, even though we erase few elements from the "front" and relieve


Consider the following 5-city traveling salesman problem. The distance between each city (in miles) is shown in the following table: (a) Formulate an IP whose solution will

Problem Your LC code is stored in a memory location as shown and the variable name is LC                  LC Memory address       Content(LC code)

Write the algorithm for compound interest