0% found this document useful (0 votes)
3 views

1.1.8 Programming Terminologies

Programming terminologies encompass specific terms used in computer programming, including concepts related to languages, data structures, algorithms, and methodologies. Examples include terms like Algorithm, API, Debugging, and Object-oriented programming. The document also provides definitions for key terms such as Class, Compiler, and Recursion.

Uploaded by

sbappau10
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
3 views

1.1.8 Programming Terminologies

Programming terminologies encompass specific terms used in computer programming, including concepts related to languages, data structures, algorithms, and methodologies. Examples include terms like Algorithm, API, Debugging, and Object-oriented programming. The document also provides definitions for key terms such as Class, Compiler, and Recursion.

Uploaded by

sbappau10
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

PROGRAMMING TERMINOLOGIES

Programming terminologies refer to the specific words and phrases used in the field of
computer programming.
These can include terms related to programming languages, coding concepts, data structures,
algorithms, and software development methodologies.
Examples of programming terminologies include:
 Algorithm  Debugging  Iteration
 API (Application  Declaration  Library
Programming
Interface)  Encryption  Loop

 Array  Exception handling  Method

 Boolean  File  Object

 Bytecode  Flowchart  Object-oriented


programming
 Class  For loop
 Operating system
 Compiler  Function
 Parameter
 Conditional  Garbage collection
statement  Pointer
 If-else statement
 Console  Recursion
 Inheritance
 Control flow  Syntax
 Input/Output (I/O)
 Database  Variable
 Interface
 While loop  Global variable  Polymorphism
 Abstraction  Identifier  Program
 Boolean expression  Keyword  Programming
language
 Compression  Library function
 Recursion
 Constant  Local variable
 Scope
 Control structure  Loop control
variable  Statement
 Data type
 Memory  Syntax error
 Debugger
 Object-relational  Type casting
 Exception mapping (ORM)
 Unary operator
 Formatting  Open source
 Function call  Overloading

DEFINITIONS:
 Algorithm: a set of steps or instructions used to solve a problem or accomplish a task.
 API (Application Programming Interface): a set of protocols, routines, and tools for
building software and applications.
 Array: a collection of data items, all of the same type, stored in contiguous memory
locations.
 Boolean: a data type that can have one of two values, true or false.
 Bytecode: a set of instructions that can be executed by a virtual machine or interpreter.
 Class: a template or blueprint for creating objects (a particular data structure), providing
initial values for state (member variables or attributes), and implementations of
behavior (member functions or methods).
 Compiler: a software tool that converts source code written in a programming language
into machine code.
 Conditional statement: a statement that controls the flow of execution of a program
based on a certain condition.
 Console: a command-line interface for inputting and outputting text.
 Control flow: the order in which the statements of a program are executed.
 Database: a structured collection of data stored electronically.
 Debugging: the process of identifying and fixing errors in a program.
 Declaration: the process of creating a variable or constant, giving it a name and a data
type.
 Encryption: the process of converting plain text into a coded form to prevent
unauthorized access.
 Exception handling: the process of dealing with exceptional circumstances that arise in
a program.
 File: a collection of data stored on a disk or other storage device.
 Flowchart: a diagram that shows the steps of a process or program.
 For loop: a control structure that allows a program to repeat a set of instructions a
specific number of times.
 Function: a block of code that performs a specific task and can be reused in a program.
 Garbage collection: the process of automatically freeing memory that is no longer being
used by a program.
 If-else statement: a control structure that allows a program to make a decision based on
a certain condition.
 Inheritance: a mechanism that allows one class to inherit properties and methods from
another class.
 Input/Output (I/O): the process of reading data from or writing data to an external
device.
 Interface: a description of the methods and properties of an object.
 Iteration: the process of repeating a set of instructions a specified number of times or
until a certain condition is met.
 Library: a collection of pre-written code that can be used in a program.
 Loop: a control structure that allows a program to repeat a set of instructions until a
certain condition is met.
 Method: a function that is associated with an object and can be used to manipulate the
object's properties.
 Object: an instance of a class that can have properties and methods.
 Object-oriented programming: a programming paradigm that is based on the concept
of objects, which have properties and methods.
 Operating system: the software that controls the basic operations of a computer.
 Parameter: a value passed to a function or method when it is called.
 Pointer: a variable that stores the memory address of another variable.
 Recursion: a technique where a function calls itself to solve a problem.
 Syntax: the set of rules that govern the structure of a programming language. It defines
how the language's elements are put together, such as how statements are written, how
keywords are used, and how expressions are formed.
 Variable: a container for storing a value that can change during the execution of a
program.
 While loop: a control structure that allows a program to repeat a set of instructions
while a certain condition is true.
 Abstraction: the process of hiding the implementation details of an object or system and
exposing only the necessary information to the user.
 Boolean expression: an expression that evaluates to either true or false.
 Compression: the process of reducing the size of data to save storage space or reduce
transmission time.
 Constant: a value that cannot be changed during the execution of a program.
 Control structure: a programming construct that controls the flow of execution in a
program.
 Data type: a category of data that defines the type of value that a variable can hold.
 Debugger: a tool that helps to find and fix errors in a program.
 Exception: an abnormal event that occurs during the execution of a program and
disrupts the normal flow of control.
 Formatting: the process of arranging data in a specific way, such as by adding spaces,
tabs, or line breaks.
 Function call: the act of executing a function or method.
 Global variable: a variable that is accessible from any part of a program.
 Identifier: a name given to a variable, function, or other programming construct.
 Keyword: a word that has a special meaning in a programming language and cannot be
used as an identifier.
 Library function: a pre-written function that is included in a library and can be used in a
program.
 Local variable: a variable that is only accessible within the scope in which it is defined.
 Loop control variable: a variable that is used to control the execution of a loop.
 Memory: the physical storage space in a computer where data and programs are stored.
 Object-relational mapping (ORM): a technique for converting data between an object-
oriented model and a relational database model.
 Open source: a type of software that can be freely modified and distributed.
 Overloading: the ability to use the same function or operator name for multiple
operations with different parameters.
 Polymorphism: the ability of an object or function to take on multiple forms.
 Program: a set of instructions that a computer can execute to perform a specific task.
 Programming language: a set of rules and symbols that can be used to create
instructions that a computer can understand.
 Recursion: a technique where a function calls itself to solve a problem.
 Scope: the region of a program in which a variable or function can be accessed.
 Statement: a test that evaluates to either true or false.
 Syntax error: an error in the structure of a program's source code that prevents it from
being compiled or executed.
 Type casting: the process of converting a value from one data type to another.
 Unary operator: an operator that performs an operation on a single operand.

You might also like