Вы находитесь на странице: 1из 76

ú

GAÓñʪÖÏ @ ú
æ ® JË@ €ñÓA


®Ë@
Q
ú
G. Q« ø

Êm. @ '
English Arabic
Technical Computing Dictionary
èQm Ì '@ ©K PA‚Ö Ï @ IK QªK ‡K Q¯

.

Free Software Arabisation Team


http://wiki.arabeyes.org/Technical Dictionary

Version: 2.0.29-02-2008
February 29, 2008

This is a compilation of the Technical Computing Dictionary that is under development


at Arabeyes, the Arabic UNIX project. The technical dictionary aims to to translate and
standardise technical terms that are used in software. It is an effort to unify the terms used
across all Open Source projects and to present the user with consistant and understandable
interfaces. This work is licensed under the FreeBSD Documentation License, the text of
which is available at the back of this document. Contributors are welcome, please consult
the URL above or contact doc@arabeyes.org.
 éÒ  ¢ @ Ñ«YË QK AK Q« ¨ðQå„Ó Q« èQK ñ¢ ÕæK ø YË@   
ÉJ
ª ‚ Ë@
. .


ú
æ ®JË@ ú
G. ñƒAmÌ '@ €ñÓA®ÊË éj‚ è Yë
 J‚ÖÏ @ éJ J ® JË@ HAjÊ¢’Ö
l×. @QK. éÔ g. QK ú
¯ éÊÒª  Ï @ YJ
kñKð éÔ g. QK úÍ@ €ñÓA®Ë@ .ºKñJ
 ¬YîE  J‚Ë@

ËAK. éîD



. 
ÐYj J‚ÒÊË éÒj  ‚Óð
.
éÓñê
 ®Ó H ñƒAg éêk
.
 @ð Õç' Y® JË ð á Ôg QÖÏ @ á K H PA’ JË@ ø XA® JË , H ñƒAmÌ '@
.

.
. .
.

.€ñÓA®Ë@ éK
AîE ú
¯ èQ¯ñJÖÏ @ ð †ZAKñÊË ø
X € @ ú
G. ø
Q¯ é’kP ù
ë €ñÓA®Ë@ é’kP . éJ
K. QªËAK. ÕξJÖÏ @
         
ZAg QË@ , á ÒëA‚ÖÏ @ ɾK IkQK
. doc@arabeyes.org úΫ ÈA’B@ ð @ èC« @ à@ ñJªË@ úÍ@ H. Aë YË@ .
. .
Action, Z@Qk. @
, Activate, ¡J
‚ K

Active, ¡J
‚ 


A Activity,  A‚ 

Abort, Aêk .@ Actor, É«A¯

Abortive release, ‘êm .× (ú¾J.ƒ)  ¨A¢® K@ Actuator, ɪ ‚Ó


Adapt, ­J
J
ºK
Abscissa, éʓA¯
   Adapter, ­J
ºÓ

Absolute, ( éÒJ
¯) ( é)®Ê¢Ó
 ñJ« Adaptive answering, éJ
®J
ºK éK. Ag. @
 
Absolute address, ‡Ê¢Ó à@
 Adaptive learning, ù®J
J
ºK ÕΪK

Absolute path, ‡Ê¢Ó PA‚Ó

Absolute pathname, ‡Ê¢Ó PA‚Ó Õæ…@
 Adaptive routing, ù®J
ºK éJ
k. ñK
 

Abstract, XQm .× Add, é¯A“@


Abstract class, XQm.× ­J“
Add-In,
 KAJ
K. ¨ñK Add-in, ¬A’Ó

Abstract data type, XQm.× HA

K. ¨ñK
 KAJ Additional, ú¯A“@

Abstract datatype, XQm.× HA

Additive, ú×AҒ @
Abstract interpretation, XQm.× ÉK
ð AK
 Address, à@
ñJ«
Abstraction, YK
Qm.'
Abstract machine, èXQm.× éË @
  Address book, áK Q¯X

ðAJªË@
 
Abstract method, èXQm.× é®K
Q£ Address bus, áK
ðAJ« ɯA K
 
Abstract syntax, èXQm.× éJ
K. Addressee, éJ
Ë@ ɃQÓ
    Addressing, éKñ
 J«
Abstract syntax tree, èXQm.× éJ
K. èQm.… 
Accelerated Graphics, Adjacency, PðAm.'
Accelerator, ¨Qå„Ó
 Adjacent, PðAm.×
  
Adjust, éK
ñ‚
Accent, é»Qk
Accept, ÈñJ.¯
 Admin, QK

 
Acceptance testing, ÈñJ.®Ë@ PAJ.Jk@ Administration, èP@X@

Access, XA®K Administrative, ø P@X@
ÕºjJË@ éÖ ß A¯

Access control list, XA®JËAK . Administrator, QK



  Advance, ÐY®K

Accessibility, ékAK@
Advanced, ÐY®JÓ

Accessible, hAJÓ
øñJ‚Ó 
Affix, èYK@ P
Access level, XA®JË@
èQ» @ X 
Agenda, èQº®Ó
Access memory, XA®JË@
Agent,  ñ ®Ó

Accessory, úÍAÒ»

Aggregate, ÉÒm.×

Account, H . A‚k
 . A‚mÌ '@ Q
J
‚ Aggregate type, ÉÒm.× ¨ñK

Accounting management, HAK
 Aggregation, ©J
Òm.'

Accumulator, Ñ» QÓ
Accuracy, é¯X
 Aggregator, ©Ò  m.×

¯Q« Aging, ÐXA®K

Acknowledgment, Qºƒ , àA
Acoustic coupler, AGP,
 @ 
Agree, ‡¯@ñÓ
Acquire, H. A‚»
Agreement, †A®K@

Acronym, PA’Jk@

Airbrush, é«AJ.“ X@ XQÓ
Announce, àC«@

Alarm, éJ.JÓ Announcement, àC«@
Alarm clock, éJ.JÓ Anonymous, Õæ…B@ Èñêm.×
 @ ¡Öß
Aleph, ­Ë @ Answer mode, éK. Ag. B

Alert, éJ
J.K
 
Anti-aliasing, á ‚Ë@ éË@P@
Alert box, éJ
J.JË@ P@ñk
 
Antialiasing, á ‚Ë@ éË@P@
Algebraic data type, ø Q.g. HA  Antisymmetric, ÉKAÒJÓ B

 Q  KAJ
K. ¨ñK  Q
¯ XA’Ó
Algebraic structure, éK
.g. éJ
K. Anti virus, HAƒð
Algorism, éJ
ÓPP@
 ñk Antivirus, HAƒð  Q
¯ XA’Ó
Algorithm, éJ
ÓPP@
 ñk Antivirus software, HAƒð  Q
®ÊË XA’Ó l× AKQK
.
    ñk .
Alias, éJ
J» Anytime algorithm, éJ
J¯ð B éJ
ÓPP@
Aliasing, á ‚
 Apostrophe, AJ
Ê« éʓA¯

 
Aliasing bug, á ‚ ÉÊg Appear, Pñê£

Align, è@ XAm×

Append, †AmÌ '@
Alignment, è@ XAm×
 Applet, i.Öß
QK.
Allocate, Application, ‡J
J.¢
 
Allow, hAÖޅ Application Launcher, ‡J
J.¢JË@ ɪ ‚Ó
 
Alpha, A®Ë @
Applix,
Alpha channel, A®Ë @ èAJ ¯
   
Apply, ‡J
J.¢

Alphanumeric, ø XY« ø Ym.'. @ Approval, P@Q¯@
  

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, ZAƒP@

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' ùªÖޅ
 

Article, éËA®Ó Audiographic teleconferencing,


 ù
ªÖޅ ¨AÒ Jk. @
Artifact, ù¢J
¢m'
YªK. á«
 

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.×  

Assembler, ©Ò Autodetect, úÍ @ ­‚»


Assembly code, ©J
Òm.' èQ®ƒ
   
ªK
Autofill, éJ
Ë @ éJJ
   . 
Assembly language, éJ
ªJ
Òm.' éªË Autoloader, úÍ @ ÉÒm×
Asserted,

Automata theory, ÉJ
ª ‚ Ë@ éJ
K@ YË@ HB
   B@ éK Q¢ 
 

Assertion, YJ
»ñK Automated testing, úÍ @ PAJ.Jk@
 JÒÖÏ @ Q
J
‚ 

Asset management, HA¾Ê Automatic, úÍ @




Assign, á 
J
ªK Automatically, AJ
Ë @
 
Assignment, á 
J
ªK Automation, úÍ @ ÉJ
ª ‚ 

Assignment problem, ( ém.× QK.) á 
J
ªK éË A‚Ó
 Automaton, úÍ @ ɪJ‚Ó

 


Assistant, Y«A‚Ó Autotrace, úÍ @ ©J.K
 

Associative array, éJ
¢. @QK é¯ñ®’Ó Auxiliary, ú¯A“@
 
'
Associative memory, éJ
¢. @QK èQ» @ X Auxiliary storage, ú¯A“@

áK
Qm
Asterisk, Availability, Q¯ñK
Asymmetric, Q£ AJ JÓB
Available, Q¯ñJÓ


Asymmetrical, ø Q£A

JK B Avatar, PAJ¯ @
Asymmetrical modulation, Average, ¡ƒñJÓ
Asynchronous, úæÓ@  Average seek time, 颃ñJÓ Im
  '. èYÓ

QK B  
Asynchronous logic, úæÓ@QK B ‡¢JÓ Away, I . KA«


Atom, èP X Away message, H . AJ
« éËAƒP
Atomic, ø P X
Axial, ø Pñm×



Atomicity, Axiom, éJ
îE
YK.

At sign, @ éÓCªË@ Axiomatic semantics, éJ
îE
YK. HAJ
 
ËBX
  
Attach, †A¯P@

Axiomatic set theory, éJ
îE
YJ.Ë@ HA«ñÒj  . ÖÏ @ éK
Q¢ 
Attachment, ‡¯QÓ Axis, Pñm×

Attempt, éËðAm×

Attribute, éJ
“Ag
Batch, 骯 X

B Batcher, HAª  ¯X lÌ. 'AªÓ
Babbleprint,
 JÓ éҒ
é¯ñ¢ 
. Batch file, HAª  ¯ YË@ ­ÊÓ
Back, ¨ñk. P Batching, ©J
¯YK

Backbone, XAÔ« Batch processing, HAª  ¯YËAK ém Ì 'AªÓ
  . .
Backbone site, ø XAÔ« ©¯ñÓ Battery, éK
PA¢.


Back door, ÐA¢ JÊË
ø Qå… ÉgYÓ Baud, XñK.

Backend, ù®Êg úæîDJÓ Baud rate, XðAJ.Ë@ ÈYªÓ



  
Back-end, éJ
®Êg éK
AîE Bay, éjJ¯

Background, éJ
®Êg Beam,
 
Background processing, éJ
®ÊmÌ '@ ú¯ ém.Ì 'AªÓ Beamer, HAK  .
 éʓð 
 '.
Back link, èXñªK . Beam search, ©J
ÓA«X Im
Backlog, Beep, Q
®“


Backport, ú愺« ÉÔg Beeper, Q®’Ó


Back-propagation, ù®Êg PA‚ K@ Behavior, ¼ñʃ
 AJÊ« éʓA
 ¯
Back quote, éÊKAÓ
Bell, €Qk.
Backronym, AJ
‚º« Qk . ñÓ Õæ…@ Bell curve, úæ…Qk. úæj JÓ
Backside cache, ù®Êg AJ.m×

Benchmark, Z@XB@ €AJ


¯



Backslash, ú愺« ÉKAÓ ¡ k Best effort, (... éÓYg) Yêk. ɒ ¯ @


Backspace, ­ÊjÊË ¨@Q¯ Beta, AJ
K.
 AJÊ« éʓA
Backtick, éÊKAÓ
 Beta abstraction, AJ
K. YK
Qm.'


 ¯ 
Backtracking, ù®Êg ©J.K Beta conversion, AJ
K. ÉK
ñm'

 
Backup, éJ
£AJ
Jk@ éj‚ , ù£AJ
Jk@ q‚ , ù£AJ
Jk@ Beta reduction, AJ
K. È@Qg@

 

Backup rotation, ù£AJ


Jk@ I . ¯AªK Beta testing, AJ
K. PAJ.Jk@

Backup software,  AJ


Jk@ l×. AKQK . Beta version, AJ
K. P@Y“@

Backward analysis, ­ÊmÌ '@ úÍ@ ÉJ
Êm'

Bibliography, ©k. @QÖÏ @

Backward chaining, ­ÊmÌ '@ úÍ@ Y®“
BiDi,
Backward compatibility,  P @Y “B @ ‡ ¯@ ñ K
H@  @ éJ KA J K
Bidi, èAm.' B

é®K . A‚Ë@ Bidirectional printing, èAm.' B@ éJ


KA
  J K é«AJ  £
.
Backward compatible, AJ
®Êg
‡ ¯@ ñJÓ
Big-endian, Q
J.ºJ
¯Q£
Balance, à P@ ñK Bijection, ÉK. A®K

Bandwidth, †A¢JË@
 Q g  J K éª  ¯P

Bilinear patch, éJ
KA

Banner, éJ¯B 
Binary, ùKA
Bar, ¡
Qå…

JK ø Qå„«
J K Q ÓQÓ
Binary coded decimal, AJ
KA
Bareword, Binary exponential backoff, ùKA J K
úæ… @ Xñ¯P
 
J K á KA¿

Base, èY«A¯ , €Aƒ @ Binary large object, Ñm• ùKA



Baseband, úæ…Aƒ @ †A¢

Binary package, éJ
KA
 J K éÓ Qk

Base class, úæ…Aƒ @ ­J“ Binary search, ùKA J K Im  '.



Baseline, úæ…Aƒ @ ¡k Binary tree, éJ


KA
 J K èQm…


  .
Base memory, éJ
ƒAƒ @ èQ» @ X Bind, ¡. P

Basename, úæ…Aƒ @ Õæ…@ Binding,

Binding handle,  AJ.KP@ ‘J


 . ®Ó Bolt,
Binding-time analysis,  AJ.KPB@ I
 ÉJÊm'
 ¯ð Boo,

Binomial distribution, úÍñK Q


K. ©K
Pñ K Book, H 
 
. AJ»  
Bioinformatics, éK
ñJ
k éJ
KAÓñÊªÓ Book mark, ©¯ñÓ éÓC«
Bipolar, I ¢®Ë@  ùKA J K Bookmark, ©¯ñÓ éÓC«
 
.
  J K ,
éJK 
Bit, èP X , éJ
KA .     Boolean, ù®¢JÓ
Bit block transfer, IK Boot, ¨C¯@


 . éÊ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


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ð éËAƒP
  .
Blend, Bound, YJ
®Ó
Blending, h. QÓ Boundary scan, ø XðYg i‚Ó

Óð

Blink, ‘J Boundary value analysis,


Blinking cursor, ‘ . AK Qå…ñÓ 
Bounded, Xð Ym× , èAJ JÓ
Bloat, Boundedly complete,
Block, Q¢k , Y“  Bounding box, é£Ag@ ©K. QÓ

Block buffer, Bound variable,
Blocked, ¨ñJÜ Ø  ,©K QÓ
Box, †ðYJ“
   . 
Blocked record, éÊJºÓ éÊJ
j.‚ Boxed comment, ©K. QÓ ‡J
ʪK

Block-structured, ÉJ» éJ
K. ð X Bpp,
Block (unit), éÊJ»
 
Brace, èQå•Ag
 Bracket, €ñ¯

Block (verb), YJ
Òm.'
  
Blog, éK ðYÓ Bracket abstraction, €@ñ¯ B@ YK
Qm.'
Bluetooth, Braille, ÉK
@QK.
ÐY« , (Õæ…P) éJ
K. AJ.“ Branch, ¨Q¯

Blur, hñ“ð
  
Branch coverage testing, ¨ Q®JË@ éJ
¢ª K PAJ.Jk@
Blur image, éÖß A« èPñ“

Branch delay slot, ¨ Q®JË@ ÉJ
êÖß éjJ¯

Board, ékñË
 Branch prediction, ¨ Q®JË@ ©¯ñK

Body, á Ó
Bogon filter, Brand,

Q«  . Ë@
Bold, ‘ Breadth-first search, Bð @ QªËAK . IjJ
Break, Q儻

Bus cycle, ɯ@ñK èPðX

  ® K@
Break point, Q儻 颮J,«A¢
 ® K
é¢ Bus device, ɯAK PAêk

   
Breakpoint, 骣A®ÖÏ @ 颮K Bus error, ɯAK A¢k
 .
