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
Question 1 Write a program in 'C' to read N numbers and print them in descending order Question 2 Discuss the properties of ADT Question 3 Write a note on

Limitation of Binary Search: - (i)  The complexity of Binary search is O (log2 n). The complexity is similar irrespective of the position of the element, even if it is not pres


Ask question #sdgsdgsdginimum 100 words accepted#

Spanning Trees: A spanning tree of a graph, G, refer to a set of |V|-1 edges which connect all vertices of the graph. There are different representations of a graph. They are f

Q. Write down an algorithm to test whether a Binary Tree is a Binary Search Tree.              A n s . The algorithm to check whether a Binary tree is as Binary Search


Using the cohen sutherland. Algorithm. Find the visible portion of the line P(40,80) Q(120,30) inside the window is defined as ABCD A(20,20),B(60,20),C(60,40)and D(20,40)

Representation of data structure in memory is known as: Abstract data type

How can we convert a graph into a tree ? Do we have any standardized algorithm for doing this?