CSCI 1300 Chapter 3 and 4 TEST KEY

Chapter 3 and 4 test

1. Cow brown now how

2. Describing an algorithm
3. Yes. All linear search algorithms have a running time of O(n). Because they always traverses the
entire list.
4. Average running time
5. Sorting/Searching
6. Searching/Sorting
7.
Space/Speed
8. Speed/Space
9. The search for the largest number in a list algorithm.
10. F(k) = 3k + 6 O(k)
11. 1011 1110
12. 1111 1001 1110 1000
13. 0000 0001 0010 1000 MUST BE TWO BYTES.
14. 1000 0000
15. -8
16. -128
17. -1
18. +128
19. 7B22h
20. ASCII coding C A S G
21. 0010 1111
22. 1000 1110
23. 1001 1101
24. 1001 1110
25. 1110 1111
----------------------------EXTRA----------------------------E1
FORTRAN
E2
FORTRAN , LISP
E3
Intractability, Turning test, Enigma code broken
E4
The Stored Program machine
E5
Augusta Ada King, Countess of Lovelace (10 December 1815 27 November 1852