Programming > QUESTIONS & ANSWERS > MIS 505 Final Exam Review 3 Chapter 8: Advanced Data Handling Concepts, complete questions and answe (All)

MIS 505 Final Exam Review 3 Chapter 8: Advanced Data Handling Concepts, complete questions and answers; Scored 100%

Document Content and Description Below

MIS 505 Final Exam Review 3 Chapter 8: Advanced Data Handling Concepts 1. The sorting process is usually reserved for a relatively large number of data items. 2. The most popular computer coding schemes include ASCII, Numeric, and EBCDIC. 3. You can make additional improvements to a bubble sort to reduce unnecessary comparisons. 4. An insertion sort is another name for a bubble sort. 5. Two-dimensional arrays are never actually required in order to achieve a useful program. 6. Some programming languages allow multidimensional arrays. 7. It is relatively easy for people to keep track of arrays with more than three dimensions. 8. You do not need to determine a record’s exact physical address in order to use it. 9. When a record is removed from an indexed file, it has to … physically removed. 10. Every time you add a new record to a linked list, you search through the list for the correct logical location of the new record. 11. When records are in ____ order, they are arranged one after another on the basis of the value in a particular field. 12. The ____ is often used as a statistic in many cases because it represents a more typical case. 13. The ____ is skewed by a few very high or low values. 14. When you store data records, they exist in ____. 15. ____ report, the records must have been sorted in order by a key field. 16. When computers sort data, they always use ____ values when making comparisons between values. 17. Because “A” is always less than “B”, alphabetic sorts are ____ sorts. 18. In a ____, items in a list are compared with each other in pairs. 19. When you learn a method like sorting, programmers say you are learning a(n) ____. 20. To correctly swap two values, you create a(n) ____ variable to hold one of the values. 21. A bubble sort is sometimes … a ____. 22. When using a bubble sort to sort a 10-element array, on the fourth pass through the array list you detect that no swap has occurred. This indicates ____. 23. When you sort records, two possible approaches are to place related data items in parallel arrays and to ____. 24. In a(n) ____, if an element is out of order relative to any of the items earlier in the list, you move each earlier item down one position and then insert the tested element. 25. An array whose elements you can access using a single subscript is a ____ array. 26. A two-dimensional array contains two dimensions: ____. 27. Each element in a two-dimensional array requires ____ subscript(s) to reference it. 28. When mathematicians use a two-dimensional array, they often call it a ____ or a table. 29. ____ are arrays that have more than one dimension. 30. A record’s ____ field is the field whose contents make the record unique among all records in a file. 31. As pages in a book have numbers, computer memory and storage locations have ____. 32. When you ____ records, you store a list of key fields paired with the storage address for the corresponding data record. 33. When you use an index, you can store records on a ____ storage device. 34. One way to access records in a desired order, even though they might not … physically stored in that order, is to create a(n) ____. 35. Every time you add a new record to a linked list, you search through the list for the correct ____ location of the new record.

[Show More]

Last updated: 3 years ago

Preview 1 out of 8 pages

Buy Now

Instant download