Data structure for representing numbers, Data Structure & Algorithms

Your first task will be to come up with an appropriate data structure for representing numbers of arbitrary potential length in base 215. You will have to deal with large negative numbers also1. (Any negative number is to be stored in such a way that the most significant digit is a -1, but all lower order digits are positive. Note that you will need to make sure that you don't have a multi-digit number with 0 as the high order digit. Also, you are required to make sure that the top two high order digits of any number store are not -1,32767. If you have trouble figuring out why, come see me...) You need to write a function that takes a given file that contains a number in base 10, reads it in, and stores it in your data structure in base 215.

Posted Date: 3/20/2013 2:32:37 AM | Location : United States







Related Discussions:- Data structure for representing numbers, Assignment Help, Ask Question on Data structure for representing numbers, Get Answer, Expert's Help, Data structure for representing numbers Discussions

Write discussion on Data structure for representing numbers
Your posts are moderated
Related Questions
write an algorithm for stack using array performing the operations as insertion ,deletion , display,isempty,isfull.

(a) Discuss the role played by Business Intelligence Systems in giving companies strategic advantage. (b) Explain the term heuristics searching . (c) With the use of an appr

Give the example of bubble sort algorithm For example List: - 7 4 5 3 1. 7 and 4 are compared 2. Since 4 3. The content of 7 is now stored in the variable which was h

In this unit, we learned the data structure arrays from the application point of view and representation point of view. Two applications that are representation of a sparse matrix

How divide and conquer technique can be applied to binary trees?  As the binary tree definition itself separates a binary tree into two smaller structures of the similar type,

An interesting application or implementation of trees is the playing of games such as tie-tac-toe, chess, nim, kalam, chess, go etc. We can depict the sequence of possible moves

I need to know about data structure and algorithms. can you help me?

By changing the NULL lines in a binary tree to the special links called threads, it is possible to execute traversal, insertion and deletion without using either a stack or recursi

A full binary tree with 2n+1 nodes have n non-leaf nodes

explain quick sort algorithm