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
How do you find the complexity of an algorithm?  Complexity of an algorithm is the measure of analysis of algorithm. Analyzing an algorithm means predicting the resources that

differentiate between indexing and hashing in file organization

Do you have a library solution for this problem?

There are four data type groups:  Integer kepts whole numbers and signed numbers Floating-point Stores real numbers (fractional values). Perfect for storing bank deposit

1)      Why space complexity is comparatively more critical than time complexity? 2)      Determine the space complexity of Euclid Algorithm?

1. develop an algorithm which reads two decimal numbers x and y and determines and prints out wether x>y or y>x. the input values, x and y, are whole number > or equal to 0, which

Deletion Algorithm for dequeue Step 1: [check for underflow]   If front = 0 and rear = 0   Output "underflow" and return Step 2: [delete element at front end]   If front

Data records are stored in some particular sequence e.g., order of arrival value of key field etc. Records of sequential file cannot be randomly accessed i.e., to access the n th

What is bubble sort? Bubble Sort: The basic idea in bubble sort is to scan the array to be sorted sequentially various times. Every pass puts the largest element in its corr

Problem 1. Explain about the doubly linked list with neat diagram. Diagram Explaining doubly linked list 2. Explain what are the criteria to be used in evaluatin