Untitled Quiz

A program that translates high-level language code into low-level machine code.

Programming language that is closer to human language and easier to understand.

Programming language that is closer to machine code and harder for humans to read.

The set of instructions that a computer's processor can directly execute.

A program that translates and executes high-level instructions line by line, instead of generating a whole new program.

High-Level language code is converted into machine code (low-level) via the software Compiler

The source code, written in a high-level language, is the input for the compiler

Machine code, which the computer can directly execute, is the output of the compiler.

A program that executes a high-level programming language (PHL) directly, without pre-translation to a lower-level language.

A programming language that is designed to be closer to human language, making it easier to write and understand than low-level languages.

A compiler translates the entire high-level program into a lower-level language before execution, while an interpreter executes the high-level programming language directly.

The data a program requires to run that's provided as input to the interpreter

The process of executing a program, whereby the program steps are performed in the order they are written.

Both compilation and interpretation have the same expressive power; any language can be either compiled or interpreted.

The external data a program uses to produce a result based on internal logic

The result of a computer program or process

A step-by-step procedure for solving a problem.

A question or task that needs a solution.

Step-by-step instructions used to make something.

Process of finding a solution to a problem.

Facts or figures used in a problem or algorithm.

The outcome or answer of an algorithm or problem solving.

Problem solvable with a computer.

Problem involving calculations of sale and purchase.

A recipe has 3 key parts: the dish goal, the ingredients, and the steps to turn ingredients into the dish.

Problem solving involves identifying a problem, manipulating given information (data) to reach a specific outcome, and following a series of steps to generate a solution.

A series of clear, unambiguous, repeatable instructions that solve a problem in a general way using an executor.

Every problem is made up of three parts: a goal (what do we want?), data (what information do we have?), and a process (how do we combine that data to solve the problem?).

Specific actions that the executor takes during each step of an algorithm.

A person or machine (like a computer) capable of following the steps laid out in an algorithm.

Input is the initial information fed into an algorithm, while output is the result generated.

Instructions in an algorithm that have only one possible interpretation. No room for doubt.

Steps involved in creating a database, including requirement analysis, conceptual design, logical design, refinement, physical design, and application design.

Understanding user needs to determine what data to store and which applications will use the data.

Describing all information in a future database and the relationships between the data.

A conceptual model used to design databases by defining entities, attributes, and relationships between them.

A person, place, object, or concept that is relevant to the database.

A characteristic or property of an entity.

A connection between entities.

The format of the exam, which may include a practical computer demonstration or a written test followed by an oral interview, and practical examples.

A general-purpose language (high expressive power) used to formalize database properties. The description results in an Entity-Relationship (ER) schema.

The logical schema design depends on the underlying DBMS. In relational databases, it coincides with the definition of the logical schema.

Analyzing the initial logical schema to identify and solve issues like incompleteness and redundancies. Normalization is a formalized process that ensures important properties via a rigorous algebraic theory.

Analyzing workloads and defining or restructuring indexes to maximize performance for expected applications.

Defining application processes, identifying similar ones, creating user groups, access privileges, and rules.

Determining the entities, relationships, and information to store, along with integrity constraints and business rules.

Formalized using a powerful, general-purpose language called the ER language.

Schema matching the Database System Model