Section 1

Preview this deck

Interpreters

Front

Star 0%
Star 0%
Star 0%
Star 0%
Star 0%

0.0

0 reviews

5
0
4
0
3
0
2
0
1
0

Active users

0

All-time users

0

Favorites

0

Last updated

6 years ago

Date created

Mar 1, 2020

Cards (165)

Section 1

(50 cards)

Interpreters

Front

___________________ execution is much slower compared to assembly and compiler programs.

Back

Encapsulation

Front

Conceals the functional details of a class from the user.

Back

Loops

Front

A repetition structure that can potentially process the same sequence of statements multiple times. Use Boolean logic

Back

Just In Time Compilation

Front

Code can be recompiled at anytime including at execute time and can run on any platform for which a VM exists

Back

Small, fast

Front

Assembled programs tend to be very _____________, and very ___________.

Back

Compiling

Front

The process of taking compiler language statements and converting them to machine code

Back

Source code

Front

Assembled programs ________________ tend to be long and difficult to understand and follow.

Back

Compiled Languages

Front

A third generation high level programming language that is easier to learn and are not CPU specific.

Back

Object

Front

An instance of a class

Back

Assembly

Front

Back

Sequential Action

Front

A linear progression of tasks.

Back

Assembly Language

Front

Known as a second generation, low level, earliest programming language. Is also closest to the native machine code used by CPU.

Back

Class

Front

Defines what actions an object can perform and what data it can store

Back

"

Front

Back

Decision

Front

Is used as a diamond for branches in a flow chart

Back

Inheritance

Front

When a class possesses characteristics and behaviors from another class.

Back

Interpreted/scripting languages

Front

Delays the intermediate step of assembling/compiling which is associated with assembly and compiler languages. Instead, user invokes a interpreter to translate the source code to machine language each time it is run. Considered a high level, third generation programming language.

Back

Assembler

Front

The tool that converts assembly language to machine code so CPU can execute the instructions.

Back

Unstructured Programming

Front

The most elementary method of programming in which any line of code may be executed if the logic dictates that action. It becomes unwieldy once the program grows in size and complexity.Pr

Back

Just-In-Time (JIT) compilation

Front

Blurs the lines between compiler languages and interpreted languages. Considered a high level, third generation programming language.

Back

Behaviors

Front

Actions an object can perform

Back

g++"

Front

The C++ compiler that is used to compile C++ source code files

Back

Compiled

Front

The speed at which a _____________ program executes on a computer is usually slower than the equivalent assembly language program.

Back

Interpreters

Front

_________________ require a source code on the computer.

Back

Interpreter

Front

The _____________ reads the source code statements, parses them, understands them, and executes the necessary machine instructions.

Back

Knowledge, machine

Front

Programmers require a detailed _________________ of how the CPU works since programs are __________________ dependent in an assembled program.

Back

Input/ output

Front

Is used as a parallelogram in a flow chart and acquires data from a user or display data to a user.

Back

Just In Time Compilation

Front

Code can be recompiled at anytime including at execute time and can run on any platform for which a VM exists

Back

g++"

Front

The C++ compiler that is used to compile C++ source code files

Back

Interpreters

Front

_________________ are not suitable for large scale, complex tasks.

Back

Compilation

Front

Back

Pseudocode

Front

A tool that uses a structured, natural, language to abstract the technical details and programming syntax away from reader leaving a clear picture of the logical processes necessary to solve a problem.

Back

Attributes

Front

Characteristics of an object

Back

Just In Time Compilation

Front

Code can be recompiled at anytime including at execute time and can run on any platform for which a VM exists

Back

Java

Front

Compiled to Java byte code and is interpreted by the Java Virtual Machine

Back

Compilers

Front

Many _____________ will catch programming errors and warn the programmer of actual or potential problems that could lead to incorrect results or a system crash.

Back

Interpreters

Front

The _______________ are useful for small tasks where a compiled program would be overkill

Back

Stages of Compilation

Front

"Pre processor

Back

"

Front

Back

Branches

Front

A selection between different courses of action and use Boolean logic

Back

Branches

Front

Provides one or more paths of execution for the program to follow

Back

Pseudocode

Front

A tool that uses a structured, natural, language to abstract the technical details and programming syntax away from reader leaving a clear picture of the logical processes necessary to solve a problem.

Back

Parameters

Front

Allows a procedure to work with different data and be able to produce varied results.

Back

Executable

Front

The result of either compiling or assembling the source code into a compiled or assembled program

Back

Object-Oriented Programming (OOP)

Front

A complex programming method, which uses the concept of objects and their interactions to design applications and computer programs.

Back

For

Front

Statements described as the Counting Loop.

Back

Interpreted Languages

Front

________________________ rarely interact with specialized functions of hardware/software.

Back

Procedural Programming

Front

Provides a means to make a program modular by grouping statements that perform a specific task together.

Back

Sequential Action

Front

A linear progression of tasks.

Back

Polymorphism

Front

Allows you to treat subclasses just like their parent class's members but achieve a different result.

Back

Section 2

(50 cards)

"

Front

Back

&&

Front

Logical AND

Back

Pre processor

Front

Combines multiple source code and include files into one logical file then performs other actions that are indicated by a # in the source code

Back

==

Front

Comparison operator

Back

Iostream library

Front

Include this library to do input and output functions

Back

Compilation

Front

"Output from pre processor that is converted to assembly language

Back

Parts of a program

Front

"Declarations

Back

=

Front

Assignment operator

Back

Processing

Front

Back

Assembly

Front

Object code (machine code) is generated from the output of the compilation stage

Back

Linking

Front

Takes object code and links together any third party libraries of pre written code producing an executable file.

Back

Pre processor

Front

