• Shuffle
    Toggle On
    Toggle Off
  • Alphabetize
    Toggle On
    Toggle Off
  • Front First
    Toggle On
    Toggle Off
  • Both Sides
    Toggle On
    Toggle Off
  • Read
    Toggle On
    Toggle Off
Reading...
Front

Card Range To Study

through

image

Play button

image

Play button

image

Progress

1/64

Click to flip

Use LEFT and RIGHT arrow keys to navigate between flashcards;

Use UP and DOWN arrow keys to flip the card;

H to show hint;

A reads text to speech;

64 Cards in this Set

  • Front
  • Back

Data arranged in rows and columns, much like a spreadsheet

Table or entity

A specific piece of information in a table row

Column, field or attribute

A collection of columns

Row, record, or tuple

Set of possible values for a column

Domain

A special file that occupies its own space and specifies one or more columns that determine how info stored in the table can be accessed more effieciently

Index

In a DB table, one or more columns used to determine the data's sort order

Sort key

A DB design process that structures tables to eliminate duplication and inconsistencies in the data structure

Normalization

A column or combination of columns that uniquely identifies a row in a table

Primary key

Eliminating repeating fields or groups of fields from the table and confirming that every column has only one value by creating a new record in the table

First normal form

First normal form has already been applied to the table, and every column that isn't part of the primary key is fully dependent on the primary key

Second normal form

Eliminate columns that are not dependent on only the primary key

Third normal form

In a DB, any column you can use to determine the value assigned to another column in the same row

Determinant

A column's value is dependent on another column's value

Functional dependency

A primary key made up of more than one column

Composite key

One column is dependent on another column that isn't a primary key

Transitive dependency

A column in one table that relates to a primary key in another table

Foreign key

One instance of an entity (parent table) is associated with zero to many instances of another table (child table)

One-to-many (1:M) relationship

One instance of an entity (parent table) is associated with only one instance of another entity (child table)

One-to-one (1:1) relationship

Many instances of one entity or table (parent) are associated with many instances of another entity (child)

Many-to-many (M:M) relationship

SQL SELECT option used to organize the data being returned

ORDER BY

SQL statement used to retrieve records from a table

SELECT

Applies conditional selection criteria when using a SELECT statement

WHERE

Numbering system with two digits, 0 and 1. Also known as base 2

Binary

Numbering system with 16 digits, 0-9 and A-F; also known as base 16

Hexadecimal

The numerical value each position in a number has

Positional value

The point that divides the fractional portion from the whole portion of a number. (In decimal its referred to as the decimal point)

Radix point

Smallest unit of representation in a computer system

Bit

A group of 8 bits considered as one unit and used as the basic unit of measurement

Byte

A group of bits in a computer system

Word

A term sometimes used to refer to 4 bits

Nibble

A method of representing negative numbers in a computer system

Twos complement

A standard for storing text characters in computers in 7 bits

ASCII

A method for storing characters with an 8-bit code

Extended ASCII

A 16-bit standard for storing text or script information. 34,168 unique characters

Unicode

A way of organizing data in memory, such as arrays, lists, stacks, queues and trees

Data structure

A set of contiguous memory cells used for storing the same type of data

Array

A memory cell in an array

Element

Used to specify the distance between memory locations

Offset

How an array accesses each element stored in its data structure

Index (subscript)

A data structure that uses noncontiguous memory locations to store data

Linked list

A list in which the next item to be removed is the item most recently stored

Stack

The last item placed on the stack is the first item removed from the stack

LIFO

A list in which the next item to be removed is the item that has been in the list the longest

Queue

The last item in a list is the last item removed from the stack

FIFO

A data structure that represents a hierarchical structure

Tree

A position in a tree data structure

Node or vertex

The node that begins a tree

Root node

A node that has no child nodes

Leaf node

The distance from the node to the root node
Depth or level

A binary tree in which the left child's data value is less than the parent node's, and the right child's data value is greater than the parent's

Binary search tree

A sorting routine that selects the smallest unsorted item remaining in the list then swaps it with the item in the next position to be filled

Selection sort

A sorting routine that compares each item in the list with the one next to it and swaps if it's greater

Bubble sort

The core of an operating system. Stays in main memory

Kernel

A method of allocating fixed time units to running processes so that it appears to users that all processes are running simultaneously

Time slicing

A method of allowing processes and hardware I/O devices to interrupt the processor's normal executing so that it can handle specific tasks

Interrupt handling

A rare situation in which I/O devices and/or processes are waiting for each other for use of resources. Handled by the OS

Deadlock

An area of a hard disk reserved to hold files of a particular OS types

Partition

The part of the OS responsible for creating, manipulating, renaming, copying, and moving files to and from storage

File system

A common method for accessing data in a file or a database tale with a unique value called the hash key

Hashing

A unique value used in hashing algorithms and identifying records

Hash key

In hashing, what happens when the hashing algorithm generates the same relative key for more than one original key value

Collision

Area in a file that's used in case a collision occurs during the hashing algorithm

Overflow area

The six steps for designing a database
Investigate, create a master column list, create tables, assess the relationships, analyze the design, and reevaluate
This file system provides better reliability and security, journaling, file encryption, and file compression
NTFS