Tuesday, December 18, 2018
Sorting and Searching
A Sorting Algorithm is used to rearrange a given array or list elements according to a comparison operator on the elements. The comparison operator is used to decide the new order of elements in the respective data structure.
Searching Algorithms are designed to check for an element or retrieve an element from any data structure where it is stored.
Saturday, December 15, 2018
File Processing
File
File is a collection of notes.
Files can be opened and manipulated using the following steps:
Declaration of file :
File is a collection of notes.
Files can be opened and manipulated using the following steps:
Declaration of file :
Structure, Union and Memory Allocation
Structure is a collection of various types of data in which can contain a variable or array, structure capacity is the sum of all variables and arrays defined.
Union is the same thing as the structure starting from the application, assign it, and also the declarations, the difference is that Union only uses the capacity of the largest variable of the union.
Memory Allocation is a function that takes memory from RAM to be used in the program.
Memory De-Allocation is a function to restore memory from a program back to RAM.
There are two basic types of memory allocation: When you declare a variable or an instance of a structure or class.
Union is the same thing as the structure starting from the application, assign it, and also the declarations, the difference is that Union only uses the capacity of the largest variable of the union.
Memory Allocation is a function that takes memory from RAM to be used in the program.
Memory De-Allocation is a function to restore memory from a program back to RAM.
There are two basic types of memory allocation: When you declare a variable or an instance of a structure or class.
Function and Recursion
Function is a module that has various kinds of commands in it, we can call the function if and only if the function is above the caller function.
Recursion is the application of a function that calls itself, is like a loop (while) but its work is heavier than looping, based on the base case and best case.
Recursion is the application of a function that calls itself, is like a loop (while) but its work is heavier than looping, based on the base case and best case.
Cloud Computing Services
Cloud Computing Services
Cloud is an IT system that is in one place (do not know where it is), which can be accessed by anyone connected to the internet
Cloud Computing leads to configuration and access to applications and to separate infrastructure categories from business
Cloud is an IT system that is in one place (do not know where it is), which can be accessed by anyone connected to the internet
Cloud Computing leads to configuration and access to applications and to separate infrastructure categories from business
Monday, October 29, 2018
Selection
What is selection?
In an algorithmic implementation, an instruction or block of instructions may be executed (or
not) with certain predetermined conditions.
Operator, Operand, and Arithmetic
What are Operator and Operand?
An operator is a symbol to process the values in the result of a new value
An operand is a part that specifies which data should be manipulated or exploited
An operator is a symbol to process the values in the result of a new value
An operand is a part that specifies which data should be manipulated or exploited
Formatted Input and Output
Functions
The standard library functions are predefined functions provided by the C compiler. Using them, specify the header files indicating where to find these functions (include directive)
The function defined by the programmer or the user-defined function are functions created by the programmer / developer for use in a program.
The standard library functions are predefined functions provided by the C compiler. Using them, specify the header files indicating where to find these functions (include directive)
The function defined by the programmer or the user-defined function are functions created by the programmer / developer for use in a program.
Introduction to C Progamming
What is Algorithm?
An algorithm is a procedure to solve a problem in terms of actions to execute and the order of execution of these actions.
An algorithm is a procedure to solve a problem in terms of actions to execute and the order of execution of these actions.
Pointer and Array
What is the pointer?
A pointer is a value that designates the address (that is, the location in memory) of a certain value. Pointers are variables that contain a memory location. Pointers can reference any type of data, including functions.
A pointer is a value that designates the address (that is, the location in memory) of a certain value. Pointers are variables that contain a memory location. Pointers can reference any type of data, including functions.
Repetition
What is repetition?
Repetition means repeating the sequence of instructions several times, or until certain results are achieved. In programming terms, this means loops of all types, such as repetitive, for, while, etc.
Repetition means repeating the sequence of instructions several times, or until certain results are achieved. In programming terms, this means loops of all types, such as repetitive, for, while, etc.
Subscribe to:
Comments (Atom)