Combines multiple source code and include files into one logical file then performs other actions that are indicated by a # in the source code

Back

Input

Front

Back

Output "

Front

Back

Linking

Front

Takes object code and links together any third party libraries of pre written code producing an executable file.

Back

==

Front

Comparison operator

Back

==

Front

Comparison operator

Back

Compilation

Front

"Output from pre processor that is converted to assembly language

Back

Input

Front

Back

==

Front

Comparison operator

Back

Input

Front

Back

Parts of a program

Front

"Declarations

Back

Processing

Front

Back

Assembly

Front

Object code (machine code) is generated from the output of the compilation stage

Back

||

Front

Logical OR

Back

Parts of a program

Front

"Declarations

Back

Parts of a program

Front

"Declarations

Back

Output "

Front

Back

Assembly

Front

Object code (machine code) is generated from the output of the compilation stage

Back

Output "

Front

Back

Pre processor

Front

Combines multiple source code and include files into one logical file then performs other actions that are indicated by a # in the source code

Back

Processing

Front

Back

Compilation

Front

"Output from pre processor that is converted to assembly language

Back

Output "

Front

Back

Output "

Front

Back

&&

Front

Logical AND

Back

Input

Front

Back

=

Front

Assignment operator

Back

Pre processor

Front

Combines multiple source code and include files into one logical file then performs other actions that are indicated by a # in the source code

Back

"

Front

Back

Processing

Front

Back

=

Front

Assignment operator

Back

Input

Front

Back

Parts of a program

Front

"Declarations

Back

"

Front

Back

Pre processor

Front

Combines multiple source code and include files into one logical file then performs other actions that are indicated by a # in the source code

Back

Processing

Front

Back

"

Front

Back

Linking"

Front

Back

Compilation

Front

"Output from pre processor that is converted to assembly language

Back

Section 3

(50 cards)

Operators

Front

Used in C++ to perform several different actions to include memory, logical, bit wise, and mathematic operations

Back

Stack

Front

Memory used by non static local variables explicitly declared in a program.

Back

&

Front

Means address of and returns the address in memory where the variable is stored.

Back


Front

Represents a newline character similar to std::endl

Back

Single Line Comment

Front

//

Back


Front

Represents a newline character similar to std::endl

Back

!

Front

Logical NOT

Back

Heap

Front

Dynamically allocated memory

Back

\t

Front

Represents a tan character

Back

*/ stop"

Front

Back

!

Front

Logical NOT

Back

+=

Front

Increments

Back

Array

Front

A concept that groups data of the same type in adjacent or contiguous memory locations.

Back

Stack

Front

Memory used by non static local variables explicitly declared in a program.

Back

/=

Front

Divides

Back

Pointers

Front

Handle large amounts of data; value is the address of a variable ; functionality prevents duplicates of data in memory resulting in a significant reduction in processing time

Back

Operators

Front

Used in C++ to perform several different actions to include memory, logical, bit wise, and mathematic operations

Back

Data

Front

Holds global and static variables which exist throughout the life of the program

Back

++

Front

Increments

Back

Heap

Front

Dynamically allocated memory

Back

-=

Front

Decrements

Back

\t

Front

Represents a tan character

Back

/=

Front

Divides

Back

Concentating

Front

Process of joining two or more strings together.

Back

-=

Front

Decrements

Back

Heap

Front

Dynamically allocated memory

Back

&

Front

Means address of and returns the address in memory where the variable is stored.

Back

+=

Front

Increments

Back

*=

Front

Multiplies

Back

+=

Front

Increments

Back


Front

Represents a newline character similar to std::endl

Back

/=

Front

Divides

Back

\t

Front

Represents a tan character

Back

String

Front

A special object that holds a series of characters

Back

Array

Front

A concept that groups data of the same type in adjacent or contiguous memory locations.

Back

Operators

Front

Used in C++ to perform several different actions to include memory, logical, bit wise, and mathematic operations

Back

&

Front

Means address of and returns the address in memory where the variable is stored.

Back

!

Front

Logical NOT

Back

&

Front

Means address of and returns the address in memory where the variable is stored.

Back

Single Line Comment

Front

//

Back

Stack

Front

Memory used by non static local variables explicitly declared in a program.

Back

&

Front

Means address of and returns the address in memory where the variable is stored.

Back

\t

Front

Represents a tan character

Back

++

Front

Increments

Back

Multiple Line Comment

Front

"/* start

Back


Front

Represents a newline character similar to std::endl

Back

Stack

Front

Memory used by non static local variables explicitly declared in a program.

Back

!

Front

Logical NOT

Back


Front

Represents a newline character similar to std::endl

Back

--

Front

Decrements

Back

Section 4

(15 cards)

Stack

Front

If they should ever meet, a ____________ or heap based buffer overflow will occur

Back

Heap

Front

Dynamically allocated memory

Back

Data

Front

Holds global and static variables which exist throughout the life of the program

Back

Stack

Front

Memory used by non static local variables explicitly declared in a program.

Back

Text

Front

Stores the Compiled code of the currently running program

Back

Heap

Front

Dynamically allocated memory

Back

&

Front

Means address of and returns the address in memory where the variable is stored.

Back

Dynamic memory allocation

Front

Contiguous blocks of memory from the heap

Back

Text

Front

Stores the Compiled code of the currently running program

Back

Text

Front

Stores the Compiled code of the currently running program

Back

Data

Front

Holds global and static variables which exist throughout the life of the program

Back

Stack

Front

Memory used by non static local variables explicitly declared in a program.

Back

Stack

Front

If they should ever meet, a ____________ or heap based buffer overflow will occur

Back

Data

Front

Holds global and static variables which exist throughout the life of the program

Back

&

Front

Means address of and returns the address in memory where the variable is stored.

Back