Мы поможем в написании ваших работ!
ЗНАЕТЕ ЛИ ВЫ?
|
Recursive transition network
Содержание книги
- Erasable programmable read-only memory
- Extended-precision arithmetic
- Floating-point representation
- Graphics pad , graphics table
- Hierarchical direct-access method
- Immediate constituent grammar
- Incremental garbage collection
- Information management system
- In-line subroutine expansion
- Installation and checkout phase
- Interface module, interface specification
- Internetting, internetworking
- IOC see input/output controller
- Job definition, job description
- Keyed sequential-access method
- Least frequently used removal
- Longitudinal redundancy check
- Machine-independent language
- Management information system
- Memory-to-memory instruction
- Multiple declaration, multiple definition
- Natural language front-end, natural language interface
- Non von Neumann architecture
- Object-oriented architecture
- On-the-fly garbage collection
- Optical character recognition
- Original equipment manufacturer
- Parameter passing by reference
- Prediction-correction method
- Procedure-oriented programming
- Programmable read-only memory
- Queued indexed sequential-access method
- Recursive transition network
- Register-to-register instruction
- Representation specification
- Routine directory, routine table
- Sensor-based computer, sensor-based system
- Single-key command, single-keystroke command
- Software development environment
- Storage-to-register instruction
- Switched circuit, switched line
- Terminal transactions system
- Three-plus-one address instruction
- Trace program, trace routine
- Tree traversal, tree walking
- Unconditional branch, unconditional jump
- Unique identifier, unique name
- Virtual storage access method
- Warning, warning diagnostics
- WYSIWYG (What You See Is What You Get)
ðåêóðñèâíàÿ ñåòü ïåðåõîäîâ
Redirection
ïåðåíàçíà÷åíèå (ââîäà-âûâîäà)
Reduction machine
ðåäóêöèîííàÿ ìàøèíà
Redundancy check
êîíòðîëü çà ñ÷¸ò èçáûòî÷íîñòè
Reentry point
òî÷êà ïîâòîðíîãî âõîäà
Reference
1. óêàçàòåëü, ññûëêà 2. ññûëêà (èñïîëüçîâàíèå â îïèñàíèè îäíîãî îáúåêòà èìåíè äðóãîãî îáúåêòà)
Reference manual
ñïðàâî÷íèê, ñïðàâî÷íîå îïèñàíèå; ñïðàâî÷íîå ðóêîâîäñòâî
Reference table
òàáëèöà ññûëîê
Refresh
ðåãåíåðàöèÿ (1. âîñïðîèçâåäåíèå èçîáðàæåíèÿ íà ýêðàíå äèñïëåÿ 2. ñ÷èòûâàíèå è ïåðåçàïèñü äàííûõ â äèíàìè÷åñêîì çàïîìèíàþùåì óñòðîéñòâå)
Refresh buffer
áóôåð èçîáðàæåíèÿ
Refresh RAM
âèäåîïàìÿòü, ïàìÿòü èçîáðàæåíèÿ
Refresh rate
÷àñòîòà ðåãåíåðàöèè
Refutation
ïðîòèâîðå÷èå, íåóñïåõ (ïðè ïåðåáîðå ñ âîçâðàòàìè)
Register allocation
ðàñïðåäåëåíèå [íàçíà÷åíèå] ðåãèñòðîâ
Register capacity
ðàçðÿäíîñòü ðåãèñòðà
Register file
ìàññèâ ðåãèñòðîâ
|
