A Balanced Introduction to Computer ScienceFor Introduction to Computing and the Web courses in departments of Math and Computer Science. This thoughtfully written text uses the Internet as a central theme, studying its history, technology, and current use. Experimental problems use Web-based tools, enabling students to learn programming fundamentals by developing their own interactive Web pages with HTML and JavaScript. Integrating breadth-based and depth-based chapters, Reed covers a broad range of topics balanced with programming depth in a hands-on, tutorial style. Supplements Include:
Bridge Page: www.prenhall.com/reed Author Website: www.dave-reed.com/book |
From inside the book
Results 1-3 of 13
Page 144
... Binary Search Fortunately , there is a more efficient algorithm for searching a list , as long as the list adheres ... search that half via the same technique . Because each check cuts the list that must be searched in half , this ...
... Binary Search Fortunately , there is a more efficient algorithm for searching a list , as long as the list adheres ... search that half via the same technique . Because each check cuts the list that must be searched in half , this ...
Page 145
... binary search for “Illinois”.The labels “left” and “right” denote the range in which the desired item can appear ... search concludes successfully. The Web page search.html (accessible at http://dave-reed.com/book) provides an ...
... binary search for “Illinois”.The labels “left” and “right” denote the range in which the desired item can appear ... search concludes successfully. The Web page search.html (accessible at http://dave-reed.com/book) provides an ...
Page 154
... find the phone number using sequential search? How many checks would be required, in the worst case, to find the phone number using binary search? 17. Consider the list of states from Figure 8.5. Which state in the list is the “easiest” to ...
... find the phone number using sequential search? How many checks would be required, in the worst case, to find the phone number using binary search? 17. Consider the list of states from Figure 8.5. Which state in the list is the “easiest” to ...
Contents
M01_REED7226_02_SE_C01 | 1 |
M02_REED7226_02_SE_C02 | 18 |
M03_REED7226_02_SE_C03 | 40 |
Copyright | |
21 other sections not shown
Other editions - View all
Common terms and phrases
algorithm ARPANet array assigned attribute behavior binary numbers bit pattern Boolean browser button Celsius characters circuit circuitry complex components computer science contains control unit corresponding counter Dave Reed define dice rolls display electrical evaluates to true example executed EXERCISE Fahrenheit Figure format function Google grade hardware instructions integer interactive Internet Explorer E:\Chapter JavaScript JavaScript code JavaScript statements load machine machine language machine-language main memory memory cell memory location menu method Mozilla Firefox operating system output perform processors prompts the user registers repCount represent result roll1 roll2 script type="text/javascript sequence server simulator specified stored string switch tasks temperature text area text box transistors TRUE or FALSE user clicks vacuum tubes variable von Neumann architecture Web browser Windows Internet Explorer wire World Wide Web write statement