Professional Documents
Culture Documents
القاموس التقني المعلوماتي انجليزي عربي
القاموس التقني المعلوماتي انجليزي عربي
القاموس التقني المعلوماتي انجليزي عربي
GAÓñʪÖÏ @ ú
æ ® JË@ ñÓA
®Ë@
Q
ú
G. Q« ø
Êm. @ '
English Arabic
Technical Computing Dictionary
èQm Ì '@ ©K PAÖ Ï @ IK QªK K Q¯
.
Version: 2.0.29-02-2008
February 29, 2008
ALSA, éÓY®JÖÏ @ éJ
KñË@ ºJJ
Ë éJ
K.
Approve, P@Q¯@
Alter, Q
J
ª K Approved, éJ
Ê« XAÓ
Alteration, Q
J
ª K Approximate, úæK
Q®K
. ñk
Alternating, úG ðAJ K Approximation algorithm, I . K
Q®K éJ
ÓPP@
.
Alternative, ÉK
YK. Arabisation,
Amount, éJ
Ò»
Arabization,
Amper, Q
J.Ó @ Arbitrary, ù®J
»
Amplify, Õæ
j Arc, ñ¯
Amplitude, éª
Architecture, éJ
K.
Analog, Q
¢
Archive, J
P
@
Analogue computer, úÎKAÖß H
ñAg Archive site, ù®J
P
@ ©¯ñÓ
.
@
Analysis, ÉJ
Êm' Archiving, é®P
Anchor, ¡. QÓ
Area, 鮢JÓ
Anchoring, ZAP@
Area grid, ékAÖÏ @ HAªK . QÓ
AND, ð
Arena, éJ.Êg
Angle, éK
ð@P Argument, ù¢ªÓ
Angle bracket, èPñºÓ
Arity, éJ
.KP
Animate, ½K
Qm'
Arrange, I
.
KQK
Animation, éºK
Qm' Arrangement, éJ.
KQK
Annotate, J
ʪK
Array, é¯ñ®Ó
Annotation, éJ
Ag
, J ʪK Arrow, ÑîD
Arrowhead, ÑîD
@P Audio, ùªÖÞ
Arrow key, ÑîDË@ hAJ®Ó Audiographic, ù¢J
¢m' ùªÖÞ
Audit, J
¯YK
Artificial intelligence, ú«AJ¢@ ZA¿X
Artificial neural network, éJ
«AJ¢@ éJ
.«
éºJ
. Authenticate,
Artwork, Authentication, AJJ
@
Authenticity, ém
Ascender, Y«A
Authentify, J
KñK
Ascending, ø Y«A
KQK Author, ËñÓ
Ascending order, ø Y«A I .
Authorization, l'
Qå
Ascii, ú¾ @
Authorize, J
kQ K
Aspect, Qê¢Ó
Aspect-oriented programming, é ê k. ñ Ó é m.× QK. Auto, úÍ @
®Ê K ÐAÖß@
QëA¢Ö Ï AK. Autocompletion, ùKA
Aspect ratio, QªË@
úÍ@ ¨A®KPB@ éJ. Autoconfiguration, úÍ @ ÉJ
º
m.×
Automata theory, ÉJ
ª Ë@ éJ
K@ YË@ HB
B@ éK Q¢
Assertion, YJ
»ñK Automated testing, úÍ @ PAJ.Jk@
JÒÖÏ @ Q
J
. éÊJ» É®K
Bit depth, IJ . Ë@ Ô« Boot block, ¨C¯@
éÊJ»
Bit gravity, IJ . Ë@ éJ
K. XAg Boot image, ¨C¯@
èPñ
Bitmap, éJ
KA
J K é£PA g . Booting, ¨C¯@
Bitmap display, ù¢®K Q«
Bootloader, ¨C¯@
ÉÒm×
Bitmap font, ù¢®K ¡k Bootrom, (¡®¯ èZðQ®Ó ¨C¯@
èQ»@ X) ¨C¯@
¯ X
Bit mask, IJ . Ë@
¨AJ ¯ Boot server, ¨C¯@
ÐXAg
Bit pattern, éJ
KA
J K éÊÊ
Ó
Bootstrap, QKñJ
J.ÒºË@ ÉJ
ª YJ
êÖß ÐA¢
Bit plane, éJ
KA
J K i¢Ó Bootstrap loader, ¨C¯@
ÉÒm×
Bit rate, IJ . Ë@ ÈYªÓ Boot virus, ¨C¯@
ðQK
A¯
Bit slice, HAJ
KA
J K ém
' Qå
Border, Yg
Bit string, HAJ
KA
J K éÊÊ Bottom, É® @
Bitwise, Bottom-unique,
Bitwise complement, Bounce, YKQK
Blank, ¨PA¯ , ¨@Q¯ Bounce message, H
ñKð éËAP
.
Blend, Bound, YJ
®Ó
Blending, h. QÓ Boundary scan, ø XðYg iÓ
Óð
CD-ROM,
Caption, ú«Q¯ à@
ñJ« , ékñË hQå
Cell, éJ
Êg
Capture, A®JË@ Cell encoding, AK
CmÌ '@ Q
ÓQK
Captured image, é¢ ®JÊÓ èPñ
Cellphone, ø ñÊg KAë
Card, é¯A¢.
Cellular, ø ñÊg
Card cage, HA
® ¯
¯A¢
ª JÓ
. Cellular automata, éK
ñÊg éJ
Ë @ HC
Cardinality, úæJ
KP
Cellular automaton, ø ñÊg úÍ @ ɪ JÓ
Cardinal number, úÎ @ XY«
Ì
Cellular multiprocessing, éK
ñÊg èXYªJÓ ém. 'AªÓ
éj
¯A¢
J¯ , Q»QÓ
Card slot, HA . Center, (ɪ¯) ¡J
ñK ,Pñm× , JJÓ ,¡ð
Caret, éªJ.¯ Ó
Centered, ¡ñ
Carriage return, úÍ@
©k. Q Ó , Q¢Ë@
×) Q¢Ë@ úÍ@
¨ñk. P Centimeter, QÒJ
J
( ¬Qm Central arbiter, ù£ñJJ
« ø Q»QÓ
Õºk
Carrier, ɯAK , ÉÓAg
JºÓ
Central office, ø Q»QÓ I .
Carrier scanner, ÉÓ@ñk ém
AÓ
Ï @ ém Ì 'AªÖÏ @ èYgð
Central processing unit, éK
Q»QÖ .
Centum call second, ÈA@ éJ
KA K éJÓ Checkbox, Q
AK éKA g
Cepstrum, Ðð Q
. Checkbox menu, Q
AK ©K. QÓ H@ P AJ
k éÖ ß
A¯
Certificate, èXAîD
Checkered,
Certify, XAîD
@
Checkout,
Chad, HA J¯
Checkpoint, ®jJË@ 颮K
Chad box, HA J¯ ðY J Checksum, ¨ñÒj.ÖÏ @ J
¯YK
Chain, YJ
¯ , éÊÊ Child, ø ñJK .
Change, Q
J
ª K Child directory, ø ñJK . ÉJ
ËX
Change management, Q
J
ª JË@ èP@X@
Child process, éK
ñJK . éJ
ÊÔ«
Changeover, Q
J
ª JÊË X@YªJ@
Child record, éK
ñJK . éÊJ
j.
Channel, èAJ ¯
Child status, éK
ñJK . éËAg
Channel service unit, éK
ñJ ¯ éJ
ÓYg èYgð
Child structure, éK
ñJK . éJ
K.
Chaos, @ ñ
Child version, éK
ñJK . éj
Chapter, ɯ
Child widget, ùK
ñJK . éêk. @ð QåJ«
Char, ¬Qm×
Child window, ú«Q¯ PA£@
é
¯A ¯P
¯A ¯P]
Character, ¬Qm× Chip, [ HA
J¯ ðY J
Character device, ú¯Qm× PAêk Chip box, HA
. Q
Character encoding, ¬Qk B@
ÓQK Chip set, l' @Qå
é«ñÒm.×
Character encoding scheme, ¬PAm× Q
ÓQK ¡¢m×
Chmod,
Character graphic, ú¯Qm× Õæ
P
Choice, PAJ
Jk@
Q
Characteristic function, è
ÜØ éË@X Choose, PAJ
Jk@
Character key, ú¯Qm× hAJ®Ó
Chooser,
Character map, ¬Qk B@ é¢
Qk Chroma,
Character repertoire, ¬PAm× XQåÓ
Chroma key,
Character set, ¬Qk @ é«ñÒm.× Chromatic number, úGñË XY«
Character set identifier, ¬PAm× Õ®£ ¬QªÓ
Chrome, ÐðQ» ,ú×ðQ»
Combine, á
K. J
Ë AK Complete, ÐAK
Combo box, XQå
ð QK
Qm' ©K. QÓ
Complete graph, éÊÓA¿ é¢J
¢m'
Combobox, I
Complete inference system, ÉÓA¿ AJ.J @ ÐA¢
. »QÓ ©K. QÓ
Comma, éÊA¯ Complete lattice,
Command, QÓ @ Complete metric space, ÉÓA¿ ø QÓ ZA ¯
JÓ
Comment out, J
ʪK éË@P@
Component, à ñºÓ
éÓC« èPAÔ«
Component architecture, éJ
K ñºÓ
Commercial a, YJ«
Component based development, úΫ á .Ó QK
ñ¢
Commit, ¨Xð @ , I . ºKP@
Ï@
KñºÖ
Common, ©KA
HA
Compose, I
Common carrier, ø XAJ
J«@ ÉÓAg . J
»QK
Composite, éJ.»Q Ó é«ñÒm.×
Common factor, ¼QÓ ÉÓA«
Common properties, éÓA« Ak
Composite drive,
Composition, I
Communication, É@ñK . J
»QK
@ Compound key, I . »QÓ hAJ®Ó
Communications, HBA
Communications port, HBA @ Y ® JÓ Compress, ¡ª
@ l×. @QK. Compressed, ñª Ó
Communications software, HBA éJ KQÓ
Compressed video, é£ñª Ó
Communication system, ÈA@ ÐA¢
Compact, l×. YÓ
Compressibilty factor, Aª B
@ ÉÓA«
Compression, ¡ª
Compact disc, l×. YÓ Q¯
Compaction, ¡ª Computability theory, I .
m' éK
Q¢
Computable, I
Compactness preserving, ÐA ¡ ®k .
jJÊË ÉK. A¯
Company, é»QåË@ Computational complexity,
®Ó
Compare, éKPA
Computational geometry,
Computational learning, Configuration item, ÉJ
º QåJ«
Computational molecular biology, A J
k. ñ Ëñ J
K. Configuration management,
éJ
K. ñAg éJ
K
Qk . Configuration programming, ÉJ
º ém.× QK.
ZAJÒJ»
Computational organochemistry, éK
ñ«
Configure, ¡J.
éJ
K. ñAg
Confirm, YJ
» AK
Compute, H . Ak
Confirmation, YJ
» AK
Computer, H . ñAg Conflation,
Computer cluster, úG ñAg Xñ®J«
. Conflict, ¯AJ K , H . PA
Computer cookie, H . ñAg øñÊg Congestion, àA ® Jk@
Computer ethics, H ñAg
HAJ g
@
¯C Q¯@
.
Conjunction, à@
Computer-generated imagery, Y Ëñ Ó QK
ñ Connect, ÈA@
H. ñAmÌ 'AK. Connected graph, ÉJÓ àAJ
J.Ó
Computer language, QKñJ
J.ÒºË@ éªË
JÓ
Connected subgraph, ÉJÓ ú«Q¯ àAJ
.
Computer law, H . ñAg àñKA¯
Connection, ÈA@
Computer literacy, H . ñAmÌ 'AK. ÐAÖÏ
@ Connectionless protocol, ÈA@ àðYK
. A ®J
Ó
Computer network, I . @ñk éºJ. Connection-oriented, ÈABAK. ék. ñÓ
Computer program, H
. ñAg l×. A
KQK. Connection-oriented network service, é ÓY g
Computer security, QKñJ
J.ÒºË@ áÓ @ ÈABAK. éê k. ñÓ éJ
ºJ.
Computer virus, úG ñAg ð Q
¯
@ ©Òm.×
. Connection pool, HBA
Computer vision, úG ñAg Qå.
Connective, úÍA@
,¡. @P
.
Compute server, H . Ak ÐXAg
Connectors, ¨AKñm. ¡. @P , ÉñÓ
Computing, éJ.ñk
. ñAg Conservative evaluation, ¡ ¯Am× Õæ
J
®K
Computron, àñK
Consistently complete,
Concatenate, ÕË
Console, Èññ»
Concatenated key, ÐñÒÊÓ hAJ®Ó
QÓ Consolidate, Õæ
«YK , YJ
£ñK
Concentrator, Q» . AK
Constant, IK
Conceptualisation, éÒê®Ó
Constant angular velocity, éJK. AK éK
ð@P é«Qå
Concrete class, èXYm× éJ
¯ . AK ù®J
J.¢ ɾ
Constant applicative form, IK
Concrete syntax, ø XAÓ ñm' . AK ù£
Constant folding, IK
Concurrency, áÓ@ Q K
Constant linear velocity, éJK. AK éJ
¢k é«Qå
Concurrent, áÓ@ Q Ó , ¯@ QÓ
ém Ì 'AªÓ Constant mapping,
Concurrent processing, é¯AJÓ
. Constraint, Qå¯ ,YJ
¯
Condense, J
JºK
. ñÓ , JºÓ Constraint functional programming, é m.× QK.
Condensed, Qk
éK
YJ
¯ éJ
®J
£ð
Condition, éËAg , Qå
Constraint satisfaction, XñJ
¯ ZAP@
Q® K
Condition out, Qå
©K Constructed type, úæJ . Ó ¨ñK
Conduit, øQm.× Constructive, ùKA
JK
.
JK
Cone, ðQm×
Constructive solid geometry, éJ
KA . éJ . Ê éY
Jë
Confidence test, é®K PAJ.Jk@
Constructor, úGAK.
Confidential, ø Qå
Consultant, PA Ó
Configuration, ÉJ
º Contact, É@QÓ
Contact (noun),
é¯QªÓ
Control unit, Õºm' èYgð
Contact (verb), ÈA@
Conventional memory, éJ
kC¢@ èQ»@ X
Container, éK
ðAg Converge, Y m
'
Container class, ¨ @ð J
Convergence, XA k@
Content, øñJm× Conversation, éKXAm×
Content addressable memory, øñJm× H@ X èQ»@ X Converse, ( ¢JÓ)
º« ,ÉK ñm'
ÉK A¯
Y®ÊË . Conversion, ÉK
ñm'
Content-based information retrieval, I. m
Conversion to iteration, P@QºJË@ úÍ@
ÉK
ñm'
øñJjÖÏ @ úΫ á.Ó HAÓñʪÓ
Convert, ÉK
ñm'
Contention slot, ¨ PA J K éÊêÓ
Converting, ÉK
ñm'
Context, AJ
Convex hull,
Context clash, AJ
PAª
K
Cooccurrence matrix,
Context-free, AJ
Ë@ á« É® JÓ
Cookie, øñÊg , 麪»
Context-free grammar, AJ
Ë@ á«
É® JÓ ñm' Cooperative, ú«AÔg.
Context object, AJ
á KA¿
Cooperative multitasking, úGðAªJË@ ÐAêÖÏ @ XYªK
Context operator, AJ
ÉÓA«
Coordinate, J
K
Context-sensitive, AJ
ËAK. QK AJÓ
Coordination language, J
K éªË
Context-sensitive menu, èQK A JÓ H@
P AJ k éÖ ß
A ¯
ËAK
Coprocessor, Y«AÓ lÌ. 'AªÓ
AJ
. Coproduct, úæKAg . h ñJJÓ
Context switch, AJ
ÉK
YJ.K
. .
P AJk éÖ ß
A¯ Copy, qK
Contextual menu, éJ
¯AJ
H@
Copy and paste, Ë @ð q@
Continuation, ÈA@ ,(È@ð X ém. QK.) éªK. AJÓ ,P@QÒJ@
×
Copying garbage collection,
( éË@X)
Continuation passing style, éªK. AJÓ QK
QÖß H
ñÊ
@ Copy left, ©J
Òj.ÊË qË@
. Copyleft, Qk Ë ñÖ
Ï @ ñ ®k
Continue, éªK. AJÓ
Copy (noun), q
Continuous, É@ñJÓ ,(¡k , éË@X) ÉJÓ ,QÒJÓ éK AÔg ,qË@ éK AÔg
Copy protection, qË@ áÓ
Continuous function, éÊJÓ éË@X
Copy right,
Continuous wave, éÊJÓ ék. ñÓ
Copyright, qË@ ñ®k
Contour, ¡J
m× ®m ×
Copyrighted, ñ®mÌ '@ ñ
Contraction, J
ʮK
Contract programmer, Y®« Im
' l×QÓ Copy (verb), éj
. . CORBA, AK. Pñ»
Contrast, áK
AJ.K
Contribution, éÒëAÓ
Core, I . Ë
Contributor, Ñë AÓ Core class, éJ
J£AK. éJ¯
Control, Õºm' Core dump, á£AJ . Ë@ ©K
Q® K
Core file, úæ£AK . ÊÓ
Control code, Õºm' QÓP
Cross-fade, Cyberspace,
Crossfade, Cyber-squatting,
Cross-fading, Hñ ® k
Cycle, èPðX
Cyclebabble, Data flow, HA
J.Ë@ ¯YK
KAJ
K. ¬Y
KAJ
Cycle crunch, Dataflow, HA K
K. ¬Y '
Cycle drought, Data flow analysis, HAKAJ K ÉJ
Êm
Cycle of reincarnation, t
AJ JË@ èPðX Data flow diagram, HAKAJ
J.Ë@ ¯YK ¡ m×
Cycle server,
¢ªÓ ©
Data fork, HAJ
Cyclic redundancy
check, á « ø PðX
J
¯Y
K Data frame, HAJ
¢ªÓ èY«A¯ PA£@
ZA¢k B@ Data glove, HA KAJ
K. PA ® ¯
Cyclic redundancy code, Datagramt,
Cyclomatic complexity, Data hierarchy, HA KAJ
J.Ë@ é J
ÓQë
Cylinder, éK@ ñ¢@
¢ªÖÏ @ áÓ úÍAg àñK
Dataless client, HAJ
Q. P ® JÓ
Dataless management utility, éJ
ËAg
K. YK éª
D
¢ªÖÏ @ áÓ
HAJ
Daemon, I
Data link layer, HAJ
¢ªÖÏ @ Éð é®J.£
. J
¯P
¢ªÖÏ @ Éð øñJÓ
Daisy chain, éJ
J.¯AªK éÊÊ Data link level, HAJ
Daisywheel printer, Data logger, HA KAJ
K. Éj. Ó
Damage, PQå Data logging,
¢ªÓ èY«A¯ ñ
Dangling pointer, úÍYÓ Qå
ñÓ Data mart, HAJ
Dash, é£Qå
Data mining, HA KAJ
J.Ë@ ÈCª J
@
Data, HA
K.
KAJ Data model, HAJ
¢ªÖÏ @ h. XñÖ ß
Data abstraction, HA
J.Ë@ YK
Qm.'
KAJ Data modeling, HAJ
¢ªÖÏ @ ék YÖ ß
.
Data acquisition, HAJ
¢ªÓ (ÈAjJ@) ÉJ
m'
Data modelling, HAJ
¢ªÖÏ @ ék. YÖß
Database, HA KAJ
K. èY«A¯ Data packet, HA KAJ
K. éÓ PP
Database administrator, HAJ
¢ªÓ èY«A¯ QK
YÓ Data path, HA KAJ
K. PAÓ
Database analyst, HAJ
¢ªÓ èY«A¯ ÉÊm× Data processing, HA KAJ
J.Ë@ ém .Ì 'AªÓ
Database machine, HAJ
¢ªÓ èY«A¯ éJºÓ Data rate, HA
J.Ë@ É® K ÈYªÓ
KAJ
KAJ
K. 骢 ¯
Database management system, èY«A¯ Q
K. YK ÐA¢ Data segment, HA
¢ªÖÏ @
HAJ Data service, HA KAJ
K. éÓY g
Database manager, HA
K.
KAJ èY«A¯ QK YÓ Data service unit, HA KAJ g èYgð
J.Ë@ éÓY
×
Database normalisation, Data set, HA
K. é«ñÒm
KAJ .
Database query language, Y«@ñ ¯ ÐCª J@ é ªË Data set organization, HA KAJ × Õæ¢ J K
J.Ë@ é«ñÒm.
HA
J.Ë@
KAJ Data striping,
Database server, HAJ
¢ªÓ èY«A¯ ÐXAg Data structure, HA
J.Ë@ éJ
K .
KAJ
Data bus, HA
J.Ë@ ɯA K
KAJ Data transfer bus, HAJ
¢ªÖÏ @ É® K øQåÓ
Datacenter manager, HA
J.Ë@ Q»QÓ
KAJ QK
YÓ Data transfer rate, HA KAJ
J.Ë@ É® K È YªÓ
Data channel, HA
J.Ë@ èAJ ¯
KAJ Data type, HA KAJ
J.Ë@ ¨ñK
Data communications analyst, HC@ ñ Ó ÉÊm× Datatype definition, HAJ
¢ªÖÏ @ ¨ñK K
QªK
HAJ
¢ªÖÏ @ KAJ
K. èYgð
Data unit, HA
Data compression, HA KAJ
K. ¡ª
¢ªÓ à Q m ×
Data warehouse, HAJ
Data dictionary, HA
K. ñÓA¯
KAJ
¢ªÖÏ @ à Q k
Data warehousing, HAJ
Data dictionary file, HA KAJ
K. ñÓA¯ ÊÓ
Ó Date, t'
PAK
Data driven, HA
J.Ë@ áÓ
KAJ A Datum, ù¢ªÓ
Daughter, éÊJ
Ê Deductive tableau, úk AJJ @
hñË
.
Daughterboard, éÊJ
Ê ékñË Deep, J
Ô«
Daughtercard, éÊJ
Ê é¯A¢. Deep magic,
Day, ÐñK
De facto standard, ùª¯@ð PAJ
ªÓ , úΪ¯ PAJ
ªÓ
ø PAîE
Ó
Default master,
.
Dead, IJ
Ó ,É£A« Default route,
Dead code, Defect, I . J
«
Deadlock, P AÓ , éÓP @
Defect analysis, ɪË@ ÉJ
Êm'
Deadly embrace, Defect density, ÉʪË@ é¯AJ»
Dealer, Qj.JÓ Deferral, ZAg. P@
Deamon, YJ
®J JË@ ð Q®Ë@ I
¯@ QÓ
Define, YK
Ym' , K
QªK
.
Death code, Definite clause,
Deb, Definite sentence,
Debianize, éJ
K. X Definition, K
QªK
Debug, iJ
®J K , ij
Definitional constraint programming,
JÓ
Debugger, i®JÓ Deflate, Òº
Debugging, ZA¢k B@ iJ
j Deflate compression, Òº JÓ ¡ª
Decay, È ðA Deforestation, éK. AªË@
éË@ P@ , éK AªË@
. HA JJk.
@
Dechunker, Defragment, éJ
¢ Ë@ éË@P@
¯ Z@Qk. @ , IJ
Decidability, Defunct process, àA
Ó Z@Qk.
@
Decidable, Degree, ék. PX
Decimal, ø Qå« Degrees, HAg . PX
Decimal point, ø Qå« ÉA¯ Degrees of freedom, éK
QmÌ '@ HAg . PX
J.JË@ ½¯ , I
J.JË@ éË@
P@
Decision problem, P@Q¯ éÊ¾Ó Deinstallation, I
Decision support, P@Q¯ Ñ«X
Deinterlace,
Decision support database, Ñ«X HA
K. èY«A ¯
KAJ Dejagging,
P@Q®Ë@ Ñ«X HAÓñʪÓ
èY«A¯ ,P@Q®Ë@
Delay, Q
g AK , éÊêÓ
Decision theory, P@Q®Ë@ éK
Q¢ Delayed control-transfer,
@
, ¨CK
Declaration, éJ
KC« Delay instruction,
.
Declarative language, éK
QK
Q®K éªË Delay slot,
, ZBX@
Declare, àC«@
Delegation, éK. AJ
K , éJªK.
Decode, Q
ÓQK ½¯
Delete, ¬ Yg
Decoder, Deleted, ¬ð Ym×
Decompress, ¡ª ½¯
Deletia,
Decorative, ú¯Qk P
' Deletion, ¬ Yg
Decrease, ÉJ
ʮK , J
®m' , J
®m Delimiter, Ym×
Decrypt, Q
® ½¯ Deliverable, ÕÎJ Ó
Decryption, Q
® ½¯
Delivery, Õæ
Ê
Dedicated line, Qº Ó ¡ k Delta, È@ X
¢ªÓ
Deductive database, éJ
k. AJJ @
HAJ
èY«A¯
Delta conversion,
Delta reduction, Deskside, I
èPðQåË
@ . JºÖÏ @ I.KAg. , èYJÖÏ @ I.KAg.
Demand, I . Ê¢Ö Ï @ , Desktop, I . JºÓ i¢
Demand driven, èPðQåÊK
A Ó Desktop background, I JºÖÏ @ i¢ éJ
®Ê g
új® . .
Demand paged, èPðQåË@ Desktop database, I
K. èY«A¯
KAJ
. JºÖÏ @ i¢ HA
Demand paging,
Desktop environment, I . JºÖÏ @ i¢ ¡J
m×
Demo, Q« Desktop manager,
Demodulate, Õæ
K QË@ »
, ÕæK QË@ ½ ¯
Digest, éCg Disable, ÉJ
¢ªK
Disassemble, ©Êg@
, ½¯
Digi-,
Disassembly, ©Êg , ½¯
Digit, Õ¯P
Disc, Q¯
Digital, ùÔ¯P
Discard, YJ. K
Digital audio, ùÔ¯P Hñ
Digital camera, éJ
Ô¯P QK
ñ éË @ , éJ
Ô¯P @Q
ÓA¿
Disc drive, Q¯ ñÓ
ZCg@
Digital carrier, ùÔ¯P ɯAK , ùÔ¯P ÉÓAg Disclaimer, éJ
Ëð ñÓ
Disconnect, ÈA@ ©¢¯
Digital certificate, éJ
Ô¯P èXAîD
Disconnected, ¨ñ¢®Ó ,½¾®Ó
,¨ñÊm ×
Digital computer, ùÔ¯P H
. ñAg
Discrete, ©¢®JÓ ,É®JÓ
Digital dashboard,
Digital electronics, éJ
Ô¯P HAJ
Kð QºË
@ Discrete cosine transform,
Digital image, éJ
Ô¯P èPñ
骢
Digitalize, Discrete preorder,
Discriminated union, ¡ ®JÓ XAm'
@
Digital logic, éJÔ ¯QË@ ¢JÓ
Digital service unit, éJ
Ô¯QË@ éÓYmÌ '@ èYgð
Discussion, P@ñk
Discussion group, ¯AJ K é«ñÒm.× ,ÈXAm.' é«ñÒm.×
Digital signature, ùÔ¯P ©J
¯ñK XAm' @
Disjoint union, É®ÖÏ @ ¨ñÊm× XAm'
@ ,É®JÓ
Digital versatile disc, ¨PAK. ùÔ¯P Q¯
Disk, Q¯
Digitize, éJÔ ¯P
Disk array, @Q¯ @ P
Digits, ÐA¯P@ ¯@ QÓ
Dimension, AJ
¯ , YªK.
Disk controller, Q®Ë@ I
.
Disk device group, Q®Ë@ è@X @ é«ñÒm.×
Dimensioning, XAªK. B@ I
J.K ð @ K
QªK
Dingbat, úæJ
K
QK ¬Qm × Disk drive, Q¯ ñÓ
J K AÖÞ
Disk duplexing, Q®Ë@ éJ
J K
Diode, ùKA
Q¯
Diskette, àQÓ
Diplex,
Diskfull client,
Z úÎÓ àñK
Q®Ë@ . P Dividend, ÑîDË@ l'. P , Ðñ®Ó
Diskless client,
. P , Q ¯ àðYK
ø
PA« àñK . àñK
. P
Division, éÒ¯
áÓ
Q®Ë@
Division by zero, Q® úΫ éÒ¯
Diskless workstation, Divisor, Õæ
A¯
Disk mirroring, Q®Ë@ éK
ð @QÓ
DMA, éK
A.ÓA.K
X
Disk operating system, Q®Ë@ áÓ
ÉJª ÐA¢
X
DNS, A. KA.K
Disk partition, Q®Ë@ áÓ Õæ¯ Docbook, J
KñJË@ H . AJ»
Disk path, Q¯ PAÓ
Dock, ZAP@
Disk striping, Docking station, I . J
»QK èY«A¯
Disman, Document, YJ Ó
Dismiss, XAªK.
@ , È Q« Documentation, J
KñK
Dispatch, XA®K
@
Documentor, K ñÓ
Display, Q« Dollar, PBðX
Display device, QªË@ PAêk . Do loop, P@QºJË@ é®Êg
Display Report, Domain, A¢
Display report, QK
Q®JË@ Q«@
ñJ« ,ÈAjÖÏ @ à@ ñJ«
Domain address, É®mÌ '@ à@
Display standard, Domain architecture, ÈAj.ÖÏ @ èPAÔ«
.
Display terminal, Q« ¬@ Q¢Ó Domain calculus,
. Ó , ékðQ£
Dissertation, IjJ @ Domain engineering, ÈAj.ÖÏ @ éYJë
Dissipation, X YJ.K Domain maturity, ÈAj.ÖÏ @ i.
Dissolve, éK. @ X@
Domain model,
Distance, é¯AÓ , ÉA¯ , PA¯
Domain name, ÈAj.ÖÏ @ Õæ
@
Distinct, Q
ÜØ Domain selection, ÈAj.ÖÏ @ PAJ
Jk @
Distort, Z@ñJË@ , èñ
Domain-specific language, XYm× ÈAm.× éªË
Distribute, ¨ Pð Domain theory, ÈAm.× éK
Q¢
Distributed, ¨ PñÓ
Dot, 颮K
HA
K. èY«A¯
KAJ J« ,ù¢® K à@ ñJ«
Distributed database, é«PñÓ Dot address, éJ
¢®K éKñ
Distributed file, ¨ PñÓ ÊÓ
Double-click, Ag. Xð QÓ
Dithering, à@ñË B@ HAJ.K Double density, ék. ðXQÓ
é¯A J»
Diverge, Double-duplex, h. ðXQÓ ø ñJ JÓ
Divergence, h. @Q®K@
, Y«AJ.K , @Q®K@
Double-ended queue, ð X , á
JK
AîE ð X PñK. A£
Divergent, úk @Q®K@
, ø Y«AJ.K á
JK
AîE
.
h ðXQÓ
Divide, éÒ¯ Double-precision, YË@ .
Double quote, ék. ðXQÓ
AJ.J¯@
éÓC«
Dual-partition, éÒJ
®Ë@ ù KA
JK
Doubly linked list, á
¯Q¢Ë@ áÓ
éËññÓ éÖ ß
A¯ Dual ported,
Down, Bð QK
Dual-stack, éYºË@ h. ðXQÓ
, éÓñºË@ h. ðXQÓ
Download, ÉK
QK
Dumb, èñJªÓ
Downloading, ÉK
QJË@ ø PAg.
Dumb Terminal, èñJªÓ ¬@Q¢Ó
@ úÍð Q K Q¯
@ , éJ
ÓX
Downstream, PAJ
JË@ úÍð Q K , H . AJ
B
Dummy, YÓAë ,úæ@
P
Downtime, J
¯ñJË@ áÓ Dump, h Q£
P
Down-time, ÉJ
ª Ë@ ¬A®K
@ áÓ
Duplex, h. ð XQÓ
Downward closed,
Duplicate..., ...pAJ@
Dpi, éñJ.Ë@ ú¯ 颮K Duplicate, PQºÓ
Draft, èXñÓ
Duration, Ð@ð X , è YÓ
Drag, I . m
Dword,
Drag-and-drop, Dyadic,
Drag and drop, HC ¯@
ð I.m
Dynamic, ú»Qk
Education, éJ
K. QK
E-mail address, úGð QºË@
YK
QK. à@ ñJ«
Q
Education contact, ú
¯ é Ê , ø
ñ K. QK É @Q Ó Email attachement, úGð ºË@ YK
QK. ¯QÓ
ø
ñK. QË@ ©JÒj.ÖÏ @ Embed, á
Ò
Edutainment, ø ñK. QK éJ
¯Q K Embeddable, PAÒ¢C
Ë ÉK A¯ ,QÒ¢ÊË ÉK A¯
Effect, Q
K AK ,QKñÓ Embedded, á ÒÓ
. .
Effective computable, Embedded system, PñÒ¢Ó ÐA¢
Effective number of bits, ÈAª®Ë@ IJ
Ë@ XY«
. Embedding, PAÒ¢@
,QÒ£
Effects, H@QKñÓ
Embosser, Ym.× ,Õæm.× , P Q.Ó
Efficiency, é«Am.' Emoticon, ék. ð
Eigenvalue, éJ
K@ X éÒJ
¯ , é¯ñ®ÖÏ (úG@ X) Q
ÜØ P Yg.
Emphasis,
Eigenvector, úG@ X IÓ
,Q ÜØ IÓ
Empty, ¨PA¯
Eigenvectort, Qj®JÂK Q ¢
@
Empty element tag,
Eight-bit clean, Emulate, èA¿Am×
Eight queens problem, Emulation, èA¿Am×
Eight queens puzzle, Emulator, ú»Am×
ªKñ KAÒ JË@ èY«A¯
Eighty-twenty rule, àðQå Enable, á
ºÖß
Eject, ¬ Y¯ @ Ø ,hñ®Ó
Enabled, áºÜ
El(alpha), Enabling, á
ºÖß ,i¯
Electronic, úGð QºË@ IK Qj
J«
Encapsulated Postscript, ʪÓ
QºËB@ èPAjJË@
Electronic commerce, éJ
Kð . Encapsulation, J
ʪ K
Electronic data interchange, HA KA J
K. ÈXA J. K Enclosure, ʪ Ó
QºË@
ú
Gð
Encode, Q
ÓQK ,Q ÓQK
Engage, Error correcting memory, A¢mÌ '@ éjjÓ èQ»@ X
Engine, ¼Qm× Error detection
and correction, ð ¬A »@
Engineering, éYJë
ZA¢k B@ iJ
j
Enhanced parallel port, YJÓ ø P@ ñJÓ
Y ® JÓ Error handling, A¢mÌ '@ ém.Ì 'AªÓ
Enhancement, á
m'
Error indicator, A¢k Qå
ñÓ
Enlarge, Q
J.ºK Error message, A¢k éËAP
Enlargement, Õæ
j , pA®JK@
Error recovery, A¢mÌ '@ YªK. iJ
j
Escape, ñÊmÌ '@
Enter, ÈñkX
Escape character, ñÊmÌ '@ ¬Qm×
Enterprise, YK
Yg. ¨ðQåÓ ( úΫ ÈAJ.¯@
)
Entertainment, éJ
¯QK
Escape sequence,
»
Entity, àAJ Escrow,
Entity-relationship diagram, Esim,
Entity-relationship model, Essential complexity, úæ
A @ YJ
®ªK
KA g
Extend, YK
YÖß
Exclusive OR, : éÒ¢ JÓË@ Extended,
Executable, ø YJ
®J K Extended memory, éªñÓ èQ»@ X
Executable content, ø YJ
®J K øñJm× Extended memory manager,
Executable file, ø YJ
®J K ÊÓ Extensible, YK
YÒJÊË ÉK. A¯
Execute, YJ
®J K Extensible database,
Execution, ÉJ
ª®K
Extension, X@YJÓ@
Executive, ø YJ
®J K Extensional,
PAJJk@
Exhaustive testing, ÉÓA PAJ.Jk@ , ÒªÓ
.
Extensional equality,
Exist, úk ,Xñk. ñÓ Extensionality,
First-order logic, ø ð @ ¢JÓ , I
PYË@
.
KQË@ úÍð @ ¢JÓ
Floating point underflow,
ék. Floating underflow,
Fit, I
. AJK
ù®¯@ñK Float (verb),
ñ®£
Fit-to-window, è Y¯AJÊË Flood, Q« @
Fix, hC@
Floor, K. A£ ,PðX
Fixed, iJ
ÊJË@ IK . AK , iJ
jJË@ IK . AK . JÓ
, I Floppy, àQÓ
Fixed disk, I . JÓ Q¯ Q¯
Floppy disk, àQÓ
Fixed Font, IK . AK ¡k Ï @ @Q¯ B@
×
Floppy disk drive, éKQÖ ¼Qm
Fixed point,
Floppy drive, àQÓ Q¯ ɪÓ
AK
Fixed-point, éÊA®Ë@ IK
àQÓ Q¯
. Floptical, ùKñ
Fixed point combinator,
Qk
. , ¯X
Flow, àAK
Fixed width, IK . AK Q«
Flow analysis, ¯YJË@ ÉJ
Êm'
Fixed-width, IK . AK Q«
Q k. ¡¢ m ×
Flow chart, àAK
Fixed width font, Q ªË@ . AK ¡k
IK
Flowchart, ¯YJË@ éÖß A¯
Fixpoint, Flow control, àAK
Qm.Ì '@ éJ . ¯@ QÓ , ¯YË@
éJ ¯@ QÓ
.
Flag, ÕΫ Flower key, ( ñJJ» AÒÊK. Ag) èXPñË@ hAJ®Ó
Flamage, Flow of control,
Flame, Flush,
Flame off, Fly page,
Flamewar, Flytrap,
Flaming,
Focus, èP ñK .
Flap, Focus group,
Flapping router, Fold,
Flash, K
QK. Fold case,
Flash memory,
Folder, YÊm.×
Flat, i¢Ó Follow-on bus,
Flat address space, Follow-up,
Flat color, Font, ¡k
Fontwork, ñ¢mÌ '@ ÉÒªÓ Forwards compatibility,
Foo, Forwards compatible,
Foobar,
,
AK
Foundation, éñÓ
Foreground, ékñÊË@ éJ
ÓAÓ @ ,Q¢ JÖ Ï @ éJ
ÓAÓ @ Fractal compression, ø Pñ» (Pñ) ¡ª
Freeware, èQmÌ '@ l×. @Q.Ë@
Forward chaining,
Forward compatibility, , úÎ J. ® J ÖÏ @ K. A ¢ J Ë@ Freeze, YJ
Òm.'
ú
ÎJ.® JÖÏ @ ÐAj.B
@
Frequency, QK@ñK , XXQK
Forward compatible, úÎ J. ® JÓ , ¯@ñ JË@ úÎ J. ® JÓ Frequency division multiple access,
ÐAj.B @
Frequency division multiplexing,
@
Forward delta, Frequently asked question, éK. ñk. @ ð éÊJ
Forward engineering, Friction feed,
Forwarding, Frobnicate,
Front-end, Future date testing,
Front end, éJ
ÓAÓ @ éK
AîE Fuzzy, ÑîD.Ó ,úG AJ.
.
Front-end processor, ÈACË ¡J
ð lÌ. 'AªÓ Fuzzy computing, éÓA « éJ.ñk
Front side bus,
Fuzzy logic, úG AJ. ¢JÓ
.
Frotzed, Fuzzy subset, éÓA « ú
«Q¯ èQÓP
Fry, Fuzzy translation, (úæªÖ «
Ï @) éÓA YJÊQ K
FTP, ¨ è X Fuzzy variable,
Fudge factor,
Full, ÉÓA¿ G
Full-custom, Gadget,
Full-duplex, Gallery, QªÓ
Full-duplex Switched Ethernet, Game, éJ.ªË
Full-motion video, é»QmÌ '@ ÉÓA¿ ùKQÓ Game tree,
Functional programming, éJ
®J
£ð ém. QK.
Generate, YJ
ËñK
Functional programming language, ém.× QK. é ªË
Generation, ÉJ
k. ,YJ
ËñK
éJ
®J
£ð
Functional requirements, Ðð QË C ¢ JÓ
, éJ
®J
£ð Generator, YË ñÓ
éJ
®J
£ð Generic, ÐA«
é®@ ñÓ Generic identifier, Õæ
Ô« ¬QªÓ
Functional specification, éJ
®J
£ð
PAJJk@ Genericity, éJ
ÓñÔ«
Functional testing, ù®J
£ð
Functional unit, éJ
®J
£ð
èYgð.
Generic markup,
J J¢
Generic programming, é
J k. ém.× QK.
Function application, é®J
£ð
.
Generic resource, Õæ
Ô« XPñÓ
Function call, é®J
£ð ZA«YJ@
hAJ®Ó Generic thunk,
Function key, é®J
£ð ÕæÔ« ù ª JÓ
Generic type variable, ¨ñJË@
Functor,
ñk
K
@ Genetic algorithm, éJ
K@P ð éJ
ÓPP@
Furniture, HA
Genetic programming file, úG@P ð ém.× QK. ÊÓ
Fusion, PAîD @ , é«AÓ@
, éËA@
, éK. @ X@
Genre,
Geographical, ú¯@Qªk
Grammatical inference,
.
J.Ó
Geometric, úæ
YJë Graph, àAJ
Geometry, éYJë
Graph colouring,
Gesture, é»Qk
Graphic, úGAJ
K.
Þ
Glue, AË ,Z@Q« , ©Ö Gray-scale image, ø XAÓQË@ ék. PYJÓ èPñ
Ñ¢«
@ , áÓ
Q.» @
Glue language, Greater, áÓ
èPñË@
Q
Glyph, éK
QÓQË@ Greater or equal, ðAÓ ð @ áÓ .» @
GNOME, ÐñJJ
k. Greater than, áÓ Q.» @
. B@
Q
GNU, ñJk Greatest common divisor, Ñ¢« ¼ ÖÏ @ Õæ
A®Ë@
ë X@
Go, ʢ@
,I Greatest lower bound,
.
Goal, Y®Ó , ¬Yë Greedy, èQå
Go gold, Greedy algorithm,
Gold, I
. ë YË@ ( àYªÓ) Green, Qå k
@
Golf ball printer, Green lightning,
Gopher, Green monitor,
Gorilla arm, Grey-scale, ø XAÓQË@ PY JÓ
Gorp, Grick,
Go voice,
Grid, éºJ
.
GPL, üªk. Grok,
Grab, J . ¯ Gronked,
Grab handle, .× h. , é«ñÒm
Group, HA«ñÒm
×
.
Gradient, h. PY K Group attribute, é«ñÒm. é® ×
Grain, I . J.m' Group identifier, é«ñÒm.× QªÓ
Grammar, Y«@ñ¯ Group object,
Grammar analysis, Groupware,
Growth, Ñj , ñÖß
Hard coding,
Grunge, Hard
copy, éJ
¯Pð éj
Gry, Hard disk, IK . AK Q¯
Gtk, ½Jk. Hard disk drive, I
. Ê Q¯ ñÓ
Guaranteed scheduling, Hard drive, I . Ê Q¯
Guard, PAg Hard limit, øñ¯ Yg
Guess, á
Òm' Hard
link, éJ.Ê éÊð
Guest, J
Hard
link count, ¡. @ð QË@ XY« , éJ.ÊË@
¡. @ð QË@ Y«
GUI, éJ
ÓñQË@ ÐYjJÖÏ @ éêk. @ð éJ . ÊË@
Hard linking, I
Guide, ÉJ
ËX . Ê ¡. P
Guideline, H@XA P@
Hard return,
Hard sector, I
Guru, ðPñ« . Ê ¨A¢¯
Gutter, Hardware, XAJ«
Hardware circular buffer,
H Hardware handshaking, øXAJ« ÈA@ YJ
» AK
Hack, ¼Aë Hard wrap,
Hacker, Q»Aë Hash, YJ
J.ÊK
Hack value, ¼AêË@ éÒJ
¯
Hash bucket,
« Hash character,
Hair, Y®ªÓ , ÓA
Hairy ball, Hash coding,
Haiti, úæK Hash collision,
Aë '
Hash function, éK
Qm .' éË@X
Half-duplex, èAm. B@ ø XAg @
Half-Sphere, èQ» Hashing,
Halftone, éJ
® é«AJ.£ Hash table,
Halfword, éÒÊ¿
Hassle, h. A«P@
Hatching, á
¯QK
Halt, ¬A®K
@ , C«@
Halting problem, ¯ñK éʾÓ
, ¬A ®K @ éʾ
Ó
Head,
Handbook, I
Header, é
ðQK
.
J»
Handheld, YJ
ËAK. ÈñÒm× Header file, é
ð QË@ ÊÓ
Handle, Qå
ñÓ
Heading,
Handle (noun), J
. ®Ó Head normalisation theorem,
Handler, Èð @YÓ Head-strict,
Headword,
Handle (verb), ÉÓAªK
Handout, H Heap,
. ñJºÓ , éj JÓ
Handshake, ÈAB Heartbeat, I . ʯ éJ.K
@ éÓA¯@
Heat sink, èP@Qk é«ñËAK.
Handshaking, ÈA¹»ï @ éÓA¯@
, ÈA¹»ï@ YJ
» AK
Hang, J
ʪK Heat slug,
Haptic, ÒÊËAK. ʪJÓ , úæÖÏ Heavy metal,
Haptic interface, éJ
ÖÏ éêk. @ð Heavyweight, à PñË@ ÉJ
® K
Height, ¨A®KP@
Hard code,
Hard-coded, Hello packet,
Hello World, ÕËAªËAK. Cë @ Histogram, ø P@QºK h. PYÓ ,újJ
úGAJ
K. Õæ
P
.
Home page, éK
@YJ.Ë@ éj®
éj ®
Hex, I Homepage, éJ
KP
Hexadecimal, ø Qå« I Homogeneous, Aj.JÓ
K
Hexidecimal, Homogeneous environment, é®AJ JÓ éJ
.
Hibernate, HAJ . Homogenous, Aj.JÓ
Hidden, úæ
Jm × , ù® m × Homomorphism,
.
©ñÓ
Hidden file, ù®m× ÊÓ Hook, á
KðQË@ ú¯ é¯A@
Hierarchical, øQm.
Horizontal application, ù®¯ @ J
J.¢
Hierarchical database, éK
Qm.
HA
KAJ
K. èY«A¯ Horizontal encoding, ù®¯ @ Q
ÓQK
Hierarchical file system, øQm.
HA
®ÊÓ ÐA¢ Horizontal line, ù®¯ @ ¡k
Hierarchical navigation, øQm.
i®
Horizontal loop combination,
Hierarchical routing, ú×Që éJ
k. ñK Horizontally, AJ
®¯ @
.
Highest, éÒJ
¯ úΫ @ , úΫ·»ï @ Host-host layer, J
Ò®J
Ó é®J.£
High-level language, úÍAªË@ øñJÖÏ @ éªË
Host name, J
Ö
Ï @ Õæ
@
Highlight, P@ QK.
@ Hostname, J
Ó
Õæ
@
High light, P@ QK.
@ Host number, J
Ö
Ï @ Õ¯P
Highlighting, P@ QK.
@ , éKAK
@ Host-resident, J
Ö
Ï @ úΫ Õæ®Ó
.
High memory area, éJ
ËA« èQ» @ X 鮢JÓ Hot Key, hAJ®ÖÏ @ úΫ A®K@
High speed serial interface, éJ
ËA« éJ
ÊÊ éêk. @ð
Hotlink, á kA ¡. @P
é«QåË@
éÖ ß
A¯
Hotlist, éªKA
Hill climbing, ÈCJË@ É Hotplug,
Hindi, éK
YJêË@ Hot-plugging,
Hot spot, éËAª ¯ 颮K Identify, ¬Qª
K
Hot-swappable,
Idle, á»A
Hot swapping, ø Pñ¯ ÉJ
ñK
Ignore, ÉëAm.'
¯ éÊð
Hyperlink, é®KA
ú
æÖ Þ ¨ñK éËXAJ .
Hypermedia, éJ
¢. @QK ¡Að
Implies, Õæ , ÉÖÞ
,ø ñ k
Hyperspace, ù¢. @QK ZA ¯
Import, X@Q
J@
¯
Hypertext, KA Imported, XPñJÓ
¯ HAJ
Hyperware, é®KA
m.× QK. Importing, X@Q
J @
Hyphenate, Imports, H@XP@ ð
Impossible, I
Hyphenation, . ªJÓ ,ÉJ
jÓ
Hyphens, ÉñË@ HAÓC« Imprecise probability,
Inactive, ÉÓAg
Hypotenuse, QKð
Inactive window, é¢ Q
«
è Y ¯A K
I In-band,
Iceland, @YJÊ
@ Inbox, XP@ñË@ ðYJ
®K
@
Incantation, è YK
ñªK
Icon, éKñ
®K
@ éêk. @ð
Inch, éñK.
Iconic interface, éJ
Kñ
Include, á
Ò
ID, éK
ñë
K
IDE, éÊÓA¾JÓ QK
ñ¢ éJ Include file,
.
Ideal, úÍAJÓ Include war,
Including subdirectories,
Identification, K
QªK
Identifier, éK
ñêË@ I . JÓ ,QªÓ
Inclusive,
Information highway,
éº
, HAÓñÊªÖ Ï @ èXAg.
Incoming, XP@ð
HAÓñʪÖ
Ï @ K
Q£ , HAÓñ滅 Ï@
Incomparable,
Information overload,
Incompatible, ¯@ñJÓ Q
«
Information superhighway,
Increase, Y«A , YK
@Q K , ¨A®KP@
,PAJ»
@
'
Infrared, QÔg @ Im
Increment, ? YK
Q Ó
Infrastructure, éJ
Jm' éJ
K.
Incremental, ø YK
@Q K
Inheritance,
Incremental analysis,
Inherited, HðPñÓ
Incremental backup,
Inhertence,
Incremental constraint solver,
,ùK@Y
JK @
Incremental update, ø YK
@Q K IK
Ym' Initial, ùK@YK
.
.
Initialise,
Indent, ék@P@
Initialization, YJ
êÖß
Indentation,
îE ÊÓ
Initialization file, éJJ
Indented,
Indent style, ék@PB
@ H ñÊ
@ Initialize,
. Initializing,
Independent, É®JÓ
Initials,
Index, Qê¯
Initiate,
Indexing,
Initiator,
Indicate,
, È@X Init state,
Indicator, Qå
ñÓ
Injection, á ®k
Indice,
ñJ« Inkjet printer,
Indirect address, Qå
AJ.Ó Q
« à@
J« Ink printer, Q.g éªK. A£
Indirect addressing, èQå
AJ.Ó Q
« éKñ
Inline,
Indirection,
Induction, Im Ì '@ Inline image,
Inline template,
Inductive inference,
Inner,
Inductive relation,
Inner join,
Infeasible path,
Inner product,
Infect, ø YªK
Inode,
Inference,
In-order traversal,
Inference engine,
Input, Ég X
Inference rule,
B@
Ì Input device, ÈAgX@
PAêk .
Infimum, Ñ¢« úGX B@ Ym '@
Input method, ÈAgXB
@ é®K
Q£
Infinite, ùKAîE B
Input/output, h. @Qk@
,ÈAgX@
Infinite loop, éJ
KAî E B é®Êg
Input side,
Infinite set,
Inquire, ÈZA , Q.jJ@
Infinity, ùëAJ KCË@
ñJ K In row,
Infix notation, úÎg@X IK
Inscription,
Infix syntax,
Insensitive version,
Inflate,
Insert, h. @P X@
Info, HAÓñʪÓ
Inserted, ÉgYÓ ,h. ñÓYÓ
Information, HAÓñʪÓ
¢ªÓ èY«A¯
Insertion point, ÐAm¯ B
@ éÓC« Intelligent database, ú»X HAJ
Integrate, l×. YK
Internal frame, úÎg@X PA£@
Integrated, International, úÍ ð X
, È Qª JÓ
Isolated, XQ®JÓ K
Isometric joystick,
Kamikaze packet, éK
PAjJK@ éÓQk
Isometry, èQ®
Kangaroo code, éK
Qª J»
Isomorphic, KDE, ø YJ
»
KDM,
Knowbot, é¯QªÓ HñK .
Keep, ¼QK
Know-how, èQ.g , éK
@P X
Kernal, I . ÊË@ , è@ñJË@ Knowledge, é¯QªÓ
Kernel, è@ñK
Knowledge base, ¬PAªÓ èY«A¯
Kernel panic, Q« X , ¨AJ
KP@
Knowledge-based system, é¯QªÖÏ @ úΫ úæJ .Ó ÐA¢
Kerning, ( ¬Qk B@) J
Ë AK Knowledge level, é¯QªÖÏ @ øñJÓ
Key,
Knowledge representation, é¯QªÖÏ @ ÉJ
JÖß
Key agreement,
Keybind, hAJ®ÖÏ @ AJ.KP@
L
Key binding, hAJ®ÖÏ @ AJ.KP@ Label, é®J
Ë
Keyboard, iJ
KA®Ó ékñË Label edge router,
Keyboard focus, ékñË Q
»QK , iJ
KA®Ö Ï @ ékñË
èP ñK
. Label switched path,
iJ
KA®Ö Ï @ Label switching, HAª ¯QË@ ÉK YJK
.
Key (Button), P P
Lag, ñ£AJ.K
Key-encrypting, iJ
KA®ÖÏ AK. Q
® Ë@ Lambda, @YÓB
Key escrow, hAJ®ÖÏ @ áÖ
ßñÓ
Lambda abstraction,
Key field, hAJ®ÖÏ @ É®k
Lambda-calculus,
Key frame, úæJ
KQË@
PA£B @ , úæ
A B@ PA£B
@
Lambda expression,
Key (Lock), hAJ®Ó Lambda lifting,
Keymap control, hAJ®Ó é¢
Qk Õºm'
Lamp-post error,
Keypal, éÊ@QÓ K
Y
Landscape, úæQ«
Key stroke, P P 颪
Language, éªË
Keystroke, P P 颪 úΫ úæJ Ó PQm×
Language-based editor, éªÊË@ .
Key word, éJ
A @ éÒÊ¿ Ak
Language-sensitive editor, éªÊÊË PQm×
Keyword, éJ
A @ éÒÊ¿ Laptop, ÈñÒm× H
. ñAg
Keyword in context, AJ
Ë@ ú¯ éJ
kAJ®Ó éÒÊ¿ Laptop computer, ÈñÒm× H
. ñAg
Keywords, éJ
kAJ®Ó HAÒÊ¿ Larges,
Kiboze,
Laser, P Q
Ë
Kill, ÉJ¯
Laser printer, P Q
Ë éªK. A£
Kill app, l×. AKQK . ÉJ¯ Last call optimisation,
Killer poke, Last-in first-out, Bð @ h. PAg , @Qk @ Ég@YË@
Kilo-, ÊJ
» Latch,
Kilobaud, XñK. ñÊJ
» Latency, ÈññË@ áÓ P
Kilobit, IK . ñÊJ
» LaTeX, p éK
ñÊJ»
Kilobits per second, éJ
KA JË@ ú¯ IK
Q« , éºJ
.
Lattice,
.
Kilobyte, IK
AK. ñÊJ
» Launch, YJ
®JK
Kiloflops, éJ
KA JË@ ú¯ éÖß A« 颮K ñÊJ
»
Launcher, Ê¢ Ó
Kilometer, QÓñÊJ
»
Launch icon,
Kiosk, É£ , pñ» Lavender, ú×@Q mÌ '@
Kit, Law, àñ KA ¯
Knapsack problem, éJ.J
®mÌ '@ ú¯ éʾÓ
Layer, é®J.£
Layout, , ¡J
¢m'
Level-sensitive scan design,
Laziness, É»
Level two cache, úGAJË@ øñJÖÏ @ áÓ (lÌ. 'AªÓ) éJ
K. Ag
Leaf, é¯Pð
Lexical scope,
Leak, I
Lexical scoping,
. K
Qå
Leaky heap, Lexicon, Ñj.ªÓ
Leap second, Liar paradox,
Leased line, Qk. ñÓ
¡k Libraries, HAJ . JºÓ
Least fixed point,
Library, éJ.JºÓ
Least recently used,
Library routines, éJ
.JºÓ ©J
Least significant bit, License, J
kQ K
Least upper bound,
License agreement, J
k QË@ éJ
¯A®K@
Lee, Liechtenstein,
Left, PA
Life, èAJ
k
Left arrow, ø PA
ÑîD
Life-cycle, èAJ
k èPðX
Left brace, éK
PA
èQåAg
Life science, ZAJ
k B@ ÕΫ
Left bracket, (ø)PA
ñ¯ LIFO, Bð @ h. PAg , @Qk @ Ég@YË@
Left join, Lifted domain, ¨ñ¯QÓ ÈAm.×
Left-justify, PA
ÊË è@ XAm×
Ligature,
Left outer joint, Light, PñK
Left outside,
Light client, J
®k ÉJ
Ô«
Left parenthesis, ø PA
ÈCë
Light pen, J
®k Õί
Locale, éJ
Êm×
Line pattern, Local echo, úÎm× øY
Line printer, ñ¢k éªK. A£
Links, HCð
Locator, ©¯@ñÖÏ @ XYm×
Linux, ºJ J
Ë Lock, É®¯
Liquid crystal display, ÉJ.Ë@ ÉKA @QªÓ Locked, á ÓñÓ
List, éÖß A¯
Locked file, Èñ®®Ó ÊÓ
Listbox, Locked up,
List comprehension, Lock-in,
Listing, Q«
Locking, C«@
,ÈA®¯@
Listless, éÖß A¯ àðYK Log, Ém.
.
Lists, Õç'@
ñ¯ Logarithm, Õç'PA«ñË
Lite, J
®k Logarithmus dualist,
Literal, ù¢ ®Ë , ú¯Qk Log file, Éj.Ë@ ÊÓ
Logical-hostname, ù®¢JÓ
J Ó
Õæ
@ Love, I. k
Logical network, éJ
®¢JÓ
éºJ Low, ®jJÓ
. ék ñÓ Èñ£
Logical relation, éJ
®¢JÓ é¯C«
Low-bandwidth, ®jJÓ .
QJª K Low earth orbit, (¨A®KPB
@) ®jJÓ úæP
@ P@YÓ
Logical shift, ù®¢JÓ
Q
J
ª K Lower, ɯ @
Lower-case, Q
ª
¬Qk
éK @ñK
Lower set, úGX @ é«ñÒm.×
Logic gate, éJ
®¢JÓ . .
Logic programming, éJ
®¢JÓ ém.× QK. Lower Stream,
èQJª JÓ
Lowest, úGX B@
Logic variable, éJ
®¢JÓ
Low-level language, ®jJÖ Ï @ øñJÖÏ @ éªË
Login, h. ñËð
èQ»@ X 鮢
Low memory area, é ®jJÓ
JÓ
Log in,
Login banner, Lub,
Login directory, h. ñËñË@ ÉJ
ËX Luminance,
Login name, h. ñËñË@ Õæ
@ Lump uncurrying,
Login prompt, h. ñËñË@ Im × Lurk, YJK
Lurker, YJÓ
Login shell, h. ñËð é¯Y
Logo, PAª Lurking, YJK
Lvalue, éÒJ
¯
Log off,
Logon, ø Q¯X iJ¯
Logout, h. ðQk M
Log out, ø Q¯X h. ðQk Machine, éË @
Longitudinal parity,
ñJ«
Machine address, éË @ à@
Look, Q¢ @
Machine code, éË B@ éªË
Look and feel, Ak B@ ð Q¢ JÖ Ï @ Machine-collating,
Lookup, Im '.
Machine cycle, éË B@ èPðX
Look-up table,
Machine language, éË B@ éªË
Loop, PQºK
, é®Êg , P@QºJK. Y®JK
Machine learning, éË B@ ÕΪK
m× , úο ,ÕæÔ« ,©Ó Ag
Loopback, ¨Ag. Q@
Macro, ¡J
.
Loopback file, Macroblock, Q
J.» I . ËA¯
Loop combination, Macrology, ðQ»AÖÏ @ ÕΫ
Loop fusion, Macro processor, Q
J.» lÌ. 'AªÓ
Loop through, Macros, ðQ»AÓ
JK AK
Loose bytes, 麺®Ó HA
Magazine, éÊm.×
.
Loss, ¨AJ
Magenta, úG@ñk. P @
Magic, ø Qm
Malta, A¢ËAÓ
Magic bullet, éK
Qm
éAP Malware, éJ
J.k éJ
m.× QK.
Magic number, ø QjË@ Õ¯QË@
Manage, èP@X@
Q¯
Magnetic disk, úæJ
£AJ ªÓ Management, èP@X@
Manipulation, I . «CK
Magnetostrictive delay line,
Man page, èY«AÖÏ @ éj®
Mail, YK
QK. Man Pages, àAÓ ÉJ
ËX HAj ®
Mail bomb, éK
YK
QK. éÊJ.J ¯ Mantainer, ù®J.Ó
Mailbox, YK
QK. ðYJ Mantissa, ø QåªË@ A B@ ,ø QåªË@ ZQm .Ì '@
Mail bridge, YK
Q.Ë@ Qåk. Manual, ÉJ
ËX
Mail client, YK
QK. àñK . P
Manual page, éK
ðYK
éj®
Mail delivery, YK
Q.Ë@ ÉJ
ñK Manual testing, ø ðYK
PAJ.Jk@
.
Mailer, YK
QK. I«AK Map, ¡@Qk h. , é¢
Qk
Mail exploder, YK
Q.Ë@ Qj.®Ó
Mapped, éJJ
ªÓ
Mail filter, YK
QK. l
QÓ
Mapped memory, éJJ
ªÓ èQ»@ X
Mail gateway, Mapping, á
J
ªK
Mail host, YK
QK. J
Ó
Map to, úÍ@ á
J
ªK
Mail hub, Marble, ÐAgP
Mailing list, éK
YK
QK. éÖß A¯ Margin, Ó@ ñë h. , ÓAë
Mail merge, YK
Q.Ë@ l×. X Marginalia, HAJ
ÓAë
Mail path, YK
Q.Ë@ PAÓ Margins, úæ
@ñk
Mail server, YK
Q.Ë@ ÐXAg
Mark, éÓC«
Mail services, YK
Q.Ë@ HAÓY g Marked, ÕΪÓ
Mail to, úÍ@
YK
QK. Marked only,
Mail user agent, YK
Q.Ë@ ÐYjJÓ ÉJ
Ô«
Marker, Õæ
@ð
ékñË Marker object, Õæ
@ð ¬Yë
Main board, éJ
KP
ékñË
Mainboard, éJ
KP
Marker primitive,
Main body, úæJ
KP
Õæk Mark-sweep garbage collection,
.
Mainframe, úæJ
KP H ñAg MARKUP,
. Markup, Õ¯P
Main memory, éJ
KP èQ» @ X
Maintainer, á
Ó Marquee,
Maintainer script, á
Ó ñ¢m×
Marshalling,
Maintenance, éKAJ
Amk
Mask, ¨AJ ¯ ,H
. .
Major delivery, èQ
J.» éÊJ
ñK Masquerading, QºJ K
Major release, éÓAë èP@Y@
Master,
KP
Ém
Make, ɾ Master boot record, úΫ) úæJ
KQË@ ¨C¯B@ .
(Q®Ë@
Malfunction, Pñ¯
Mall, Master driver, ú
æJ
KP
KA
Master server, úæJ
KP
Memoisation,
ÐXAg
Master-slave, ©K. AJ
KP Memoised function,
Match, K. A¢ Memoization,
Matching, éÓZ@ñÓ Memoized function,
Material, èXAÓ , XAJ« Memorandum, PAj J@ ,Qåm ×
P
AK
Math, HAJ Memory, èQ»@ X
Mathematical, úG Ak , úæAK
P
Memory access, èQ»@ X h. ñËð
.
ñJ«
Matrix, é¯ñ®Ó Memory address space, èQ»@ YË@ à@ ékAÓ
Matrixes, HA ¯ñ ®Ó
Memory heap, èQ»@ X YºK
Maturity, A®jJ@
Qå
Memory leak, èQ»@ X H
.
Max, úæ¯ @ Memory location, èQ»@ YË@ ©¯ñÓ
Maximal free expression, Memory management, èQ»@ X èP@X@
Maximin,
Memory protection, èQ»@ X éK
AÔg
Maximize, Q
J.ºK
Menu, éÖß A¯
Maximum, úæ¯ B@
Menu bar, Õç'@
ñ®Ë@ ¡
Qå
Maximum segment size,
Menubar, éÖß A®Ë@ ¡
Qå
MDI, èXYªJÖÏ @ H@Y J Ö Ï @ éêk @ð
Menu item, éÖß A¯ éKA g
.
Mean, ¡ñJÓ Mercury delay line, øQ»Q
Ó Q
g AK ¡k
Meaning, úGAªÓ h. , úæªÓ Merge, l×. X
Measure, AJ
¯ Mesh, éºJ.
Measurement, AJ
¯
Mesh network, éK
ðQ« éºJ.
Mechanism, éJ
Ë @ Message, éËAP
Media, ¡Að
Message block, éËAQË@ I ËA¯
.
Median, Message board, A ® JË@ HAgñË
Media type, ¡AñË@ ¨ñK
Message catalog, éËAQË@ àAJ
K.
Medium, ¡ð Message digest function,
Meeting, ù®JÊÓ , ZA®Ë , ¨AÒJk. @ Message of the day, ÐñJ
Ë@ éËAP
Meg, Message passing, ÉKAQË@
QK QÖß
Mega-, Bj.J
Ó Messages, ÉKAP
Megabits per second, éJ
KA JË@ ú¯ HA
J JË@ á
K
CÓ Message switching,
.
Megabyte, IK
AK. Aj.J
Ó Messenger, ÈAQÓ
Megaflop, Meta, úΫ @
Megaflops, Metacharacter, úΫ @ ¬Qk
Meltdown, PAîD@
Meta-data,
Member, ñ« Metadata,
Member function, ÐYjJÖÏ @ éË@X Metafile, úΫ @ ÊÓ
Membership function, éK
ñªË@
éË@X Metaheuristic,
Q
ª JÓ
Member variable, ñ« Metainformation, úΫ @ HAÓñʪÓ
Memetic algorithm, Meta key, úΫ @ hAJ®Ó
×
Memo, èQ»YÓ ,Qåm
Metal, àYªÓ
Memo function, èQ»YÖÏ @ é®J
£ð
Metalanguage, 骯QÓ éªË
Metaphone, úΫ @ KAë Minicomputer, Q
ª I.Ag
àQÓ Q¯
Metaprogram, úΫ @ l×. AKQK . Minifloppy, Q
ª
Metasyntax, Mini icons, èQ
ª
HA Kñ ®K
@
Meter, QÓ
Minimal automaton,
Method, é®K
Q£ Minimax,
Methodology, éJ
j.îDÓ
Minimize, Q
ª
Metric, ø QÓ
Minimum, úGX B@
Metric space, ø QÖÏ @ ÈAj.ÖÏ @ , ø QÖÏ @
ZA ®Ë@ Miniport,
Mice, à@ Q
¯ Minix, ºJJ
Ó
Micro, ðQºJ
Ó Minor fault,
Micro-, QºJ
Ó Minor faults, èQ
ª
ZA¢k
@
Microcentury, AJ.K
Q®K éJ
KA K 6.52 Minus, ¯AK
Microcode, ðQºJ
Ó èQ®
Minus infinity,
Microcomputer, ðQºJ
Ó I
Minute, é®J
¯X
. Ag
Microcontroller, QªÓ ÕºjJÓ Mirror, è @QÓ
Microfortnight, ðQºJ
Ó àA«ñJ .
@ Mirrored, ñºªÓ
Microkernel, éK
ñK Mirroring, ø ð @QÓ QK
ñ
Microlog, ðQºJ
Ó Q¯X Mirror site, è @QÓ ©¯ñÓ
Micrometre, ðQºJ
Ó QÓ
Miscellaneous, ¨ñJ JÓ
Micron, àðQºJ
Ó Misfeature,
Microperation, ðQºJ
Ó éJ
ÊÔ«
Missile address, pðPAË@ à@ ñJ«
¯ðQºÓ
Microphone, àñ Mistake, A¢k
Microprocesor, ðQºJ
Ó lÌ. 'AªÓ
Mixer device, ¡Êg èQ
êm.' , Cg PAêk
.
Microprocessor, ðQºJ
Ó lÌ. 'AªÓ Mnemonic, ø Q»YK QÓP
Microprogramming, ðQºJ
Ó ém.× QK. Mnemonic key, ø Q
»YK hAJ®Ó
Microsecond, ðQºJ
Ó éJ
KA K Modal, ðQåÓ
Middle-endian, Modal logic,
Middleware, Modal (value), Õæ
j.jJË@ éÒJ
¯
Midi, øYJ
ÖÏ @ Mode, ©ð
Mid-level network, Mode bi,
Miles, ÈAJ
Ó @ Model, P@ Q£
Mill, éKñkA£ Model checking,
Millennium bug, éJ
®Ë B@ èQåk Modeling,
Millennium meltdown, ZA @ , ék
Modelling, ÉJ
º , h. XAÒJË@
. YÖß
Milli-, JÊÊÓ Modem, ÐXñÓ
Millimeter, QÒÊÓ
Moderator, ¬QåÓ
Millisecond, éJ
KA K úÎÊÓ Modern, ø Qå«
MIME, Modification, Q
J
ª K
Mime Type, : úæJ
K ¨ñK Modified, Q
J
ªÓ
Mind mouse, Modifier, Q
J
ªÓ
Mind uploading, Modifier key, Q
J
ªÓ hAJ®Ó
Modify, ÉK
YªK
Mouse pad, èP A®Ë@ èXAð
Modular, øPAJ
ªÓ
Mouse trails, èP A®Ë@ QK @
Modular arithmetic, Move, ½K
Qm'
Modularization, MSDOS, ðY..Ó
MS,
Modulate, àP
Modulation, Õæ
K QË@
MTU, :ð éK
Module, èYgð Multiboot, ¨C¯B
@ XYªJÓ
Modulo, AJ
®Ó Multibyte, IK
AJ.Ë@ XYªJÓ
Modulo arithmetic,
Multicast, èXYªJÓ é«@ X@
Modulo operator,
Multicast addressing, èXYªJÓ é«@ X@
éKñ
J«
Modulus, Multicast backbone,
Molecule, Zø Qk . Multiclick, XYªJÓ ¡ª
Monadic, Multihomed hos,
, H A¯QÓ
Monitor, éA
Multihomed host,
. Ï @ XYªJÓ Q¯
Monkey, scratch, ¡» , XQ¯ Multihost disk, á
®J
Ö
Monkey sort, øXQ¯ PQ
Multilayer perceptron,
¯ XYªK
ªÊË@
Monkey up, úΫ B XQ¯
Multilingualization, HA
Monochrome, àñÊË@ ø XAg @
Multimedia, èXYªJÓ ¡Að
Monoid, Multipart, ÐA¯B@ XYªJÓ
Monolithic kernel, Multi-part key, Z@Qk . B@ XYªJÓ hAJ®Ó
Monospace, Multiple, XYªJÓ
Monotonic, I
.
KP Multiple access, XYªJÓ ÈñkX
Month, QîD
Multiple boot, ¨C¯B@ XYªJÓ
Moose call, Multiple inheritance, «AÓ
HP@ ñK
More, ú¯A@
Multiple value, éÒJ
®Ë@ XYªJÓ
Morphing, Èñm'
Multiplexed, ÕæÓ , «A Ó
Mosaic, (ùKA
Multiplexer, ÈAPB
®J
¯ .) ZA®J
¯
@ XYªJÓ
Most general unifier, Multiplexing, XYªJÓ ÈA@
Most significant bit, Multiplex printer,
Mother, Ð @
Multiply, «A
Motherboard, Ð B@ ékñÊË@ Multiprocessing, Z@Qk. B@ XYªJÓ
Motion, é»Qk Multiprocessor, lÌ. 'AªÖÏ @ XYªJÓ
Mount, Éð
Multiprogramming, èXYªJÓ ém.× QK.
Mounting, I Multiscan, XYªJÓ iÓ
. J
»QK
Mount point, Éð 颮K Multiselection, XYªJÓ PAJ
Jk@
Mouse, èP A¯ Multisync,
Mouse Cursor, èP A®Ë@ Qå
ñÓ Multitasking, ÐAêÖÏ @ XYªK
Mouse droppings, Multi-threaded,
¯
Mouse grab, èP A®Ë@ éJ Multithreaded,
.
Mouse mat, Multi-threading,
Mouse-over, èP A¯ úΫ PðQÓ Multithreading,
Multi threading, ø XYªK I Navigating, QjJ.K
á . ª
Multiuser system,
ÓYjJÖÏ @ XYªJÓ ÐA¢ Navigation, i®
Multi-way branch, Navigation key, PAm'. B@ P P
Mumble, ÑêÒîE
Navigator, hCÓ
Munching squares, Negation by failure,
Museum, jJÓ Negative acknowledgement,
Mute, Õæ»@ Negative Binomial,
Mutual exclusion, ÈXAJ.JÓ ZAJ J@ Neighborhood,
Mutually recursive, ÈXAJ.JÓ PQºJÓ
Net, éºJ.
Mutual recursion, ÈXAJ.JÓ P@QºK Netcafe, I K QK@
úæê®Ó
Mux,
ú¯ ÉÓAªJË@ H @X@
Netiquette, éºJ.Ë@
.
Netizen,
N ¨AJ ¯
Netmask, éºJ.Ë@
, Zø QK Netscape, I
Naive, h. XA
. . J
ºJ
K
Name, Õæ
@ Netting,
Network, éºJ.
Name capture,
Named, ùÒÓ Network-address, ú¾J. à@ ñJ«
Named pipe, èAÒÓ ÈA@ éK. ñJ.K @
Network byte order, ú¾J. IK
AK. I.
KQK
Network card, éºJ. é¯A¢.
Named Stream,
Network close,
Name resolution, Õæ
B@ Q
J
Öß
úΫ HA
K. èY«A¯
KAJ
Names, ZAÖÞ
@ Network database, éºJ.Ë@
Name service switching, Networked, I . Ó
Namespace, Õæ
B@ ékAÓ
Network engineer, éºJ. YJêÓ
Nano-, ñKA K Networking, HA¾J . Ë@ ¡. P
éêk @ð é¯A¢
Nanocomputer, úÍ @ I . Ag ñKA K Network interface card, éºJ.Ë@ . .
Nanometre, QÓ ñKA K Network interface controller, é ê k. @ð Õº jJ Ó
Ë@
Nanosecond, éJ
KA K ñKA K .
éºJ
Nanotechnology, ñKA JË@ éJ
J ® K é®J.£
Network layer, éºJ.Ë@
Narrowband, é®J
éÓQk
Network layer reachability information,
èP@X@
Network management, éºJ.Ë@
Narrowing, J
¨AJ ¯
Network mask, éºJ.Ë@
National character,
Native, øQ¢¯
Network meltdown,
èY®«
Network node, éºJ.Ë@
Native code, ÉJ
@ PAÓP
Network number, ÈAB@ éºJ. Õ¯P
Native compiler, øQ¢¯ ©Òm.×
ÉJª
Network operating system, éºJ.Ë@ ÐA¢
Natural deduction, ùªJ
J.£ Õæk
Network operator, éºJ.Ë@ ɪÓ
Natural language, éJ
ªJ
J.£ éªË
Natural language processing, éJ
ªJ
J.£
éªË ém .Ì 'AªÓ Network redirector,
Network segment, ú¾J. ©¢J®Ó
Natural number, ùªJ
J.£ Õ¯P
Network storm, éºJ. é®A«
Nature, éªJ
J.£
Nautilus, CJ
KñK Network, the, éºJ.Ë@
éJ ¯A ®
Network transparency, éºJ.Ë@
Navigate, ékCÓ
Neural nets, Noname, Õæ
@ »»ï
Neural network, Noncluster mode, úÎk B ¡Öß ,ø Xñ®J«
B ¡Öß
Neuron, I . « Nondeterminism,
Neutrosophic, Nondeterministic,
Neutrosophic logic, Nondeterministic automaton,
Neutrosophic probability, Nondeterministic polynomial time,
Neutrosophic set, None, Yg @ B , àðYK . ,Zú
æ
B
Neutrosophic statistics, Non-existant, Xñk. ñÓ Q
«
Never, ¡ ¯ , @YK. @ Non-impact printer,
New, YK
Yg. Non-inclusive,
Newbie, øY
JJ.Ó Non-interlaced,
Newer or from, t'
PAK áÓ ð
@ XYg.
@ Nonintrusive testing,
Newer than, áÓ XYg.
@ Nonlinear, ù¢ kB
News, PAJ.k @ Non-optimal solution, ÉJÓ @
Ë Ég
News feed, Non parity, úk ð P B
.
News group, PAJ.k @ é«ñÒm.× Non-polynomial,
Newsgroup, PAJ.k @ é«ñÒm.× Nontrivial, È YJJ.Ó Q
«
HA«ñÒm
Newsgroups, éK
PAJ.k@ .× No numbering, X@YªK àðYK .
Newsletter, PAJ.k B@ èYK
Qk. Non-uniform quantising logarithmic compres-
News reader, PAJ.k B@ øZPA¯ sion,
Non-volatile, QK
A¢JÓQ
«
News Site, ø PAJ.k@
©¯ñÓ Nonvolatile, QK
A¢JÓ Q
«
New talk, YK
Yg. IK
Yg
Non-volatile memory, èQK
A¢JÓQ
« èQ»@ X
New text, YK
Yg.
Non-volatile storage, QK
A¢JÓQ
« áK
Q m '
Next, úÍAJË@
Norm, PAJ
ªÓ
Nibble, Õæ ¯
NIC, Normal, ùªJ
J.£ , ø XA«
K
Nice, J
¢Ë , ñÊg Normal distribution, ùªJ
J.£ ©K
Pñ
Niceness value, Normal form, øXA« ɾ
Nick, I
. ®ÊË@ Normalisation, ©J
J.¢JË@
Nickle, ɾJË@ Normalised, I . £
Normalize, P@QºJË@ ÉÊ®K
Nickname,
Nick name, PAªJÓ Õæ
@ Normal order reduction,
Night mode, úÎJ
Ë ¡Öß
Normal vector,
AK.
Older than, áÓ ÐY¯
@
Nym server, QÊJ
ÓP ÒJ
K@ ©k. @P
On, ÉÒªK
®Ë@ É¿
On all pages, HAj úΫ
O One-line fix,
Obi-wan error, Ones complement,
One-Time, èYg@ð èQÓ , èQÓ
Object, á KA¿
On even pages, éJ
k. ð QË@
HAj úΫ
®Ë@
Object code,
Object file, úæQ One-way function,
« ÊÓ , Q« É®Ó One-way hash function,
Object identifier,
«
Object-orientation, éJ
k. ñJË@ éJ
Q Ongoing, PAg.
Object-oriented, Online, ÉJÓ
Q« HAj
Object oriented, éJ
k. ñJË@ úæQ
« '
On odd pages, éJ
k. ð QË@
®Ë@ úΫ
Object-oriented analysis, éJ
k. ñJË@ úæQ« ÉJ
Êm On the line, ¡mÌ '@ úΫ
HA
Object-oriented database, éJ
KA¿
KAJ
K. èY«A¯ Onto,
Object-oriented design, éJ
k. ñJË@ úæQ « ÕæÒ Ontology,
Opacity, éÒJ«
Order-embedding,
Opaque, ÕæªÓ Ordering,
Open, iJ¯ Ordinal,
Open box testing, Ordinate,
Open-collar worker,
Org, éÒ¢ JÓ
Opening,
Organization, é»QåË@ , éÒ¢ JÓ
Open source, hñJ®Ó PYÓ Organize, Õæ
¢ J K
Open switch, hñJ®Ó È@YJ.Ó (P P) Organizer, Ñ¢ JÓ
Operand, ÉÓAªÓ
Orientation, èAm.' @ , éJ
k. ñK , ék. ñK
Operating system, ÉJ
ª ÐA¢ Origin,
Operation, éJ
ÊÔ« Original, úÎ @
Operational database, éJ
ÊÔ« HA KAJ
K. èY«A¯
Orphan, Õæ
JK
Operational requirements, , é J
Ê Ô« HA J. Ê ¢ J Ó Orphaned i-node,
éJ
ÊÔ« HAg
. AJ
Jk@
Orphan process, Õæ
JK
Z@Qk. @
Operational semantics, Orthflow,
Operational test and evaluation, Orthogonal, YÓ AªJÓ
Operational testing, Orthogonal instruction set, HA Ò J
Ê ª K èQ ÓP
Operation code, éJ
ÊÔ« PAÓP
èYÓAªJÓ
ÊÔ«
Operations, HAJ OSD,
Operator, ÉÓA« Other, Qk @
Operator overloading, Outbox, PXAË@ éJ.Ê«
Optical, ùKñ Outer,
Optical character recognition, úΫ
Ì '@ ø
Qå. ¬ Qª
K Outer join,
¬ðQm Outgoing, h. PAg
Optical diff,
Outline, ù¢J
¢m' Õæ
P , é¢ k
Optical fiber, éK
ñ
¬AJ
Ë@
Outline font, úÎJ
®K ¡k
Optical fibre, éK
ñ
¬AJ
Ë@
Output, h. Q k
Optical grep, Output device,
Optical mouse, éJ
Kñ
èP
A¯ h. PAg ,h. PAm Ì '@ ú¯
Outside, á«
Optimal, ÉJÓ B@
Outside-in testing,
Optimise, éÊJÓ @ Outsourcing,
Optimising compiler,
Overclocking, éJ
KA®J
ÖÏ @ J
¯
Optimization, éÊJÓ @
¯
Overflow, J
Optimize, éÊJÓ @
Overhead, úGA¯ñ¯
Optimized, ÉJÓ AÓ
Overlap,
Option, PAJ
k Overlapping, I
. »@QK
Optional, ø PAJ
k Overlay,
Options, H@
P AJ
k Overloading,
Or, ð @ .'
Override, PðAm
Orange, úÍA®KQK.
Overriding,
Order, Overrun,
Overrun screw, Palettes,
ñË B@
Overuse strain injury, Palette window, à@ ékñË PA£@
Overview, Palmtop,
Overwrite, úΫ éK. AJ» , éJ
¯ñ¯ éK . AJ» Pane, hñË
Own,
Panel, ékñË
Owner, ½ËAÓ Panelize,
Panic,
P
Panic message, Q« X éËAP , ¨AJ
KP@
éËAP
Pack, éJ.Ê« Paper, Pð
Package, éÓQk Papermail,
Packed decimal, Paper-net,
Packet, éÓPP
Paper tape, ú¯Pð ¡
Qå
@ ñ , Ð Qk @ ñ
Parametric, ù¢ñÓ
Page out, ék. PAg éj®
Pager, Parametric polymorphism, ÈA¾ B@
Ï@ é K
XY ª K
Pages,
é¢ñÖ
HAj Paranoid programming, H. AJ
KPB
@ àñ . ém .× QK.
Jk
Paging, Q ®Ë@ úÍ@
ð áÓ èQ» @ YË@ ® ÈA® JK@
. AJË@
IK Parcel, éËAK. ,Qå
Pain in the net, Parent, ø ñK. @
Paint, é«AJ. , áëX Parent directory, Ð B@ YÊj.ÖÏ @
Parentheses, àAñ ¯
Pair, h. ð P
Palette, à@ ñË
@ ékñË
Parent level,
Parent process, Paths, HA ¯Q£
Parent structure, Patience, Q.
Parent widget, Pattern, ¡Öß
Parent window, É B@ PA£B
@ Pattern matching, H . ñÊ B@ ¯@ñK
Parity, éJ
k. ð P Pattern recognition,
Parity bi, Pause, I ¯ñÓ
¯ñ K
IK
Parity bit, éJ
k. ð QË@ . , h. ð@Q Ë@ IK . ¯ñÓ
Paused, J
¯ñJË@ I
,( AJ
J¯ð)
¯ñ JÓ
Qå
ñÓ
Parity error, úk ð QË@ A¢k Peak indicator, éJ
¯A®Ë@
Parse, ÉJ
Êm'
. Pearson Correlation,
Parser, H . QªÓ , Ém× Peephole optimisation,
Parser generator, Peer, Q
¢
Parsing, ÉJ
Êm'
Peer-to-peer, Q
¢ JJË@ Q
¢
Partial, PAj JÓ , ùK
Qk Pen, Õί
.
Partial equivalence relation, Pending signal,
Partial evaluation, ùK
Qk . á
Òm '
. á
ÒJK , ùK
Qk Q JË@ ZAªË@
Pending signals, ? éJ
®J.JÖÏ @ HCK
È@X
Partial function, éJ
K
Qk . Percent, éJÖ
Ï AK.
Partial key, ùK
Qk Percentage, éK
ñJÓ
. hA®Ó Q
Partially ordered set, I .
K Ë@ éJ
KQk. èQÓP Percentual, ø ñJÓ
Passive, úæÊ Peripheral device, ú¯Q£ PAêk .
.
Policy, éAJ
Posted write-through,
Policy group,
Poster, ÊÓ , àC«@
ñ
Policy issues, éJ
AJ
àð Posterize,
Policy repository, Postfix,
Ë@
Polish, éK
YJËñJ Postfix notation, jÊÓ IK
ñJ K
.
Primary cache, éJ
KP
éJ K Ag , éJ Ëð
@ éJ K Ag
Power save mode, é¯A¢Ë@ PAgX@ ¡Öß
.
.
Primary Colors, éJ
Ëð @ à@ñË @
Powerset,
Primary key,
PPP,
Primary management domain,
Pragma,
Primary window, úæ
A B@ PA£B
@
Pragmatic, ù ª¯ @ð , úΪ ¯ , ù ªK
@P X
Prime number, úÍð @ XY«
Precharge,
HAÒêÖ
¯ñË@ Print, ©J.£
Pre-emptive multitasking, ùKA Ï @ XYªK
Printable, é«AJ.¢ÊË ZúæêÓ , é«AJ.¢ÊË ÉK. A¯
Preference, ÉJ
®K
Pre-order,
Print server, é«AJ.£ Õ®ÊÓ
Pre-order traversal,
Priority, éK
ñËð @
Prepaging, Priority inheritance, éJ
Ëð B@ éK@P ð
Prepare, Q
m '
Priority interrupt,
Prepend, Priority inversion, éJ
Ëð B@ H
C® K@
Preprocessor, ø YJ
êÖß lÌ. 'AªÓ , ù®J. lÌ. 'AªÓ
.
Priority queue,
Pre-sales support rep, Priority scheduling, éK
ñËð B@ éËðYg.
Presence detect, Yg. @ñJË@ ¬A »
@
Privacy, éJ
ñk
Presentation, Private, Ag
Presentation layer, Private hostname, Õæ
@
,úæ m
J
Ó
Õæ
@
Preset, ú
æñk J
Ó
Private-key cryptography,
Press, ¡ª
Private Messages, éAg ÉKAP
Pretzel key,
JÓ@
Priviledge, PAJ
JÓ@
Privilege, PAJ Program transformation,
Privileged instruction, X éÒJ
H@ ʪK
ʪK , ù ÜØ éÒJ Progress, ÐY®K
JÓ@
PAJ
Progress bar, ÐY®JË@ ¡
Qå
Probabilistic, éJ
ËAÒJk @
Progressive coding, ø Y®K Q
ÓQK
. Propositional logic,
Process status, Z@Qk. B@ éËAg
Proprietary, ¼ñÊÜØ
Process table, Z@Qk. B@ ÈðYg.
Protect, éK
AÔg
Prodigy, úÃXQ«
Protected, ùÒm×
Product, i.JJÓ
Protected mode, ùÒm× ©ð
Production system, h. AJK@
ÐA¢
Provision, Quadrature, ©J
K. QK
Proxy, ÉJ
»ð Quadruplex,
Proxy gateway,
Quality, èXñk.
Proxy server, ÉJ
»ñK ÐXAg
Quality assurance, èXñm.Ì '@ YJ
» AK
Pseudo, éJ.
Y»
AJË@
Quality control, èXñm.Ì '@ áÓ
Pseudo-device, PAêk . éJ. m Ì '@ èXñk.
Quality of service, HAÓY
Pseudo-random number, ùK@
ñ« éJ. XY« Quantifier,
Pseudo-terminal, ¬@Q¢Ó éJ. Quantity, éJ
Ò»
Pubic directory, Quantum,
Public, ú×ñÔ« Quantum computer, ú×ñÒ» H . ñAg
Public directory, ú×ñÔ« Ém.× Quantum computing, éJ
ÓñÒºË@ éJ.ñmÌ '@
Quantum do,
Public domain, ¨AÓ
hAJ®Ó
Quarantine, éJ
J
ªK. P @
Public key, úæÊ«
Quarter,
Public-key cryptography,
Public-key encryption, ú×ñÒªË@ hAJ®ÖÏ AK. éJ
ÒªJË@ Query, ÐCªJ@
Quintillion,
Quit, èPXAªÓ
Pumpkineer,
Pumpking, ¨Q¯
Quorum, ÑîD
@ h. , ÑîD
Punch card, I
Quorum device,
. ®K é¯A¢.
Pure functional language, éJ
¯A éJ
®J
£ð éªË Quota, ÑîD
@ , ék
Quotation, AJ.J¯@
Pure lambda-calculus,
. éJ
®J
£ð
é ªË Quote, AJ.J¯@
Purely functional language, ɾ
ú
¯A
Quoted, ¢J®Ó ,.J®Ó
Purge, éJ
kCË@ éK
AîE Quotelike,
Push, ©¯X
Quotient, Õæ¯
Pushable module, Quoting,
Pushbuttom, Qword, , ú«AK. P I
. »QÓ , QåAJ« éªK. P @ áÓ I.»QÓ
Push-button, ¡ª P P ú
«AK. P
Push media, ©¯X ¡Að
Put procedure, R
Race condition, PAª
K éËAg
Pyramid, ÐQë
Rack-mounted,
Radar map, P@X@QË@ é¢
Qk Readable, ZðQ®Ó
Radial, ú«Aª Read-ahead,
Radio, ñK
X@P Read-eval-print loop,
Radio button, ZA®JK@ P P Read-only,
Radio group,
Read only, ¡®¯ ZðQ®Ó
Radiosity, éJ
«Aª Readout,
Radius, Q¢¯
Read-write,
Radix, ø P Yg. XY«
.
Ready..., ...QëAg
Raise, ©¯P Ready, I . AJÓ , QëAg.
ë
Random, ùK@
ñ«
Real, ù®J
®k
Rasterising, Reassembly,
Reboot, ¨C¯@ èXA«@
Rasterization,
Rasterizing, Recalculate,
Raster op, Receipt, ÉJ
ñK
Raster subsystem, Receive,
Rate, é«Qå
, YªÓ
Received,
Receiver, ÉJ.®JÖÏ @
Rating, QK
Y®K , ék. PYË@ YK
Ym'
Ratio, éJ. Receptivity,
' ém '
B , é®ð
Recipe, éK
Q
m
Rational,
Rave on, Recipient,
Recognition, ¬QªK
Raw, ÐAg
¢ªÓ Reconnect, ÈA@ èXA«@
Raw data, ÐAg HAJ
Raw memory, èXQm.× èQ» @ X
Record, éÊJ
j.
Raw mode, Record (verb), ÉJ
j.
Ray, èQk Recover, ¨Ag. Q@
Ray casting,
Recovery, èXAªJ@
Ray tracing, Rectangle, ÉJ
¢Ó
Re-, Rectangular,
Reachable, éJ
Ë@
ÉñJÓ , éJ
Ë@
ÈññË@ áºÖ ß
Recurrence,
Read, èZ@Q¯
Recurse,
Recursion, èXðAªÓ
Refresh rate, IK
YjJË@ ÈYªÓ
Recursion theory, Refuse, ¯P
Recursive, ø P@QºK Refutable, ñ ¯QÓ
Recursive definition, ø P@QºK K
QªK Regenerate, YJ
ËñK èXA«@
Relationship,
Refreshable, Aª Ë ÉK. A¯
KC Relative, úæ
.
Refreshable braille display, Relatively prime,
Refreshable display, Relative path, úæ PAÓ
.
Relative pathname, Repeating group,
Relay, ÉK
YK. ,ÈA®JÓ
Repeat loop, XXQK é®Êg
Relay host, Repetition,
Release, P@Y@
Repetitive strain disorder,
Released version, Repetitive strain injury,
Relevance, éK
Q
J
Öß é®J
£ð Replace, ÈYJ.@
Reliability, HAJ . K , é® K Replaceable unit,
Reliable communication, Replacement, ÈCg@
,È@YJ.@
Relief, èYm.' Replacement algorithm,
Reload, ÉJ
Òm' èXA«@ Replicate, PQºK
, «A
Rip, éJ
Ô¯P ¡Að q
Responsible, Èð ñÓ
Ripcording,
Restart, ÉJ
ª èXA«@
Robot, HñK . ðP
Restore, XAªJ@ Robus,
Restrict, PAJ¯@
Role, PðX
Restriction, PAJ¯@
Roll,
Restructuring, éʾJ
ë èXA«@
Rollback,
Result, éjJ
JË@ Rolling upgrade,
Resume, K AJ@
Room, é¯Q«
Rete,
Root, ø P Yg. ,P Yg.
Retrieve, ¨Ag. Q@ , èXAªJ@ , I . m
Root account, ø P Yg. H . Ak
×
®ÊÓ ÐA¢
Reuse, ÈAÒªJB
@ P@QºK , ÈAÒªJB
@ èXA«@
Root mode, ø P Yg. ¡Öß
Reverse, ñºªÓ Root node, éK
P Yg. èY®«
Reversed, ñºªÓ
Root user name, ø P Ym.Ì '@ ÐYjJÖÏ @ Õæ
@
Reverse engineering, éJ
º« ém.× QK. Root version,
Reverse polish syntax,
Root Window, P Ym.Ì '@ è Y¯AK
Reverse video, ñK
YJ
®Ë@ º« @ Roses,
Revert, ºªK
Rotary debugger,
Revision, éªk. @QÓ Rotate, Èñk P@X ,PðYK
Rough translation, éJ
.K
Q®K éÔg. QK Safe, @
áÓ
Round, PðYÓ Safe mode, áÓ @ ©ð
@
Rounded rhombus, Safety, éK
A¯ð , áÓ
Rounded square, PðYÓ ©K. QÓ Safety-critical system,
Round-robin, Salt, iÊÓ
Round-trip time, Salt substrate,
Route, K
Q£ Salutation, ÐC , I . J
kQK
Routed,
Salvage, èXQmÌ '@ éÒJ
¯
Route flapping, Sample, ú«
P A¢k Scan, iÓ
Run-time error, úÎJ
ª áÓ
Qk Q¯
Scratch disk, é Searching,
Scratch file, é
Q. k ÊÓ . Ë@ éÊÊ
Search string, IjJ
.
Screen, éA Search term, IjJ . Ë@ iÊ¢Ó , IjJ . Ë@ èXQ®Ó
Screen blanker, éA
Ë@ J
J.Ó
Second, úGAK
Ë@ A® JË@
Share, ¼QÓ
, ÑîD
Signal, èPA@
à@ ñJ«
Shared-address, ¼QÓ Signalling rate, H@ P AB @ ÈYªÓ
èQ» @ X
Shared memory, é»QÓ Signature, ZAÓ@
Shared object, ¼QÓ
á KA¿
Signature block,
m× QK
Shareware, éJ
J.
HAJ Significance, úæªÓ , éËBX
. .
Shar file, Silently, úGñº
Skip, ù¢m'
I¯@ QÓ
Sniffer, éºJ.Ë@
Skolemisation, Snippet, ©¢®Ó
.
Skrog,
Snooze, èñ®« , èZA®«@
Skulker, Social science number,
Sky, ZAÖÞ
Socket, .®Ó
Slant, SOCKS Server, 'ð é ÈXAK
Slash, Softcopy,
Slashed Cross, úæ ðQ» Soft key,
Slave, ©K. AK Soft keys, ÈñjJË@ iJ
KA®Ó
Slave cycle, Soft limit,
Slave driver, Soft link,
Slave server, Soft return,
Sleep, ÐñK
Software, éJ
m.× QK.
Sleeping, Õç'A
K Software audit, l×. AK Q.Ë@ m¯ ,l×. AK Q.Ë@ éK. A¯P
Slice, ém
' Qå
Software bug,
Slide, ËQK
, ém
' Qå
Software development kit, l×. @QK. QK
ñ¢ éJ.J
®k
Slider, QK
QÒJË@ ¡
Qå
Software development life cycle,
Sliding-window, Software enabling,
SLIP, ©J
Software engineering, HAJ
Jë
m.×Q.Ë@ éY
Slog, Software Foundation, ¨PA¯ A
@
Slogan, PAª Software handshaking,
Slot, éjJ¯ Software interrupt,
Slow, Zù¢. Software law,
¢ ¬P A¢Ó
Slow terminals, éJJ
. Software life-cycle,
Software metric,
Span, éëQK. ,¨A@
Software patent, Spanning tree algorithm,
¯
Software piracy, l×. @Q.Ë@ éJQ Spare, ù£AJ
Jk @
¯
Spoofing,
Star network, éÒm.' ɾ úΫ éºJ.
Spool, èQºK.
Start, éK
@YK.
Spooler, Start bi,
Spread sheet, H
Starting, ZYK.
. Ak é¯Pð
Spreadsheet, YJÜØ ÈðYg. Start tag,
Spread spectrum communications,
Startup, ÉJ
ª Ë@ ZYK.
Sprite, Startup files, ZYJ.Ë@ l×. AKQK . HA
®ÊÓ
Sprocket feed,
Startup Program, ÉJ
ª ZYK. l×. AKQK .
Spyware, m.' l×. AKQK
State, éËAg
.
Square, ©K. QÓ State diagram,
Square bracket, ©K. QÓ ñ¯
Stateless,
Square numbers, éªK. QÖÏ @ X@Y« B@ State machine,
Squatting, ZA¯Q®Ë@ (ñÊg.) Statement,
Stabilize, State transition diagram,
Stack, P
, éP
Static, úGñº , IK . AK
Text area, ©J
ÊJ.JË@ ékAÓ Transitive, éK
YªJÓ
Text only, ¡®¯
Translate, Ñk. QK
Textual name, ÈññÖÏ @ Õæ
@
Transmission channel, èA J ¯ Ê «
m Ì '@
XY. éÓY
Theme, éÖÞ
ÈAPB
@
Transparent, ¬A®
Thesaurus, QºÓ
Third-party, Transpose,
Third-party repository,
Trash, HCÒêÓ
Tree, èQm.
Thread, é ¯AJÓ
Triangular numbers, éJÊJÖÏ @ X@Y« B@
Threading, I . ª
Threshold, : éJ.J«Ë@ Trim,
Thumbnail, èQªÓ
Tty,
Turing Machine, éË B@ Ê«
Thumb Nails,
Tick, Tutorial,
Ticker Properties, éÖß A®Ë@ Ak
Tweak,
Tilde, èYÓ Type, ¨ñK
Type bindings, éJ
J.JË@ ¨ñK
Tile,
éJJ
ë
¯ñË@ Type mismatch, ¨ñJË@ ú¯ ¬C Jk@
Time format, I
DK@ ,
éÊêÓ
Timeout, éÊêÖÏ @ Iî
Typesetting,
Timer, I ¯ñÖ
Ï @
Timestamp, U
Time stamp, Õæ
Ê Q
« I
¯ð
Ubiquitous computing,
Timezone, Ultra-large-scale,
Timing, IJ
K
¯ñ Umount, É ¯
Tint, Unary,
Tip, Unary operator,
ñJ«
Title, à@ Unasserted,
Unavailable, Q¯ñJÓ Q
«
University, éªÓAg.
Unchanged, Q
ªÓ
Q« Unix, ºK ñK
Undo, (ÉK
YªK) ©k. @QK Unproto,
Undocumented feature, Unpublished,
Unexpected end, 骯ñJÓ Q
« éK
AîE Unread,
Unexpected error, ©¯ñJÓ Q
« A¢k Unread only,
Unfold,
Unrestricted, Pñm× Q
« , YJ
®Ó Q
«
Ungroup, Unsent,
Unhide, PAê£@ Unshielded twisted pair,
Unicode, Ym ð@ ' Unspecified, XYm× Q
«
Unification, Unsubscribe, ÉJ
j.Ë@ ZAªË@
Unifier, Unsupported, Ðñ«YÓ Q
«
Uniform resource, Untitled, àñ Q
«
JªÓ
Uniform Resource Identifier, XPñÖÏ ú
×A¢ ¬ QªÓ
Untyped,
Unify,
Unzip, ÊÖÏ @ ¡ª ½¯
Uninstall, Up,
Uninstaller, Uparrow,
Union, Update, IK
Ym'
Uniprocessor, Updating,
Unique,
Upgrade, éJ
¯QK
Unique key, Upgradeability,
Unique sales point, Upload, ©¯P
Unit, èYgð Upper,
Unit in last place, Upper bound,
Unit testing, Upper case, Q
J.» ¬Qk
Universal, Upper memory block,
Universal address, Upper Stream,
Universal quantifier, Upright,
Universal thunk, Upstream, PAJ
JË@ ø Xñª ,H
. AJ
B
@ ø
Xñª
Universe of discourse, Uptime,
Upward closure, Value added retailer, é¯AÓ
Q
®Ó ©KAK
éÒJ
¯ ð X
.
Urban legend, Values, Õæ
¯
Urgent, Ég. A« Vampire tap,
Urgent condition, ø PðQå Qå
Vanilla,
Wallpaper, éA
Ë@ éJ
®Êg Wedgie,
Wank, Week, ¨ñJ. @
Want list, Weekday, PAîE
Warchalk, Weekend, ¨ñJ. B@ éÊ¢«
Wardialer, Weeks, ©J
K. A @
Wardriving, Weight, à Pð
Warez, Weighted search, àð PñÓ Im '.
Warning, P@ YK@
Well-connected,
Warranty, àAÒ Ë@ Well-known port, ¬ðQªÓ Y®JÓ
Watch, éJ.¯@QÓ Well-ordered set,
Watch file, ÊÓ ZA®JK@
Whacker,
Water, ZAÓ Whalesong,
Watermark, éJ
KAÓ
éÓC« Wheel bit,
Wave, ék. ñÓ While,
Wave division multiplexing, White, J
K.
@
Wavelength division multiplexing, White box testing,
Wavelet,
White paper, úæ ®K YJ Ó
Wavetable, Whitespace, ÉA¯
Wavetable synthesis, White trash,
Wavyline, Wide area network, éª@ð éºJ.
Weakly typed, Wide character,
Q« ¬Qk
Weak typing, Widge,
Web, H
Widget, ék. Xð
. ð
Web browser, éºJ.Ë@ JÓ Widget class,
Webcam, Widget instance,
Web cam, éJ
ºJ. èQÓA¿
Widget set,
Webcasting,
Widow, éÊÓP @
Webhead, Width, Q«
Weblint, Wi-fi,
Weblog, Wi fi,
Web master, ©¯ñÓ QK
YÓ
Wiggles,
Webmaster, ©¯ñÓ QK
YÓ
Wiki, ú¾K
ð
Webmin, Wild card, ZAg. ñë é¯A¢.
Webmistress, Wildcard, ÈYK. ¬Qk
Webmonkey, Winbind,
Webpage,
Window, è Y¯AK
Web page, éJ
ºJ. éj®
Window control,
Web server, I
K
ð Õ®ÊÓ Window frame, è Y¯AJË@
PA£@
.
ÐXAg
Webserver, éºJ.Ë@ Window gravity,
Website, I K QKB@ úΫ ©¯ñÓ Window icon, è Y¯AJË@
éKñ ®K @
Web smith, Windowing system, Y¯@ñJË@
ÐA¢
Ñ¢ JÓ
Window manager, Y¯@ñJË@ Workspace, ÉÒªË@ ékAÓ
Window raster, Workspace object,
Windows, PðY JK
ð Workspaces, ÉÔ« HAgAÓ
Windows messaging, Workspace switch,
Window system, Y¯@ñK ÐA¢ Work station, ÉÔ« é¢m×
Wipe, Workstation, ÉÔ« é¢m×
Wired, ú¾Ê Workweek, ÉÔ« ¨ñJ. @
Year, éJ
Worksheet, ÉÔ« é¯Pð
ñJ
Years, H@
Yellow, Q® @
Yes, ѪK
Yield, YKA«
Yocto-,
Yotta-,
Yottabyte,
Z
Z-axis, úæJ ×
«Pñm
×
Z-buffer, I . KQÓ I¯ñÓ à Qm
Z clipping,
Zepto,
Zero, Q®
Zero assignment,
Zero-content, øñJjÖÏ @ Q®
¯
, øñJjÖÏ @ ¨PA
Zero-order,
Zero state, éK
Q® éËAg
Zetta-,
Zettabyte,
Zigzag,
Zigzagline,
Zip Drive, I
£ Q ¯
Zip file, ñª Ó ÊÓ
Zombie, úæÓð P
.
Zombie process,
Zone, A¢
Zoning, £AJÓ
úÍ@ Õæ® K
Zoo, HA K@ ñJ
mÌ '@ é®K
Yg
Zoom, Q
J.ºK
Zoom in, Q
J.ºK ,Q. »
Zoom Out,
Zoom out, Q
ª ,Q ª
FreeBSD Documentation License
. é£ñ
®m × ñ ®m Ì '@ É¿ . Arabeyes.org , 2006 qË@ ñ ®k
. ð
@ ÉK
YªJË@ YªK. Ð@Yj JB@ð ©K
Pñ
ð @ (SGML DocBook) PYÖÏ @ éJJ
ë ú
¯ éKðYK JË@ èXAªK. iÒ
ÖÏ @ HA
: éJ
K B@ ðQåËAK. (tÌ '@ ... RTF ð @ P ostScript ð @ PDF ð @ HTML ð @ (SGML éªÒj . JJ
êË@
¬Q¢Ë@ ZCë@ð è Yë ðQåË@ éÖ ß
A¯ ð èC«
@ Pñ»YÖ Ï @ qË@ ñ ®k Q¢ A ® JkB@ ÕæK à
@ Im'
.
..
éJJ
ë ú¯ ©K
Pñ
JË@ èXA« @ YJ« Q
ª K àðYK
. èAKX @ Pñ»YÖ Ï @
. (SGML DocBook) éK
PYÓ È@ èQ®Ë@
Q¯ñ
K ÕæK
:ÐAë
B . ¬Yë ø ZÈ éJ¯AJ Ë ð
@ èPAjJË@ È iJJÖ Ï @ éJ AJÓ HA KAÖ Þ ø
@ AîD¯ AÖß. , éJ¢J . Ó ð
@ ém
' Qå HA KAÖ Þ ø
@
. . .
Q Q
'
Xñ®Ó
« ð @ Qå
AJ.Ó
« ð @ Qå
AJ.Ó ,
ñªK ø
@ á« éJ
ËðZÓ ø
@ QK
@ H. Q« ú
¾K
ð K
Q¯ ÉJ
Òm áºÖß
ð
@ hAK P
@ ð
@ HA
K. èPAk ; éÊK YK HAÓY
k . KAJ
. g ð @ ©Ê ZAJ J¯@ Aë ú
¯ AÖß.) ù
ªJ.K ð @ ú
G. A®« ð @ Ag ð @
I KA¿ Z@ñ AîDÊ« éJ
. Ë@ é¯C« Z H Õç' úæË@ éK
Q¢ JË@ I KA¿ AÒêÓ (ÉÔ« ú¯ ÉgY K ð
@ ; Ð@Yj J@
ÉJÓ ¨ñ¯ð áÓ
@ Yë
.QåË@ QK
YjJË@ Õç' ñË úæk , J
KñJË@ @ Yë Ð@Yj J@