Computer Science Concepts Quiz

Abstraction

• Abstraction is a representation created by removing unnecessary details.

Aggregation

• Aggregation is an association where the aggregated object has a weaker connection with the aggregating objects.
• These objects exist independently of the aggregated object and continue existing after it's removed .

Ajax

• Ajax allows selected parts of a web page to be updated from a server.

Algorithm

• An algorithm is a set of unambiguous instructions to solve a problem.
• It can be represented as a Turing machine program.

API (Application Programming Interface)

• An API allows application programs to use operating system services.

Association

• An association is a relationship between two classes.
• Types include composition and aggregation.

Asymptotic Behavior

• Describes the behavior of a function for very large input values.

Asynchronous Serial Data Transmission

• Sender and receiver have separate, unsynchronized clocks.
• A start bit synchronizes them temporarily for transmissions.

Attribute

• An attribute is a property or characteristic of an object or entity (in databases).

Automation

• Turning an abstraction into a format for computer processing.

BNF (Backus-Naur Form)

• BNF is a formal system for describing programming languages.

Bandwidth

• The range of signal frequencies a transmission medium can carry.

Base Case

• A base case's solution doesn't involve the general case.

Baseband System

• A single data channel system using the whole bandwidth of the transmission medium.

Basic Operation

• The operation contributing most to an algorithm's total running time.

Baud Rate

• The rate of signal changes on a wire.

Behaviors

• Behaviors are the functions or actions of an object.

Bit Rate

• The number of bits transmitted per second.

Broadband

• A multiple data channel systems using transmission medium bandwidth for multiple streams simultaneously.

Bubble Sort

• A sorting algorithm where adjacent items are compared and swapped until no more swaps are needed.

Ciphertext

• Encrypted message data.

Circular Queue

• When the last queue element is used, the next element enters the queue from the beginning.

Class Definition

• A template for creating objects.

Client

• A computer that requests services from a server.

Client-Server System

• A system where clients request services from servers.

Closed Path/Circuit

• A sequence of edges starting and ending at the same vertex. All successive edges share a common vertex.

Communication Protocol

• A set of rules for data and information exchange between computers.

Complexity of a Problem

• The worst-case complexity of the most efficient solving algorithm.

Composite Key

• A combination of attributes uniquely identifying a record.

Computational Complexity

• A measure of how computationally efficient an algorithm is.

Composition

• A type of association, where composite objects own their constituent objects.
• Composite objects' lifecycles determine their constituent objects' existence.

Conceptual Model

• An organization's data requirements representation independent of specific software.

Cryptanalysis

• Trying to decrypt a message without the key.

Cryptography

• The science of designing encryption systems.

Cycle

• A closed path where all edges and vertices (except the start/end vertex) are unique.

Data Model

• A description of data, structures, relationships, and constraints for a system or organization.

Data Transmission

• The movement of data.

Database

• A structured collection of data.

DBMS (Database Management System)

• Software for defining, creating, maintaining and accessing a database.

Decryption

• Converting encrypted data back to plain text.

Degree (of a Vertex)

• The number of neighbours a vertex has.

Degree of Relationship

• The number of entity occurrences for two entities having a one-to-one association.

Deterministic Finite State Machine (FSM)

• An FSM where each pair (state, input) uniquely determines the next state.

Directed Graph

• A graph with directed edges.

Dynamic Allocation

• Memory allocation occurs at runtime when needed.

Dynamic Data Structure

• A data structure with varying memory size during runtime.

Dynamic Web Page Content

• Web page content generated upon receiving a browser request.

Embedded Computer System

• A dedicated computer system, often independent, with limited user interface.

Encapsulation

• Grouping a data record with procedures that manipulate it (OOP class).

Encryption

• Converting data to an unreadable form using algorithms and keys.

Entity

• A person, thing, event or object of interest about which data is recorded.

Evaluation

• Assessing if a system or item meets its objectives and specifications in terms of effectiveness, usability, maintainability.

Explorer's Problem

• Finding a route visiting each edge exactly once before returning to the start.

Exponential Growth

• Growth with a form like kn (e.g., 2n).

Exponential Time Algorithm

• An algorithm with an exponentially increasing execution time based on input size.

Feasibility Study

• Investigating the potential of a new system.

Finite State Machine (FSM)

• A model of computation with a fixed number of states. The machine moves from one state to another based on inputs.

Floating-Point Notation

• Representing a real number with a sign, mantissa (significant digits), and exponent (power of 2).

Foreign Key

• An attribute in one table referencing a primary key in another.

Gateway

• A device connecting networks using different communication protocols.

General Case

• A solution expressed in terms of a variable (e.g., 'n').

Graph

• A diagram with vertices and edges.

Halting Problem

• The unsolvable problem of determining if a given program and its input will ever halt.

Halting State

• A state in a finite state machine with no outgoing transitions.

Handshaking Protocol

• An exchange of signals between devices to synchronize before data transfer.

Heuristic

• An approach using experience for informed guesses to possibly find a polynomial-time solution to a difficult problem (often non-optimal).

Human-Computer Interaction (HCI)

• The study, planning and design of how humans interact with computer systems.

Inheritance

• A relationship where one object type is a kind of another, sharing properties and behaviors.

Instantiation

• Creating an object from a class.

Internet

• A global network of interconnected networks using the TCP/IP protocol.

Interpreter

• Reads, understands, and executes instructions in source code sequentially.

Intractable

• A solvable problem with no known polynomial-time algorithm.

Labelled/Weighted Graph

• A graph where edges have labels or values (weights).

Linear Queue

• Elements join at one end and leave from the other.

Linear Search

• Searching by comparing each item in a list sequentially until a match or the end is reached.

Linear Time Algorithm

• An algorithm taking O(n) time.

List

• A collection of ordered elements.

Maintainability of Software

• Ease of fixing bugs, altering parameters, and adapting to changed requirements.

Maintenance

• Fixing errors, changing features, responding to changing needs in software.

Mealy Machine

• A finite state machine determining output based on the present state and input.

Model

• An abstraction representing a real-world entity for a computerized problem solution.

Neighbors

• Vertices connected by an edge.

Non-computable Problem

• An algorithmic problem with no algorithm to solve.

Normalization

• Techniques used for creating normalised entities in a database.

Normalized Entities

• Data structures with no redundant data.

Null Pointer

• A pointer referencing no memory location.

Object

• An instance of a class.

Operating System Role

• Managing system resources (processors, memory, I/O) among programs, hiding hardware complexity for users.

Order of Complexity

• A problem's big O complexity.

Overflow

• A result too large for the available number of bits.

Parallel Data Transmission

• Multiple bits sent simultaneously on separate wires.

Peer-to-Peer Network

• A network without dedicated servers where all computers are equals.

Pharming

• Phishing technique redirecting users to fraudulent sites via altered DNS information.

Phishing

• Deceiving users to reveal personal information.

Plaintext

• Original, unencrypted message data.

Pointer

• A variable holding a memory address.

Pointer Type

• A variable storing memory addresses.

Polymorphism

• The ability to use the same name for actions that differ based on class.

Polynomial Growth

• Growth with a form like nk (e.g., n3).

Test your knowledge on fundamental computer science concepts including abstraction, aggregation, Ajax, algorithms, APIs, and more. This quiz covers important definitions and relationships between various programming elements. Perfect for students looking to solidify their understanding of these topics!