text stringlengths 2 2.33k | source stringclasses 826
values |
|---|---|
bytecode : object code produced by Java compilation, which is then interpreted by the Java virtual machine | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
call stack : execution stack that is the data structure that controls the calling and return of functions | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
case-sensitive : refers to whether uppercase and lowercase letters are treated as distinct from each other | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
class : code blueprint from which objects are constructed | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
client-side script : script that runs on a client computer, usually under the control of a web browser and needs an interpreter on the clientâs machine | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
code block : statement that consists of one or more statements that are structured in a sequential group and delineated as such | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
code generation : transformation of the code to the target or object language | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
coercion : ability of a variable of a data type to be forced to hold a value of a different data type | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
combined assignment : when the assignment operator is combined with another operator, usually mathematical, as a shortcut notation | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
comment : container used to hold documentation in code | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
Common Gateway Interface (CGI) : executable program residing in a special directory known to the web server management program | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
Common Language Runtime (CLR) : takes managed code and provides a JIT execution that allows all the languages to play nicely with each other | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
compilation : single process that takes the source code that the programmer creates and transforms it into another language | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
complex data type : data type consisting of multiple primitive types used as its building blocks | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
condition-controlled : loop that will continue to iterate until a specific condition is met | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
conditional expression : (also:Boolean expression) evaluates to the Boolean values of true or false | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
constructor : specialized method that is called upon to instantiate an object from a class | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
count-controlled : loop that will continue to iterate a specific number of times | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
decrement operator (--) : unary operator that lowers the value of its operand by one | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
destructor : specialized methods used in some languages to destroy an instantiated object and recover its memory | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
determinative : loop that is predictable in its number of iterations | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
dynamic linker : compilation process which allows the program to be carried over to memory for execution after it runs | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
dynamic method binding : all methods are resolved dynamically at runtime, not by the compiler, sometimes referred to as late binding | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
element : each âshelfâ of an array that can hold a value of a data type | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
embedded script : script in which one language is embedded inside another | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
encapsulation : attributes and behaviors of classes and objects are self-contained and go along with them throughout their lifetime | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
event-driven : when behavior of programs is controlled by actions (events) which are listened for and then acted upon or handled | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
exception : unusual behavior that can be recovered using exception handling support the programming language provides | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
exponentiation operator (**) : operator that raises the value of one operand to the power of the second operand | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
expression : construct in a programming language that evaluates two values | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
first-class function : function that can be assigned as a value to a variable | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
floating point : data type consisting of a decimal number | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
flow of control : order in which, or if, the statements of a program are executed | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
for loop : particular loop construct that is top-tested and count-controlled | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
formal parameter : represent values that the function needs to receive to do its job | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
front end : compilation step that is responsible for the analysis of the source code | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
function : code sequence that is designed to perform a particular task | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
function call : code which invokes the function and passes to it values that may be needed for it to do its job | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
function signature : defines a function and informs the compiler or interpreter about the details that it needs to call upon that function and what it may return | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
functional programming : programming model in which the key concept is that programs are constructed by composing functions and applying them | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
garbage collection : process used to destroy unneeded objects and recover memory when there are no longer any references to them in the code | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
global optimization : code improvements at multiple layers that include loop performance improvement, register allocation, and instruction scheduling | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
high-order function : function that can take one or more first class functions as arguments | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
hybrid implementation : method of language translation which involves the use of both a compiler and an interpreter | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
identifier : name given to a variable or other construct | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
imperative language : emphasizes a âtell the computer what to doâ approach | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
increment operator (++) : unary operator that raises the value of its operand by one | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
indexed array : array in which the elements are numbered with an index, starting at zero | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
information hiding : masking of the actual bits and bytes of implementation that the user of a module does not need to know | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
inheritance : feature of OOP in which classes and objects take on specified attributes from their ancestors | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
initialization : assigning its first value to a variable | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
instantiation : process of building an instance (an object) of a class | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
integer : data type consisting of whole numbers | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
interface : construct which resembles a class definition but contains only methods which are constructed as abstract methods | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
intermediate code : language translation phase that produces a code level between the source code and the object code | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
intermediate form (IF) : middle end compilation product created after semantic analysis if the program passes all checks | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
intermediate language : generated from programming source code, but the CPU typically cannot execute directly | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
iteration : looping, going around and re-executing sequences of statements | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
Java virtual machine (JVM) : Java interpreter that translates bytecode into executable code | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
just-in-time (JIT) compilation : process when intermediate code gets its final compilation (or usually interpretation) phase right at the start of runtime | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
just-in-time (JIT) translation : process in which intermediate language is translated and executed exactly when needed | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
keyword : word reserved by the language that has a special meaning | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
late binding : when all methods are resolved dynamically at runtime, not by the compiler; sometimes referred to as dynamic binding | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
lexical analysis : compilation step that converts the source code strings of characters into tokens | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
literal : value of one of the legal data types of an HLL that can be written directly into the code | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
local optimization : elimination of redundant operations in a basic block | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
lvalue : left-hand operand in an expression | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
managed code : code targeted to run under a particular runtime environment | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
member : attribute or method that is encapsulated within a class or object | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
metadata : data about data | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
middle end : compilation step responsible for performing optimizations of the code | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
modularization : splitting a large job into independent units which may be then called upon to perform tasks | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
module : component of a program | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
modulo operator (%) : operator which evaluates to the remainder left after division | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
multiple inheritance : ability to inherit attributes and methods from more than one parent | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
multitask : ability of an application to process more than one task at the same time or to engage in concurrency | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
mutable : something that is changeable, possibly referring to state | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
name-value pair : construct-like variables that is named and can hold values | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
named constant : container that can be assigned the value of a data type which may not be changed thereafter | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
non determinative : loop for which we cannot predict the number of iterations (condition controlled) | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
object code : machine code produced by a compiler or interpreter | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
operator : performs various types of operations (processes) on values | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
optimization : producing what will be needed to generate the fastest and most efficiently running code possible | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
override : define another method with the same name and modify its signature | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
parallelism : when programs can have more than one part of the code running simultaneously | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
parsing : front-end compilation process, also referred to as syntax analysis, or reading the code to make sure it conforms with the syntax rules of the language | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
pass by reference : actual memory address of a variable passed as an argument, meaning the function has access to modify the original variable | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
pass by value : copy made of a value and passed as an argument, meaning the function has no access to modify the original variable | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
polymorphism : feature of OOP in which methods inherited may perform in different ways in different subclasses and depend upon their context | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
precedence : order of operations rules that determine the order in which operators in statements are evaluated | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
preprocessing : pre-compilation step in which the source code is manipulated to prepare it for the compilation stage | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
preprocessor directive : code that describes resources the program needs in order to compile, usually files to insert into the source code | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
primitive data type : (also:basic data type) simplest data type of a language that can usually be represented directly by the hardware memory and registers | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
procedural language : allows programmers to group statements into blocks of code within the scope of which variables may be defined and manipulated independently from the rest of a program | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
public interface : documentation of only what a user needs to access an object, its attributes, and its methods | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
pure function : function that will return the same result every time given the same arguments | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
race condition : when the condition of a program and its behaviors are not synchronized | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
readability : measures how easily an HLL can be read and understood | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
reference variable : variable that holds memory addresses | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
return : command that ends a function and/or sends values back to the place at which the function was called | https://openstax.org/books/introduction-computer-science/pages/7-key-terms |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.