programming language module1-6

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

1/87

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 2:23 PM on 3/23/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

88 Terms

1
New cards

Programming Language

a notational system intended primarily to facilitate human-machine interaction. The notational is understood both by human and machine.

2
New cards

syntax semantics

Like English which is a natural language, programming language has word symbols and rules of grammar. The grammatical rules are called ______ and language elements have ________.

3
New cards

Imperative Languages,

also called Algorithmic languages. Their programs are constructed as algorithms or as sequence of executable instructions. These languages are generally concerned with variables include commands for sequentially allocating memory space or CPU locations to these variables and for correspondingly changing their values through assignment or procedure execution.

4
New cards

Block-Structured or Procedural Languages

These languages are process or “how” oriented. Their basic unit of modularization is the function or the procedure.

5
New cards

Object-Oriented Language

– These languages are data or “what” centered and implement the principle of program decomposition, data abstraction, and information hiding.

6
New cards

Distributed Programming Language

These languages support more than one processor working simultaneously or alternately with other processors in order to complete a task or to solve a problem.

7
New cards

Declarative languages

are those based on the relations or functions. They include facilities for writing declarations or truths.

8
New cards

Readability

It is the quality of a language that enables a programmer to understand and comprehend the structure of programs so they can be easily understood to read.

9
New cards

Writability

It is a measure of how easily and conveniently a language can be used to create codes or programs for a particular problem.

10
New cards

Reliability

It refers to the ability of a program to perform to its specifications under all-possible conditions or circumstances.

11
New cards

processor

a collection of circuit that provides a realization of a set of primitive operations, or machine instructions, such as those for arithmetic and logic operations.

12
New cards

Compilation

translates high-level language programs into equivalent programs in machine language.

13
New cards

Pure Interpretation

a method of a software simulation, which translates high-level language programs by interpreting them through software simulation of a computer whose machine language is the high-level language itself.

14
New cards

Hybrid Implementation Systems

These translates source programs into intermediate code-like versions and then decode and accomplish them through interpretation.

15
New cards

Low-Level Language

is a type of programming language that contains basic instructions recognized by a computer.

16
New cards

High Level Language

are codes that are closes to English but included simple mathematical notation

17
New cards

Pseudocode

It uses short terms, or simple English language syntaxes to write code for programs before it is actually converted into a specific programming language. It allows the designer to focus on the logic of the algorithm without being distracted by details of language syntax.

18
New cards

c++

It provided support for creating data abstractions and object-oriented programming while keeping the simplicity of expression and execution speed.

19
New cards

Java

——- increased the level of interactivity in the web, providing real time, dynamic, and visual interaction between the user and the application.

20
New cards

Visual Basic

This is an object-oriented based programming language. While most-of its

constructs are similar to other languages, the event-driven nature of _______

introduces some subtle differences.

21
New cards

Data object

represents a container for data values. A place value where data values may be stored and later retrieved.

22
New cards

Data Value

is represented by a pattern of bits recognized by the computer.

23
New cards

Type

It determines the set of data values that the object may take and the applicable operations.

24
New cards

Name

The binding to one or more names by which the object may be referenced during program execution is usually setup by declaration and modified by subprogram calls and returns.

25
New cards

Component

The binding of a data object to one or more data objects of which it is a component is often represented by a pointer value and may be modified by a change in pointer

26
New cards

Variables

are data objects defined and named by the programmer explicitly. It is a quadruple which is composed of name, a set of attributes, a reference and a value.

27
New cards

Constants

are data objects with a name that is permanently bound to a value for its lifetime.

28
New cards

Constants

are data objects with a name that is permanently bound to a value for its lifetime.

29
New cards

Attributes

distinguish data objects of a given type. Basic attributes of any data object, such as type and name, are invariant during its lifetime. These are stored in a descriptor and used during the program execution. These are used only to determine the storage representation and not used explicitly during execution.

30
New cards

Values

The type of data object determines the set of possible values that it may have.

Usually, it is an ordered set.

31
New cards

Operations

The set of operations defined by a language is basically refers to how data object of that type may be manipulated.

32
New cards

primitive data types

Data types that are not defined in terms of other types are called —————. They are used, along with one or more type constructors, to provide the structured types.

33
New cards

Integer

Data type whose value typically ranges from -32,768 to 32,767 for 16-bit machines and -2 billion to 2 billion for 32-bit machines.

34
New cards

