2. In computer science, which of the following best describes an array? (A) A collection of elements where each element points to the next. (B) A data structure that stores elements in a first-in, first-out manner. (C) A collection of elements stored at contiguous memory locations, accessed by an index. (D) A hierarchical data structure with a root and child nodes.

10.In a multi-user database environment, complex interactions between simultaneous transactions can lead to undesirable outcomes such as "lost updates" (where one transaction's changes are overwitten by another), "dirty reads" (where a transaction reads uncommitted data from another transaction), and "inconsistent reads" (where a transaction reads different values for the same data item at different points in time). Which core aspect of database management, typically managed within the database architecture, is primarily responsible for addressing and preventing these types of anomalies? (A) Indexing, which optimizes data retrieval by creating sorted pointers to data records, thereby speeding up query execution and reducing the likelihood of data conflicts. (B) Relational Algebra, which provides a theoretical foundation for querying and manipulating data in relational databases, enabling structured data operations. (C) Concurrency Control, which employs various mechanisms to manage the interleaved execution of transactions, ensuring data integrity and transaction isolation. (D) B-trees, a tree data structure used for efficient storage and retrieval of data on disk, enabling fast lookup, insertion, and deletion operations within a database.

相關試題

相關試卷