Break (program), ¨A¢®K@
 Business to business, ÉÔ«ð ÉÔ« á 
K. èQk. AJÓ

Break statement, ¨A¢®K@ èPAJ.«
  Bus master, ɯ@ñK 
KP

Bricks, H Bus mastering, ɯ@ñK éƒAKP
 
. ñ£    
Bridge, Qå„k. Bus network, éJ
¢ k éºJ.ƒ , éK
ðQå„Ó éºJ.ƒ
 
Bridge (noun), Qå„k. Bus priority, ɯ@ñK éK
ñËð @
Bus request, ɯAK I
 ʣ
Bridge (verb), Qå„k . . 
  
Bus sizing, ɯ@ñK Õæ
j.m'
Briefcase, éJ.J
®k
Bus watcher, ɯAJË@
 I¯@ QÓ
Brightness, ¨ñ¢‚Ë@ .

Broadband, ©ƒ@ð †A¢ , ©ƒ@ð ø XXQK †A¢
 Busy, Èñª‚Ó 
.
Button, P P
Broadcast, IK
 
Broadcast quality video, éJ
«@ X@ èXñk. H@  X éJ
KQÓ
Button binding, P@P P @ ¡. P
Brochure, éƒ@Q»
  , IJ» Button grab,
.
. QK .
Broken, Pñ‚ºÓ , H Buzz, QK
. ñ¢ªÓ .'
Broken line, ¨ñ¢®Ó ¡k Bypass, PðAm
  Byte, ø Qk . , IK 
AK.
Browse, i®’

KAÖ ß éKñ J«
Browser, i®’JÓ Byte addressing, HAJ
  ¯ Byte-code, éJ
KAÖ
 ß èQ® ƒ
Brush, èAƒQ
   Byte-code compiler, éJ
KAÖ
 ß èQ® ƒ Ñk QÓ
Brute force, éJ
ƒA¯ èñ¯ .
    Byte-code interpreter, éJ
KAÖß èQ®ƒ È ð ñÓ
   
Brute force attack, éJ
ƒA®Ë@ èñ®ËAK. Ðñj.ë
Byte compiler, éJ
KAÖ
  
ß èQ®ƒ Ñk. QÓ 
Bubble,
Byte order, HAJ 
KAÖ ß I
KQK
Buddy, I . kA“ .

Buffer, à@ñ“
Buffered write-through, C
Buffering, áK
ñ’ C, úæ…
ñ’Ë@ àA ¯ñ£

Buffer overflow, à@ Cable, ÉJ.»



Bug, éÊ« Cable modem, ÐXñÖÏ @ ÉJ.»
Bug fix, ÉÊg hC“@
 m × èQ»@ X
Cache, éJJ . 
Bug fix release, iÊ ’Ó P@Y“@ Cache block, AJ.m× éÊJ»
 
Bug tracking system, ÈCg éªK. AJÓ ÐA¢  Cache coherency, AJ.m× ½ƒAÖß
× 
Build, ZAJK . Cache conflict, AJ.m ú¯ PAªK


 Cache consistency, AJ.m× ½ƒAÖß

Built-in, á ҒÓ

Bullet, é“A“P , X@YªK éK

 Cache controller, AJ.m× ÕºjJÓ
 ® K ékAƒ
 
Bulletin Board, €A Cache hit, AJ.m× éK. A“@
 ÐA¢ 
 Qå„JË@ ékñË
Bulletin board system, H@ Cache line, AJ.m× Q¢ƒ

Bullet list, Cache memory, AJ.m×

Burn, Cache miss, AJ.m× ZA¢k@

Bus, ɯAK Caching, I áK
Q m '
 ¯ñÓ
Bus arbitration, ɯ@ñJË@
 Õºk Caching-only, ¡®¯ ZI
 k
.
 
m' ÐXAg , ZIk ÐXAg   
Caching server, éJJ . . Carrier signal, éÊÓAg èPAƒ@
Calculate, H Cartesian coordinates, éJ
KPA¾K
X HAJ
 
K@Yg@
. A‚k 
Calculation, H . A‚k Cartesian product, úGPA¾K
X Z@Yg.


Calculator, éJ.ƒAg Cascade, úÍAJK



  
Calendar, Õç'
ñ®K Cascaded list, ék. PYÓ éÖß A¯
Calibration, Cascading style sheet,
Call,

Case, éËAg

Callback, (ÐA¢ ) Z@YK XP