Floating-point

It represents real numbers but they are simply approximations of their true value.

Its value typically ranges from 3.5 x 10-38 to 3.4 x 10+38

35
New cards

Fixed-Point Real Numbers

The decimal stores a fixed number of decimal digits with the decimal point located at a fixed position in the value.

36
New cards

Boolean Data Types

Most languages have a Boolean type that can hold two values, true or false, which can be manipulated by logical operations.

37
New cards

Character Data Types

The character type usually used for input and output operation. Characters consist of a single character that may be alphabetic or numeric in nature or may simply be a special character. They are stored in the computer as numeric coding, which uses the values 0...127 to represent 128 characters.

38
New cards

Ordinal Types

An Ordinal type is one in which the range of possible values can be easily associated with the set of positive integers.

39
New cards

Enumeration type

type defines ordered set of values enumerating the identifiers that

denote these values. Their ordering follows the sequence in which identifiers are ————

40
New cards

array

is identified by its position relative to the first element. Typically, one of most

common data structures encountered by computer programming students,

41
New cards

static array

They are defined to be those arrays in which the subscript

value ranges are statically bound and whose storage allocation is ——

42
New cards

Array Operations

is defined to be any operation that manipulates the array as a

unit, in one way or the other.

43
New cards

Record Types

It is often the case that an object or entity is described by more than one attribute. An example would be a name, birthday, gender, address, etc.

44
New cards

Unions

are similar to records in the sense that they are aggregates of different objects.

45
New cards

Set Types

A ——- is one whose variables can store unordered collections of distinct values from some ordinal type called its base type.

46
New cards

pointer

is defined to be that particular data type whose variables can have a range of values consisting of memory addresses and a special value known in the programming as nil. Pointers provide some of the power of indirect addressing, heavily used in assembly language programming.

47
New cards

garbage collection

is a method performed by language systems in order to automatically reclaim garbage. It removes the need to deallocate memory explicitly from the programmer while at the same time automatically restoring garbage for further use.

48
New cards

name

is a sequence of characters used primarily to identify some entity in a

program – a variable, an identifier, a parameter, or a label.

49
New cards

Special Words

in programming languages are used to make programs more readable by naming actions to be performed. Moreover, they are used to separate the syntactic entities of programs.

50
New cards

Keywords

are words in a particular programming language that is special only in certain context.

51
New cards

Reserved words

are special words in a particular programming language that cannot be used as names and/or identifiers

52
New cards

variable

It can be declared at the start of any block of code, but most are found at the start of each functions. is an abstraction of one particular memory location or a group of memory cells inside a computer or a system. It provides a means for storing data values associated with a domain of allowable values.

53
New cards

binding

is an association, such as between an attribute and an entity or between an operation and a symbol. Binding refers to the process of attributing a particular object to a physical symbol.

54
New cards

Named constant

is a variable that are bound to a value at the time it is bound to storage. The values of ————- do not change and cannot be changed

55
New cards

expression

is a syntactic entity in a programming language that may be evaluated to determine its value. It is a combination of one or more constants,

56
New cards

Type conversion

play a vital role in programming for they allow programming to be more flexible and less rigid.

57
New cards

Coercion

is an implicit type conversion that is initiated by the compiler. ———- is used when the two operands of an operator are not of the same type and that is legal in the language.

58
New cards

statement

is an instruction for the computer program to perform an action. A programming ———- can consist of key words, operators, punctuation, and other allowable programming elements, arranged in the proper sequence to perform an operation.

59
New cards

Syntax

is the set of rules about how to use a particular programming language.

60
New cards

control statement

is defined to be a particular language’s statement constructs, which control and modify the flow of program execution.

61
New cards

compound statement

is a collection of statement that can be abstracted to a single statement.

62
New cards

control structure

a control statement and the statements whose execution it controls. It is a block of code that analyzes variables and decides where to take the program.

63
New cards

Selection Statement

provides the means of choosing between two or more execution paths in a program.

64
New cards

Iterative Statements

Sometimes

simply called a loop, it provides a mean ———- (Loops) – repeat a statement or block of statements in a number of times or while a condition is fulfilled s for repeating a particular section in the program.

65
New cards

unconditional branching

also called jump or start, transfers control to a specified place in the program.

66
New cards

Exception Handling

is the special processing that may be required when an exception is detected

67
New cards

SubProgram

