sorting data that is too large to fit into RAM
sorting data without the usage of a recursive implementation
sorting data outside a specific performance bound
Answer: sorting data that is too large to fit into RAM
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. In several languages, the visual development environment is known by the acronym ____.
4. Java uses ________ to reference the current object.
5. In the dmaic process, the __________ step is to measure the existing process.
6. In the diagram of a binary tree, an arrow is called a(n) ____.
7. In oop, you declare a class that extends another class. this is called ________.
8. In a(n) ____________________ data type, each data item is a collection of other data items.
9. Every node (except of the last node) in a singly linked list contains ____.
10. Every element in an array is assigned a unique number known as a ________.
11. Each node of a singly linked list has two components: ____ and ____.
12. Data that is sorted in ascending order is ordered ________.
13. Data can be organized and processed sequentially using an array, called a(n) ____ list.
14. Assigning initial values to an array is often referred to as ____.
15. As pages in a book have numbers, computer memory and storage locations have ____.
16. An immutable class cannot have ________.
17. A _____ specifies the fields and identifies the primary key in a particular file.
18. A _____ language feature allows users to type commands or requests in normal text phrases.
19. A _____ key can be described as a minimal superkey, a superkey without any unnecessary attributes.