A database is a structured collection of data that can be analyzed and used for reporting.

The data dictionary is a component of the DBMS that stores metadata. This includes information about schemas, tables, columns, data types, constraints, user permissions, and other structural information about the database.

A superkey is a set of one or more attributes that, when taken together, can uniquely identify a record in a table. A candidate key is a minimal superkey, meaning it's a superkey from which no attributes can be removed without losing the uniqueness property.

The `COUNT()` function returns the number of rows. `COUNT(*)` returns the total number of rows in a table, while `COUNT(column)` returns the number of non-NULL values in that column.

Traditional file management systems often store data in separate, application-specific files. This approach leads to several problems. While 'Program dependence' and 'Data redundancy' are valid issues, the option 'Inability to perform complex queries across multiple data sets' encapsulates a significant limitation. File systems are typically designed for basic record access rather than sophisticated querying and aggregation across disparate files. Options B, C, and D describe advantages typically found in modern database management systems, not problems in file management systems. For instance, file systems generally suffer from *lack* of data independence, *high* data redundancy, and *poor* data integrity compared to DBMS.

The physical level is the lowest level of data abstraction. It describes the complex low-level data structures in detail, defining how the data is stored on physical storage devices like disks.

An alternate key is a candidate key that was not chosen to be the primary key. A table can have multiple candidate keys, but only one is selected as the primary key; the rest are alternate keys.

A table is in Second Normal Form (2NF) if it is in 1NF and every non-prime attribute is fully functionally dependent on the primary key. This process specifically removes partial dependencies, where an attribute depends on only a part of a composite primary key.

A weak entity cannot be identified by its attributes alone. Its primary key is a composite key formed by the primary key of its owner (strong) entity and its own partial key, known as the discriminator.

The strict parent-child (one-to-many) structure of the hierarchical model makes it inherently difficult and inefficient to represent many-to-many relationships. Implementing such relationships often requires creating redundant data.