1. _____________ helps companies tap into the massive volume of customer opinions expressed online.

2. A(n) _____ can support large volumes of data and support applications that run an entire company.

3. Infiniband can support data transfer speeds of ____ per second.

4. The __________ places new orders when inventory levels fall to predetermined points.

5. A(n) ____ control is any type of input mechanism on a form.

6. In several languages, the visual development environment is known by the acronym ____.

7. In a(n) ____________________ data type, each data item is a collection of other data items.

8. You can use either a(n) ____ or a ____ to store the value of a logical expression.

9. With a(n) ____, you perform an action or task, and then you perform the next action, in order.

10. With a hollow structure, the organization ____.

11. Members of a(n) ________ union have names, but the union itself has no name.

12. In a function template, the programmer substitutes ________ for ________.

13. Because “a” is always less than “b”, alphabetic sorts are ____ sorts.

14. A ____ read is an added statement that gets the first input value in a program.

15. When computers sort data, they always use ____ values when making comparisons between values.

16. Assume s is "abcabc", the method ________ returns an array of characters.

17. A collection in the items stored there are of different types is referred to as a(n) ________ type.

18. The ____ is skewed by a few very high or low values.

19. Structures can be stacked or connected to one another at their ____.

20. A(n) ____ tells the user what to enter.

21. A variable usually is passed into a method by ____.

22. A ____ is a rectangular area into which the user can type text.

23. A(n) ____ is shorthand for the detail you want to use in a search filter.

24. A(n) ______ is a process or set of operations in a calculation.

25. Two-dimensional arrays can be thought of as containing ________.

26. Suppose integer x = new integer(3); x holds ________.

27. The body of a ______-test loop is always executed at least once.

28. A variable defined inside a method is referred to as ________.

29. The ____ function is used to create a constant.

30. In comparison with unstructured information, semi-structured information ________.

31. A(n) ________ search uses a loop to sequentially step through an array.

32. A ________ search uses a loop to sequentially step through an array.

33. The rijndael algorithm is better known today as __________.

34. When working with multiple sets of data, one would typically use a ________.

35. Every node (except of the last node) in a singly linked list contains ____.

36. To arrange the elements in an array in ascending order, you use the ____ method.

37. The number of elements in an array is called the ____ of the array.

38. Programmers sometimes refer to a situation in which nothing goes wrong as the ____ case.

39. In all languages, subscript values must be sequential ____.

40. In a ____, items in a list are compared with each other in pairs.

41. If a one-dimensional array contains five elements, its highest subscript is ____.

42. Each element in a two-dimensional array requires ____ subscript(s) to reference it.

43. An array whose elements you can access using a single subscript is a ____ array.

44. When mathematicians use a two-dimensional array, they often call it a ____ or a table.

45. The starting value of an algorithm used to generate a range of numbers is called the _________.

46. The ________ function does the same thing as using the mathematical ∧ operator.

47. The following pseudocode is an example of ____.

48. When an array is passed to a function, it is actually ________ the array that is passed.

49. Pseudocode uses the end-structure statement ____ to clearly show where the structure ends.

50. A(n) ________ member variable may be accessed before any objects of the class have been declared.

51. A bubble sort is sometimes called a ____.

52. A ________ is used to travel through a linked list and search for data.

53. The ________ represents a special value that marks the end of a list of values.

54. After you create an array variable, you still need to ____ memory space.

55. If an exception occurs in a try-catch block, the code in the finally clause ________.

56. Fill in the code in comparable________ c = new date();

57. Before a structure variable can be created, the structure must be _________.

58. The expression score[5] is pronounced ________.

59. The elements of an array are stored in __________ storage locations in the computer?s memory.

60. A variable or a value listed in a call to a method is called ________.

61. A two-dimensional array can be viewed as ___________ and _____________.

62. A three-dimensional array can be thought of as ________ of two-dimensional arrays.

63. Data can be organized and processed sequentially using an array, called a(n) ____ list.

64. Selection sort requires ________ passes to put n data items in order.

65. To describe a queuing system, we use the term ____ for the object that provides the service.

66. The priming read is an example of a(n) ____ task.

67. A ____ is a copy that is kept in case values need to be restored to their original state.

68. The maximum number of entry points that any programming structure can have is ____.

69. Attaching structures end to end is called ____ structures.

70. Java.util.vector is a subtype of ________.

71. Arrays, unlike simple built-in types, are passed by ____.

72. A loop within another loop is known as a(n) ____ loop.

73. A loop must return to the ____ question at some later point in a structure.

74. When you derive a class from an existing class, you ________ add new data and functions.

75. The number of elements an array will hold is known as the ____ of the array.

76. When you use an index, you can store records on a ____ storage device.

77. When you return an array from a method, the method returns ________.

78. When you create a ____ report, the records must have been sorted in order by a key field.

79. When an array is sorted from highest to lowest, it is said to be in ________ order.

80. To build a list initially, you can use a(n) ________ routine.

81. The following pseudocode is an example of a ____ structure.

82. You use the ________ operator to access members of an object.

83. The sequential search algorithm uses a(n) ____ variable to track whether the item is found.

84. When you search through a list from one end to the other, you are performing a ____.

85. Tcp messages are called ________.

86. Java uses ________ to reference the current object.

87. In the dmaic process, the __________ step is to measure the existing process.

88. In the diagram of a binary tree, an arrow is called a(n) ____.

89. In oop, you declare a class that extends another class. this is called ________.

90. In a(n) ____________________ data type, each data item is a collection of other data items.

91. Every node (except of the last node) in a singly linked list contains ____.

92. Every element in an array is assigned a unique number known as a ________.

93. Each node of a singly linked list has two components: ____ and ____.

94. Data that is sorted in ascending order is ordered ________.

95. Data can be organized and processed sequentially using an array, called a(n) ____ list.

96. Assigning initial values to an array is often referred to as ____.

97. As pages in a book have numbers, computer memory and storage locations have ____.

98. An immutable class cannot have ________.

99. A _____ specifies the fields and identifies the primary key in a particular file.

100. A _____ language feature allows users to type commands or requests in normal text phrases.