Cs 1030 Exam 2 V2

Front 1

Data arranged in rows and columns, much like a spreadsheet

Back 1

Table or entity

Front 2

A specific piece of information in a table row

Back 2

Column, field or attribute

Front 3

A collection of columns

Back 3

Row, record, or tuple

Front 4

Set of possible values for a column

Back 4

Domain

Front 5

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

Back 5

Index

Front 6

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

Back 6

Sort key

Front 7

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

Back 7

Normalization

Front 8

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

Back 8

Primary key

Front 9

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

Back 9

First normal form

Front 10

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

Back 10

Second normal form

Front 11

Eliminate columns that are not dependent on only the primary key

Back 11

Third normal form

Front 12

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

Back 12

Determinant

Front 13

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

Back 13

Functional dependency

Front 14

A primary key made up of more than one column

Back 14

Composite key

Front 15

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

Back 15

Transitive dependency

Front 16

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

Back 16

Foreign key

Front 17

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

Back 17

One-to-many (1:M) relationship

Front 18

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

Back 18

One-to-one (1:1) relationship

Front 19

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

Back 19

Many-to-many (M:M) relationship

Front 20

SQL SELECT option used to organize the data being returned

Back 20

ORDER BY

Front 21

SQL statement used to retrieve records from a table

Back 21

SELECT

Front 22

Applies conditional selection criteria when using a SELECT statement

Back 22

WHERE

Front 23

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

Back 23

Binary

Front 24

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

Back 24

Hexadecimal

Front 25

The numerical value each position in a number has

Back 25

Positional value

Front 26

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

Back 26

Radix point

Front 27

Smallest unit of representation in a computer system

Back 27

Bit

Front 28

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

Back 28

Byte

Front 29

A group of bits in a computer system

Back 29

Word

Front 30

A term sometimes used to refer to 4 bits

Back 30

Nibble

Front 31

A method of representing negative numbers in a computer system

Back 31

Twos complement

Front 32

A standard for storing text characters in computers in 7 bits

Back 32

ASCII

Front 33

A method for storing characters with an 8-bit code

Back 33

Extended ASCII

Front 34

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

Back 34

Unicode

Front 35

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

Back 35

Data structure

Front 36

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

Back 36

Array

Front 37

A memory cell in an array

Back 37

Element

Front 38

Used to specify the distance between memory locations

Back 38

Offset

Front 39

How an array accesses each element stored in its data structure

Back 39

Index (subscript)

Front 40

A data structure that uses noncontiguous memory locations to store data

Back 40

Linked list

Front 41

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

Back 41

Stack

Front 42

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

Back 42

LIFO

Front 43

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

Back 43

Queue

Front 44

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

Back 44

FIFO

Front 45

A data structure that represents a hierarchical structure

Back 45

Tree

Front 46

A position in a tree data structure

Back 46

Node or vertex

Front 47

The node that begins a tree

Back 47

Root node

Front 48

A node that has no child nodes

Back 48

Leaf node

Front 49

The distance from the node to the root node

Back 49

Depth or level

Front 50

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

Back 50

Binary search tree

Front 51

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

Back 51

Selection sort

Front 52

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

Back 52

Bubble sort

Front 53

The core of an operating system. Stays in main memory

Back 53

Kernel

Front 54

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

Back 54

Time slicing

Front 55

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

Back 55

Interrupt handling

Front 56

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

Back 56

Deadlock

Front 57

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

Back 57

Partition

Front 58

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

Back 58

File system

Front 59

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

Back 59

Hashing

Front 60

A unique value used in hashing algorithms and identifying records

Back 60

Hash key

Front 61

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

Back 61

Collision

Front 62

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

Back 62

Overflow area

Front 63

The six steps for designing a database

Back 63

Investigate, create a master column list, create tables, assess the relationships, analyze the design, and reevaluate

Front 64

This file system provides better reliability and security, journaling, file encryption, and file compression

Back 64

NTFS