CSC375 Homework1 George Corser 2009-01-12

CSC375 Homework1 George Corser 2009-01-12 - CSC 375...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
George Corser 2009 January 12 1.1 MS-Word is unacceptably slow when I use my older laptop. It takes well over a minute just to open the program. This makes it impossible to make quick updates to files. Sometimes even after the program is open it takes a curiously long time to perform an operation such as bold/italic/underline the first time. Once the program is finally open, it is possible to insert, modify and delete text relatively quickly. And usually once an operation is performed (such as bold/underline) is can be used again at a reasonable speed. Because MS-Word performs so terribly on my old laptop, I use WordPad most of the time to edit .doc files. This begs some interesting questions that relate to the first chapter's reading. What is really my word processing " problem ?" Is MS-Word unsatisfactory because it does not efficiently meet speed requirements within my resource constraints , or is MS-Word trying to address a word processing problem that in not my particular problem? Whatever the reason, I use WordPad unless I'm on a faster computer or I absolutely need the formatting capabilities of MS-Word. 1.2 A representation for integers that has no size restriction other that the limits of the computer's available memory might be implemented using (1) the current built-in integer data types in most programming languages and (2) pointers. The infinitely-large "super integer" could be broken up into pieces. In this implementation, each sub-integer piece of the super-integer would have an order of magnitude. For example, the number. .. 111,222,333,444,555,666,777,888,999,000,111,222,333,444,555,666,777,888,999,000,111,222, 333,444,555,666,777,888,999,000,111,222,333,444,555,666,777,888,999,000,111,222,333,444, 555,666,777,888,999,000,111,222,333,444,555,666,777,888,999,000,111,222,333,444,555,666, 777,888,999,000,111,222,333,444,555,666,777,888,999,000,111,222,333,444,555,666,777,888, 999,000,111,222,333,444,555,666,777,888,999,000 could be represented as. .. Order 0 +9 111,222,333,444,555,666,777,888,999,000 Order 0 +8 111,222,333,444,555,666,777,888,999,000 Order 0 +7 111,222,333,444,555,666,777,888,999,000 Order 0 +6 111,222,333,444,555,666,777,888,999,000 Order 0 +5 111,222,333,444,555,666,777,888,999,000 Order 0 +4 111,222,333,444,555,666,777,888,999,000 Order 0 +3 111,222,333,444,555,666,777,888,999,000 Order 0 +2 111,222,333,444,555,666,777,888,999,000 Order 0 +1 111,222,333,444,555,666,777,888,999,000 Order 0 111,222,333,444,555,666,777,888,999,000 base order of magnitude assuming the given programming language's integer data type could accomodate 111,222,333,444,555,666,777,888,999,000. The pointers would point to other parts of the super-integer at higher or lower orders of magnitude. Infinite Order
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/19/2010 for the course CSC 375 taught by Professor Turner during the Winter '09 term at University of Michigan-Dearborn.

Page1 / 5

CSC375 Homework1 George Corser 2009-01-12 - CSC 375...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online