User-specified memory location, Data Structure & Algorithms

Assignment Help:

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


Related Discussions:- User-specified memory location

Procedures, what is far and near procedures in system programming?

what is far and near procedures in system programming?

Single pointer pointing to the tail of the queue, Can a Queue be shown by c...

Can a Queue be shown by circular linked list with only single pointer pointing to the tail of the queue? Yes a Queue can be shown by a circular linked list with only single p

Enumerate the types in ruby, Enumerate the Types in Ruby Ruby is a pure...

Enumerate the Types in Ruby Ruby is a pure object-oriented language, meaning that all types in Ruby are classes, and each value in a Ruby program is an instance of a class. Thi

#, if two relations R and S are joined, then the non matching tuples of bot...

if two relations R and S are joined, then the non matching tuples of both R and S are ignored in

Algorithm, algorithm to search a node in linked list

algorithm to search a node in linked list

Estimate best first search nodes , Given the following search tree, state t...

Given the following search tree, state the order in which the nodes will be searched for breadth first, depth first, hill climbing and best first search, until a solution is reache

Find the optimal solution - branch and bound algorithm, Consider the follow...

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

Degree of node, Q. The degree of a node is defined as the number of childre...

Q. The degree of a node is defined as the number of children it has. Shear show that in any binary tree, the total number of leaves is one more than the number of nodes of degree 2

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd