 |
 |
 |
- Bits & bytes:
How the simple binary digit adds up to larger units of storage.
- Computer architecture:
An overview of the basic components and interactions found in all computers.
- Machine language:
An explanation of registers and how they're used by the core instructions.
- Operating systems:
A look at the low-level software that interfaces to peripherals, schedules tasks, allocates storage, and presents a default user interface.
- File organization:
An explanation of file allocation tables, directory structures, file attributes, and file naming.
- Memory management:
An overview of how operating systems and applications allocate, use, cache, and recycle the computer's memory.
- Input/output:
A look at peripheral devices for inputting and outputting data, and at I/O control systems and techniques.
- Interrupts:
How the computer manages different input/output tasks and handles their requests to interrupt an operation in progress.
- Virtual machines:
Using isolated memory to simulate dedicated computers or perform specialized functions.
- Real-time processing:
A look at how computers are used to process outside data or handle real-world events continuously as they occur.
- Data types:
A look at data with predefined characteristics, including integers, floating point numbers, characters, strings, pointers, and Booleans.
- Character strings:
An explanation of how alphanumeric characters are stored as strings, and the techniques for comparing, combining, and breaking them apart into smaller units.
- Arrays:
How a group of numbers can be stored in a matrix of varying dimensions under a single variable name and accessed using a pointer or index.
- Variables and Constants:
A look at how blocks of data are used to store and manipulate variable data values, and are represented symbolically within a computer program.
- Expressions:
An explanation of programming methods used to directly assign values to variables, and how algebraic operations are performed using variable names.
- Numeric methods and functions:
An examination of various mathematical techniques and how they are applied in computing to find results or transform data.
- Boolean Operators:
An overview of Boolean math, including TRUE/FALSE values, AND/OR operations, and their use in computing.
- Procedural programming:
An introduction to elementary program structure and flow, and the use of subroutine calls, branches, and parameters.
- Conditional statements: IF/ELSE:
A look at logic tests and how they can be used to form powerful branches in the flow of computer programs.
- DO WHILE and other loops:
How parts of computer programs can be set up to repeat themselves, how the looping is controlled, and the application of this coding technique.
- List processing:
An overview of how data can be chained into lists, and the techniques for inserting/adding data and creating sub lists.
- Stacks:
A look at the alternative stack data structure, and related processing techniques including LIFO, push, pop, dup, and swap.
- Queues:
An overview of how the system handles multiple demands for resources, and other related programming principles such as FIFO, interrupts, and parallel processes.
- Algorithms:
An overview of how a set of program instructions or procedures can be used to solve a problem in a finite number of steps.
- Sorts:
A look at the basic computing techniques for arranging data into a specific order.
- Recursion:
An examination of how a function or subroutine can call a simpler version of itself to arrive at a desired solution.
| Broadcasters: Interested in airing Micromoments? Click here |
|
|
|
|
|
|
 |
|
|