is either a procedure or a function. A ————- is written ——- declaration, which specifies its name, formal parameters, and (for a function) its result; and a ———- body which specifies the sequence of actions.

68
New cards

recursive subprogram

is one that calls itself, either directly or by invoking some other subprogram that calls it.

69
New cards

overloaded subprogram

is one that has the same name as another subprogram in the same referencing environment.

70
New cards

Parameter-Passing

refers to the activity of transmitting an argument to and/or rom the corresponding parameter of a subprogram.

71
New cards

abstraction

a view or representation of an entity that includes only the attributes of significance in a particular context.

72
New cards

Information hiding

is the purposeful omission of details in the development of an abstract representation,

73
New cards

Control Abstraction

means hiding the implementation details. It is association of a name with a program fragment that performs an operation,

74
New cards

Data Abstraction

means hiding the details about the data. It is the process by which a particular data structure is views as representing an abstraction.

75
New cards

Encapsulation

is a mechanism to wrap up variables(data) and methods(code) together as a single unit. It is the process of hiding information details and protecting data and behavior of the object.

76
New cards

Getters

also known as Accessors are member function that get the values of fields.

77
New cards

Setters

also known as Mutators are method that modify the value of a field.

78
New cards

Constructors

are member function that perform any necessary initialization when an object is first created. Its name is always the same as the class name.

79
New cards

Destructors

are member function to clean up after an instance is destroyed; usually just to reclaim the heap storage.

80
New cards

Object-oriented programming

is a programming approach based on objects and classes.

81
New cards

is the ability of different functions to be invoked with the same names.

82
New cards

Static polymorphism

is the common case of overriding a function by providing additional definitions with different numbers or types of parameters. The compiler matches the parameter list to the appropriate function.

83
New cards

Dynamic polymorphism

relies on parent classes to define virtual functions which child classes may redefine.

84
New cards

Concurrent Programming,

also called Parallel Programming, is a computer programming technique that provides for the execution of operations concurrently, either with a single computer or across a number of systems.

85
New cards

Functional Programming

It is a way of writing a program that describes only the operations to be performed on the inputs to the program.

86
New cards

Variable

is an object used to represent data that can be changed while the program or procedure is running.

87
New cards

Compound

is an element that includes a functor and an ordered list of parameters

or tuples.

88
New cards

Functors

are similar to function identifiers where it identifies the relation it represents.

Explore top notes

note
Science - Chapter 8
Updated 1058d ago
0.0(0)
note
Risk / Riesgo (IT)
Updated 1245d ago
0.0(0)
note
Chemistry Chapter 3
Updated 426d ago
0.0(0)
note
B1
Updated 1268d ago
0.0(0)
note
Body Disorders
Updated 1154d ago
0.0(0)
note
Conformity
Updated 1037d ago
0.0(0)
note
Impacts of Urbanization
Updated 1164d ago
0.0(0)
note
Science - Chapter 8
Updated 1058d ago
0.0(0)
note
Risk / Riesgo (IT)
Updated 1245d ago
0.0(0)
note
Chemistry Chapter 3
Updated 426d ago
0.0(0)
note
B1
Updated 1268d ago
0.0(0)
note
Body Disorders
Updated 1154d ago
0.0(0)
note
Conformity
Updated 1037d ago
0.0(0)
note
Impacts of Urbanization
Updated 1164d ago
0.0(0)

Explore top flashcards

flashcards
Camping Vocab
44
Updated 564d ago
0.0(0)
flashcards
Chemistry Unit 8 Ions
56
Updated 1117d ago
0.0(0)
flashcards
APUSH Vocab Quiz
30
Updated 1098d ago
0.0(0)
flashcards
Russia - APCG
47
Updated 1234d ago
0.0(0)
flashcards
Bio evolution test
41
Updated 12d ago
0.0(0)
flashcards
Genetics E1- Medical Pedigree
34
Updated 286d ago
0.0(0)
flashcards
Camping Vocab
44
Updated 564d ago
0.0(0)
flashcards
Chemistry Unit 8 Ions
56
Updated 1117d ago
0.0(0)
flashcards
APUSH Vocab Quiz
30
Updated 1098d ago
0.0(0)
flashcards
Russia - APCG
47
Updated 1234d ago
0.0(0)
flashcards
Bio evolution test
41
Updated 12d ago
0.0(0)
flashcards
Genetics E1- Medical Pedigree
34
Updated 286d ago
0.0(0)