Create a New Flashcard Set

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/98

encourage image

There's no tags or description

Looks like no tags are added yet.

99 Terms

1
New cards

cin

Character input

2
New cards

Comment

A programmer-readable explanation in the source code of a computer program ( // single line, /**/ multiline)

3
New cards

Compiler

A program that generally transforms code written in a high-level language like C++ into a low-level language like machine code in order to create an executable program

4
New cards

cout

Character output

5
New cards

Dynamically typed

A type of programming language in which variables need not necessarily be defined before they are used, and can be changed during execution

6
New cards

Statically typed

A type of programming language in which variables must be defined before they are used and cannot change during execution

7
New cards

Header file

A library file that contains a variety of useful definitions, imported into any C++ program by using the pre-processor #include statement

8
New cards

#include

A statement that tells the pre-processor to treat the contents of a specified file as if they appear in the source program at the point where the directive appears

9
New cards

Interpreter

A program that directly executes statements in a scripting language without requiring them to have been compiled into machine language

10
New cards

Machine code

A computer program written in instructions that can be directly executed by a computer's CPU

11
New cards

Pointer

A variable that stores a memory address and can be used to directly access data stored at that memory location; a value that indicates a place in a computer's memory

12
New cards

Address-of

The operator used to access the address of a C++ variable (&)

13
New cards

Atomic data type

A basic data type that cannot be broken down into any simpler data elements

14
New cards

bool

Keyword for Boolean data type

15
New cards

char

Keyword for character data type that stores a single character

16
New cards

Dereference

To follow a pointer to its referenced memory location and read the data there

17
New cards

float

Keyword for floating point data type

18
New cards

double

Keyword for double-precision floating point data type

19
New cards

int

Keyword for integer data type

20
New cards

break

A statement that terminates the current block of code and resumes the program outside of it

21
New cards

case

A condition in a switch statement for a variable to be tested against

22
New cards

Conditional

A statement that tests whether a condition is true or false

23
New cards

Loop

A series of instructions repeated infinitely or until a condition is met

24
New cards

switch

A statement that tests a variable against possible conditions for it

25
New cards

Argument

The data passed to the parameter

26
New cards

const (immutable)

Keyword that makes a variable or value constant and unchanging; unable to be modified

27
New cards

Function

A section of code that performs a procedure and is usually named

28
New cards

Overloading

Specifying more than one definition that accepts data passed from an argument; defining a new meaning for an already existing operator; creating multiple functions with the same name but different implementations

29
New cards

Parameter

A variable in a function or method definition that accepts data passed from an argument

30
New cards

void

Keyword indicating a function has no return value

31
New cards

Array

A data structure consisting of an ordered collection of data elements of identical type in which each element can be identified by an index

32
New cards

Collection

A grouping of a number of data items that have some shared significance or need to be operated upon together

33
New cards

Hash table

A collection of key-value pairs with an associated hash function that maps the key to the associated value

34
New cards

non-const (mutable)

Able to be modified

35
New cards

Set

An unordered data structure consisting of unique, immutable data values

36
New cards

String

A sequential data structure consisting of zero or more characters

37
New cards

Vector

A sequence container storing data of a single type that is stored in a dynamically allocated array which can change in size

38
New cards

Word

A unit of data used by a particular processor design

39
New cards

c-string

An array of characters that ends with a terminating null character

40
New cards

Member function

A function that's associated with a certain type of object

41
New cards

Stream

An abstraction that allows you to send or receive an unknown number of bytes in input or output

42
New cards

End-Of-File (eof)

A flag at the end of a file to let programs know when to stop reading

43
New cards

Exception

A response to an unusual circumstance while a program is running

44
New cards

Logic error

An error in which the program/code functions, but performs incorrectly

45
New cards

Runtime error

An error that occurs when a program runs

46
New cards

Syntax error

An error in the structure of a statement or expression of code

47
New cards

Undo queue

A queue of actions the turtle has previously taken

48
New cards

Abstract data type (ADT)

A mathematical model for data

49
New cards

Abstraction

Focusing on desired behaviors and properties while disregarding what is irrelevant or unimportant; representing data without revealing the details

50
New cards

Access keywords

Keywords such as ''public'', private'', and ''protected'' that indicate what class properties/behaviors a user can change

51
New cards

Algorithm

A set of instructions or rules given to complete a task

52
New cards

AND

A logic gate in which both inputs must be true

53
New cards

Base class

A class from which other classes are derived

54
New cards

Class

A template for creating (instantiating) objects, for providing initial values for state via member variables, and for implementations of behavior via member functions or methods

55
New cards

Class methods

The functions and methods that belong to a class that describe what the class can do

56
New cards

Data structure

The organization of data that allows for improved search, storage, and sorting capability

57
New cards

Derived class

A class created or derived from another existing class

58
New cards

Encapsulation

Hiding the contents of a class except when absolutely necessary

59
New cards

Friend

An operator or function that is defined outside of a class' scope but can access the private data members of a class

60
New cards

HAS-A relationship

A relationship where one object "belongs to" another object, and behaves according to rules of ownership; the object contains instances of another class

61
New cards

Interface

A shared boundary in which two or more components of a computer system exchange information

62
New cards

NOT

An inverter gate, used to negate input

63
New cards

Object

A variable, data structure, function, or a method, that can be referenced by an identifier

64
New cards

OR

A basic gate. If either input is true, the output is also. If inputs are false, so is the output

65
New cards

Pass by reference

To pass an object to a function by referencing its location in memory

66
New cards

Pass by value

To pass an object to a function by copying its value

67
New cards

Polymorphism

The ability to process objects or methods differently depending on their data type, class, number of arguments, etc.

68
New cards

Superclass

A class that has been extended by another existing class

69
New cards

Average case

When an algorithm performs between its worst and best case given a certain data set or circumstance

70
New cards

Best case

When an algorithm performs especially good given a certain data set or circumstance

71
New cards

Brute force

A technique that tries to exhaust all possibilities of a problem

72
New cards

contains

A hash operation used to check if a table contains a specific element

73
New cards

Contiguous

Adjacent or next to

74
New cards

Dynamic size

Able to change size automatically

75
New cards

get_item

A hash operation used to retrieve the information associated with a hash key

76
New cards

Logarithmic

Functions that are the inverse of exponential functions usually presented as f(n) = logn

77
New cards

Order of magnitude (Big-O Notation)

Function describing the part T(n) that increases the fastest as the value of n increases (a function describing an algorithm's steps as the size of the problem increases)

78
New cards

Quadratic

Function describing a relationship who's highest order is a number squared; f(n) = x^2

79
New cards

set_item

A hash operation used to add an item to your table

80
New cards

Worst case

Refers to when an algorithm performs especially poorly given a certain data set or circumstance

81
New cards

Linear data structure

A data structure wherein each element but the first and last has a unique predecessor and successor; the positions are relative to each other

82
New cards

Stack (push-down stack)

An ordered collection of items where the addition of new items and the removal of existing items always takes place at the same end

83
New cards

Infix

A type of notation where the operator is in between the two operants that it is working on

84
New cards

Prefix

A type of notation where the operator precedes the two operands that is it working on

85
New cards

Postfix

A type of notation where the operator comes after the two operands that is it working on

86
New cards

Queue

An ordered collection of items where the addition of new items happens at one end and the removal of existing items occurs at the other end

87
New cards

Deque

An ordered collection of items with two ends and the items remain positioned in the collection; new items can be added at either the front or the rear

88
New cards

First-In First-Out (FIFO)

Ordering principle in which the first item added is also the first removed

89
New cards

Last-In First Out (LIFO)

Ordering principle in which the last item added is also the first removed

90
New cards

Simulation

An imitation of a process or operation

91
New cards

Linked data structure

A data structure which consists of a set of data structures called nodes which are linked together and organized by links created via references or pointers

92
New cards

Linked list

A linear data structure, where order of elements is not determined by the placement in memory, but by being stored in nodes which point to the next nodes

93
New cards

Node

The basic building block for the linked list implementation; holds at least two pieces of information (list item and reference)

94
New cards

Data field

The field of a node which contains the list item itself

95
New cards

Unordered linked list

A linked list whose elements are not in an order

96
New cards

Linked list traversal

The process of systematically visiting each node in a linked list

97
New cards

Ordered list

A list whose elements are ordered

98
New cards

Forward list

Sequence containers in the STL that allow you to do constant time insert and delete operations

99
New cards

List (STL)

Sequence container which holds a link to the previous element and the next element