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
An algorithm is a sequence of steps to solve a problem; there may be more than one algorithm to solve a problem. The choice of a particular algorithm depends upon following cons

Q. Which sorting algorithm can be easily adaptable for singly linked lists? Explain your answer as well.        Ans: The simple Insertion sort is sim

differentiate between indexing and hashing in file organization

Q. Explain quick sort? Sort the given array using quick sort method. 24 56 47 35 10 90 82 31

Think of a program you have used that is unacceptably slow. Identify the specific operations that make the program slow. Identify other basic operations that the program performs q

Give an algorithm to find both the maximum and minimum of 380 distinct numbers that uses at most 568 comparisons.

How do you rotate a Binary Tree?  Rotations in the tree: If after inserting a node in a Binary search tree, the balancing factor (height of left subtree - height of right

Which sorting methods would be most suitable for sorting a list which is almost sorted  Bubble Sorting method.

1. In computer science, a classic problem is how to dynamically store information so as to let for quick look up. This searching problem arises frequently in dictionaries, symbol t

State the Introduction to pseudocode No specific programming language is referred to; development of algorithms by using pseudocode uses generic descriptions of branching, loop