Case based reasoning, éÊJÓ B@ úΫ á .Ó Q
º®K

 
Call-by-name, Õæ…BAK. Z@YK Case (font), ( ¬QmÌ '@) éËAg ,( ¬ðQk) Q.»

Call-by-need, ék. AmÌ 'AK. Z@YK Case insensitive, ¬ðQmÌ '@ Q.º K. QK AJÓ Q
«
Call-by-reference, ©k. QÖÏ AK. Z@YK

Case Sensitive, ¬QmÌ '@ éËAmÌ €A‚k
 
Call-by-value, éÒJ
®ËAK. Z@YK
 
Case-sensitive, ¬Qk B@ éËAmÌ Q
ÜØ
    
Call-by-value-result, éÒJ
®Ë@ éj.J
JK. Z@YK Case sensitivity, ¬ðQmÌ '@ Q.º K
. QK AK
 
Callee, øXAJÓ Case statement, éËAg èPAJ.«
Calling convention, Z@YK †A®K@
 Cast,
Callout, Z@YK Casting,

Call-with-current-continuation, éʓ@ñ ÖÏ AK. Z@Y K Catalog, XQå„Ó ,h. ñËAJ»
éJ
ËAmÌ '@ Catch-all-entry, Ég@YÖÏ @ É¿ ‘J
. ¯
Camera, èQÓA¿
  ®J


Categories, HA
Cancel, ZAªË@ Category, éJ ¯

 
Candidate key, l…QÓ hAJ®Ó Catenet,

Canonical, úGñKA ¯ Cathode ray tube, ø XñKA¿ H@  Qk H. ñJ.K @



Canonical name, éJ
Ê« ¬PAªJÓ Õæ…@ Cationic cocktail, úGñJ
KA¿ ÈñÊm×
 KA ¯
Canonicity, éJ



Cause-effect graphing, úæJ.‚Ó úæJ.ƒ ¡J
¢m'
 (2) ; éJ KñK
.
. 
Canvas, Õæ…QË@ hñË CC, t… AJK
(3) ; ém… AJÓ
. Q» éj‚ (1)
 
Capability, èPY¯ CD, ø Y.J
ƒ

 Õºm' ékñË 
Capacity, 骃 CDE panel, úæ”
Caps,

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»

 

Character string, ¬PAm× éʂʃ Chrominance, éJ


KAÓðQºË@

Char cell, ¬Qm× éJ
Êg

Cipher, èQ®J
ƒ
 
Charityware, ø Q
g l×. AKQK

×  . Ciphertext, Q®‚Ó ‘
Charmap, ¬PAm é£PAg

Circle, èQK@X

Charset, ¬PAm× Õ®£
 
Circuit, èP@X

Chart, úGAJ
K. Õæ…P , é£A¢k
 Circuit switched, È@YK. B 

 @ ø
PðX
Chase pointers, ¨AKñj.’’’ ®K Qå…ñÓ Circuit switching,

Chat, éƒXPX Circular buffer, ø PðX ¡ ®m×

Chatchup, Circumflex, éªJ.¯
 

Chat room, éƒXPX


  é¯Q « Class, ­J“


Chat script, éKXAm×  ñ¢m×
Class hierarchy, ¬AJ“
@ éËCƒ 

Check, Y» AK , ‘m¯

Classic, ø XAJ
J«@ ,ø YJ
ʮK



 
Check (a button), Classical logic, ø YJ
Ê®K ‡¢JÓ


Check bit, ‘j®Ë@ IK Classification, ­J
’
 . 
Check box, Q
ƒ AK †ðYJ“ Classify, ­J
’

@ éJ.JºÓ       
èY®« , éÊJ
’k èY®«
Class library, ¬AJ“ Cluster node, Xñ®J«
 é®K Q£
Class method, éJ
®J“ Cluster-transport, Y‚k  É® K
Classpath, ¬AJ“
@ PA‚Ó
Coalesced sum,
Class variable, ­J“
Qª JÓ Coarse grain, á ‚ k I . k

Clause, YJK. Coax, PñjÖÏ @ YjJÓ ÉJ.»



Clean, ­J
¢  , ­J
¢ K Coaxial, PñjÖÏ @ YjJÓ
Clear, ñm× Coaxial cable, ø Pñm× É“ñÓ

¯
Clear box testing, Cocktail shaker sort,  Cg PQ

Click, Q®K Code,

Click (noun), èQ®K
  
Codebase, èQ®ƒ èY«A¯
Click (verb), Q®K

Codec, PAÓQÓ
Coded character set, Q ÓQÓ ¬PAm× Õ®£
 
Client, ÉJ
Ô«
Client-server, ÐXAgð ÉJ
Ô«
Code division multiplexing,
Client-server model, ÐXAgð ÉJ
Ô«
ß
h. XñÖ Code management, èQ®ƒ Q
J
‚
 
Client-side, ÉJ
ÒªË@ éêk. áÓ
 Code position, QÓP ©“ñÓ
 
Clip art, é“A’¯ Code (program), èQ®ƒ

  
Clipart, éJ
J ¯ é“A’¯ Code segment, èQ®ƒ 骢¯
  
Clipboard, é¢ ¯Ag
 Code (symbol), QÓP
Clip board, HA“A’  ¯ ékñË Code violation, PAÓQË@ (Y«@ñ¯)  †Q  k

Clip list, HA“A’ ¯ éÖ ß A¯  
Code walk, èQ®ƒ éªk. @QÓ
  
Clip mask, é“A’¯ ¨AJ ¯ Codomain,
Clipping, Coefficient, ÉÓAªÓ
Clipping plane, Cognitive architecture, éJ
»@P X@ èPAÔ«
 

Clock, é«Aƒ Collaboration, àðAª K
 
Clock rate, é«Aƒ é«Qå… Collapse, ù£
  

Clock speed, éJ
KA®J
ÖÏ @ é«Qå… Collate, Ð PP

Clone, pA‚Jƒ@ , q‚J‚Ó
Collect,  A®JË@

Clone device, q‚J‚Ó PAêk
Collection, é«ñÒm.×

 . 
Close, †C«@ Collision, ÐXA’
Closed set, é®ÊªÓ
  é«ñÒm  × Collision detection, HAÓXA’   ­ ‚»
Closed surface, é®ÊªÓ
  ékA‚Ó . Colocation, ú¾J.ƒ ÉJ
“ñK
Closed term, ‡ÊªÓ
 Yg Colon, àA J¢® K

 
Close routine, †C«@ èQ
Kð
Color, àñË

Closure, †C«@ Color chooser, à@ ñË @ Q 
m ×
×
ñË B@
Closure conversion, Color map, à@
¡¢
m
Clover key, É®K hAJ®Ó Colormap, à@ñË @ ¡¢m ×
Clumsy,  A£
Color model, à@ ñË @ h XñÖ
 , éʒ  k . ß
Cluster, Xñ®J« Color saturation, à@ñË @ ¨AJ.ƒ@ 
Cluster file, Y‚k  ­ÊÓ Colour, àñË
Clustering, Y‚k  Colour depth, à@ ñË @ ‡Ô «
 ñ’«  '
ñË B@
Cluster member, Y‚k Colour look-up table, à@ á« Im . ÈðYg.

ñË @ h XñÖß 
Colour model, à@ Compatibility, ‡¯@ñK
. 
Colour palette, à@ñË @ ékñË Compatible, ‡¯@ñJÓ
Column, XñÔ«

Compilation, ­K
Qå”
Column span,

Compile, ­K
Qå”
  
Combination, éªJ
Òm.' Compiler, ¬Qå”Ó
    
Combinator, éJ
®¯@ñK éË@X Compiler compiler, Ñk. QÓ Ñk. QÓ
Combinatory logic, ù®¯@ñK ‡¢JÓ
  
Complement, éÊÒºK

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’ ¯

Command button, QÓ @ P P Completeness, ÈñÒ»



Command interpreter, QÓ@ð @ Èð ñÓ Complete partial ordering, ÉÓA¿ ùK Qk . I.
KQK


Command key, QÓ @ hAJ®Ó Complete theory, ÈñÒ» éK


Q¢ 

Command line, QÓ@ð B@ Q¢ƒ Complete unification, ÉÓA¿ YJ
kñK
 
Command line interface, QÓ@ð B@ Q¢ƒ éêk. @ð Complexity, Y®ªK
 
Command-line interpreter, QÓ@ð @ Q¢ƒ Èð ñÓ Complexity analysis, Y®ªK ÉJ
Êm'

Command line option, QÓ@ð @ Q¢ƒ PAJ
k Complexity class, Y®ªK ­J“
 P AJ
k  
Command line options, QÓ@ð B@ Q¢ƒ H@ Complexity measure, Y®ªK €AJ
¯
× 
Command Prompt, QÓ@ð @ Im Complex number, I . »QÓ XY«
Comma separated values, ɓ@ñ®K. éËñ’®Ó Õæ
¯
  Complex programmable logic device, PA ê k.

Comment, ‡J
ʪK YJʂ QÊË éÊK
 A¯ Y®ªÓ
.
 ù®¢

 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« ‘A’k
 Composite drive,
Composition, I 
Communication, ɓ@ñK . J
»Q K
 @ 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 . A‚k
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, ÈA’BAK. ék. ñÓ

Computer program, H
 . ñƒAg l×. A KQK. Connection-oriented network service, é ÓY g

Computer security, QKñJ
J.ÒºË@ áÓ @ ÈA’BAK. éê k. ñÓ éJ
ºJ.ƒ
Computer virus, úG ñƒAg €ð Q
¯
 @ ©Òm.×

. Connection pool, HBA’
Computer vision, úG ñƒAg Qå”. 
Connective, úÍA’@ ,¡. @P

.
Compute server, H . A‚k Ð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
¯ ZA“P@ 

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, q‚K

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

Control file, Õºm' ­ÊÓ


 Core gateway,
Control flow, Core leak,

Corner, éK
ð @P
Controller, ÕºjJÓ
 
Control point, ÕºjJË@ 颮K Corollary,
 
Control structure, Õºm' éJ
K. Correct, iJ
m•
Correlation, ‡ËAªK

Correspondence, Ð ðC K Cross-over, Q.ªÓ
Correspondent, Õç'@ ñJÓ , Õç'@ ñÓ Cross-platform, HA’  JÖ Ï @ Q.« , HA’
 JÖ Ï @ XYªJÓ
Corrupt, YƒA¯
Cross-reference, éËAg@

Cos, AJk. Cruft,

Cost, é®Ê¿ Cruft together,
Cost control callback, Crumb,

Count, X@Yª K Crypt, Q
®‚ 
Countable, X@YªJÊË ÉK. A¯
 
Cryptanalysis, éJ
ÒªJË@ ÉJ
Êm'

Counted, XðYªÓ Cryptography, éJ
ÒªK

Counting records, YªË@ HCJ
  j‚ 
Cryptology, Q
®‚ Ë@ ÕΫ

. 
Country code, YÊJ.Ë@ QÓP Ctrl, È QK
Coupling, Cube, I 
. ªºÓ
Coupon, Cubing,
Courseware, Cumulative, ùÒ»@QK

Covariance, Curly bracket,


CPU, lÌ. 'AªÓ Current, úÍAg

Crack, Current directory, úÍAmÌ '@ ÉJ


ËYË@
Crash, PAJ
îE@


Current session, éJ
ËAmÌ '@ é‚Êm.Ì '@
  
Crash dump, ø PAJ
îE@ ©K Current working, éK
PAm.Ì '@ ÈAª ƒ B@ , éK
PAm.Ì '@ ÈAÔ« B@


Q®K
Crawler, H . @X , ­k@P Curried function,
Create, ZA‚@  Currying,
Creation, ZA‚ @
Curses,
Credential, XAÒJ«@

Cursor, ( èP A®Ë@) Qå…ñ Ó


Credential cache, éK
XAÒJ«@ éJ
K. Ag
 
Cursor plane, ‡ËQÖÏ @ i¢ƒ

Credits, QK
Y®Kð Qºƒ
 JÓ
Curve, éJ
Jj
Creeping featurism, H@  Q 
ÖÏ @ ÈAîD…@ Custom, ‘’m×

   
Crisp, ­’ ®JÓ Customization, ‘J
’m'
Critereon, Customize, ‘J
’m'

Criteria, PAJ
ªÓ Custom window, éJ
kC¢“B

@ è Y ¯A JË@
Criteria range, HA
ñÖÏ @ ÈAm×
 ®“@ Cut, ‘¯

.  
Criterion, ½m × Cut and paste, ‡’Ë@𠑯
 ñ“
Critical error, h. Qk A¢k Cut buffer, ‘ ®Ë@ à@
Critical section, h. Qk ZQk . Cutover,

Crop, Cut-through switching,
Cross-assembler, Cyber,
Cross-compiler, Cyberbunny,
Cross-device link, Cybercafe,
 ËA’ 
Crossed, ©£A®K , I . Cybernetics, úÍ B@ ÕºjJË@

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 
¢ªÓ (ÈA’jJƒ@) É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 Ó

Day mode, ¡ÒJË@ Default, ùKYJ .


Deactivate, ɢ 

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. , èY’JÖÏ @ 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

Demo, Q« Desktop manager,
Demodulate, Õæ
K QË@ ­‚»
  , ÕæK QË@ ½ ¯ 
 

Desktop publisher, I . JºÖ Ï @ i¢ƒ PQm×


Demodulation, Õæ
K QË@ ­‚» Desktop publishing, I . JºÖÏ @ i¢ƒ Q.« Qå„
Demo mode, újJ
“ñ ¡Öß
JË@ QªË@ Destination, Y’®Ó


¡k
Demote, éJ.KQË@ áÓ Destroy, Q
ÓYK
Demo version, újJ
“ñ  
Destructor, ­ÊJÓ ,YJ
J.Ó

 JË@ QªË@ èP@Y“@
Denominator, Õæ…A¯ Detach, ¨ Q K
Denotational semantics, Detail, ÉJ
“A®K

Deny, ‘ ¯P
Detect, ­‚»

Depeditate,

Detection, ¬A‚ »@
Dependability, Detective, ­ƒA¿

Dependable software, Deterministic,
Dependence,  AJ.KP@ , éJ
ªJ.K
 Deterministic automaton,
Dependency, éK
XAÒJ«@
 Devel,
Deprecate, à@X @ Develop, P ñ£
Deprecated, Pñj.êÓ Developement, QK
ñ¢

Deprecation, éK@ X@
 Developer, Pñ  ¢Ó
 
Depth, ‡Ô« Development, QK
ñ¢

Depth-first search, Bð @ ‡ÒªËAK. IjJ  . Ë@ Development environment, QK
ñ¢JË@ ¡J

Dereference, .
Device, PAêk
Derivative, ‡J‚Ó
  
Device-dependent, èQ
êj.JÊË ©“A g

Derived, ‡J‚ Ó Device driver, PAêm .Ì '@ ‡ KAƒ
Derived class, é®J‚Ó
   éJ ¯ Device group, H@  Q 
êm.' é«ñÒm
 × , PAêk
.
 ×
. é«ñÒm .
Derived type, ‡J‚Ó
  ¨ñK Q
Device-independent, è 
êj.JË@ áÓ úÍC®Jƒ@   

Descender, ¡. Aë , ¬ñ‚m× Device independent bitmap,


Descending, ú支AJ K
 Device name, PAêm .Ì '@ Õæ…@

.Ì '@ Õ¯P
Descending sort, úÍ PA J K I 
. 
KQK Device number, PAêm

Descent function, Diacritic,


Description, ­“ñË@
Diagonal, ø Q¢¯



Descriptor, ­“@ð Diagonal line, ø Q¢¯ ¡k
 

Deselect, ZA®JK@ ÐY« Diagram, é£A¢k


Design, Õæ
Ғ

Dial, ­Jë
Design pattern, Dialer,
Design recovery, Dialog, P@ñk
Desk, I   Dialog box, P@ñk ©K. QÓ
. JºÓ , èY ’JÓ @ PAêk
Desk check, úæJºÓ ‘m¯

. Dialout Device, ÈAgXB .
Dial-up, ù®KAë I
Directed acyclic graph,

  . ʣ
Dialup, ù®KAë , é®KAêÓ Directed graph, ék. ñÓ  ñ¢m×

    
Dial-up link, éJ
®Jë éʓð , ù®Jë ÈA’@ Directed set, h. ñÓ èQÓP


K. , èQå…AJ.Ó HAJ
Dial-up login, ù®Jë h. ñËð Direct graphic, èQå…AJ.Ó HA KAJ 
ÓñƒP
Diameter, Q¢¯


Direction, èAm.' @
Diamond, €AÖÏ @ Directional coupler,

Diamond key, úæ…AÓ hAJ®Ó Directive, úæîD
k. ñK QÓ @
®K


 
Dictate, Q Direct mapped cache, ¡J
¢jJË@ èQå…AJ.Ó éJ
K. Ag
Dictionary, €ñÓA¯
  
Direct memory, èQå…AJ.Ó èQ»@ X

Difference, ¬Cg , †PA¯ Directory, ÉJ
ËX
  
Difference equation, †PA¯ éËXAªÓ Directory path, Éj.ÖÏ @ ½Ê‚Ó ,ÉJ
ËYË@ ½Ê‚Ó
® K   
Differential, úΓA Directory service, Éj.ÖÏ @ éÓYg ,ÉJ
ËYË@ éÓYg

Differential backup, úΓA ® K ù£AJ


Jk@ q‚ Directory stack, Ðñº K , YÊj.ÖÏ @ ÐA¿P ,ÉJ
ËYË@ ÐA¿P
Differential driver, úΓA

® K †ñ‚Ó 
, úΓA ® K ‡ KAƒ
ÉJ
ËYË@
Differential line, úΓA

® K ¡ k
Direct virtual,


Dirty, Zø YK. ,t…ð
Diges,


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,


¯ Discrete Fourier transform,


é K Pñ ¯ @ é Ê K ñ m'
Digital envelope, ùÔ P ¬Q£  ® JÖÏ @

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, ZAƒP@
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ñÓ ­ÊÓ 

Dot file, ù¢®K ­ÊÓ


Distributed memory, é«PñÓ
 èQ» @ X
 é¯ñ
®’Ó éªK
 A£
Dot matrix printer,  A®JË@ .
Distributed system, ¨ PñÓ ÐA¢  Dot notation, ù¢®K IK
  ñJ K
Distribution, ©K
Pñ K  


Dot pitch, 颮JË@ èñ¢k


JË@ éÖ ß A¯ 
Distribution list, ©K
Pñ Dotted, ¡®J Ó
Distributive lattice,  
Q « , ù ª K
Pñ K ½ K. A ƒ Dotted quad,
K
ù
ªK


 Double, ­«A’Ó

Distributor, ¨ PñÓ Double click, àA KQ® K
Dither, ùÒëð ÉJ
Ê¢ 
 Q® JK


  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..., ...pA‚Jƒ@
  
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

Dragging, I . kAƒ , I.m… Dynamic adaptive routing,


Drag-n-drop, Dynamically scoped,

Drakconf, Dynamically typed, AJ
ºJ
ÓAJK
X H . ñJºÓ
Draw, ñ“ ,Õæ…P @ Dynamic analysis, ú×AJK
X ÉJ
Êm'


Drawer, Dynamic binding,


Drawing, Õæ…P Dynamic database management system, ÐA ¢ 
Drawing Area, Õæ…QË@ 鮢JÓ
 ú
×AJK
YË@ HA
J.Ë@ èY«A¯ èP@X@
 KAJ
Draw object(s), Dynamic link,

Drive, @Q¯ @ ¼Qm× Dynamic link library,

Driver, †@ñƒ Dynamic random access memory,
Driver kernel, ‡KA‚Ë@
 è@ñK Dynamic routing, ú¾J
ÓAJK
X éJ
k. ñK

Drop, Dynamic scope,


Drop cable, Dynamic scoping,
Dynamic

translation, éJ
ÓAJK
X YJʂQK
Dropdown, È@Y‚@
Dynamic
 
typing, éJ
ºJ
ÓAJK
X éK. AJ»
Drop-down arrow, È@Y‚@ ÑîD… , ÈY‚Ó ÑîD…
  
Drop-down list, È@Y‚@ ém' B , éËY‚Ó ém' B
Drop-down menu, éËY‚Ó éÖß A¯
   E
Droplets, H@  Q¢¯ Eager evaluation,
Drop on the floor, Earliest deadline firs,

Drugged, Earliest deadline first, Bð @ QºK. B@ ú支 B@ Y«ñÖÏ @
Druid, Echo, øY“
Dry run, ø PAJ.Jk@ ÉJ
ª ‚  Echo cancellation, øY’Ë@ ZAªË@
Dual, h. ðXQÓ

 QºËB@ èPAjJË@
E-commerce, éJ
Kð .
Dual-attached, E-ddress,
Dual boot, h. Xð QÓ  
Edge, é¯Ag
ÉJ
ª ‚ 
Dual head, € @QË@ h. ðXQÓ Edit, QK
Qm'
 
Dual-homed, È QÖÏ @ úæ JÓ Edition, éªJ.£ , QK
Qm'
 m×
Editor, PQ Ellipsoid, újÊJ
Êë@

.
Editor pane, Else,
Editor panel, PQjÖÏ @

ékñË E-Mail,
E-dress,

Email, úGð QºË@ YK
QK.

Q
Edu, ùÒJ
ʪK , ø ñK. QK E-mail, úGð ºË@ YK
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, Y‚ m.× ,Õæ„ 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

Electronic funds transfer, úGð QºË@



È@ñÓ@ É® K 
Encoder, Q
ÓQK è@X @
Electronic funds transfer system,
QºËB@ È@ñÓB@ É ® K ÐA ¢  Encoding, Q
ÓQK

ú
Gð 
Encrypt, éJ
ÒªK
Electronic magazine, éJ

 QºË@ éÊm × 
 . Encrypted, Q®‚Ó
Electronic mail, úGð QºË@ YK
QK.

 ñJ« Encryption,
Electronic mail address, úGð QºË@ YK
QK. à@

End, ÐAJk
Electronic meeting, úGð QºË@ ¨AÒJk. @

Endl,
Electronic whiteboarding,
Endless, ùKAî E B ,ø YK @
Element, Qå”J«

. 
Endless loop, éJ
ëAJ JÓB é®Êg
Elephant, ÉJ
¯
Endnote,
Elevator controller, 
End of file, ­ÊÓ éK
AîE
Eliminate,  é¢  ® K

« @ , éJ . m ' Endpoint, éK
AîDË@
Elite, ZAêk. ð , àAJ
End tag,
Ellipse, i.J
Êë@ E ÐYj J‚Ó
End-user, ùKAî

 
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 éËAƒP
 
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

Entries, HA Eta abstraction,


Entropy, Eta conversion,

Entry, éÊgYÓ Eta expansion,
Enumerated type, X YªÓ ¨ñK
 Eta reduction,

Enumeration, ZA’k@ , X@Yª K E-tex,

Envelope, ¬C« , ¬Q£ Ethernet,
 K 
Ethics, †Cg B@ ÕΫ ,H

@X @ ,  AJ.’ @ , Èñ“ @
Environment, éJ
. .
 K Qª JÓ  
Evaluation, Õç'
ñ®K , á 
ÒJK , á 
Òm'
Environment variable, éJ
.

Ephemeral, ùÖÞ ñÓ … Evaluation strategy,



Evaluator,
Ephemeral port, ùÖޅñÓ Y®JÓ


Event, HYg
Episode,
 Event-driven,
Epoch, H . A‚mÌ '@ ZYK. t'
PAK 
Epsilon, àñʂ. @ Every, É¿
Evolutionary algorithm, éK
Pñ¢ éJ
ÓPP@
   ñk
Equal, ÈX AªÓ , ð A‚Ó
Evolutionary computation,
Equalizer, ÈX AªÓ
 Evolutionary programming, éK
Pñ¢ ém.× QK.
  
Equation, éËXAªÖÏ @
    
Evolution strategy, éK
Pñ¢ éJ
m.' @Qƒ@
Equational logic,
Equipment, H@  Yª  Ó Exa-,
Equivalence class, éJ ¯A¾Ó ­J“
 Exabyte, IK 
AK. A‚»@
Equivalence class partitioning, Exact, ÐAK
Equivalence partitioning, Example, ÈAJÓ
 
Exception, ZAJ Jƒ@
Equivalence relation, ñ ¯A¾JË@ é¯C«
Equivalent, ú ¯ A¾Ó
Exception handler,
P Exceptions, HA

 KA J Jƒ@
Era, áÓ
Erase, i‚Ó Excercise, áK
QÖß
Ergonomic, ÉÒªË@ HAJ 
J
K. Excl,
Exclamation mark, I
  
Error, A¢k . j.ªJË@ éÓC«
Error-based testing, Exclamation point, ÉJ
ÊîE éÓC«
Exclude, úæ J‚

 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,

Existential quantifier, Extent,


Existing, Xñk. ñÓ

External, éJ
k. PAg
Exit, h. ðQk
  KAJ
External data, éJ
k. PAg HA
K.
Expand, ©J
ĖK
 
External memory, éJ
k. PAg èQ»@ X
Expanded, © ƒñÓ , YJÜØ , †A¢  JË@ ©ƒ@ð
Extra, ú¯A“@
 

Expanded memory, 骃ñÓ èQ» @ X Extract, h. QjJƒ@
Expanded memory manager, Extranet, I  K@ Q‚»@
Expanded memory page frame, Eyedropper, I’   JÓ ,€ñƒAg.
Expansion, ©J
ƒñK E-zine, à P@

Expansion card, 骃ñK é¯A¢.

Expansion slot, ©J
ƒñK I . ® ƒ  F

Expect, ©¯ñK , I

. ®KP@    
Facsimile, ɓ B@ ‡J. £ éj‚ 
Expected location, I . ®KQÖÏ @ ©¯ñÖÏ @ , I.® KQÖÏ @ àA¾Ö
Ï@ 
Fact, éÓñÊªÓ ,©¯@ð

Expert system, Q
J.k ÐA¢ 
Factor,

Expire, éJ
kC’Ë@ é’ ®K@
  
Factorial, H . ðQå”Ó
Explicit parallelism,
  Factor of proportion, I . ƒAJ K ÉÓAªÓ
Explicit state, : é¢ ¯AjÖÏ @ , éK
BðË@ Factory, ÉÒªÓ ,©J’Ó
Explicit type conversion, ’ 
Fade, È ðA

Exploit, èQª K
Fail, ɂ ¯
Explore, ¨C¢ Jƒ@ Failback,

Exponent, € @ Failfast,
'
Exponential, úæ… @ Failover, ɂ ®Ë@ PðAm.

   
Exponential notation, éJ
®K
Q «@ éJ
®J
ƒñÓ PñÓP Failover resource,
éÖ ß
Y¯

Failure, ɂ ¯
Exponential-time, úæ… @ áÓ


P QË@ éJ
ƒ @ Ð PP@
ñk
Failure-directed testing,
Exponential-time algorithm, áÓ Failure fencing,
Export, QK
Y’
    ÊË@
Fall back, ©k. @QË@ éËAg ú¯ ÉmÌ '@ , Zñj
Exporting, PY’Ó  
 .
Fallback, ©k. @QË@ éËAg ú¯ ÉmÌ '@ , Zñj
Expression, Q
J.ªK
Q  . ÊË@
Fallback procedure, ©k. @ Ë@ H@Z@Qk. @
Expression tree, Fall forward,
Expunge, I . ¢ƒ 
Fallout, ¡®ƒ
Fall over, Field separator, Èñ®k ɓA¯

Fall through,

Fields involved, é£PñJÖÏ @ Èñ®mÌ '@

Fall thru, Fiery,

False, FIFO, Bð @ h. PAg , Bð @ Ég@YË@
Farkled, Figure, ɾƒ

Farm, é«P QÓ

File, ­ÊÓ
Fast, ©K
Qå… File compression, ­ÊÓ ¡ª “


Fatal, hXA¯ ,ÉKA¯
 File control block, HA  ®ÊÖ Ï AK ÕºjJË@ èQ»@ X éÊ J»
.
Fatal error, hXA¯ A¢k File descriptor, ­ÊÖÏ @ ­“@ð
Fatal exception, File descriptor leak, ­ÊÖÏ @ ­“@ð H
Qå„
 .
Fat binary, File extension, ­ÊÖÏ @ èX@YJÓ@
Fat client, File name, ­ÊÓ Õæ…@


Fault, ¡Ê« ,¨Y“ Filename, ­ÊÓ Õæ…@

Fault-based testing, Filename extension, ­ÊÓ Õæ…@ X@YJÓ@

Fault monitor, File permissions, ­ÊÓ àð
X @

Fault tolerance, A¢jÊË éK. Aj.JƒB@  ®ÊÓ
Files, HA
Fault tolerant, File server, HA  ®ÊÓ ÐXAg
Fault tree analysis, File signature, ­ÊÓ ZA’Ó
@

Faulty, ¡Ê« ,¨ðY’Ó File system, HA  ®ÊÖ Ï @ ÐA¢ 
Favorite, I
 Filesystem, HA  ®ÊÓ ÐA¢ 
 . jJÓ , ɒ®Ó 
Fax, »A¯ File transfer, ­ÊÖÏ @ É®K
Feasible,

File type, ­ÊÖÏ @ ¨ñK

Feature, èQ
Ó Filing system,
Feature creep, Fill, ZÉÓ@

Feed, Õæ
®ÊK Fillcolor, ZCÓB
@ àñË
Feedback, ɪ¯ XP Fill-out form,
Feedback control,

Filter, l … QÓ
Feed-forward, Filtering, iJ
ƒQ  K , éJ
®’ 
Feeper, Filter promotion, l…QÖÏ @ éJ
¯QK
 
Femto-, Finalize, ÈAÒ»@ ,ÐAÖß @ ,ÐAJJk@

Fence, i.J
ƒ , ‡KA«
 Financial, úÍAÓ

Fetch, I . Êg. Find, ( úΫ) PñJ« , Im  '.


Fetch-execute cycle, Fine grain, ‡J
¯X I
 k
    .
Fetchmail, Fine-tune, é®J
¯X é®Ë@ñÓ
 Qå” éJ J ® K
Fiber optics, ¬AJ
Ë B@ HAK , ÐñÊ« Finger, úΫ ɒm
'

Qå”. éJ
J ® K
Fibre optics, ¬AJ
Ë B@ HAK , ÐñÊ« 
Finish, ÈAÒ»@ ,ÐAÖß @ ,ZAîE@

.

Field, É®k Finite, ùëAJ JÓ


 
Field mouse, É®mÌ '@ èP A¯

Finite automata, ùëAJ JÓ é»QmÌ '@ ùKA


 ®Ê K

Field-programmable gate array, Finite differencing,


Field-replaceable, Finite state machine,
Fields, 閨k
 Firebottle, ( éƒA
  ‚Ë@  ú¯ HA  Kð QºËB @ ) lk. . AK èPðPA¯


éÓðA®Ó
Firefighting, PAJË@
  Flat file,
Firewall, ø PAK P@Yg. Flatten,


Firing, †C£@ Flat thunk,


Firmware,

Flavor, †@ YÓ ,Ѫ£ , éêºK

Firmy,
 ÊÓ , éêº
Flavorful, †@ YÒÊK. úæ
 JÊK . úæ ÊÓ

First class module, Flip,



First customer, Èð B@ àñK . QË@ Flip-flop,
First generation computer, Èð B @ ÉJ
m.Ì '@ H Float, Qk
Ì  . ñƒAg
First generation language, Èð B @ ÉJ
m. '@ éªË Floating head,

First in first out, Bð @ h. PAg , Bð @ Ég@YË@ Floating point,
 
First-in, first-out, Bð @ h. Qm
' Bð @ Ég@YË@ Floating-point, éÖß AªË@ éʓA®Ë@
First normal form, Floating-point accelerator,
 Q
First-order, ék. PYË@ úÍð @ , I . 

K Ë@ ú Íð @ Floating-point arithmetic,

 

 
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
j’JË@ 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, 邃ñÓ

Foogol, Four-colour glossies,


Footer, Four colour map theorem,
Foot-net, Four colour theorem,
Footnote,

Fourier Analysis, Q
K
Pñ¯ ÉJ
Êm'
Footprint, Fourth generation computer, ÉJ
m.Ì '@ H. ñƒAg
For, ©K. @QË@
Fora, Fourth generation language, ©K. @QË@ ÉJ
m.Ì '@ éªË
  
Force, èPY®Ë@ ,ñ ®Ë@ Fourth normal form,

Forecast, ©¯ñK Fractal, ø Pñ‚»

  
Foreground, ékñÊË@ éJ
ÓAÓ @ ,Q¢ JÖ Ï @ éJ
ÓAÓ @ Fractal compression, ø Pñ‚» (Pñ“) ¡ª “

Foreign key, Fractal dimension, ø Pñ‚» YªK .




Fork, © ‚  , h. @Q®K@ Fraction, Q儻


For loop, Fragile, I. ¢ªË@ ©K
Qå…
Form, ɾƒ , èPAÒJƒ@
 
Fragment, èQ儻 
 
Fragmentation, éK Qm .'
Formal argument,
Formal methods, Frame, PA£@
Formal parameter, úξƒ ¡‚ Ó
Frame buffer, PA£B

 @ à@ñ“  
Formal review, Frame grabber, H@P A£B @ ¡®JÊÓ
Format, éJJ
 îE Frame pointer,

 ë ,(‘) ‡‚ 
Format (noun), ( à Q m× , ­ÊÓ) éJJ
Frame rate, PA£B @ ÈYªÓ 

êÓ , ¨A’Ó Frame relay, PA£B
Formatted, úæ

 @ ÉJ

®JK
Formatting, Frame set, H@P A£@ Õ®£
 îE ,(‘) ‡J ‚ K 
Frames per second, éJ
KA JË@ ú¯ PA£@

Format (verb), ( à Q m× , ­ÊÓ) éJJ

Form factor, Framework, ɾJ


ë
Form feed, Framing specification,
Formula, éªJ
 “ Free, Qk

Formulas, Free disk space,


  m× QK
Forum, øYJJÓ Free software, èQk HAJ
 
. .
Free space, é«PA¯ ékA‚Ó
Forward, ÐAÓ B@ úÍ@

Free variable, ‡J
Ê£ ù ª JÓ ,Qk  ù ª JÓ
Forward analysis,


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, ÈA’CË ¡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,

Full outer join, Gamma, AÓAg.


Full pathname, ÉÓA¿ PA‚Ó Õæ…@ Gamma correction,
  ‚Ë@
Full screen, éƒA  ZÉÓ Gamut,
Fully associative cache, Gantt Chart, I . ¡¢m ×
 KAg
Fully lazy lambda lifting,
   
Gap, ¨@Q¯ , èñm.¯ , èQª K

Function, éË@X Garbage, HC  ’ ¯ , éK
A® K

Functional, ù®J
£ð Garbage collect,

    KAJ èY«A¯
Functional database, èY«A¯ , éJ
Ë@X HA
K. Garbage collection,
éJ
K@ Q¯@ HA
K.
 KAJ Gas, PA «

Functional dependency, XAJ
® K@ , éJ
®J
£ð
  éJ ªK A K  Q« éƒA ƒ

. Gas plasma display, éJ
ÓPCK .
ù
®J
£ð 
Gate, éK. @ñK.
Functionality, éJ
®J
£ñË@
 éK X AJË@ 


Gated, éK. @ñK. Q.« PAÓ 
Functional language, éJ
®J
£ð éªË 
× Gateway, éK. @ñK.
Functional program, ù®J
£ð

 l . A KQK.  × General, úÍAÔg. @ ,ÐA«

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.

Get, Èñ’k Graphical, ú×ñƒP



  @ð
Ghost, ÉÒêÓ I . K
𠩯ñÓ , q‚K
Graphical user interface, éJ
ÓñƒP ÐYjJ‚Ó éêk.
Giga-, Graphics, HAJ 
ÓñƒP
Gigabit, Graphics accelerator, úGAJ
K. ¨Qå„Ó


AK. AªJ
«

Gigabyte, IK Graphics adapter,
Gigaflop, Graphics adaptor,
Glass, Graphics card, HAJ 
ÓñƒP é¯A¢ 
.
Glass box testing, Graphic workstation,
  ƒ
Glitch, éÊ« , éJ.KA Graph plotter,
Global, ú×ñÔ« Graph reduction,

Global device, Graph rewriting system,


Global index, Gravel,
  
Global interface, éÒJ
Ô« éêk. @ð , éJ
ËAÔg. @
 @ð
éêk Gray,
.
Globalisation, Gray code, ø Qk. PAÓP

Global resource, ú×ñÔ« XPñÓ Gray-scale, ø XAÓQË@ h. PYJÓ





Global variable, ú×ñÔ« Q


ª JÓ Grayscale, ø XAÓQË@ h. PYJÓ


ޕ
 
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, ÈA’B 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


.

Hello, world, ÕËAªË@ AîE


@ , AJ.kQÓ History, t'
PAK

Help, èY«A‚Ó Hit,
Henry,

Hit rate, éK. A“B@ ÈYªÓ
Here document, Hog,
Heterogeneous, Aj.JÓ Q
«
 ® K
Hole, éjJ¯ ,I

Heterogeneous network, é‚Aj.JÓ Q
« éºJ.ƒ
 Home, È QÓ
.
Heterogenous, Aj.JÓ Q
«
Home box,

Heuristic, éJ
.‚» Home directory, úæ„J
KP ÉJËX

Heuristics testing, éJ
.‚ºË@ PAJ.Jk@ 


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“@

Hide, ZA®k@ Hop,


Hidef, Hopping,
Hierachy, ú×Që Horizontal, ù®¯ @


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
®¯ @
 

Hierarchy, èQm.… Horizontal microcode,



High, ©®KQÓ ,úÍA« Horizontal scan rate, ù®¯ B@ i‚ÖÏ @ ÈYªÓ


ñË B@
  
High colour, à@ ú
ÍA« Horizontal tabulation, éJ
®¯ @ éËðYg.
High definition, YK
YjJË@ úÍA«

Host, ­J
’Ó

úæ êÓ
High density, é¯AJºË@ úÍA« Host adaptor, ­J
’Ó

  
Higher-order function, éJ.KQË@ éJ
ËA« éË@X Host bus adapter, ­J
’Ó

ɯA K ú¾Ó
Higher-order macro, Host computer, ­J
’Ó
H ñƒAg

  . 
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.'


Hour, é«Aƒ Illegal,


Hourglass,
 “@
Illumination, QK
ñJ K , éKA
 ' QK @YK
Housekeeping, éK
Q
’m
.

Illustration, Q
‚®K , iJ
“ñ K , Õæ…P ,QK
ñ’
Hover,

Image, èPñ“
Hover link,

Image format, èPñ’Ë@ éªJ
 “

Html, Image map,


HTML, ýG ék
 Image processing, Pñ’Ë@ ém.Ì 'AªÓ

 
HTTP, ¨ è ék Image recognition,

Hub, ¨ PñÓ Image sequence, Pñ“ I
  
h PYK . ¯AªK ,Pñ“ ©K. AJK
Hue, àñÊË@ . Imaging,

Humanist technology, ¬YêË@ éJ
KA‚
 @ éJ J ® K Immediately,


Humor, é¯@Q£ Immediate version, Ég. A« P@Y“@ ,ø Pñ¯ P@Y“@

Hung, Impact printer,


Hybrid, á 
j.ë

Imperative language, éK
PAJ.k. @ éªË

Hybrid multiprocessing, , á 
j.êË@ Z@Q k. B @ XYª K Implement,
á 
j.êË@ ém .Ì 'AªÖÏ @ XYªK Implementation,
Hybrid testing, áj . êÓ PAJ.Jk@   
Implicit parallelism, è@P@ ñ ÖÏ @ , é J J
¯Y Ë@ è@P@ ñ ÖÏ @
Hyper, ú
æÒ ’ Ë@
Hypercube, ‡KA
 ¯ ©ºÓ Implicit type conversion, , úæÖ Þ• ¨ñ K ÉK
ñm'
 Ó

  ¯ éʓð
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

 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

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

Insertions, Intelligent key,


Insertion sort, Intelligent terminal, ú»X ¬@Q¢Ó

@ ¡Öß , h @P XB @

Insert mode, ÈAgXB . ¡Öß Intensional,



Inside, úæ£AK. , Ég@X , úG@ñk.

Intensity, è Yƒ

Inside (centered), Interaction,


 
Inspection, Y®®K , ZA’®J ƒ@
 Interactive, úÍXAJ.K

J.K

Install, I Interactive development environment,


Installable file system,

Interactivity, éJ
Ê«A®K
Installation, I 
J.K Intercept,
Installed user base, Interchange File Format,
Installer, I . JÓ Interconnect, ɓð éºJ.ƒ


Instance, èQÓ Interest,
Instance method, Inter-exchange carrier,
Instance variable,

Interface, éêk. @ð
Instantiate, Interface analysis,
Instantiation, Interface card,
Instant messenger, ø Pñ¯ ÈAƒQÓ
 Interference, Ég@YK



Institution, Interlace,

Instruction, éÒJ
ʪK Interlaced,
Instruction mnemonic, Interlaced image,
Instruction pointer, Interlacing,
Instruction prefetch, Interleave,
Instruction scheduling, HAÒJ


ʪJË@ éËðYg Interleaving,
.
Instruction set, Intermediate, ¡ƒñ  JÓ
Instruction set architecture, Intermercial,
Instrument, éË @
  , éJ Êg@X
Internal, éJ
J£AK

.

Insufficient, Internal bug, úÎg@X I . J


«
Integer, iJ
m• XY«

Internal error, úÎg@X A¢k



Integral, l×. YÓ Internal field separator,

Integrate, l×. YK
Internal frame, úÎg@X PA£@

Integrated, International, úÍ ð X


Integrated circuit, Internationalization,


Integrated development environment, é J 
K. Internet, I  K QK@
ÉÓA¾JÖÏ @ QK
ñ¢JË@ Internet address, I  K QKB @ à@ ñJ«
Integration, l×. X Internet number, I  K QK@ Õ¯P
Integration testing, Internetworking,
Integrity, ÉÓA¾K Interoperability,
Integrity constrain, Interoperable database,

Intellectual property, éK
Qº®Ë@ éJ
ºÊÖÏ @ Inter-packet gap,
Intelligent backtracking, Interpolation,
Interpret, Isomorphism,
Interpreted,  ®Ó
Isomorphism class,
Interpreter, Qå„  ® Ó
Italic, ÉKAÓ
Inter-process communication, Item, Qå”J«
Interrupt, Iteration, P@QºK
Interrupt handler, Iterative deepening,
Interrupt list, Iterator,
Interrupt priority level, ¨A¢®KB
 @ éK ñËð @ øñJ‚Ó


Interrupt request, ¨A¢®KB


@ I.Ê£ J
Intersect, Jag,
 
Intersection, I . ËA’ , ©£A®K Jam, €YºK , ÐAgP
Interupt,  
Jaz Drive, ékñJ®Ó é¯@ñ‚Ë@
Interval, Jewel case,
Interworking, 
Jitter, ék. Qk. P , €Aª  KP@
Intranet, I K@ QK@ Job, ɪ ƒ

Intuition, éë@YK.  
Job control, éÒêÖÏ @ éJ.¯@QÓ
Intuitionism, éJ
ƒYg
  
Job number, éÒêÖÏ @ Õ¯P

Intuitionistic logic, úæîE
YK. ‡¢JÓ

Join, ÐAҒ @
Intuitionistic probability, Joint, úΒ®Ó

Intuitive, úæ…Yg


Journal, éJ
ÓñJ
Ë@

Invalid, Joy stick, H . AªË·»ï@


Invariant,
A’«
Joystick, H . AªËB@ A’«
Inverse, º« 
JPEG, èPñ“ éJJ
îE i.J
ªk
Inverse comment convention, Jukebox,
Invert, º« .' ,Q ® ¯
Jump, PðAm
Inverted index, 
Jumper, PA ®¯ , A¢

Invert Selection, PAJ
JkB @ Iʯ Jumpstart,
 .
Invisible, ù®k Jump table,

Invoke, ZA«YJƒ@ Jump trace buffer,


Involved,  PñJÓ 
Junction, éÊJ
“ñK
I/O subsystem, ú«Q¯ h. @Qk@
, ÈAgX@ ÐA¢   

Junk, I . J
»@Q» ,ÐAë Q
« , éÓAÔ¯
IP Address, ©K
@ à@ ñJ« Junk mail, éËAK. P YK
QK.
IRC, Justification, è@ XAm×

Irrational number, Justified, ø XAm×

Irrefutable,  
Justify, éK
ñ‚
Isochronous, Just-in-time, I
 ú¯ AÓAÖß
 ¯ñË@
Isochronous transfer,

, È 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


Landscape, úæ•Q«
Key stroke, P P 颪 “
 

Language, éªË

Keystroke, P P 颪 “  úΫ úæJ Ó PQm×
Language-based editor, éªÊË@ .
 
Key word, éJ
ƒAƒ @ éÒÊ¿  €A‚k
  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


Lazy evaluation, Èñ‚» Õæ


J
®K Lexeme,

Lazy list, éËñ‚» éÖß A¯
  Lexer, see lexical analyser
Leader, YK@ P Lexical analyser, ø ñªË ×
 , úÍð @
ÉÊm '
Leading, ø XAJ
¯ , úæ„J
KP Lexical analysis, ø ñªÓ ÉJ
Êm


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 Õί

Legacy, Light pipe,


 
Legacy code, úG@QK èQ®ƒ Light precipitation, Èñêm.× Èñ¢ë

Legacy software, éJ
K@QK l×. @QK. Lightweight, à PñË@ ­J
® k
Legacy system, Light-weight process, à PñË@ é®J
® k éJ
ÊÔ«

Legal, úGñKA ¯ Like, ÉJÓ

    
Legalese, HAJ
KñKA¯ , HAJ
¯ñ®k Like this, @ Yë ÉJÓ
 
Legend, èPñ¢ƒ @ , HAjÊ¢’Ó ÉJ
ËX Lilo, ºJJ
Ë ÉÒm×
Lemma, Limes,
Length, Èñ£ Limit, XðYg
Lenient evaluation, Limits, XðYg

Less, ɯ @ Line, Q¢ƒ
Less than, áÓ É¯ @ 
Linear, éJ
¢k
Let floating, Linear address space,

Letter, éËAƒP Linear argument,
Level, øñJ‚Ó Linear assignment,
 
Level one cache, ð B@ øñJ‚ÖÏ @ áÓ (lÌ. 'AªÓ) éJ
K. Ag Linear function, éJ
¢k éË@X
Line arguments, Literate programming,
Linear logic, ù¢k ‡¢JÓ
 Literature, HA  ®Ë ñÖ Ï @

Linear map, éJ
¢k é¢
Qk
 Little-endian,

Linear programming, éJ
¢k ém.× QK.
 Load, ÉÔg

Linear space, Loadable, ÉJ
ÒjJÊË ÉK. A¯

Linear transfer, ù¢k É®K
 Loadable kernel, ÉJ
ÒjJÊË ÉK. A¯ è@ñK
 
Linear transformation, ù¢k ÉK
ñm'
 Load-balancing,


Linear type, ù¢k ¨ñK

 Load balancing, ÉJ
ÒjJË@ éK P@ ñÓ ,ÉÒm Ì '@ éK P@ ñÓ
 Loading, ÉJ
ÒjJË@ øPAg.
Line buffering, ¡mÌ '@ áK
ñ’ ,Q¢‚Ë@ áK
ñ’
Line conditioning, Local, úÎm×
Line discipline,


Local area network, éJ
Êm× é®¢JÓ
   éºJ ƒ
  .
Line editor, ù¢k ‘ PQm× ×
Local bus, éJ
Êm éʯAg

  KAJ
Line feed, Q¢ƒ YK
ð Q K Local data sources, éJ
Êm× HA
K. PXA’Ó
× 
Linen, Local disk, úÎm Q¯
Line of code, èQ®‚Ë@
  áÓ Q¢ƒ 

Locale, éJ
Êm×

Line pattern, Local echo, úÎm× øY“
Line printer,  ñ¢k éªK. A£


Local exchange carrier,


Line probing, Local file, úÎm× ­ÊÓ

 
Lines per minute, é®J
¯YË@ ú¯ Pñ¢ƒ

Local host, úÎm× ­J


’Ó



m Ì
Line starve, Localhost, I‚êÊ
Linewrap, Localisation,

Link, éʓð Localised,
Linkage editor, HCJ 
“ñJË@ PQm× Locality,

Link editing, éʓð ÉK
YªK Localization, á 
£ñK

Linked list, éËñ“ñÓ éÖß A¯
  Localize,
Linked to, úÍ@ ɓñÓ  
Local loop, éJ
Êm× é®Êg
Linker, ɓñÓ Local loopback addresses,
Linking, ÉJ
“ñK Locals,
Link loader, HC“ð  ÉÒm× Local variable, úÎm× ù ª JÓ
 
Link rot, éJ ®« éʓð Location, ©¯ñÓ


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.‚Ë@ ­ÊÓ


Logging in, ø Q¯YË@ ÈñkYË@


 øPAg. 
Lossless, èPA‚k àðYK
.

Logic, ‡¢JÓ Lossless audio compression, . Hñ’Ë@
àðYK  ¡ª “
 èPA‚k
Logical, ù®¢JÓ

 à@ ñJ« 
Lossy, Xñ®¯
Logical address, ù®¢JÓ

Lossy audio compression,
Logical complement,
 Q¯ Lossy compression, Xñ®¯ ¡ª “

Logical disk, ù®¢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, ɯ @


Logical shift left, øPA‚


ù®¢JÓ
Logical shift right, úæJ
Öß
ù®¢  JÓ QJª K Lowercase,
Logic emulator, ù®¢JÓ
 ú» Am×

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, €A‚k 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… é“A“P Malware, éJ
J.k éJ
m.× QK.
Magic number, ø Qj‚Ë@ Õ¯QË@
 
Manage, èP@X@

Q¯ 
Magnetic disk, úæ„J
£AJ ªÓ Management, èP@X@

Magnetic stripe, úæ„J


£AJ ªÓ ¡
Qå… Manager, QK

Magnetic tape, úæ„J
£AJ ªÓ ¡
Qå… Manager widget, QK
YÖÏ @ è@X @



Magnetic tape drive, úæ„J
£AJ ªÓ ¡
Qå… †ñ‚Ó
 Manifest section,

Magneto-optical disk, ø Qå”. úæ„J


£AJªÓ Q¯

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, PA’j Jƒ@ ,Qå”m ×

P 

“AK
Math, HAJ Memory, èQ»@ X
Mathematical, úG A‚k , úæ•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, éËAƒP

Media, ¡Aƒð

Message block, éËAƒQË@ I ËA¯
.
Median, Message board, €A  ® JË@ HAgñË

Media type, ¡AƒñË@ ¨ñK

Message catalog, éËAƒQË@ àAJ
K.
Medium, ¡ƒð Message digest function,
  
Meeting, ù®JÊÓ , ZA®Ë , ¨AÒJk. @ Message of the day, ÐñJ
Ë@ éËAƒP
Meg, Message passing, ÉKAƒQË@ QK QÖß

Mega-, Bj.J
Ó Messages, ÉKAƒP
Megabits per second, éJ
KA JË@ ú¯ HA
  ’J JË@ á 
K
CÓ Message switching,

.
Megabyte, IK 
AK. Aj.J
Ó Messenger, ÈAƒQÓ 

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, ÈAƒPB 

®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, ÈA’B@ éº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

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,


Nipple, éÒÊg Normed space,


No, B

North, ÈA҂Ë@
Northbridge, úÍAÖޅ Qå„k.

No assignment,
NO-DAEMON, úæk
 Notation, áK
ðY
K
 
.B Not between,
Node, èY®«
 •
Noise, i.J
m.• , l . Note,
Noise shaping, i.’Ë@ ÉJ
º‚  Notebook, ÈñÒm× H
. ñƒAg
Non-algorithmic procedure, Not empty, ¨PA¯ 
« Q
Not equal, ÈXAªÓ Q
«
Object-oriented language, éJ
k. ñJË@ éJ
“Q
 
« éªË
Not equal to, úÍ@ ÈXAªÓ Q
«
Object-oriented programming, éJ
KA¿
 ém × QK
. .
Notice, PAªƒ@  Objects, ¬@Yë·»ï@
Notification, PAªƒ@  Oblique, ÉKAÓ , ¬Qj JÓ

ÊJ.K
Notify, ©J Oblique stroke,

Notwork, éºJ.ƒ Observational equivalence,
No-write allocation, Observations, HA  ¢kCÓ 
, H@Y“Q K
N-th Roo, Obsolete, ¡J  Ó ,¼ð QÓ
.
N-tier, Occam,
Nu-calculus, Occasion, éJ.ƒAJÓ
 , é“Q  ¯
Nudge, Occlude, Y‚



Null, Ð Y« Occurence, HðYg 


Nullary, Occurrence, HðYg 
Null modem, ÐXñÓ CK. Occurs check,
 
Null pointer, Zúæ…CË Qå…ñÓ Octal, úGAÖß


Null string, é«PA¯ ¬Qk @ éʂʃ

ß
Octet, éJ
KAÖ
Number, Õ¯P
 October, ÈðB@ áK
Qå„
Number Converter, ÐA¯P B@ Èñm×
 Octothorpe,
  
Numbered List, éÔ¯QÓ éÖß A¯

Off, ‡ÊªÓ
Numbering, Õæ
¯QK
 Offline, ɒJÓ Q
«

Number sign, Offset, àAm '
P
 
Number Theory, ÐA¯P B@ éK
Q¢  Off-side rule,
Numeral, ø XY« Off-topic, ¨ñ“ñÖ Ï @ h PAg

 .
Numeral system, Y« ÐA¢  OK, ‡¯@ñÓ
Numerator, ¡ ‚ .
Old, Õç'



Numeric, ø XY« ø Ym.'. @ Older or from,
Nybble, IK 

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

 “ è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 éËAƒP , ¨AJ
KP@ éËAƒP


Pack, éJ.Ê« Paper, †Pð


Package, éÓQk Papermail,
Packed decimal, Paper-net,

Packet, éÓPP

Paper tape, ú¯Pð ¡
Qå…
†@ ñƒ , Ð Qk †@ ñƒ

Packet driver, Ð PP Paraconsistent probability,


Packet mode, éÓQk
 ¡Ö ß , éÓ PP ¡Öß Paradigm,
Packet radio,
 
Paradox, é’ ¯ AJ JÓ
 
Packet sniffer, éÓQm Ì '@ ‡‚ J‚Ó Paragraph, èQ®¯
 

Packet-switched, éÓQm Ì '@ úÎK
YJ.K Parallel, P @ñJÓ


Packet Switching, Parallel computer, (ÉJ
ª ‚ Ë@) P@ ñJÓ H . ñƒAg
Packet switching, éÓPQË@
 È@YK @ , éÓ Qm Ì '@ È@YK @    
Parallel computing, (ÉJ
ª‚Ë@) éK
P@ñJÖÏ @ éJ.ƒñmÌ '@

.  .
  
Packet writing, éÓPQË@ éK. AJ» , éÓQm '@ éK. AJ»Ì   Parallelism, ø P@ ñK


Padded cell, Parallelogram, ¨C“ B@ ø P@ ñJÓ


Padding, Parallelograms, ¨C“ B@ éK
P @ñJÓ
 Parallel port, ø P@ ñJÓ Y®JÓ

Page, éj®“

  
Pagebreak, èYK
Yg. éj®“ é¯C¢@

Parallel processing, éK
P@ ñJÓ ém.Ì 'AªÓ , P@ ñJÓ Z@Qk. @
Paged, új®“
Parallel processor, P@ ñJÓ lÌ. 'AªÓ

ñJ« Parallel random access machine, XA ® K é J º Ó

Paged address, új®“ à@


Paged memory, új®“ èQ» @ X P@ ñJÓ ù
K@ ñ‚«



Parallel reduction, P@ ñJÓ ÉJ
Ê®K , ‘J
®J K

Page fault, éj®’Ë@ A¢k

Page frame, éj®’Ë@ PA£@ Parallel resource, P @ñJÓ XPñÓ
   
Parallel-service, éK
P@ ñJÓ éÓYg
Page in, éÊg@X éj®“
Pagelet, Parameter,

Parameters, HA¢ƒñÖ Ï@
Page mode, új®“ ¡Öß

  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Ó

Partial ordering, ùKQk. I Perceptron,



 . 
KQK
Participants, àñ»PA‚Ó Perf,
Partition, Õ愯
 Performance,
Partitioned data set,

Period, èPðX
  
Partitioning, Õæ
‚®K , éK Qm .'

Periodic, éK
PðX
Pass, QK
QÖß
 Periodic group, ø PðX ¨ñÒm.×
Passing, Peripheral, ú¯Q£



Passive, úæʃ Peripheral device, ú¯Q£ PAêk .

.

Passive grab, Perl, È Q


K.
Passive matrix display, úæʃ é¯ñ®’Ó ð X @
 QªÓ Perl Script, È Q
K. ‘

Passphrase, Qå…  èPAJ.«
. Permanent, Õç'@X
Password, Qå…

 éÒÊ¿ Permanent file, Õç'@X ­ÊÓ
Password aging, Qå„Ë@ éÒÊ¿ ÐXA®K
  Permanent link, Õç'@X ¡ @P
  .
Password field, Qå„Ë@ éÒÊ¿ É®k Per-message,

Paste, †A’Ë@ Permission, à X@


Patch, 骯P Permutation, éËXAJ.Ó

Patch (noun), 骯P
 
Perplexity, èQ
g ,¼AK. P@
Patch pumpkin, Persistence, P@QÒJƒ@
Patch (verb), ©J
¯QK
 Persistent, QÒJ‚Ó
Path, PA‚Ó Persistent link, QÒJ‚Ó ¡. @P
Path coverage testing, Persistent memory, èQÒJ‚Ó èQ»@ X
 
Pathname, PA‚ÖÏ @ Õæ…@ Personal,
Pathname separator, PA‚ÖÏ @ Õæ…@ ɓA¯
Personal computer, úæ”m… H
 ñƒAg

.
Perspective, Pñ¢ JÓ

, ék. Q¯  
Pin, éʃ , èQK. @
Pessimising compiler, Pin feed,
Peta-, Ping,
Petabyte, Ping-flood,
Petaflops, Pinging,
Phase, Pñ£ Ping-pong, XP ð Yg @

Phase alternating line, Pin-out,
Phase Change Memory, Pipe, H
. ñJ.K @
Philippines, á 
J.J
ÊJ
®Ë@ Pipeline,

Philosophy, 鮂ʯ Pipeline break,
Phishing, Pipelined,

Phone, ­JîE
, ­KAë

Pipeline processing, éK
XP@ñK ém .Ì 'AªÓ
Phone book, Pipeline stall,

Phone mail, ù®KAë YK
QK.

Pipelining, èXP@ñÓ

Phosphor fatigue, Piping,


Phyiscal,
 ¯
Piracy, éJ“Q

Physical, Xñk. ñË@ ù®J
®k , €ñÒÊÓ , €ñ‚m×
¯
Pirate, àA“Q


Physical address, €ñÒÊÖÏ @ à@ ñJªË@
Pitch, èñ¢k

Physical addressing, éƒñÒÊÓ éKñ
 J« Pixel, ɂºK.
Physical file, €ñÒÊÓ ­ÊÓ
Pixelize,

Physical layer, éƒñÒÊÖÏ @ é®J.¢Ë@
 Pixels, H@  P ñ’J«
Physical
  
memory, èQ » @ Y Ë@ , é ƒñ Ò Ê ÖÏ @ èQ »@ Y Ë@ Pixmap,

AJ
®J
®k
 èXñk ñÖÏ @
. , ékAƒ
Place, àA¾Ó


Physical memory address, éƒñÒÊÖÏ @
à@ ñJ«
èQ» @ YË@ Ï @ ½ƒAÓ
Placeholder, àA¾Ö
Pica, Placement,
Pi-calculus, Plaid screen,
Pick aperture,
Plain, (‘) XQm.×
Picker button, Plain text, ¬Qå•
‘
Picker Settings, H@X@Y«B  @ Qg@  
Plain window, éÊÓA¿ è Y¯AK

Picking, ZA®JK@ ,PAJ
Jk@

Plants,
Pico-, Plastic,
Picosecond, Platform, é’JÓ

Pictogram, 
Play, ZQ¯@ ,ɪ ƒ , ¬Q«
@
Pictograph, Play by electronic mail,

Picture, èPñ“ ¯ ,I.«B
Player, øPA

Picture element, èPñ“ Qå”J« Plenum cable,
Pictures, Pleonasm,

PID, éÒêÖÏ @ QÓP Pling,
¯ h , èQ¢¯
Pie, QKA¢ Plonk,
.

Piggybacking, Plotter,  A¢k


Pilot device, Plot (verb), ¡k ,¡J
¢m '
Plug, Pop-down menu, éËY‚Ó éÖß A¯
  
Plug and play, ÉJ
ª ‚  ð .¯
  
Pop up, ‡J.JÓ
Plug-in,
  è Y ¯A K
Popup, é®J.JÓ
Plugin, ‡jÊÓ
 Popup menu,
Plug-in editor kit,

Port, Y®JÓ
Plus, Portability, É®JÊË
 éJ ÊK A¯

.
Plus every, Portable, ÉÒjÊË ÉK. A¯ ,ÈñÒm×
Pocket calculator, I
 ƒAg éË @ 
Portal, éK. @ñK. ,H
. J

j . ÊË éJ. . AK.
Pocket computer, I . J
j . ÊË H. ñƒAg Port (Development),
 
Podcast, ( éJ
Kñ“) èQå„
 Porting,

, é¢
Point, Qå … ñK
 ® K 
Portmap, Y¯AJÖ Ï @ é¢
Qk
Point-and-grunt interface,

Portmapper, Y®JÖ Ï @ A¢ k
Pointed domain,

Port monitor, Y®JÖ Ï @ I ¯@ QÓ
 .
Pointer, Qå…ñÓ Port number, Y®JÖ Ï @ Õ¯P
Pointer grab, Portrait, úÍñ£

Pointer swizzling, Portugal, ÈAª KQK.



Pointing device, Q
ƒ AK PAêk . Portuguese, éJ
ËAª KQ.Ë@
Q   
Pointing stick, 
ƒ AJË@ A’« Pose, éJ
ª“ð
Point of presence, Xñk. ñË@ 颮K
  Position,
Point of sale terminal, ©J
K. 颮K ¬@Q¢Ó
 
Positional, úGA¾Ó , ù ª¯ñÓ

    


Point-to-point protocol, 颮K úÍ@ 颮K †A®J
Ó Post, (ɪ¯) ɃP @ , éËAƒP
Poisson distribution, Postal Box, ø YK
QK. †ðYJ“



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
.

Polling, k.  Postfix syntax,



Polygon, ©Ê’Ó Posting,
Polyline, Postmaster, YK
Q.Ë@ ¨ PñÓ
Polylithism, Post Office, YK
Q.Ë@ I 
. JºÓ 
Polymorphic, ÈA¾ƒ B@ XYªJÓ Post office problem, YK
Q.Ë@ I . JºÓ 
ɾ‚Ó
Polymorphic lambda-calculus, Post-order traversal,
  B@ Ì
Polymorphism, ÈA¾ƒ B@ éK
XYªK Post Processor, H@Yg l . 'AªÓ
Polynomial, éK
XðYg
 
Postscript, IK Qj’J‚«

Polynomial-time, Potential difference,
Polynomial-time algorithm, Potential master,
Polyvinyl chloride, Potential primary,
Pound, ( à Pð)
 «) éJJk
Pool, ñk É£P ,( éÊÔ
.
Pooled Variance, Pound on,
Pop,
Pound sign,
èYgð) É£QË@ éÓC«
 
, éJ
Jm .Ì '@ éÓC«   
( à Pð
Prevent, I . 
Jm.' ,ZA® K@
   Prevention, Y“ ,Q¢k
Power, èPY®Ë@ , é¯A¢Ë@ ¯ð
Preventive, ùKA
Power cycle,
 ¯ð
 éKAJ

“
Preventive maintenance, éJ
KA
Powerdomain, 
  Preview, éJK
AªÓ
Power management, é¯A¢Ë@ èP@X@ 
Previous, ‡K. A‚Ë@
Power-on,
 @ YJ« úG@ YË@ ‘j®Ë@ Primary, úÍð @
Power-on self-test, ¨C¯B

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,

 Prime number theorem,


Precision, é¯X
Prime time,
Predecessor,
Primitive,
Predicate calculus,
Principal, úæ„J
KP
Predicate logic,
¨ñK
Principal type, úæ„J
KP
Predomain,

 HAÒêÖ
¯ñË@ Print, ©J.£
Pre-emptive multitasking, ùKA  Ï @ XYªK   

Printable, é«AJ.¢ÊË ZúæêÓ , é«AJ.¢ÊË ÉK. A¯
Preference, ÉJ
’ ®K  

Print area, é«AJ.¢Ë@ ékA‚Ó


Preferences, HCJ 
’ ® K
 Printed, ¨ñJ.¢Ó
Prefix, é®K. Aƒ
  Printed circuit board,
Prefix notation, @YJ.Ó IK
ñJK 
Printer, éªK. A£
Prefix syntax, 
Printer port, é«AJ.¢Ë@ Y®JÓ

   îE , éK YJêÖß é«A“@
Preformat, éK
YJ
êÖß éJJ




Printing, ©J.¢

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
’Ó

Presets, Private key, ø Qå… hAJ®Ó



Presiding,

Private-key cryptography,
Press, ¡ª “ 
Private Messages, é“Ag ÉKAƒP
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

Probabilistic automaton, Project, ¨ðQå„Ó



Probability, †ñK , ÈAÒJk@
Project assurance,
Problem, ɾ‚Ó  Projection,  A®ƒ@

Problem report, ɾ‚Ó  á« QK
Q® K Projective plane,
Problem state, ɾ‚Ö

 Ï @ éËAg  èP@X@
Project management, ©K
PA‚Ó

Procedural language, éJ
K@ Qk. @ éªË

Project planning, ¨ðQå„Ó Q
K. YK , ¨ðQå„Ó Õæ
¢ J K
Procedure, Z@Qk. @ Prolog,
Procedure call, Promiscuous mode,

Process, éJ
ÊÔ«  
Promote, èY«A‚Ó , éJ
¯QK
Process code, Prompt, Ik 

Process file, ém.Ì 'AªÓ ­ÊÓ , Z@Qk. @ ­ÊÓ
 . K@ , àAëQK
.
Proof, HAJ
Process ID, Z@Qk. B

@ Õ¯P Proof theory,

Process identifier, Z@Qk. B@ ¬QªÓ Propagation, PA‚ K@

Processing, ø PAg. , éÊÓAªÖÏ @ ø PAg. , ‡J
J.¢JË@



ø
PAg. Propeller key, ©¯@X hAJ®Ó
YJ
® J JË@ Properties, HA  ®“@ ñÓ ,‘A’ k
Processor, lÌ. 'AªÓ 
Property, éJ
ºÊÓ , éJ
“Ag

Processor bus, Proportional, I  
. ƒAJJÓ ,ú
æ.ƒAJK
Processor farm, Proportional font,
Processor time, lÌ. 'AªÖÏ @ (ÉJ
ª ‚ ) áÓ
P 
Proposition, h@Q¯@ ,h Q®Ó ,ø @P

Process scheduling,
émÌ 'AªÖÏ @ é ËðY g. , Z@Q k. B @ é ËðY g. Propositional calculus,

.  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¢ 

 YJʂQ K Protected workbook,


Professional programming, éJ
JêÓ  J»
 HAÓY  g Protected workbooks, éJ
Òm× ÉÔ« I .
Professional services, éJ
JêÓ 
  ñÓ , ­K QªK ­ÊÓ Protection, éK
AÔg
Profile, èQ k . ñÓ èQ
ƒ , HA
 ®“@
Protocol, Èñ»ñKðQK.
Profiling data,
. Protocol analyser, Õæ…@QÓ ÉÊm×
Program, l×. AKQK   
. X@Y« Protocol class 0, éK
Q®“ †A®J
Ó éJ ¯
Program counter, úm× QK. X@Y« , l×. AKQK 

. Protocol converter, †A®J
Ó ñm ×
Programmer, l×Q .  .Ó  
Protocol layer, †A®J
ÖÏ @ é®J.£
Programming, ém.× QK.
Protocols, Õæ…@QÓ
Programming fluid,
Protocol stack,
Programming language, 
Prototyping, ék. YÖß
Programs, l×. @QK.
Provably difficult,
Provably unsolvable,

Provide, Q
¯ñK

Q
Provider, Q¯ñÓ Quadratic, ùªJ
K. QK

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ƒ@

Publish, Qå„ Query expansion,



Publisher, Qå„ P@X ,Qå…AK Ques,

Question mark, ÐAê®JƒB@ éÓC«

Pull, Qk. ,H . @ YJk. @ , I.m…
Pull-down list, Queue, PñK. A£

Quickstart, ©K
Qå… (ÉJ
ª ‚ ) ZYK.
Pull-down menu,
Pull media, Quiesce,
Pumpkin, á 
¢®K

 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

Random-access memory, Reality check,


Random numbers, éJ
K@ ñ‚«
  X@Y« @ , éJ K@ ñ‚«
ÐA¯P @  

 Real Memory, éJ
®J
®k èQ»@ X
Random testing, Real mode,
Range, øYÓ Real number,

Rank, éËQÓ Real path,
Rapid prototyping, Real-time, ø Pñ¯

 

Raster, úæÓA‚

Ë@ i‚Ö Ï @  ñ¢k Realtime, ø Pñ¯


Raster file, úæÓA‚ ­ÊÓ
 Real time, úΪ¯ I ¯ð



Raster font, ù¢®K ¡k



Real-time structured analysis, ø
ñJ
K . ÉJ
Êm'
Rastergram, ø
Pñ¯
   ÓñƒP 
Real user, ùª¯@ñË@ ÐYjJ‚ÖÏ @
Raster graphics, éJ
JÓA‚ HAJ

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«@

Recursive descent parser, Regex,


Recursive type,
 
Region, Õæ
ʯ@ ,Q¢¯
     
Red, QÔg @ Regional network, éK
Q¢¯ éºJ.ƒ , éJ
ÒJ
ʯ@ éºJ.ƒ
Redemption, X@XQƒ@
 Register, ÉJ
j.‚

Redex, Register allocation,

Redirect, éJ
k. ñK èXA«@ Register assignment,

Redirection, éJ
k. ñK èXA«@ Registered port, Éj.‚Ó Y®JÓ

Redirectort, Register set,
Redirect output, Register spilling,
Yg
Redisplay, QªË@
 Register-true,

Redo, èXA«@ Registration, ÉJ
j.‚Ë@

Redocumentation, Registry, Éj.‚Ó

Redraw, Regression,
Reduce, ‘®K
 Regression analysis,
Reduction, ‘®K
 Regression curve,
Reduction strategy, Regression testing,
Redundancy, Regular, Ñ¢ JJÓ
Regular expression, ù¢Öß Q
J.ªK

Redundant array,

Red zone, Regular graph,


Re-engineering, Regulate,
Re-entrant, Reify,
Ref, Reincarnation, cycle of,

Refactoring, ©J
’JË@ èXA«@
 Reinstallation, I 
J.JË@ èXA«@
Reference, ©k. QÓ

Reject, ‘ ¯P

Reference counting, ùªk. QÓ Y« , ©k. @QÖÏ @

Y« Rejected, ñ ¯QÓ


Referential integrity, ùªk. QÓ ÉÓA¾K Relation, é¯C«

Relational algebra,
Referentially transparent,

Referential transparency, , é J
ª k. Q Ó é J
¯A ® ƒ Relational calculus,
éJ
¯A ® ‚Ë@
 éJ
ªk. QÓ Relational database, éJ
£AJ.KP@ HA

K. èY«A¯
 KAJ
Referer, ÈYK
Relational database management system,
Referral, éËAg@
 Relational data model,
Reflexive, » A« Relational language,
Reflexive domain, Relational model, ù®KC«
 ¡Öß
 K@
Refresh, €Aª

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’



Rely on, úΫ YÒJªK


Replication, P@QºK , 鮫A’Ó
Remailer,

Reply, XP
Remaining, † AK.
 
Report, QK
Q®K
 
Remark, é¢kCÓ Reports, QK
PA®K

Remind, Q
»YK
Repository, Q®Ó

Reminder, Representation,
Remote, YJ
ªK. , YªK. á« Requeriments,
Remote access, YªK. á« XA ® K Request, I . Ê£
Remote control, YªK. á« Õºm' Request for proposal,
Remote echo, YJ
ªK. øY“ Require, I

. ʢ
Remote login, Required,
Remote monitoring, YªK. á« éJ . ¯@ QÓ Requirement, h. AJ
Jk@ ,I . Ê¢JÓ

Remote procedure call, YªK . á« Z@Qk. @ ZA«YJƒ@ Requirements analysis,
Remote shell, Reseller,
Removable, È@QÓ Resend,
Removable disk, Reserved block,

Remove, éË@P@ Reserved blocks,  A‚ Ë@ I
Ë@ñ¯
 .
Removed, Reserved memory, èPñj.m èQ»@ X ×
Remove invisible content,

Reset, Q
®’
 
Rename, éJ
҂ èXA«@ Reset button, ùK@Y JK B@ ©“ñÊË
. èXA«@ P P
  

Render, (Q
“ . ¬) Q
J
’  Resident, Õæ
®Ó
Rendering, Q
J
’
   
Resident memory, éÒJ
®Ó èQ»@ X
Rendezvous, Y«ñÓ

Residual, ù®J.JÓ

 Q  
Renew, YK
Ym.' @ Resizable, €AJ
®Ë@ 
J
ªJË ÉK. A¯

Resize, Õæ
j.m' èXA«@
ReNice, see Nice

Reorganize, Õæ
¢ J K èXA«@ Resize handle,

Repaginate, éj®’Ë@ X@Y«@ èXA«@
 Resize pointer,

Repagination, éj®’Ë@ X@Y«@ èXA«@
 Resolution, éKAJ
 ƒ@
 . 
Repair, iJ
ʒ Resolutions, H@ 
  P @Q ®Ë@ 
Repeat, YK
XQK , P@QºK , èXA«@ Resolve, ÉÊg , †Q¯ , Ég

Repeater, XXQÓ Resolver, ÈAg
Resolver library, Rhombus, á 
ªÓ
Resource, XPñÓ Rhythm, ¨A®K
@

Resource bundle, XPñÓ éÓQk
 Rich object,
Resource control, XPñÒÊK. Õºm'
 
Right, l• , á 
Öß

Resource element, Qå”JªË@ ­K


QªK Õ¯P   Ag
Right brace, éJ
J
Öß
èQå•
 
Resource fork, XPñÓ éJ.ªƒ Right bracket, (ù)JJ
Öß
€ñ¯


Resource-group, Right-click, á 
ÒJ
Ë@ úΫ Q®JK

Resource group, Right join,


Resource monitor, XP@ñÖÏ @ I . ¯@ QÓ Right-justify, á 
ÒJ
ÊË è@ XAm×

Resource pool, XP@ñÓ ñk Right outer join,
Resource state, XPñÖÏ @ éËAg
 Right outside,
Resource status, XPñÖÏ @ éËAg
 Right parenthesis, úæJ


Öß
ÈCë 
Resource type, XPñÖÏ @ ¨ñK Ring network, ɾ‚Ë@ éJ
®Êg éºJ.ƒ
Respawn, Rings, I

 ®Êg

Response, éK. Ag. @ Ring topology, ù ®Êg úÆÊK è
 

Response time, éK. Aj.JƒB@ I

 ¯ð  

Rip, éJ
Ô¯P ¡Aƒð q‚
Responsible, Èð ñ‚Ó Ripcording,

Restart, ÉJ
ª ‚  èXA«@ Robot, HñK  . ðP
Restore, XAªJƒ@ Robus,
Restrict, PA’J¯@
 Role, PðX
Restriction, PA’J¯@
 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 . A‚k
 ×

Retry, @XYm. ÈðAg Root bridge,



Return, èXñ«
Root directory, P Ym.Ì '@ ÉJ
ËYË@
Return from interrupt, Root disk, ø P Yg. Q¯


Reusability, ÈAÒªJƒB @ éK


P@QºK Root file system, ø P Yg. HA

 ®ÊÓ ÐA¢ 
Reuse, ÈAÒªJƒB   
@ P@QºK , ÈAÒªJƒB @ è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

Revocation, ÈA¢. @ , I . m… Rotation, à@ P ðX


Revoke, ɢJ.K
, I . j‚
   Rotational latency,
Revolutions per minute, é®J
¯YË@ ú¯ H@
 P ðX

Rotation object,
Rotation objects,
 
Rotations per minute, é®J
¯YË@ ú¯ H@
 P ðX S
  

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, ú«

Routeing, Sample Rate,


Sample rate, àAJ
J«B @ YªÓ 
Routeing domain,
Router, ék. ñÓ Sampling, àAJ
J«@

J«B @ XXQK
Routine, èQ
Kð Sampling frequency, àAJ
Routing, éJ
k. ñK Sampling rate, àAJ
J«B @ ÈYªÓ

Routing table, éJ
k. ñK ÈðYg. Sandbender,
Sandbox, Èñ“ñË@ YK
Ym' éJ
Ë @
 
Row, ­“ ,Q¢ƒ
Row-level locking, Sanity check,
RPM package, ᪫ éÓQk
 Sans,
  
RSS Feed, èQå„ PY’Ó Sanskrit, éJ
K
Qº‚‚Ë@

Sans serif, ÉK
YÓ Q
«
Rude,
 
Rule, èY«A¯ Satisfiability problem,

Ruler, èQ¢‚Ó Saturation, ©J.‚ 

Rulers, Save, ¡ ®k


Run, YJ
®J K Say, ɯ

Run code, Scalability, ©ƒñJË@ éJ
ÊK. A¯
 
Runic, Scalable, YK
YÒJÊË ÉK. A¯

 
Run-length encoding, Scalable resource, úÎ ƒ XP ñÓ , éJ
¯QÊË ÉK. A¯ XPñÓ
 

Run level, ÉJ
ª ‚  øñJ‚Ó €AJ
®Ë@
    
Scalable service, éJ
¯QÊË éÊK. A¯ éÓYg
Runnable process, úÎJ
ª ‚  Z@Qk. @ 
Run time,

Scalar, ú΃ (XY«)
 P 

Runtime, ÉJ
ª ‚ Ë@ áÓ Scale, Õ΃ ,€AJ
®Ó
 P
Run-time, úÎJ
ª ‚  áÓ Scaling,

 P ¡Jm× 
Scaling Factor, €AJ
®Ë@ ÉÓAªÓ
Run-time environment, úÎJ
ª ‚  áÓ



P A¢k Scan, i‚Ó
Run-time error, úÎJ
ª ‚  áÓ

Run-time library, úÎJ


ª ‚  áÓ
 P éJ JºÓ Scan line, i‚ÖÏ @ ¡k

. 

Runtime library, úÎJ
ª‚ áÓP éJ.JºÓ
   Scanner, ém… AÓ

Run-time support, úÎJ


ª ‚  áÓ
 P Ñ«X Scan path, i‚ÖÏ @ PA‚Ó

 P ÐA¢  
Run-time system, úÎJ
ª ‚  áÓ Scan register, i‚ÖÏ @ Ém.…
 

 P ÐA¢ 
Runtime system, úÎJ
ª ‚  áÓ Scenario, ( ɒ®Ó) YîD„Ó éK. AJ»

Scheduel, ÈðYg. Script language,


 . , ÈðYm.× 
Schedueler, éËðYg. l×. AKQK Scroll, ­Ë
Schedueling,
 éÊK
Scrollable list, ‡ËQÊË
 A¯
. ém ' B
Schedule, ÈðYg. Scroll arrow, QK
QÒJË@ ÑîD…

Schedule manager, éËðYg. úæ„Ó , éËðYg.
 Ñ¢ JÓ  ¡ Qå…
Scrollbar, ‡ËQË@


Scheduler, éËðYg. l×Q . .Ó , ÈðYm.× Scrollbars,


Scheduling, éËðYg.
 
Scroll box, QK
QÒJË@ †ðYJ“
Schema, ¡¢m×

Scrolling, ‡ËQË@
Schematic, ù¢J
¢m'
  hñË
Scroll pane, ‡ËQË@

Schematic capture, Scrozzle,


Schematic type variable, Scruffies,

Scheme, é¢k , ¡¢m×
SCSI, ø Qºƒ

Scientific, ùÒÊ« Scuzzy,



  ®J
J.¢ @ YJ« ­Ë
Scientific notation, éJ
ÒÊ« HA SC/XSpread, h. @QkB

Scope, †A¢  '.
Search, Im
Scoring, PQk @ ,P@ Qk@ Search Domains, Im  .×
 '. HBAm

Scratch, .(Q®“) Zúæ…B , éK
@YK.
 Search engine, Im  '. ¼Qm×

  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Ë@

Screen capture, éƒA Secondary, ø ñKA K


Screencast, Secondary cache,


Screen editor, éƒA
  ‚Ë@  PQm× 
Secondary Colors, éK
ñKA K à@ ñË @
Screen lock, éƒA
  ‚Ë@ É® ¯
Secondary key, úGAK hAJ®Ó



Q m '
Screenname, Secondary storage, ø ñKA K áK

Screen popping, Second generation computer, ÉJ


m.Ì '@ H . ñƒAg
Screen reader, éƒA
  ‚Ë@  øZPA¯ ú
GA JË@
Screen refresh, Second generation language, ú
GA JË@ ÉJ
m.Ì '@ éªË
Screen saver, Second level cache,
Screen Saver, éƒA
  ‚Ë@ é¢ ¯Ag Second normal form,
Screensaver, éƒA
  ‚Ë@  é¢ ¯Ag Section, (H . AJ») H. AK. , Õ愯
Screen scraper,

Sector, éJ.ªƒ , ¨A¢¯

Screen server, éƒA
  ‚Ë@  ÐXAg Sector interleave,
Screen sharing, Sector interleaving,
Screenshot, éƒA
  ƒ é¢  ®Ë  
Sector map, ¨A¢®Ë@ é¢
Qk

Screw, Y‚®K
, ½®Ó Sector mapping,
Scrip, Secure, áÓ @
Script, XQå… , úæ” l×. AKQK
Secure channel, éJÓ
 @ èAJ ¯

.
Scripting, Secure keyboard,
Scripting language,
@
Security, àAÓ
Security breach, Serialise,
Seek, ùªƒ

Serial line, ú΂ʂ ¡k ,ɂʂÓ ¡k




Seeking, AJ
«Aƒ Serial port, ú΂ʂ Y®JÓ
‚  Ë@ áÓ
P , à@Y

Seek time, ùª‚Ë@ áÓ



P Serial processing,

Segfault, Serif, ÉK
YÓ (¡k)
 
Segment, 骢¯ Serve, ÐYg @
Segmentation, Õæ
‚®K
 Servelet,
Segmentation and reassembly, Server, ÐXAg

Segmentation fault, Serverlet,
Segmented address space,

Server room, ÐXAmÌ '@ é¯Q«

Select, ZA®JK@ Servers, ÐX@ñk
Selection, ù®JJÓ
 Server-side, YJ« , ÐXAm Ì '@ ÉJ.¯ áÓ
,ÐXAm Ì '@ éJ
kAK áÓ

Selector, ÐXAm Ì '@
Self-test, ùKA ®Ê K ‘m¯ Server-side include,


Service, éÓYg
Selvage,
  
Serviceability, éÓYmÌ '@ èPY¯
Semantic,
 
Service interface, éÓYmÌ '@ éêk. @ð
Semantic gap,

Service provider, é ÓY g Q ¯ñ Ó , é ÓY m Ì '@ Q ¯ñ
Ó
Semantic network,  j ÊK Xð QÓ , I K QKB
éÓY @
Semaphore, .
Semiautomatic, ùKA   Servlet,

®ÊK éJ.ƒ 
Session, é‚Êg.
Semi bold,
Semicolon, Session layer,
Semi light, Set, á 
J
ªK
Send, ÈAƒP@ Set abstraction,
Sendding, Set associative cache,
Sender, ɃQÓ Set complement,
Send-Monitor, Set comprehension,
Sense, €A‚k@ , éj.JÓ Set-Operation,
Sensitive, €A‚k Set theory,

Sensor,  m.× Setting,

Sentence, éÊÔg. Settings, H@X@Y«@ 
Settlement, éK
ñ‚

Separate compilation, 
Separator, ɓA¯
Settling time, P@Q®JƒB@ P
(úÍ@ Èñ“ñË@) áÓ
September, ÈñÊK
@ Set-top box,
 Setup, I 
J.K
Sequence, éJ
ËAJJÓ
Sequencer, ©K. AJJË@ Ñ¢ JÓ Set up,
Sequential codec, Seven layer model,
  
Severity, èñ‚¯ , èYƒ
Sequential coding,
Sequential file matching, Sexadecimal,

Sequential processing, úÍAJJÓ YJ
®J K , éJ
ËAJJÓ ém .Ì 'AªÓ Sha-bang,

Shabang,
Serial, ɂʂÓ
 
Shading, ÉJ
Ê ’  Shriek,
Shadow, É£ Shrink, ‘J
ʮK

Shadow file,
 
Shut down, ÉJ
ª ‚ Ë@ ¬A®K
@
Shadowing, ÉJ
Ê¢ 
 Shutdown, ÉJ
ª ‚ Ë@ á«
 ­ ¯ñ  JÓ ,ÉJª ‚ Ë@
 ¬A ®K @



Shadow ram,
Side bar, úæKAg. ¡
Qå… 

.
Shaft, Side-effect, úæKAg . Èñª ®Ó

.
Shallow binding, Sig,

Shape, ¬C« ɾƒ Sigma,
  , QÓP 
Shaped text, Sign, èPAƒ@ ,© ¯ñK

Share, ¼Q‚Ó
  , ÑîD…  
Signal, èPAƒ@
  à@ ñJ«
Shared-address, ¼Q‚Ó Signalling rate, H@  P AƒB  @ È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ñºƒ

Sharp, XAg Silicon chip,


Sharpen, Silo,
 
Sharpness, Yg , é¯X , hñ“ð Silver bullet,

Sheet, é¯Pð Simple, ÉîD… , ¡J
‚.

Sheets, éJ
¢« @ Simple multicast protocol,

Shelf, ¬P Simple path,

Shell, é¯ Y“ Simplex,
Shell procedure, Simplex method,
Shell scrip, Simplex printer,
Shell script, Simship,
Shell variable, Simulated annealing, áK
YÊJË@ èA¿Am×
Shielded twisted pair, Simulation, èA¿Am×


Shift, ék@P@ Simultaneous shipment, ø Pñ¯ ÈAƒP@



Shift key, hAJ®ÖÏ @ úΫ †A®K@ Since, YJÓ


Shift left logical, Since saving,
Shift right logical, Sine,
Ship, Sine wave,
Shockwave,

Singapore, èPñ®ª Jƒ
Shopbot, Single, YK


Shortcut, Qå”Jm×
Single assignment,
Shortcut key, PA’JkB@ hAJ®Ó Single-attached,
 
Shortest job first, Bð @ Q唯B@ éÒêÖÏ @ Single-duplex,
Shorthand, Single-electron transistor,
Shovelware, Single ended,
Show, PAê£@ Single inheritance, èYgñÓ éK@P ð
 

Shred, Single inlinememory moduleviewing pipeline,
Single-instance, Smail,
Single-precision, Smalles,
Single quote, Smart,

Single sign-on, ø XAg @ ÈñkX

ÉJ
j.‚ Smart card,
Single sourcing,

Smart terminal, èPñ¢JÓ éJ
¯Q£

Single static assignment, Smash case,
Single system, Smash sum,
Singleton variable, Smiley, éÓA‚K. @

Single-user mode, YJ
kñË@ ÐYjJ‚ÖÏ @ ¡Öß
Smooth, Ñ«AK
Sink, SMTP, ¨ éJ“


Site, ©¯ñÓ Snaf,

Sitename, ©¯ñÓ Õæ…@ Snag,

Size, 骃 , Ñm.k Snail mail,

Size box, ÐAm.k B@ †ðYJ“ Snap,

Skew, ¬@Qm' @ Snap dump,
Skewness, Sneakernet,
Skin,

Sniff, Õæ„J‚
, ‡‚ J‚

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.Ë@ éJ“Q Spare, ù£AJ
Jk @
¯

Software pirate, l×. @Q.Ë@ àA“Q Sparse,


 @ é¢  ® K , †A JKB  
Software reliability, l×. AK Q.Ë@ È ñ«


Spawn, éK
P X ,¨A¯YKB . @ 颮K
Software theft, l×. @Q.Ë@ é¯Qå… Speaker,
Softweave, Spec,
Soft wrap, Special, Ag

Softy, Special character,
Solarization, Special file,
Solid, I Specialisation, ‘’m'

. ʓ
Solid lines, Pñ¢‚Ë@  áÓ XY« ú支 @ Specialized, ‘’jJÓ

Solid model, Specials, HAJ 
“Ag
Solid-state storage device, Specific address, ‘’m× à@
ñJ«
Solution, Specification, 鮓@ñÓ

¯
Sort, PQ Specific markup,
Sorted, I  ®Ó Specify, YK
Ym'

. KQÓ ,PðQ
Sorting, I . 
KQK ,PQ ¯ Specular,
Sort order, Speculative evaluation,
Sound, Hñ“  Speculative execution,
Sound card, Hñ’Ë@  
é¯A¢ Speech recognition, ÐC¾Ë@ úΫ ¬QªJË@

.
Soundness, Speech synthesis,
Source, PY’Ó

Speed, é«Qå…

Source code, éJ
ʓ·»ï @ èQ®J
‚Ë@
  Spell,
Source language, Spellcheck, éJj
 îDË@ éªk
 @QÓ
. .
Source package, Spell checker, ùKCÓ@ ‡ ¯YÓ


Source route, Spelling, ZAj.ë
Source routing, Sphere, èQ»

Source tree, Spider,
Southbridge, úG ñJm .Ì '@ Qå„m.Ì '@ Spike,

.
Space, ÈAm.× , ¨@Q¯ , ZA’ ¯

¯ñ£
Spill, àA

Space bar, ¨@Q®Ë@ hAJ®Ó
Spinbox,

Spacebar, ¨@Q®Ë@ hAJ®Ó
Spiral,
Space character, PñÓQË@ èQ® ‚  Spiral model,

 
Space complexity, Splash, @YK. éƒA ƒ
Space leak,

Splash screen, éK
@YJ.Ë@ éƒA
  ƒ

Spacing, èY«AJ.Ó Split, ÐA‚®K@

Spaghetti code, Split brain,
Spam, ÐAm…
Split pane,
Spamdex, Splot,
Spamming, Spoof, ÉjJK


Spoofing,

Star network, éÒm.' ɾƒ úΫ éºJ.ƒ


Spool, èQºK.

Start, éK
@YK.
Spooler, Start bi,
Spread sheet, H
 Starting, ZYK.
. A‚k é¯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

Stack compression, Static allocation,


Stacked, Statically typed,
Stack frame, Static analysis, á»Aƒ ÉJ
Êm' , IK
 . AK ÉJ
Êm'
Stacking order, Static database management system,
Stack loader, Static field, IK  . AK ɮk 
Stack overflow, Static link,

Stack pointer, é“QË@ Qå…ñÓ Static linking,

Stack segment, é“QË@ áÓ Pñj 
. m× ©¢®Ó Static nested scope,
Stack traceback, Static nested scoping,
Staircase, Static random access memory,
Staircasing, Static scope,
Stake, Static typing,
Stalled, Statistical, ùKA’k @

Standalone, Statistical time division multiplexing,


¯
Stand alone, éK@ YK. Õç'A Statistics, HAJ

KA’k@

Standard, úæ…AJ
¯ Stats,


Standard deviation, ø PAJ
ªÖÏ @ ¬@Qm' B@ Status, éËAg

Standard disclaimer, Statusbar,


Standard error, úæ…AJ
¯ A¢k
 Status bar, HAÓñʪÖ Ï @ ¡
Qå…

Standard for robot exclusion, Steganography,


Standard input, úæ…AJ
¯ ÉgX
  Stemmer,

Stemming,
Standard interpretation,

Standard output, úæ…AJ
¯ h. Q k

Step, èñ¢k

Step increment,
Standard semantics,
Standby, ù£AJ
Jk@ Stepwise refinement,


Star, éÒm.' Stereogram,


Stereotype, Stripe set,
Sticky, Striping,
Sticky analysis, Stroke, ÐY’

Sticky bit, Stroke font object,


Sticky content, Strongly connected component,
Sticky data, Strongly typed,
Sticky keys, Strong typing,
Sticky notes, Struct,
Stipple, Structural recursion,
Stochastic, ùK@ ñ‚«  
Structure, éJ
K.

Stock-keeping unit, Structured analysis,



Stock Ticker, : ù®J.JÖÏ @ àð QjÖÏ @ Structured design,

Stone, Structure diagram,



Stop, ¬ñ¯ð Structured language,
Stop bit, Structured programming,
Stopping,

Stub, èP YK.
Storage, áK
Q m ' Stub network,
Storage pool, Stupid-sort,

Q j JË@ Ñm.k
Storage space, áK Style, H. @
ñʃ

Q m '
Store, áK Stylesheet,
Store and forward, Stylewriter,
Stored procedure, Sub, ú«Q¯

Storm, Subband encoding,



Stream, ‡¯YK , ‡¯X
  
Subclass, éJ
«Q¯ éJ ¯
Streaming, Subdirectory,
Stream-oriented,

Sub directory, ú«Q¯ ÉJ
ËX

Strength reduction, Subdivision,


Stress testing,

Subfield, ú«Q¯ É®k


Stretch, Sub folder, ú«Q¯ YÊm.×

Stretched, XYÜØ , XYÒJÓ Subject,


Strict, ÐPA“ Subject index, ©J
“@ ñÖÏ @ ÉJ
ËX
Strict evaluation, Subject-oriented programming,
Strikeout, Sublanguage,
Strikethrough, ¡k 颃ñJK
, H 
. ñ¢‚Ó Submenu,
Strikethrought, Submission, ¼@Qƒ@

String, ©¢®Ó
 Submit, ɃP@ , ¼Qƒ@

String reduction, Subnet,
String variable, Subnet address,
 
Strip, ¨ Q K , 鮃    ¨AJ ¯
Subnet mask, éJ
«Q®Ë@ éºJ.‚Ë@
Stripchart program, Subnet number,
Stripe, Subnetting,
Subroutine, Superpipelined,
Subscribe, ÉJ
j.‚
 Superscalar,
Subscribed, Superscript,
Subscribing, Superset,
Subscript, Supertype,
Subscription, ÉJ
j.‚
 Superuser,
Subset,

Supervisor mode, ¬Qå„ÖÏ @ ©“ð
Subshell support,

Support, èY«A‚Ó ,Ñ«X
Substituted, Supremum,
Substitution,

Surface, ékA‚Ó
Substrate, Surfaces,
Substring, Surfing,
Substructure, Surjection,
Subsystem, Surjective,
Subtitle, Surrogate key,

Subtotal, ú«Q®Ë@ ¨ñÒj.ÖÏ @

Suspend, ‡J
ʪK

Suspension, ­J
¯ñK

Subtract,
Subtype,

Suspicious, éJ
¯ ¼ñº‚Ó 
Subtyping, Svg,

Succeed, hAm.' Swallow, ©ÊK. @
Successor, Swap, ÉK
YJ.K
 èQ»@ YË@
Swap file, éK
QëA¢Ë@
­ÊÓ
Sufficient, ú¯A¿

Swap partition,
Sufficiently small, AJ
¯A¿ Q
ª“

Suffix, é®kB Swapped in,
Suggest, h@Q¯@
 Swapped out,
Suggestion, h@Q¯@
 Swapping,
Sum, ¨ñÒm.× ,©Ôg. Swap space,
Summary, ‘jÊÓ
Sweden, YK
ñ‚Ë@

Swedish, éK
YK
ñ‚Ë@
Sum (noun), ¨ñÒm.×
Switch, Èñm'

Sum (verb), ©Ôg.
Sun-stools, Switchboard,
Super, Switched virtual circuit,
Superblock, Switched virtual connection,
Superclass, Switching,
Supercombinators, Switching hub, ÉK
YJ.K ¨ PñÓ

Supercompilation, Switch level, Yg@ð øñJ‚Ó
Supercomputer, Switchover,
Superhighway, Switch statement,
Superimpose, Switzerland, @Qå„
ñƒ
Super minicomputer, Swung dash,

SYLK file, ­ÊÓ ZA®JK@
Superordinate,
Symbol, QÓP System controller,
Symbolic inference, è@ñK
System kernel, ÐA¢ JË@
Symbolic link, éK
QÓP
 éʓð  System management,
Symbolic logic, ø QÓQË@ ‡¢  JÖ Ï @ System manager,

Symbolic mathematics, System message,


Symbols, PñÓP System name,
 éʓð
Symlink, éK
QÓP
 System number,

Symmetric, Q£ AJ JÓ System operator,
Symmetric control, System programming language, ÐA¢ JË@ ém .× QK. éªË
Symmetric key cryptography, Systems analyst,
Symmetric multiprocessing, é®ÊJm× èXYªJÓ
  ém .Ì 'AªÓ System settings,
Symmetric multiprocessor, Systems jock,
 QÓ
Sync, éJÓ@ System software, ÐA¢ JË@ l× AKQK
 QÓ . .
Synchronize, éJÓ@ Systems operator,
Synchronized,

Systems programmer, éÒ¢ B@ l×Q
 .  .Ó
Synchronous, áÓ@ Q Ó Systems programming, éÒ¢B@ ém.× QK.
Synchronous key encryption, System state, ÐA¢ JË@

éËAg
Sync level,
éK . Qm.'
System testing, ÐA¢ JË@
Sync pulse, System tray,
Synflood, System type, ÐA¢ JË@
¨ñK

Synonym, ¬X@QÓ , ¬X@QÓ
èYgð
System unit, ÐA¢ JË@
Synonym ring, Systolic array,

Syntax, é«AJ
“
Syntax directed translation,

T
Syntax error, éÊÒm.Ì '@ ZAJK . ú¯ A¢k
Tab, àA‚Ë

Syntax tree, Table, ÈðYg.


Synthesis, áK
ñºK 
Tabulation, éËðYg.
Synthetic image, éJ
«AJ¢“@
 èPñ“ Tag, Õæ…ð
Sysadmin, Tagging,
System, ÐA¢ 
Talk,
System administration, ÐA¢ JË@ èP@X@ Tall,
System administrator, ÐA¢ JË@ QK
YÓ  ®m × ZA‚ @
Tar archive, é£ñ
ÉJ
Êm' , ÐA¢ JË@ ‘m¯ 
System analysis, ÐA¢ JË@ Target file, ­ÊÓ ZA®JK@ 
System analyst,

Task, éÒêÓ
System beep, Taskbar, ÐAêÖÏ @ ¡
Qå…
System bell, ÐA¢ JË@ €ñ¯A K Tastkt,
System board, ÐA¢ JË@ hñË TCLASS,
System bus, 
TCP/IP, ©K
@ éÔg. QK
System call, Team,
System catalog, Tear-off,
System Configuration, ÐA¢ JË@ HA  ®K
QªK Technic,
 
Technique, éJ
J ®K TODO List, ÐAêÖÏ @ éÖß A¯
 
Technology, éKA ®K
  Toggle, ÉK
YJ.K
Telnet, Token,
Temp file, I  ¯ñÓ ­ÊÓ Tolerance,
Template, I
 
Tool, è@X @
. ËA¯  
Temporary buffer, ( è AJ.m× èQ» @ X) Toolbar,
Tentative, ùKAî Q Toolkit,

E 
«  
 ð X B@
Term, iÊ¢’Ó Tool menu, H@ éÖß A¯
Terminal, éJ
¯Q£
 Tooltip,
Terminate, .ZAîE@ Topic, ¨ñ“ñÓ
TERM variable, :Q
J
ª JÊË ÉK. A¯ Q«
 Trace,
Ternary, Track,
Test, PAJ.Jk@ Track ball,

Test Module, èYgñË@ PAJ.Jk@ Transfer, É®K

Text, ‘
Transfer statement, É®JË@
 éÒJ
 ʪK
 

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, éÖÞ …
 ÈAƒPB @
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®Ë@ ‘A’k
  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

Uncompression, Unknown, Èñêm.×


Uncountable,

Unknown host, ¬ðQªÓ Q
« ­J
’ ‚Ó

Uncover, Unlink,
Uncrypted, Unload,
Uncurrying,

Unlock, É®®Ë@ ZAªË@
Undelete, Unmark,
Underflow, Unmarked,
Underline, Unmount, ɒ¯

Under line, Unnamed, ùÒ  ‚ Ó Q
«
Underlining, Unnormalised,

Underscore, úήƒ Q
¢‚
 Unprotect,

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,

URI, Vanity domain,


URL, Vaporware,
Url, I Var,
. K
ð à@ñJ«
Usability, Variable, Q
ª JÓ
Usage, ÈAÒªJƒ@ Variable declaration,
USB, (“ð@) ÐAªË@ úæ„Ê‚Ë@ ɯAJË@
  Variance,


Use, Variant, éªK
ñJ K
User, ÐYjJ‚Ó
Variations, H@  Q
ª K
User acceptance testing, Vector, éj.JÓ
User account, ÐYjJ‚ÖÏ @ H
Vector font,
 . A‚k 
User agent, ÐYjJ‚ÖÏ @ ÉJ
»ð Vector graphics, éJ
êj.JÓ HAJ 
ÓñƒP
User base, Vector processor,
User-defined, Vector space,

User defined, ÐYjJ‚ÖÏ @ áÓ XYm× Veeblefeetzer,
User directory, Vendor, ©KAK
.  
User-friendly, Ð@YjJƒB@ ÉîD… Ventilator card, éK
ñîE é¯A¢.
User id, Verbage,
User identifier, ÐYjJ‚ÖÏ @ ¬QªÓ
 Verbatim copy,
User interface, Verbose, I
. J¢Ó  
User interface copyright, Verification, ‡J
®m'

User name, ÐYjJ‚Ó Õæ…@ Verified,

Username, ÐYjJ‚ÖÏ @ Õæ…@
 
Verify, ‡J
®m'

Utility, éÊJ
ƒð Version, P@Y“@
Utility-coder, Versioning, èPY“ @

Utility window, Versions, H@  P @Y“@
Vertex,

V
®Ó ÐAÖޕ
Vertical, ø XñÔ« ,úæ… @P



Vacuum tube, ¨Q Vertical Alignment, ø XñÓA« è@ XAm×

Valency, Vertical application,


Valid, lÌ 'A“ Vertical bar, ø XñÓA« ¡
Qå…
 ‡ ®j  JË@

Validate, ém• áÓ Vertical blanking,



Validation, éÓCƒ áÓ ‡ ®m ' Vertical drive,

Valid chars, Õæ
ʃ ©J
¯ñK Vertical encoding,

Validity, éJ
kC“ Vertical interval,
 
Value, éÒJ
¯ Vertical loop combination,
 
Value-added, éÒJ
®Ë@ ¬A’Ó Vertically, AK
XñÓA«
Value added reseller, Vertical microcode,
Vertical refresh,

Virtual memory, éK
QëA£ èQ»@ X

Vertical refresh rate, Virtual path,
Vertical scan rate, Virtual point of presence,
Very-large-scale, Virtual reality,
Vet, Virtual server, ø QëA£ Õ®ÊÓ

    m ×

VFS, . éK. AJºÊË éÊK. A®Ë@  Y£ HA¢¢ Virus, €ð Q


¯
Via,

Visibility, éK
ðP

Video, éJ
KQÓ
Visible, ù KQÓ


Video adapter, Visible bell, ùKQÓ
é¯A¢

KQÓ  
€Qk.
Video card, HAJ . Visit, èPAK
P
Video compression, ùKQÓ ¡ª “ Visited link,
Video conference, ùKQÓ
¨AÒJk @ Visual, ø Qå”.

.

Video conferencing, Visual bell, ùKQÓ

€Qk.
Video dial tone, Visual editor,
Video display terminal, Visualisation,

Video interface, ñK
YJ
¯ éêk. @ð Visualization, éJ
KQÓ
 ÐñƒP
Video memory, Visual language,
Video (random, Visual programming,
Video random access memory, Visual programming environment,
Video terminal, éJ
KñK
 Q ®Ê K éJ ¯Q£
Visual programming language,

View, Q« Viz,


Viewer, Qê¢ Ó

Voice mail, úGñ“ YK
QK.

View model, Voice recognition,


Viewport, QªË@ Y ® JÓ Voip,
View transform, Volatile, QK
A¢JÓ
View volume,
 
Volatile memory, èQK
A¢JÓ èQ»@ X
Vim, Volatile storage,
Violation, †Qk
 Volatile variable,
Viole, Volume, Ñm.k
Virgule, Von Neumann architecture,
Virtual, Von Neumann integer, iJ
j’Ë@ àAÓñJ
K àñ ¯ XY«
Virtual address, ø QëA¢Ë@ à@ ñJªË@ Von Neumann, John, àAÓñJ ¯ àñk

K àñ .
Virtual cache,

Von Neumann machine, àAÓñJ ¯ éË @



K àñ
Virtual circuit, Von Neumann ordinal,
Virtual connection,
Virtual Console,
 W
Virtual Desktop, I  Wait, Q¢JK @
. JºÖÏ @ i¢ƒ éJ
®Êg
Virtual device, Waiting, PA¢ JK@
Virtual disk, 
Wait state, PA¢ JK@ éËAg

Virtual hos, Walk, úæ„Ó @

Virtual machine, ø QëA£ PAêk . Wall clock time,


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

 Wiggles,
Webmaster, ©¯ñÓ QK

 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.ƒ @

Wireframe model, World, ÕËA« 


Wireless, ú¾ÊƒB World-readable, AJ
ÖÏ A« ZðQ®Ó


 K QK@ èXðX
Wireless bitmap, Worm, I

Wireless local area network, éJ
Êm× é ®¢
 JÓ éºJ
 ƒ Wormhole,
.
éJ
ºÊƒB Wormhole routing,
Wish list, Wound around the axle,
With, ©Ó Wrap,

With copy, éj‚ ©Ó
Wrapper, ¬C«
Within epsilon of, Wrapping,
Wizard, YƒQÓ Wrats nest,
Wizard mode, YƒQÓ  ¡Öß Write, I J» @

: éÒÊ¿ .
Word, Qå”J« Write-back,

Word processing, HAÒʾË@ ém .Ì 'AªÓ Write buffer,
Word processor, ñ’ lÌ. 'AªÓ

Write-only language,

Words, HAÒÊ¿ 
Write-protect, éK. AJºË@ Y“ ùÒm
'
 

Word size, éÒÊ¿ Ñm.k Write queue, éK. AJ» ­“


Word spamming, 
Write side, éK. AJ» I
. KAg.
Wordwrap, Write-through,

Word wrap, HAÒʾË@ ¬A ® JË@ Write-thru,
Work, 
Writing system, éK. AJ» ÐA¢ 


Work area, ÉÔ« 鮢JÓ WVLAN,
Workaround,
Work around,

X
Workbook, €@Q»
X Align, ­J
“QK
Workflow, ÉÒªË@ Q
ƒ X-axis, úæJ ×

Work group, ÉÔ« é«ñÒm.×


ƒ Pñm   
XDMCP socket, éJ
ÊjÖÏ @ I»ñ‚Ë@

Workgroup, ÉÔ« é«ñÒm.× XML, ýæk
Working,

Xor,
Working directory, X server,
Working memory,
Working set, Y
Working set model, Y-axis, ø XA“ Pñm×
Work in progress, PAm .' B @ YJ
¯ ÉÔ« 

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

Copyright 2006, Arabeyes.org. All rights reserved.


Redistribution and use in source (SGML DocBook) and ’compiled’ forms (SGML, HTML,
PDF, PostScript, RTF and so forth) with or without modification, are permitted provided
that the following conditions are met:
Redistributions of source code (SGML DocBook) must retain the above copyright notice,
this list of conditions and the following disclaimer as the first lines of this file unmodified.
Redistributions in compiled form (transformed to other DTDs, converted to PDF, PostScript,
RTF and other formats) must reproduce the above copyright notice, this list of conditions
and the following disclaimer in the documentation and/or other materials provided with the
distribution.
Important: THIS DOCUMENTATION IS PROVIDED BY THE ARABEYES WIKI
TEAM ”AS IS” AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT
NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FIT-
NESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
THE ARABEYES WIKI TEAM BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDEN-
TAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIA-
BILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY
WAY OUT OF THE USE OF THIS DOCUMENTATION, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
 KñÊË ø X € @ úG ø Q¯ é’
†ZA  kP


.

. é£ñ
®m × †ñ  ®m Ì '@ É¿ . Arabeyes.org , 2006 q‚Ë@ †ñ  ®k 
. ð @ ÉK
YªJË@ YªK. Ð@Yj JƒB@ð ©K

ð @ (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¢ƒ YJËñK ÕæK à @ Im'


¬Q¢Ë@ ZCgZð , è Yë  ðQå„Ë@ éÓZA¯ð , èC« @ Pñ»YÖÏ @ q‚Ë@ †ñ
    ®k


..

èXA« @ YJ« é«ñÒj      


. ÖÏ @ ú
¯ Aë Q
¯ñK ÕæK
øQk @ X@ñÓ ø
@ ð @/ð ‡J
KñJË@ ú
¯ @ð Qê¢
àZð , èAKX @ Pñ»YÖÏ @
 Qk @ ¨ñK úÍ @ éËñm  ×) éªÒj  ÖÏ @ éJJ êË@ ú¯ ©K Pñ
RTF ð @ PostScript ð @ PDF úÍ @ éËñm× , DTD áÓ .


JË@

.(øQk @ éJJ
ë ø
@ ð @
 ‡J KñJË@ YJ ‚Ó
áÓ ¬Q¢Ë@ ZCg @ ©Ó ñë AÒ» QK
@ H. Q« ú
¾K
ð ‡K
Q¯ 颃@  ñK @ Yë
.

 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. èPA‚k ; éÊ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ƒ@



᫠ɾƒ ø ZH. ZQ¢ úæË@  ð ,(½Ë X Q


« ð @ ÈAÒëZÈ@ éJÒ ’ JÓ) éJ
KYÓ ð @ éÓ PB ð @ éK
Y®«  éK ÈðZÓ



ÉJÓ ¨ñ¯ð  áÓ
@ Yë
.Qå”Ë@ QK
YjJË@ Õç' ñË úæk , ‡J
KñJË@ @ Yë Ð@Yj Jƒ@