English Arabic Technical Computing Dictionary

Arabeyes Arabisation Team http://wiki.arabeyes.org/Technical Dictionary

Versin: 0.1.29-04-2007 April 29, 2007

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 [email protected].

    Q    Ì   ÉJ ª‚Ë@ éÒ¢@ Ñ«YË QK AK.Q« ¨ðQå„Ó .« èQK ñ¢ ÕæK ø YË@ úæ®JË@ úGñƒAm '@ €ñÓA®ÊË éj‚ èYë          .   l×. @QK. éÔg. QK ú¯ éÊÒªJ‚ÖÏ@ éJ J®JË@ HAjÊ¢’Ö Ï@ YJ kñKð éÔg. QK úÍ@ €ñÓA®Ë@ ¬YîE .ºKñJ ËAK. éîD J.‚Ë@         ÐYjJ‚ÒÊË éÒj. ‚Óð éÓñê®Ó H. ñƒAg éêk. @ð Õç'Y®JË ð á ÔgQÖÏ@ á K. H. PA’JË@ øXA®JË ,H. ñƒAmÌ'@ .           ¾JÖ Ï .€ñÓA®Ë@ éK AîE ú ¯ èQ¯ñJÖÏ@ ð †ZAKñÊË ø X €@ ú G. ø Q¯ é’kP ù ë €ñÓA®Ë@ é’kP . éJ K.QªËAK. ÕÎ @ [email protected]  . úΫ ÈA’B@ ð@ èC«@ à@ñJªË@ úÍ@ H. AëYË@ ZAg. QË@ ,á ÒëA‚ÖÏ@ ɾK. I. kQK A Abortive release  ‘êm .× (ú¾J.ƒ) ¨A¢®K@

Abort Aêk . @ Abscissa ú æJ ƒ Absolute address ‡Ê¢Ó à@ñ J« Absolute pathname ‡Ê¢Ó PA‚Ó Õæ @ Absolute path ‡Ê¢Ó PA‚Ó Absolute ‡Ê¢Ó Abstract class XQm.× ­J“ Abstract data type XQm.× HA KAJ K. ¨ñK Abstract datatype XQm.× HA KAJ K. ¨ñK Abstract interpretation ×  XQm. ÉK ðZH Abstraction YK Qm.' Abstract machine    èXQm.× éJ Ë@ Abstract method   èXQm.× é®K Q£ Abstract syntax tree     èXQm.× éJ K. èQm. Abstract syntax   èXQm.× éJ K. Abstract X Qm.× Accelerated Graphic Port f ¨Qå„Ó úGAJ K. Y®JÓ Accelerator ¨ f Qå„Ó Accent é»Qk Acceptance testing  éJ J.ÊJË@ PAJ.Jk @ Accept  ÈñJ.¯ Access control list Èñ“ñËAK ÕºjJË@ éÓZA ¯ . Accessibility ékA K@ Accessible hAJÓ Access level Èñ“ñË@ øñJ‚Ó Access memory Èñ“ñË@ èQ»@ X Accessory ú ÍAÒ» Access XA ® K Accounting management   HAK .A‚mÌ'@ Q ‚ Account HA‚k Accumulator . Õ»@QÒ,Ó
f»QÓ Accuracy é¯X Acknowledgment Qºƒ ,àA ¯Q« Acoustic coupler úGñ“ àPA ¯ Acquire  H. A‚»@ Acronym PA’Jk@

Action Z@Qk. @ Activate ¡J ‚K Active ¡J ‚ Activity A‚ Actor É«A¯ Actuator ɪ ‚Ó Adapter ­J ºÓ Adaptive answering   éJ ®J ºK éK.Ag. @ Adaptive learning   ù® JºK ÕΪK Adaptive routing ù®J ºK éJ k. ñK Adapt  ­ JºK Add-In ¬A ’Ó Additional ú ¯A“@ Additive ú×AҒ @ Address book  áK ðAJªË@ Q¯X Address bus áK ðAJ« ɯA K

Addressee éJ Ë@ ɃQÓ Addressing éKñ J« Address à@ñ J« Add  é¯A“@ Adjacency PðAm.' Adjacent PðAm.× Adjust   éK ñ‚ Administration Q‚

Administrative øP@X@  Administrator Q ‚Ó Admin QK YÓ Advanced ÐY®JÓ Advance ÐY®K Affine transformation   ù®ËAK ÉK ñm'

Affordance èPAÓ @ Agenda èQº ®Ó Agent  ñ®Ó Aggregate type ÉÒm.× ¨ñK Aggregate × ÉÒm. Aggregation ©J Òm.' Aggregator ÉÒm.× Aging ÐXA®K AGP Agreement †A ® K@ Agree ‡¯@ñÓ Airbrush  é«AJ.“ X@XQÓ Air restrictor   Y J®K éjJ ®“ Alarm clock éJ.JÓ Alarm éJJ K . Aleph ­Ë @ Alert box éJ J.JË@ ©K.QÓ

Alert P@Y K @ Algebraic data type øQ.g. HA KAJ K. ¨ñK Algebraic structure   éK Q.g. éJ K. Algorism  é JÓPP@ñ k Algorithm  éJ ÓPP@ñk Aliasing bug á ‚  Ég Aliasing    Ⴀ , éJ Jº K Alias  éJ J» Alignment  ¬A®¢“@ ,­J ®’ Align  ¬A®¢“@ ,­J ®’ Allocate ‘m' Allow hAÖÞ

Alphanumeric øY« øYm'@ . . Alpha A®Ë @ ALSA     éÓY®JÖ Ï@ éJ Kñ’Ë@ ºJJ Ë éJ K. Alteration  (‘) ­K Qm' ,¬CK@ ,[ɒ@] (àñË) Èñ’ Alternating  ú G.ðAJK Alternative ÉK YK. Alter Qª K  Amateur packet radio è@ñê ËÐQk é«@ X @ Amount éJ Ò»

Amper Q J.Ó@ Amplify  Õæ j’ Amplitude ©ƒð Analogue computer   úÎKAÖß H. ñƒAg Analog Q ¢  Analysis ÉJÊm'

Anchoring ZAƒP@ Anchor  ¡.QK , èAƒQÓ Angle bracket èPñ‚ºÓ Angle  éK ð@P Animate ½K Qm' Animation é»@Qk Annotation éJ ƒAf, ®J ʪK, HA ®J ʪK, éJ ‚m '

Announcement àC« @

Announce àC« @ Anonymous remailer Anonymous Õæ B@ Èñêm× . Anti-aliasing á‚ Ë@ éË@ P @ Antialiasing   á J‚ Ë@ éË@P @ Antichain XA’Ó XA®“ Antisymmetric ÉKAÒ JÓ B Antivirus software  HAƒð Q ®Ë@ áÓ éK AÒmÌ'@ l×. AKQK. Anti virus HAƒð Q ¯ XA’Ó ,HAÔ g XA’Ó Anytime algorithm    éJ J¯ð B éJ ÓPP@ñ k Apostrophe  AJ Ê« éʓA¯ Appear Pñê£

Append †Am Ì'@ Applet iÖß QK . . Appliance éË @ Application   ‡J J.¢ Apply ‡J J¢ . Approval P@Q¯@ Approved éJÊ« †XA’Ó

Approve P@Q¯@ Approximate  úæ KQ®K Approximation algorithm   . I KQ®K éJ ÓPP@ñ k Arbitrary . ù®J » Architecture  éJ K. Archive site  ù®J ƒP @ ©¯ñÓ

Archive ­J ƒP @

Archiving é® ƒP @ Arc €ñ¯ Area 鮢 JÓ Arena  éJ.Êg Argument ù¢ªÓ Arity  éJ .KP Arrangement  (HAJ “AK P) éJ. KQ K Arrange   I.  KQK Array é¯ñ ®’Ó Arrowhead ÑîD €ZP Arrow key ÑîD„Ë@ hAJ®Ó Arrow ÑîD Article éËA ®Ó Artifact  .Qk Artificial intelligence ú«AJ¢“@ ZA¿X Artificial neural network    éJ «AJ¢“@ éJ »ñƒ éºJ.ƒ Ascender Y«A’,«ñ¯QÓ Ascending  ø Y«A’ Aspect-oriented programming   I. K@ñm.Ì'AK. éêk. ñÓ ém.×QK. Aspect ratio  QªË@ úÍ@ ¨A®KPB@ éJ.‚ Aspect IKAg . Assembler . ¨
fÒm.× Assembly code   ©J Òm.' èQ®ƒ Assembly language  '  éJ ªJ Òm. éªË Asserted Y»ñÓ Assertion YJ »ñK Asset management   Èñ“@ Q ‚ Assignment problem    (ém.×QK.) á ªK éËZÓ Assignment á ªK  Assign á ªK Assistant Y«A‚Ó Associative array  (ém.×QK.) ù¢.@QK ÈðYg. Associative memory   éJ ¢.@QK èQ»@X Asterisk   (*) éÒj. JË@ éÓC« Asymmetrical modulation  á  ø Q£AJKB Ғ Asymmetric Q£A J JÓB Asynchronous logic   ú æÓ@QKB ‡¢JÓ Asynchronous  ú æÓ@QKB Atomicity   ¨ñk. QË@ éJ Ë@ Atomic ø PX Atom èP X At sign @ éÓCªË@ Attachment ‡¯QÓ

Attach †A ¯P @ Attempt éËðAm × Attenuation  ­J ®m' Attenuator × ¡ÊÓ ,‘®m Atto- K@ Attribute  éJ “Ag Audiographic teleconferencing '  YªK. á« ù ¢J ¢m ù ªÖÞ ¨AÒJk. @ Audiographic ' ù ¢J ¢m ù ªÖÞ Audio ùªÖÞ Audit   ‡J ¯YK Authenticate  ‡J Kñ K Authentication  ‡J Kñ K Authenticity ém• Authentify é¯XA’Ó Authoring ­J ËZH Authorization ‘J kQ K Authorize ‘J kQ K Author ­ËZÐ Autocompletion    ø ZA®ÊK ÐAÖß@ Autoconfiguration   ú Í@ ÉJ º‚ Autodetect   ú Í@ ­‚» Autoloader   × ú Í@ÉÒm Automata theory     ú ÍB@ÈAªJƒB@ éK Q¢ Automated testing   ú Í@ PAJ.Jk@ Automatically   AJ Ë@ Automatic baud rate detection H@XñJ ËAK IJ Ë@ é«Qå„Ë úÍ@ ­ ‚» . . .  Automatic hyphenation úÍ@ ɓ@ð ¡Qå„  Automatic úÍ@ Automation   éK ZA®ÊK Automaton    ú Í@ɪJ‚Ó Automounter  ú Í@I. »QÓ Autotrace   ú Í@ ©J.K Auto    ø ZA®ÊJJ Ë@ Auxiliary storage ' ú ¯A“@ áK Qm Auxiliary ú ¯A“@ Availability Q¯ñ K Available Q¯ñ JÓ

Avatar PAJ¯ @ Average seek time    颃ñJÓ Im '. èYÓ Average ¡ƒñJÓ Axial øPñm× Axiomatic semantics  éJ îE YK. HAJ ËBX Axiomatic set theory   éJ îE YJ.Ë@ HA«ñÒj . ÖÏ@ éK Q¢  Axiom  éJ îE YK. Axis Pñm× B Backbone site «  ø XAÔ ©¯ñÓ Backbone XAÔ« Back door  ÐA¢JË ø Qå ÉgYÓ Backend ù®Ê g úæîDJÓ Back-end   éJ ®Êg éK AîE Back-face culling Back-facing Background processing   éJ ®ÊmÌ'@ ú¯ ém.Ì'AªÓ Background  éJ ®Êg Backing store  Y«A‚Ó áK Q m' Back link   èXñªK. éʓð Backlog Backport g ú 愺« ÉÔ Back-propagation ù®Ê g PA‚K@ Back quote   éËZAÓ AJ Ê« éʓA¯ Backronym AJ ‚º« Qk . ñÓ Õæ @ Backside cache × ù ®Êg ZI. m Backslash ú愺« ÈZAÓ ¡k  Backspace ­Ê m Ì ¨@Q ¯ Backtick   éËZAÓ AJ Ê« éʓA¯ Backtracking  ù ®Êg ©J.K Backup rotation    ù £AJ Jk@ I. ¯AªK Backup software  AJ Jk@ l×. AKQK. Backup ù£AJ Jk@

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

Backward chaining ­Ê m Ì'@ úÍ@Y®“ Backward compatibility   é®K.A‚Ë@ H@P@Y“ZÈ@ ‡¯@ñK Backward compatible  AJ ®Êg ‡¯@ñJÓ Back ¨ñk. P Balance à P@ñ K Bandwidth     †A¢JË@ Qª,K XQË@ †A¢JË@ Banner  éK @PPAª ƒ Bareword Barrel shifter Bar ¡ Qå Baseband  ú æ Aƒ@ †A¢ Base class ú æ Aƒ@ ­J“ Baseline ú æ Aƒ@¡k Base memory   éJ ƒAƒ@ èQ»@X Basename ú æ Aƒ@ Õæ @ Base   èY«A¯ ,€Aƒ @ Batcher ©¯YÓ Batch file HAª ¯YË@ ­ÊÓ Batching ©J ¯YK Batch processing  HAª ¯YËAK. ém.Ì'AªÓ Batch éª ¯X Battery  éK PA¢. Baud rate XðAJ.Ë@ ÈYªÓ Baud XñK. Bay éj J¯ Beam Beamer HAK . Beam search ©J ÓA«X Im '. Bearer channel    éÊÓAg èAJ¯ Beeper Q®’Ó Beep Q ®“ Begin  ZYK. , éK @YK. Behavior ¼ñʃ Bell curve ú æ Qk. úæjJÓ Bell €Qk. Benchmark  Z@XB@ €AJ ¯ Best effort  (... éÓYg) Yêk. ɒ ¯@ Beta abstraction  ' AJ K. YK Qm.  Beta conversion AJ K. ÉK ñm' Beta reduction  AJ K. È@Qg@ Beta testing AJ K PAJJk@ . . Beta version AJ K. P@Y“@ Beta AJ K. Bibliography  éƒQê¯ ,©k. @QÖÏ@ Bidirectional printing '    èAm. B@ éK ZA JK é«AJ.£ Bidi èAm.'B@ øZAJ K Big-endian Q J.ºJ ¯Q£ Bijection  ÉK.A®K Bilinear patch    éK ZAJ K 骯P Binary coded decimal AKZAJ K P
ÓQÓ øQå„« f

Binary exponential backoff øZAJ K úæ @ Xñ¯P

Binary large object Ñm • øZAJ K àZA¿ Binary package   éK ZAJ K éÓQk Binary search   ' ø ZAJK Im . Binary tree    éK ZAJ K èQm. Binary øZAJ K Binding handle  AJ.KP@ ‘J .®Ó Binding-time analysis   AJ.KPB@ I ¯ð ÉJ Êm' Binding ¡.QË@ HAÓñʪÓ Bind ¡.P Bioinformatics   éK ñJ k éJ KAÓñʪÓ Bipolar   I. ¢®Ë@ øZAJK Bit block transfer   IK . éÊJ» É®K Bit depth  IJ .Ë@ ‡Ô« Bit gravity  IJ .Ë@ éJ K.XAg. Bitmap display  ù ¢®K Q« Bitmap font ù¢®K¡ k Bitmap   éK ZAJ K é£PAg Bit mask  IJ .Ë@ ¨AJ ¯ Bitonal image   HAg . PYË@ éK ZAJ K èPñ“ Bit pattern    éK ZAJ K éʂʂÓ Bit plane  éK ZAJ K i¢‚Ó Bit rate IJ .Ë@ ÈYªÓ Bit slice  HAK ZAJ K ém' Qå Bit string  HAK ZAJ K éʂʃ Bitwise Bitwise complement Bit  éK ZAJ K, IK . Blank ¨@Q ¯ Blending h. QÓ Blink ‘J Óð Bloat Block buffer Blocked record    éË
JºÓ éÊJ j. ‚ Block-structured f  ÉJ» éJ K. ðX Block (unit)   éÊJ» Block (verb) YJ Òm.' Block   YJ Òm.' ,(ÉJ») éÊJ» Blog éK ðYÓ Blur  hñ“ð ÐY« ,(Õæ P) éJ K.AJ.“ Board ékñË Body á Ó Bogon filter Bold ‘ Q« Boo Bookmarks ©¯ñÓ éÓC« Bookmark ©¯ñÓ éÓC« Book HAJ» Boolean . úGAJ ËñK.

Boot block ¨C¯@ éÊ J»

Boot image ¨C¯@ èPñ“

Booting ¨C¯@

Bootloader ¨C¯@ÉÒm ×

Bootrom (¡®¯ èZðQ ®Ó ¨C¯@ èQ»@ X) ¨C¯@ ­ ¯X

Boot server ¨C¯@ÐXAg

Bootstrap loader ¨C¯@ÉÒm × Bootstrap QKñJ JÒºË@ ÉJª ‚ YJêÖß ÐA¢  . Boot virus ¨C¯@ èAÔ g

Boot ¨C¯@ Border Yg Bottom-unique

Bottom É®ƒ @ Bounce message   H. ñKð éËAƒP Bounce YKQK Boundary scan øXðYg i‚Ó Boundary value analysis Boundedly complete Bounded XðYmÖ,ëAJ JÓ Bounding box  é£Ag@ ©K.QÓ Bound variable Bound  X
J®Ó Boustrophedonic f  h. QªJÓ Boxed comment  ©K.QÓ ‡J ʪK Box ©K.QÓ Bpp Brace èQå•Ag Bracket abstraction   €@ñ¯ZÈ@ YK Qm.' Bracket €ñ¯ Braille ÉK @QK. Branch coverage testing  ¨Q®JË@ éJ ¢ª K PAJ.Jk@ Branch delay slot   ¨Q®JË@ ÉJ êÖß éjJ¯ Branch prediction ¨Q® JË@ ©¯ñ K Branch ¨Q¯ Brand éK PAm' éÓC« . Breadth-first search Bð@ QªËAK . IjJ .Ë@ Breakpoint 骣A ®Ö Ï@ é¢ ®K Break point ¨A¢®K@ é¢ ®K Break (program) ¨A¢®K@ Break statement   ¨A¢®K@ èPAJ.« Break Q儻 Bridge (noun) Qå„k. Bridge (verb) Qå„k. Bridge Qå„k. Briefcase   éJ. J®k Brightness ¨ñ¢‚Ë@ Broadband     ©ƒ@ð †A¢Nªƒ@ð ø XQK †A¢ Broadcast quality video    éJ «@X@ èXñk. H@ X éK ZQÓ Broadcast IK . Brochure   éƒ@Q» ,I.  J» Broken line ¨ñ¢®Ó ¡k Broken  H. ñ¢ªÓ Browser (HAj ®’ JÓ .h) i®’ JÓ .  Browse i®’  Brush èA ƒQ ¯ Brute force attack     éJ ƒA®Ë@ èñ®ËAK. Ðñj. ë Brute force     éJ ƒA¯ èñ¯ Buffered write-through Buffering  áK ñ’ Buffer overflow à@ñ’Ë@ àA ¯ñ£ Buffer à@ñ“

Bug fix release iÊ’Ó P@Y“@  Bug fix Ég hC“@ Bug tracking system   ÈCg éªK.AJÓ ÐA¢  Bug éÊ« Build ZAJK . Built-in á Ò’Ó Bulletin board system H@Qå „JË@ ékñË ÐA¢  Bullet   é“A“PX@Yª K éK Q» Bus arbitration ɯ@ñ JË@ Õºk Bus cycle ɯ@ñ K èPðX Bus device  ɯAK PAêk . Bus error ɯA KZ¡ k Business to business « « á   ÉÔ ð ÉÔ K. èQk. AJÓ Bus mastering ɯ@ñ K éƒ @P Bus master  ɯ@ñK  ZP Bus network      éJ ¢k éºJ.ƒ, éK ðQå„Ó éºJ.ƒ Bus priority   ɯ@ñK éK ñËð@ Bus request  ɯAKI. Ê£ Bus sizing   ɯ@ñK Õæ j. m' Bus watcher   ɯAJË@ I. ¯@QÓ Bus ɯA K

Button binding P@PP @ ¡.P Button grab Button PP Buzz QK.QK. Bypass PðAm .' Byte addressing   HAJ KAÖ ß éKñ J« Byte-code compiler     éJ KAÖ ß èQ®ƒ Ñk. QÓ Byte-code interpreter    éJ KAÖ ß èQ®ƒ ÈðZÐ Byte-code    éJ KAÖ ß èQ®ƒ Byte compiler     éJ KAÖ ß èQ®ƒ Ñk. QÓ Byte order    HAJ KAÖß I.  KQK Byte IK AK. C Cable modem ÐXñÖÏ@ ÉJ.» Cable ÉJ.» Cache block ZIm × éÊ J» Cache coherency .  ZI. m× ½ƒAÖß Cache conflict  ZI. m× ú¯ PAªK Cache consistency  ZI. m× ½ƒAÖß Cache controller  ZI. m× ÕºjJÓ Cache hit  ZIm× éK.A“@ Cache line . ZI. m× Q¢ƒ Cache memory ZIm × . Cache miss ZIm × ZA¢k @ Cache  .  èZI. m× èQ»@X Caching-only  ¡®¯ ZI. k Caching server   èZI. m' ÐXAg,ZI. k ÐXAg Caching   I ¯ZÐ áK Q m' Calculate H. A‚k Calculation HA‚k Calculator . éJ.ƒAg Calendar  Õç' ñ®K Callback (ÐA¢ ) Z@YK XP Call-by-name Õæ BAK. Z@YK Call-by-need  ék. AmÌ'AK. Z@YK Call-by-reference ©k. QÖÏAK. Z@YK Call-by-value-result    éÒJ ®Ë@ éj. JJK. Z@YK Call-by-value   éÒJ ®ËAK. Z@YK Callee øXAJÓ Calling convention Z@YK †A ® K@ Callout Z@YK Call-with-current-continuation   éJ ËAmÌ'@ éʓ@ñÖÏAK. Z@YK Call ÈA’@ Camera èQÓA¿

Cancel ZAªË @ Candidate key h
ƒQÓ hAJ®Ó f Canonical name éJ Ê« ¬PAªJÓ Õæ @ Canonical úGñ KA ¯ Canonicity   éJ Kñ KA ¯ Canvas    Õæ Ғ éºJ.ƒ Capability èPY ¯ Capacity 骃 Caps Caption   ú «Q¯ à@ñJ« , ékñË hQå Captured image é¢ ®JÊÓ èPñ“ Capture A®JË@ Card cage   HA ¯A¢. ‘®¯ Cardinality úæ„ ZP  Cardinal number úΓ@ Y« Card slot   HA ¯A¢. éjJ¯ Card  é¯A¢. Caret   éªJ.¯

Carriage return (¬Qm×) Q¢‚Ë@ úÍ@ ©k. QÓ ,Q¢‚Ë@ úÍ@ ¨ñk. P Carrier scanner ÉÓ@ñk ém AÓ

Carrier signal éÊÓAg èPA ƒ@ Carrier ɯA NÊÓAg Cartesian coordinates  éJ KPA¾K X HAJ K@Yg @ Cartesian product  úGPA¾K X Z@Yg. Cascaded list    ék. f PYÓ éÓZA¯ Cascade ÈCƒ Cascading style sheet    éJ.¯AªJÓ Hñʃ@ é¯Pð Case based reasoning  . éÊJÓZÈ@ úΫ á .Ó Q º®K Case (font)  (¬QmÌ'@) éËAg ,(¬ðQk) Q.» Case insensitive ¬ðQmÌ'@ Q.ºK. QKZ IÓ Q « Case-sensitive ¬QkZÈ@ éËAm Ì P
JÓ f Case sensitivity ¬ðQmÌ'@ Q.ºK. QKZ H Case statement   éËAg èPAJ.« Case éËAg Cast Casting Catalog XQå„Ò,k. ñËAJ» Catch-all-entry  Ég@YÖÏ@ É¿ ‘J .¯ Category èZ ¬ Catenet Cathode ray tube   ø XñKA¿ H@Qk H. ñJ.K@ Cationic cocktail  × ú GñJ KA¿ ÈñÊm Cause-effect graphing    úæ‚Ó úæƒ ¡J ¢m' Cell encoding . . AK CmÌ'@ Q ÓQK Cellphone  ø ñÊg ­KAë Cellular automata    éK ñÊg éJ Ë@ HC ª J‚Ó Cellular automaton    ø ñÊg úÍ@ɪJ‚Ó Cellular multiprocessing     éK ñÊg èYªJÓ ém.Ì'AªÓ Cell  éJ Êg Centered ¡ƒñÓ Center (ɪ¯) ¡J ƒñK ,Pñm× ,­’JJÓ ,Q»QÓ ,¡ƒð Centimeter  QÒJ Jƒ Central arbiter  ú ¯ñJ J ø Q»QÓ Õºk Central office  øQ»QÓ I. JºÓ Central processing unit    éK Q»QÖ Ï@ ém.Ì'AªÖÏ@ èYgð Centum call second    ÈA’@ éJ KA K èZÐ Cepstrum  ÐðQ‚.ƒ Certificate YJîD„

Certify XAîD @ Chad box HA J¯ †ðY J“ Chad HA J¯ Chain   YJ ¯, éʂʃ Change management Q   ªJË@ èP@X@ Changeover Qª JË X@YªJƒ@  Change Q ª K Channel service unit     éK ñJ ¯ éJ ÓYg èYgð Channel èA J ¯ Chaos €@ñ ƒ Chapter ɒ¯ Character device ú¯Qm× PAêk . Character encoding scheme  ¬PAm× Q ÓQK ¡m× Character encoding ¬QkZÈ@ Q ÓQK Character graphic ú¯Qm × Õæ P Characteristic function    èQ Ó éË@X Character key ú¯Qm × hAJ®Ó Character map  ¬QkZÈ@ é¢ Qk Character repertoire ¬PAm × XQå„Ó Character set identifier  ¬PAm× Õ®£ ¬ f QªÓ Character set  ¬Qk@ é«ñÒm.× Character-special Character string ×  ¬PAm éʂʃ Character ¬Qm Ö,¯Qk,QÓP Char cell  ¬Qm× éJ Êg Charityware Q × ø g l. AKQK. Charmap ¬PAm × é£PA g Charset ¬PAm × Õ®£ Chart  ú GAJ K. Õæ P , é£A¢k Char ¬Qm × Chase pointers Añ²‚’ ’ ®K Qå ZÐ Chatchup Chat room éƒXPX é¯Q « Chat script éKXAm × ñ¢m × Chat éƒXPX Checkbox menu   Q ƒZ H ©K.QÓ H@PAJ k éÓZA¯ Checkbox  Q ƒZ H éKA g Check box  Q ƒZ H †ðYJ“ Checkered Checkout  Checkpoint ‡j JË@ é¢ ®K Checksum ¨ñÒjÖÏ@ ‡J ¯Y K . Check ‘m¯ Child directory øñJK . ÉJ ËX Child process   éK ñJK . éJ ÊÔ« Child record    éK ñJK . éÊJ j. ‚ Child status   éK ñJK . éËAg Child structure   éK ñJK . éJ K. Child version   éK ñJK . éj‚ Child widget  úG ñJK. éêk. @ð Qå”J« Child window ú «Q¯ PA£@ Child ø ñJK. Chip box HA J¯ †ðY J“ Chip set  hZ@Qå é«ñÒm.× Chip [HA ¯A ¯P] é¯A ¯P Choice PAJ Jk@ Choose PAJ Jk@ Chroma Chroma key Chromatic number  ú GñË Y« Chrome ÐðQº,J ÓðQ» Chrominance  éJ KAÓðQºË@  Ciphertext Q® ‚Ó ‘ Cipher  èQ®J ƒ Circle èPZ@X Circuit switched È@YK.ZÈ@ AK PðX Circuit switching Circuit èP@X Circular buffer × ø PðX ¡®m Circumflex éªJ ¯ . Class hierarchy ¬A J“ @ éËCƒ Classical logic   øYJ Ê®K ‡¢JÓ Classic  øXAJ J«@ ,øYJ Ê®K Classification  ­J ’ Classify  ­J ’ Class library  ¬AJ“ @ éJ.JºÓ Class method éJ ® J“ é®K Q£

Classpath ¬A J“ @ PA‚Ó Class variable ­J“ Q ª JÓ Class ­ J“ Clause YJK . Clean ­J ¢  ,­J ¢ K Clear box testing Clear ñm× Click (noun) èQ ®K Click (verb) Q®K Click  Q®JK Client-server model ÐXAgð ÉJ Ô« h. XñÖß Client-server ÐXAgð ÉJ Ô« Client-side  ÉJ ÒªË@ éêk. áÓ Client ÉJ Ô« Clip art é“A’ ¯ Clipart    éJ J ¯ é“A’¯ Clipboard é¢ ¯Ag Clip board HA“A’ ¯ ékñË Clip list HA“A’ ¯ éÓZA ¯ Clip mask é“A’ ¯ ¨AJ ¯ Clipping Clipping plane Clock rate é«Aƒ é«Qå  Clock speed    éJ KA ®J ÖÏ@ é«Qå Clock é«Aƒ Clone device q‚J‚Ó PAêk . Clone pA‚ Jƒ@ ,q‚ J‚Ó Closed set   é®ÊªÓ é«ñÒm.× Closed surface é®Ê ªÓ ékA‚Ó Closed term ‡Ê ªÓ Yg

Close routine †C « @ èQKð

Close †C « @ Closure conversion

Closure †C « @ Clover key É® K hAJ®Ó Clumsy €ZA£ Cluster file Y‚k ­ÊÓ Clustering Y‚k Cluster member Y‚k ñ’« Cluster node       Xñ®J« èY®« , éÊJ ’k èY®« Cluster-transport Y‚k É®K Cluster Xñ®J« , éʒ k Coalesced sum Coarse grain á ‚k AJ.k Coaxial cable × ø Pñm ɓñÓ Coaxial PñjÖÏ@ YjJÓ Coax PñjÖÏ@ YjJÓ ÉJ.» Cocktail shaker sort Cg PQ ¯ Codebase èQ ® ƒ èY«A ¯ Codec PAÓQÓ Coded character set Q ÓQÓ ¬PAm × Õ®£ Code division multiplexing Code management    èQ®ƒ Q ‚ Code position QÓP ©“ñÓ Code (program) èQ ® ƒ Code segment èQ ® ƒ 骢 ¯ Code (symbol) QÓP Code violation PAÓQË@ (Y«@ñ¯) †Q k Code walk   èQ®ƒ éªk. @QÓ Code  QÓP ,(úm×QK. ‘) èQ®ƒ Codomain . Coefficient ÉÓAªÓ Cognitive architecture   éJ »@PX@ èPAÔ« Collaboration àðAª K Collapse ù £ Collate ÐPP Collection  é«ñÒm.× Collect A®JË@ Collision detection HAÓXA’  ­ ‚» Collision ÐXA’ Colocation   ú ¾J.ƒ ÉJ “ñK Colon àA J¢ ®K Color chooser à@ñË@ P
f Jm× Color map à@ñËZÈ@ ¡m ×

Colormap à@ñË @ ¡m ×

Color model à@ñË @ hXñÖ ß . Color saturation à@ñË @ ¨AJ.ƒ@ Color àñË

Colour depth à@ñË @ ‡Ô « Colour look-up table à@ñËZÈ@ á« Im ' ÈðYg . . Colour model à@ñË @ hXñÖ ß . Colour palette à@ñË @ ékñË Colour àñË Column span Column XñÔ« Combination   éªJ Òm.' Combinatory logic ù®¯@ñ K ‡¢ JÓ Combinator    éJ ®¯@ñK éË@X Combine á  K. ­J ËZH Combo box XQå ð QK Qm' ©K.QÓ Combobox I»QÓ ©K.QÓ . Command button QÓ@PP

Command interpreter QÓ@ð@ ÈðZÐ

Command key QÓ@ hAJ®Ó Command line interface QÓ@ðZÈ@ Q¢ƒ éêk @ð . Command-line interpreter QÓ@ð@ Q¢ƒ ÈðZÐ

Command line option QÓ@ð@ Q¢ƒ PAJ k Command line QÓ@ðZÈ@ Q¢ƒ

Command Prompt QÓ@ð@ Im ×

Command QÓ@ Comma separated values   ɓ@ñ®K. éËñ’®Ó Õæ ¯ Comma éʓA ¯ Comment out   ‡J ʪK éË@P @ Comment  ‡J ʪK Commercial a YJ« éÓC« Commit  ¨Xð@,I. ºKP@ Common carrier  ø XAJ J«@ ÉÓAg Common factor ¼Q‚Ó ÉÓA« Common ¨ZAƒ Communications port HBA’ @ Y ® JÓ Communications software  HBA’ @ l×. @QK. Communication system ÈA’@ ÐA¢  Communications HBA’ @ Communication ɓ@ñK Compact disc  l×. YÓ Q¯ Compaction ¡ª “ Compactness preserving ÐA’  ¡ ®k Compact   ÐA’ JÒ,m .×YÓ,QJºÒ,“@ QÓ Company é»Qå „Ë@ Compare éKPA ®Ó Compatibility ‡¯@ñ K Compatible ‡¯@ñ JÓ Compilation  ­K Qå” Compiler compiler   Ñk. QÓ Ñk. QÓ Compiler ¬ f Qå”Ó Compile time YJʂ Q K èYÓ Compile  ­K Qå” Complement éÊÒº K Complete graph    éÊÓA¿ é¢J ¢m' Complete inference system  ÉÓA¿ AJ.J ƒ@ ÐA¢  Complete lattice Complete metric space Q ÉÓA¿ ø Ó ZA’¯ Completeness ÈñÒ» Complete partial ordering   ÉÓA¿ øZQk . I.  KQK Complete theory  ÈñÒ» éK Q¢  Complete unification ÉÓA¿ YJ kñK Complete ÐAK Complexity analysis   Y®ªK ÉJ Êm' Complexity class Y®ª K ­ J“ Complexity measure    Y®ªK €AJ ¯ Complexity Y®ª K   Complex number I. »QÓ Y« Complex programmable logic device      YJʂ QË éÊK.A¯ Y®ªÓ ù®¢JÓ PAêk . Component architecture   éJ K ñºÓ èPAÔ« Component based development  HA KñºÖ Ï@ úΫ á .Ó QK ñ¢ Component à ñºÓ Compose I J»QK Composite drive . Composite   éJ.»QÓ é«ñÒm.× Composition  I. J»QK Compound key  H.
f»QÓ hAJ®Ó Compressed video   é£ñª ’Ó éK ZQÓ Compressed ñª ’Ó Compressibilty factor Aª ’ ZÈ@ ÉÓA« Compression ¡ª “ Compress ¡ª “ Computability theory   I.  ‚m' éK Q¢ Computable   I ‚jJË ÉK.A¯ Computational complexity . Computational geometry Computational learning Computational molecular biology   éJ K.ñƒAg éJ K Qk . AJ k. ñËñJ K. Computational organochemistry   éJ K.ñƒAg éK ñ’« ZAJ ÒJ » Computer cluster  ú G.ñƒAg Xñ®J« Computer cookie H. ñƒAg øñÊg Computer ethics  HñƒAg HAJ ¯Cg@ Computer-generated imagery .  HñƒAmÌ'AK. YËñÓ QK ñ’ Computer language .  QKñJ J.ÒºË@ éªË Computer law HñƒAg àñ KA ¯ . Computer literacy HñƒAmÌ'AK. ÐAÖÏ@ Computer network .  I. ƒ@ñk éºJ.ƒ Computer program HñƒAg l×AKQK . . . Computer security QKñJ J.ÒºË@ áÓ @ Computer virus úGñƒAg €ðQ ¯ Computer vision . ú G.ñƒAg Qå”. Computer H. ñƒAg Compute server H. A‚k ÐXAg Compute HA‚k Computing . éJ.ƒñk Computron àñK .ñƒAg Concatenated key ÐñÒÊÓ hAJ®Ó Concatenate ÕË Concentrator P
f»QÓ Conceptualisation éÒê ®Ó Concrete class èYm × èZ ¬ Concrete syntax ' ø XAÓ ñm Concurrency áÓ@ Q K Concurrent processing   邯AJÓ ém.Ì'AªÓ Concurrent ‡¯@QÓ Condensed Qk . ñÒ,®JºÓ Condense ­J Jº K Condition out Qå ©K Q®K Condition éËAg , Qå Conduit øQm.× Cone ðQm × Confidence test  é®K PAJ.Jk@ Confidential øQå  Configuration item  ÉJ º‚ Qå”J« Configuration management Configuration programming   ÉJ º‚ ém.×QK. Configuration  ÉJ º‚ Configure ¡J.“ Confirmation YJ »ZH Confirm YJ »ZH Conflation Conflict  H. PA’ Congestion àA ®Jk@ Conjunction à@ Q¯@ Connected graph ɒJÓ àAJ J.Ó Connected subgraph ɒJÓ ú«Q¯ àAJ J.Ó Connectionless protocol   ÈA’@ àðYK . †A®J Ó Connection-oriented network service      ÈA’BAK. éêk. ñÓ éJ ºJ.ƒ éÓYg Connection-oriented   ÈA’BAK. ék. ñÓ Connection pool  HBA’ @ ©Òm.× Connection ÈA’@ Connective  ú ÍA’A,¢.@P Connectors Añ²ƒ ¡.@P ,ɓñÓ Connect ÈA’@ Conservative evaluation ¡ ¯Am × Õæ®K Consistently complete Console-access Console Õºm' ékñË Consolidate Õæ«YK ,YJ £ñK Constant angular velocity    éJK.AK éK ð@P é«Qå Constant applicative form      IK.AK ù ®J J.¢ ɾƒ Constant folding IK .AK ù£ Constant linear velocity    éJK.AK éJ ¢k é«Qå Constant mapping Constant IK .AK Constraint functional programming     éK YJ ¯ éJ ®J £ð ém.×QK. Constraint satisfaction  XñJ ¯ ZA“P @ Constraint   Q儯,YJ ¯ Constructed type úæJ .Ó ¨ñK Constructive solid geometry    éK ZAJK . éJ.ʓ éƒYJë Constructive øZAJK . Constructor ú GAK. Consultant PA‚‚Ó Contact (noun) é¯QªÓ Contact (verb) ÈA’@ Contact   €AÒJËéËA’ @ éêj. ,ʃ@QÓ Container class ¨@ð ­ J“ Container   éK ðAg, éJ.ʪ,«XñJ‚Ó,ZA«ð Content addressable memory    Y’®Ë ÉK.A¯ øñJm× H@ X èQ»@X Content-based information retrieval  øñJjÖÏ@ úΫ á.Ó HAÓñʪÓ I. m Contention slot ¨PA J K éÊêÓ Content øñJm× Context clash  †AJ ƒ PAª K Context-free grammar   †AJ ‚Ë@ á« É®J‚Ó ñm' Context-free   †AJ ‚Ë@ á« É®J‚Ó Context object  †AJ ƒ àZA¿ Context operator  †AJ ƒ ÉÓA« Context-sensitive menu     †AJ ‚ËAK. èQKZ IÓ H@PAJ k éÓZA¯ Context-sensitive  †AJ ‚ËAK. QKZ IÓ Context switch  †AJ ƒ ÉK YJ.K Contextual menu     éJ ¯AJ ƒ H@PAJ k éÓZA¯ Context  †AJ ƒ Continuation passing style   éªK.AJÓ QK QÖß Hñʃ@ Continuation     . (éË@X) ÈA’@ ,(È@ðX ém.×QK.) éªK.AJÓ ,P@QÒJƒ@ Continue  éªK.AJÓ Continuous function éʒ JÓ éË@X Continuous wave   éʒJÓ ék. ñÓ Continuous ɓ@ñJÓ ,(¡k , éË@X) ɒJÓ ,QÒJ‚Ó Contour ¡J m× Contraction  ‘J Ê®K Contract programmer   Y®« Im ' l×Q. .Ó Contrast áK AJ.K Contribution éÒëA‚Ó Contributor ÑëA‚Ó Control code Õºm' QÓP Control file Õºm' ­ÊÓ Control flow Controller ÕºjJÓ Control point ÕºjJË@ é¢ ®K Control structure   Õºm' éJ K. Control unit Õºm' èYgð  Control Õºm' Conventional memory éJ kC¢“@ èQ»@ X

Convergence XA‚k @ Converge  Y‚m' Converse (‡¢ JÓ) º« ,ÉKñm'

Conversion to iteration P@QºJË@ úÍ@ ÉKñm'  Conversion ÉK ñm' Converting ' ÉK ñm  Convert ÉK ñm' Convex hull Cooccurrence matrix Cookie  øñÊg, 麪» Cooperative multitasking AJ KðAª JË@ ÐAêÖÏ@ YªK Cooperative g ú «AÔ . Coordinate  ‡J ‚K Coordination language   ‡J ‚K éªË Coprocessor Y«A‚Ó lÌ.'AªÓ Coproduct  úæKAg. h. ñJJÓ . Copy and paste ‡’ËZð q‚ @ Copying garbage collection Copy left  ©J Òm.Ì q‚Ë@ Copyleft Qk ­ËZÕË@ †ñ ®k Copy (noun) q‚ Copy protection   q‚Ë@ áÓ éK AÔg ,q‚Ë@ éK AÔg Copyrighted †ñ ®m Ì'@ ñ ®m × Copy right q‚Ë@ †ñ ®k Copyright Qå„JË@ †ñ ®k Copy (verb) éj‚  Copy q‚K Core class   éJ J£AK . èZ¬ Core dump á£AJ .Ë@ ©K Q®K Core file úæ£AK . ­ÊÓ Core gateway Core leak  á£AJ .Ë@ Qå„ Core á£AJ .Ë@ Corner  éK ð@P Corollary Correct iJ m• Correlation ‡ËAª K Correspondence ÐZCK Correspondent ÐZ@ñJÓ ,ÐZ@ñÓ Corrupt YƒA¯ Cost control callback Countable   X@YªJË ÉK.A¯ Counted XðYªÓ Counting records  @YªË@ HCJ j. ‚ Country code YÊJ.Ë@ QÓP Count X@YªK Coupling Courseware Covariance Crack Crash dump  ø PAJ îE@ ©K Q®K Crash PAJ îE@ Crawler H@Y®k@ P . Create ZA‚ @

Creation ZA‚ @

Credential cache éK XAÒJ« @ éJ KAg . Credential XAÒJ« @ Credits  QK Y®Kð Qºƒ Creeping featurism H@ Q ÖÏ@ ÈAîD @ Crisp ¬
’®JÓ Critereon f Criteria PAJ ªÓ Criterion ½m× Critical section h. Qk ZQk . Crop Cross-assembler Cross-compiler Cross-device link Crossed   ©£A®JJ.ËA’ Cross-fade Crossfade Cross-fading Cross-over Q.ªÓ Cross-platform HA’ JÖ Ï@ Q«,HA’ JÖ Ï@ Yª JÓ . Cross-reference éËAg @ Cruft Cruft together Crumb Cryptanalysis   éJ ÒªJË@ ÉJ Êm' Cryptography  Q ®‚ Cryptology  Q ®‚Ë@ ÕΫ Crypt  Q ®‚ Cube IªºÓ Cubing . Cumulative ùÒ»@QK Curly bracket Current directory úÍAmÌ'@ ÉJ ËYË@ Current session   éJ ËAmÌ'@ é‚Êm.Ì'@ Current working   éK PAm.Ì'@ ÈAª ƒZÈ@ , éK PAm.Ì'@ ÈAÔ«ZÈ@ Current úÍAg Curried function Currying Curses Cursor plane ‡Ë Q Ö Ï@ i¢ƒ Cursor ‡Ë Q Ó Curve  éJ Jj JÓ Customization  ‘J ’m' Customize  ‘J ’m' Custom window   éJ kC¢“ZÈ@ èY¯AJË@ Custom ‘m × Cut and paste ‡’Ë@𠑯 Cut buffer A’®Ë@ à@ñ“ Cutover Cut-through switching Cut ‘¯ Cyber Cyberbunny Cybercafe  Cybernetics úÍB@ ÕºjJË@ Cyberspace Cyber-squatting Cyclebabble Cycle crunch Cycle drought Cycle of reincarnation t AJ JË@ èPðX Cycle server Cycle èPðX Cyclic redundancy check   ZA¢kZÈ@ á« øPðX ‡J ¯YK Cyclic redundancy code Cyclomatic complexity Cylinder éK@ñ¢ƒ@ D Daemon  I. J¯P Daisy chain  ø QK X éʂʃ Daisywheel printer Damage Qå • Dangling pointer úÍYÓ Qå ZÐ Dash   é£Qå Data abstraction HA KAJ J.Ë@ YK Qm.' Data acquisition  HAJ ¢ªÖÏ@HCj. Jƒ A,KAJ ¢ªÖÏ@HA‚»@ Database administrator .  . HAJ ¢ªÓ èY«A¯ QK YÓ Database analyst    HAJ ¢ªÓ èY«A¯ Ém× Database machine    HAJ ¢ªÓ èY«A¯ éJºÓ Database management system   HAJ ¢ªÖÏ@ èY«A¯ Q K.YKÐA ¢  Database manager   HA KAJ K. èY«A¯ QK YÓ Database normalisation Database query language   HA KAJ J.Ë@ Y«@ñ¯ ÐCªJƒ@ éªË Database server   HAJ ¢ªÓ èY«A¯ ÐXAg Database   HA KAJ K. èY«A¯ Data bus  HA KAJ J.Ë@ɯAK Datacenter manager HA KAJ J.Ë@ Q»QÓ QK YÓ Data channel    HAKAJ J.Ë@ èAJ¯ Data communications analyst HAJ ¢ªÖÏ@ HC“@ñÓ Ém× Data compression HA KAJ K. ¡ª “ Data dictionary file  HA KAJ K. €ñÓA¯ ­ÊÓ Data dictionary  HA KAJ K. €ñÓA¯ Data driven HA KAJ JË@ áÓ †A‚Ó .  Data flow analysis HA KAJ K. ¬YK ÉJ Êm' Data flow diagram    × HAKAJ J.Ë@ ‡¯YK¡ m Data flow HA KAJ JË@ ‡¯Y K . Dataflow HA KAJ K. ¬YK Data fork  HAJ ¢ªÓ ©‚ Data frame   HAJ ¢ªÓ èY«A¯ PA£@ Data glove  HA KAJ K. PA ®¯ Datagramt Data hierarchy  HA KAJ J.Ë@ è
JÓQë Dataless client f HAJ ¢ªÖÏ@ áÓ úÍAg àñK .P Dataless management utility   HAJ ¢ªÖÏ@ áÓ éJ ËAg Q K.YK 骮JÓ Data link layer  HAJ ¢ªÖÏ@ ɓð é®J.£ Data link level HAJ ¢ªÖÏ@ ɓð øñJ‚Ó  Data logger HA KAJ K. Éj. ‚Ó Data logging Data mart HAJ ¢ªÓ èY«A ¯ †ñƒ

Data mining HA KAJ J.Ë@ÈCª Jƒ @ Data modeling  HAJ ¢ªÖÏ@ ék. YÖß Data modelling  HAJ ¢ªÖÏ@ ék. YÖß Data model HAJ ¢ªÖÏ@ h. XñÖß Data packet  HA KAJ K. éÓPP Data path HA KAJ K. PA‚Ó Data processing  HA KAJ J.Ë@ ém.Ì'AªÓ Data rate  HA KAJ J.Ë@É®K ÈYªÓ Data segment   HA KAJ K. 骢¯ Data service unit   HA KAJ J.Ë@ éÓYg èYgð Data service  HA KAJ K. éÓYg Data set organization  HA KAJ J.Ë@ é«ñÒm.× Õæ¢ J K Data set  HA KAJ K. é«ñÒm.× Data striping Data structure  HA KAJ J.Ë@ éJ K. Data transfer bus  HAJ ¢ªÖÏ@É®K øQå„Ó Data transfer rate   HA KAJ J.Ë@É®KÈ YªÓ Datatype definition HAJ ¢ªÖÏ@ ¨ñK ­K QªK Data type HA KAJ J.Ë@ ¨ñK Data unit  HA KAJ K. èYgð Data warehouse HAJ ¢ªÓ à Q m× Data warehousing HAJ ¢ªÖÏ@ à Q k Data HA KAJ K. Date t' PAK Datum ù¢ªÓ Daughterboard   éÊJ ʃ ékñË Daughtercard   éÊJ ʃ é¯A¢. Daughter  éÊJ ʃ Day mode ¡ÒJË@ ø PAîE Day ÐñK Deactivate  É¢. Dead code

Deadlock †PZÐ, éÓ P @ Deadly embrace Dead tree edition Dead IJ Ó ,É£A« Dealer  Qk.
fJÓ Deamon   YJ ®J JË@ ð Q®Ë@ I¯@QÓ Death code . Deb Debianize  éJ K.X Debugger i®JÓ Debugging  ZA¢kZÈ@ iJ j’ Debug    iJ ®J Jj’ Decay ÈZA’  Dechunker Decidability Decidable Decimal point  ø Q儫 ɓA¯ Decimal  ø Q儫 Decision problem P@Q¯ éʾ ‚Ó Decision support database       P@Q®Ë@ Ñ«X HAÓñʪÓ èY«A¯ ,P@Q®Ë@ Ñ«X HA KAJ K. èY«A¯ Decision support P@Q¯ Ñ«X Decision theory   P@Q®Ë@ éK Q¢  Declaration  éJ KC« ,¨CK.@ Declarative language éK QKQ®K éªË

Declare àC« @,ZBX@ Decoder PñÓQË@ ­ ƒA¿ Decode Q ÓQK ½¯ Decompress ¡ª “ ½¯ Decorative ú ¯QkP Decrease    ÉJ Ê®J®J ®jJ’J ®m' Decryption  Q ®‚ ½¯ Decrypt  Q ®‚ ½¯ Dedicated line QºÓ A¢k

Deductive database éJ kAJJ ƒ @ HAJ ¢ªÓ èY«A ¯ . Deductive tableau úkAJJ ƒ @ hñË Deep magic . Deep  ‡J Ô« De facto standard  ùª¯@ð PAJ ªÒ,J ʪ¯ PAJ ªÓ Default master Default route Default Q ú æ•@ ¯@ Defect analysis ' ɪË@ ÉJ Êm Defect density ɪË@ é¯A J» Defect I. J« Deferral ZAg. P@ Define  YK Ym' ,­K QªK Definite clause Definite sentence Definitional constraint programming Definition ­K QªK Deflate compression Òº JÓ ¡ª “ Deflate Òº JÓ Deforestation    éK.AªË@ éË@P @, éK.AªË@ HA JJk . @ Defragment    éJ ¢ ‚Ë@ éË@P @ Defunct process àA ¯ Z@Qk. A,JJ Ó Z@Qk. @ Degrees of freedom  éK QmÌ'@ HAg . PX Degrees HAg . PX Degree  ék. PX Deinstallation    I J.JË@ ½®,J J.JË@ éË@P @ Dejagging Delayed control-transfer Delay instruction Delay slot Delay QkZ H, éÊêÓ Delegation   éK.AJ K, éJªK. Deleted ñm× ,¬ð Ym × Delete ¬ Yg Deletia Deletion ñm× Delimiter Ym× Delivery Õæʂ Delta conversion Delta reduction Delta È@X Demand driven   èPðQå”ÊK . †A‚Ó Demand paged  èPðQå”Ë@ AJ j®“ Demand paging Demand  I. Ê¢ÖÏèèPðQå”Ë@ Demodulate    Õæ KQË@ ­‚º,ÒJ KQË@ A¾¯ Demodulation   Õæ KQË@ ­‚» Demo mode  ú jJ “ñJË@ QªË@ ¡Öß Demote  éJ.KQË@ áÓ ¡k Demo version   ú jJ “ñJË@ QªË@ èP@Y“@ Demo Q« Denominator Õæ A¯ Denotational semantics Deny ‘ ¯P Depeditate Dependability Dependable software Dependence  AJ.KP@ , éJ ªJ.K Dependency  éK XAÒJ« @ Deprecated PñjêÓ . Deprecate à@X @ Deprecation  éK@X@ Depth-first search  Bð@ ‡ÒªËAK. IjJ .Ë@ Depth ‡Ô « Dereference Derivative    ú ¯A®Jƒ@ Derived class é®J‚Ó èZ ¬ Derived type ‡J‚Ó ¨ñK Derived ‡J‚Ó Descender ¡Aî¯ñ‚ m × . f Descending ú支A J K Descent function Description ­“ñË@ Descriptor ­“@ð Deselect ZA®JK@ ÐY« Design pattern Design recovery Design  Õæ Ғ Desk check  ¯ ú æ.JºÓ ‘m Deskside   I. JºÖÏ@I. KAg. , èY’JÖÏ@I. KAg. Desktop background   I. JºÖÏ@ i¢ƒ éJ ®Êg Desktop database    I. JºÖÏ@ i¢ƒ HA KAJ K. èY«A¯ Desktop environment  I. JºÖÏ@ i¢ƒ ¡J m× Desktop manager Desktop publisher  I. JºÖÏ@ i¢ƒ Qm× Desktop publishing  I. JºÖÏ@ i¢ƒ Q.« Qå„ Desktop  I. JºÓ i¢ƒ Desk   I. JºÓ, èY’JÓ Destination Y’®Ó Destroy Q ÓYK Destructor ­ÊJÓ,YJ J.Ó Detach ¨Q K Detail ÉJ “A®K Detection ¬A ‚»@ Detective ­ ƒA¿ Detect ­ ‚» Deterministic Deterministic automaton Devel Developement  QK ñ¢ Developer P f ñ¢Ó Development environment QK ñ¢JË@ ¡J m× Development  QK ñ¢ Develop Pñ£ Device-dependent   èQ êj. JË ©“A g Device driver  PAêm .Ì'@ †ZAƒ Device group    H@ Q êm.' é«ñÒm.×,PAêk . é«ñÒm.× Device independent bitmap Device-independent Q   è êj. JË@ áÓ ú ÍC®Jƒ@ Device name PAêm .Ì'@ Õæ @ Device number  PAêm .Ì'@ Õ¯P Device PAêk . Diagonal line øQ¢¯ ¡k Diagonal  ø Q¢¯ Diagram é£A¢ k Dialer Dialog box P@ñk ©K.QÓ Dialog P@ñk Dial-up link    éJ ®Jë éʓñ,J ®Jë ÈA’@ Dial-up login  ù ®Jë h. ñËð Dial-up  ù ®KAë I. Ê£ Dialup    ù ®KAë , é®KAêÓ Dial ­ Jë Diameter Q¢¯ Diamond key AJ ƒAÓ hAJ®Ó Diamond €AÖÏ@ Dictate Q ®K Difference equation †PA ¯ éËXAªÓ Difference ¬C f, ¯PA ¯ Differential backup “A ® K ù£AJJk@ q‚ ú Î Differential driver “A ® K †ñ‚Ó , “A ® K †ZAƒ ú Î ú Î Differential line “A ® K A¢k ú Î Differential úΓA ® K Diges Digest é“C g Digi- Digital audio ¯  ù Ô P Hñ“ Digital camera       éJ Ô¯P QK ñ’ éË@, éJ Ô¯P@Q ÓA¿ Digital carrier ¯  ¯ ù Ô PɯANJ Ô P ÉÓAg Digital certificate  ¯   éJ Ô P èXAîD Digital computer ùÔ¯PH. ñƒAg Digital dashboard Digital electronics    éJ Ô¯P HAJ Kð QºË@ Digital envelope ¯ ù Ô P ¬Q£ Digital image    éJ Ô¯P èPñ“ Digitalize  Digital logic éJÔ ¯QË@ ‡¢ JÓ Digital service unit     éJ Ô¯QË@ éÓYmÌ'@ èYgð Digital signature ¯   ù Ô P ©J ¯ñK Digital versatile disc   ¨PAK. ùÔ¯P Q¯  Digital ùÔ¯P  Digitize éJÔ ¯P Digits ÐA¯P@ Digit Õ¯P Dimensioning  XAªK.ZÈ@ I J.K ð@ ­K QªK Dimension  €AJ ¯,YªK. Dingbat   × ú æ KQK ¬Qm Diode øZAJ K AÖޕ Diplex Directed acyclic graph Directed graph ék. ñÓ ñ¢m× Directed set  h. ñÓ èQÓP Direct graphic   èQå AJ.Ó HA KAJ K., èQå AJ.Ó HAJ ÓñƒP Directional coupler  Direction èAm.'@ Directive  úæîD k. ñK QÓ@ Direct mapped cache   ¡J ¢jJË@ èQå AJ.Ó éJ K.Ag Direct memory   èQå AJ.Ó èQ»@X Directory path Éj. ÖÏ@ ½Ê‚Ò,ÊJ ËYË@ ½Ê‚Ó Directory service   Éj. ÖÏ@ éÓYf,ÊJ ËYË@ éÓYg Directory stack  ÉJ ËYË@ ÐñºKYÊj. ÖÏ@ ÐA¿QÊJ ËYË@ ÐA¿P Directory ÉJ ËX Direct virtual Dirty  Zø YJ.,m ð Disable ÉJ¢ªK

Disassemble ©Êg @,A¾¯ Disassembly ©Êg,A¾ ¯

Discard YJ.K Disc drive Q¯ †ñ‚Ó Disclaimer ù® OPA¾ K@  Disconnected ¨ñ¢®Ò, º®Ò,«ñÊ m × Disconnect ÈA’@ ©¢¯ Discrete cosine transform Discrete Fourier transform       骢®JÖ Ï@ éK Pñ¯@ éÊK ñm' Discrete preorder Discrete ©¢®JÒ,ʒ ® JÓ

Discriminated union ¡®JÓ XAm'@ Discussion group     ¯AJ K é«ñÒm.Ö,ËXAm.' é«ñÒm.× Discussion P@ñk Disc Q¯

Disjoint union ɒ®Ö Ï@ ¨ñÊm × XAm'A,ʒ® JÓ XAm'@

Disk array @Q¯@ ­“P Disk controller   Q®Ë@ I. ¯@QÓ Disk device group    Q®Ë@ è@X@ é«ñÒm.× Disk drive Q¯ †ñ‚Ó Disk duplexing    Q®Ë@ éJ J K Diskette àQÓ Q¯ Diskfull client  Q®Ë@ ZúÎÓ àñK .P Diskless client   Q®Ë@ áÓ øPA« àñK .oå•Q¯ àðYK . àñK .P Diskless workstation Disk mirroring    Q®Ë@ éK ð@QÓ Disk operating system   Q®Ë@ áÓ ÉJ ª ‚ ÐA¢  Disk partition Q®Ë@ áÓ Õ愯 Disk path Q¯ PA‚Ó Disk striping Disk Q¯ Disman

Dismiss XAªK.A,ËQ« Dispatch XA®K @ Display device QªË@ PAêk . Display function Display Report Display report  QK Q®JË@ Q«@ Display standard Display terminal Q« ¬@Q¢Ó Display Q« Dissertation  IjJ .Ó, ékðQ£@ Dissipation  X f YJ.K Dissolve  éK.@X@ Distance é¯A‚Ó ,ɓA®, ¯PA ¯ Distinct  Q Ó Distort Z@ñJË@ , èñ‚ Distributed database    é«PñÓ HA KAJ K. èY«A¯ Distributed file ¨PñÓ ­ÊÓ Distributed memory é« PñÓ èQ»@ X Distributed system ¨PñÓ ÐA¢  Distributed ¨PñÓ Distribute ¨Pð Distribution ©K Pñ K Distributive lattice     ù ªK PñK  Qª,J ªK PñK ½K.Aƒ Distributor ¨PñÓ Dithering à@ñËZÈ@ HAJ .K Dither  ùÒëð ÉJ Ê¢  Diverge Divergence  h. @Q®K@,Y«AJ.J¯@Q®K@ Divergent  úk@Q®K@ ,ø Y«AJ.K Dividend .  ÑîD„Ë@ l'.QÓñ‚ ®Ó Divide é҂ ¯ Division é҂ ¯ Divisor Õæ A¯ Docbook     ‡J KñJË@ H. AJ» Docking station    I. J»QK èY«A¯ Dock I»QJ ,ƒQÓ Documentation .  ‡J Kñ K Document YJ ‚Ó Dollar PBðX Do loop P@QºJË@ é®Êg Domain address  É®mÌ'@ à@ñ J« ,ÈAj. ÖÏ@ à@ñ J« Domain architecture  ÈAj. ÖÏ@ èPAÔ« Domain calculus Domain engineering  ÈAj. ÖÏ@ éƒYJë Domain maturity ÈAj. ÖÏ@ i. ’ Domain model Domain name ÈAjÖÏ@ Õæ @ . Domain selection ÈAj. ÖÏ@ PAJ Jk @ Domain-specific language   Ym× ÈAm.× éªË Domain theory  ÈAm.× éK Q¢  Domain †A¢  Dot address     éJ ¢®K éKñ Jª,J ¢®K à@ñ J« Dot file ù¢®K ­ÊÓ Dot matrix printer    A®JË@ é¯ñ®’Ó éªK.A£ Dot notation    ù ¢®K IK ñJK Dot pitch é¢ ®JË@ èñ¢ k Dotted quad  Dotted ¡®JÓ Dot é¢ ®K Double click àA KQ ®K Double-click  Ag. XðQÓ Q®JK Double density   ék. ðXQÓ é¯AJ» Double-duplex  h. ðXQÓ øñJJÓ Double-ended queue  á JK AîE ðX ­’,JJ K AîE ðX PñK.A£ Double-precision  †YË@ h. ðXQÓ Double quote    ék. ðXQÓ €AJ.J¯@ éÓC« Double ­«A ’Ó Doubly linked list    á ¯Q¢Ë@ áÓ éËñ“ñÓ éÓZA¯ Downloading Q  ÉK JË@ ø PAg. Download ÉK QK Downstream PAJ JË@ úÍðQ NK .AJ ‚ZÈ@ úÍðQ K Downtime  ­J ¯ñJË@ áÓ P Down-time   ÉJ ª ‚Ë@ ¬A®K @ áÓ P Downward closed Down BðQ K Dpi    é“ñJ.Ë@ ú ¯ 颮K Draft èXñ‚Ó Drag-and-drop Drag and drop HC ¯@ ð I. m Dragging IkA‚. .m Drag-n-drop . Drag Im Drakconf . Drawer Drawing Õæ P Draw object(s)

Draw ñ’,ÖÞ P@ Driver kernel †ZA‚Ë@ è@ñ K Driver †@ ñƒ

Drive @Q¯@ ¼Qm× Drop Drop cable

Drop-down arrow È@Y‚ @ ÑîD „ËY‚Ó ÑîD . Drop-down list È@Y‚ @ ékZB, éËY‚ Ó ékZB Drop-down menu éËY‚ Ó éÓZA ¯

Dropdown È@Y‚ @ Droplets H@Q¢ ¯ Drop on the floor Drugged Druid Dry run  øPAJ.Jk @ ÉJ ª ‚ Dual-attached Dual boot  h. XðQÓ ÉJ ª ‚ Dual head €ZQË@ h. ðXQÓ Dual-homed ÈQ Ö Ï@ úæ JÓ Dual-partition   éÒJ ‚®Ë@ ø ZAJ K Dual ported Dual-stack   éƒYºË@ h. ðXQÓ, éÓñºË@ h. ðXQÓ Dual h. ðXQÓ Dumb Terminal èñJªÓ ¬@Q¢Ó Dumb èñJªÓ Dummy   YÓAë ,úæ•@ Q¯@, éJ ÓX Dump ©K Q®K Duplex h. ðXQÓ Duplicate QºÓ Duration Ð@ðX , è YÓ Dyadic f Dynamic adaptive routing Dynamically scoped Dynamically typed  AJ ºJ ÓAJK XH. ñJºÓ Dynamic analysis ú×AJK X ÉJ Êm' Dynamic binding Dynamic database management system    ú×AJK YË@ HA KAJ J.Ë@ èY«A¯ èP@X@ ÐA¢  Dynamic link Dynamic link library Dynamic random access memory Dynamic routing ú¾J ÓAJK X éJ k. ñK Dynamic scope Dynamic scoping Dynamic translation  éJ ÓAJK XYJʂ QK Dynamic typing   éJ ºJ ÓAJK X éK.AJ» Dynamic ú »Qk E Eager evaluation Earliest deadline firs

Earliest deadline first Bð@ QºKZÈ@ ú支ZÈ@ Y«ñÖÏ@ . Echo cancellation øY’Ë@ ZAªË @ Echo øY“ E-commerce    éJ Kð QºËB@ èPAj. JË@ E-ddress Edge é¯Ag Edition   éªJ.£ ,QK Qm' Editor pane QjÖ Ï@ ékñË Editor × P f Qm Edit QK Qm' E-dress Education contact Q    ø ñK. Ë@ ©JÒj. ÖÏ@ ú¯ éʒ,K ñK.QK Ƀ@QÓ Education  éJ K.QK Edutainment   ø ñK.QK éJ ¯QK Edu ùÒJ ʪJ/K ñK.QK Effective computable Effective number of bits   ÈAª®Ë@ IJ.Ë@ Y« Effect Q KZ HQ KZÐ Efficiency  é«Am.' Eigenvalue       Q  éJ K@X éÒJ ¯, é¯ñ®’ÖÏ (ú G@X) ÓPYg. Eigenvectort   Qj®JÂK Q¢ @ Eigenvector   úG@X IÓ ,Q Ó IÓ Eight-bit clean Eight queens problem Eight queens puzzle Eighty-twenty rule àðQå „ªKñ KAÒ JË@ èY«A ¯

Eject ¬ Y ¯@ El(alpha) Electronic commerce    éJ Kð QºËB@ èPAj. JË@ Electronic data interchange Q   ú Gð ºË@ HAKAJ K. ÈXAJ.K Electronic funds transfer system Q  ú Gð ºËB@ È@ñÓB@ É®KÐA¢ Electronic funds transfer Q  ú Gð ºË@ È@ñÓ@ É®K Electronic magazine    éJ Kð QºË@ éÊm.× Electronic mail address Q ú Gð ºË@ YK QK. à@ñJ« Electronic mail Q ú Gð ºË@ YK QK. Electronic meeting  úGðQºË@ ¨AÒJk . @ Electronic whiteboarding Electronic Q ú Gð ºË@ Element Qå”J« Elephant ÉJ ¯ Elevator controller Eliminate

Elite ZAêkñ,KAJ «@, éJ m ' . . Ellipse i. JÊë@ Ellipsoid ú j. ÊJ Êë@ Else E-mail address Q ú Gð ºË@ YK QK. à@ñJ« Email attachement Q  ú Gð ºË@ YK QK. ‡¯QÓ Email Q ú Gð ºË@ YK QK. E-mail Q ú Gð ºË@ YK QK. Embeddable     PAÒ¢ZÈ ÉK.A¯,QÒ¢Ë ÉK.A¯ Embedded system PñÒ¢Ó ÐA¢  Embedded PñÒ¢Ó

Embedding PAÒ¢ @,QÒ£ Embed  á Ғ  Embosser × Y‚m.Ö,҂m. ,P Q.Ó Emoticon ék. ð Emphasis Empty element tag Empty ¨PA ¯ Emulate èA¿Am× Emulation èA¿Am× Emulator × ú »Am Enabled ẠÒ,kñ‚ ®Ó  Enable á ºÖß Enabling  á ºÒJj‚¯ Encapsulation  ­J ʪK Enclosure ­ ÊªÓ Encoder  Q ÓQK è@X@ Encode   Q ÓQKQ ÓQK Encoding Q ÓQK Encrypted Q® ‚Ó Encryption  Q ®‚ Encrypt  Q ®‚ Endl Endless loop éJ ëAJ JÓB é®Êg

Endless øZAîE B,øYK.@ Endnote End of file  ­ÊÓ éK AîE Endpoint    éK AîDË@ 颮K End tag End-user  ø ZAîEÐYjJ‚Ó End  úæîDK @, éK AîE Engage Engineering éƒY Jë Engine ¼Qm× Enhanced parallel port YJ‚Ó øP@ñ JÓ Y ® JÓ  Enhancement á ‚m' Enlargement   Õæ j’JkA®JK@ Enlarge Q J.ºK Enterprise  YK Yg. ¨ðQå„Ó (úΫ ÈAJ.¯@) Entertainment éJ ¯QK Enter ÈñkX Entity-relationship diagram Entity-relationship model Entity àAJ » Entries HA KA g Entropy       Õæ ¢JJË@ ék. PYJ. KQË@ ék. PX Entry éÊ gYÓ Enumerated type XYªÓ ¨ñK

Enumeration ZA’k@,X@YªK Envelope ¬C ª, ¯Q £ Environment variable  éJ K. Q ª JÓ Environment  éJ K. Ephemeral port ù ÖÞñÓ Y®JÓ Ephemeral ùÖÞ ñÓ Episode Epoch HA‚mÌ'@ ZYK. t' PAK . Epsilon àñʂ .@ Equalizer ÈXAªÓ Equal ÈXAªÓ,ðA‚Ó Equational logic Equation éËXAªÖ Ï@ Equipment H@ YªÓ Equivalence class partitioning Equivalence class èZ ¬A¾Ó ­ J“ Equivalence partitioning Equivalence relation Z¬A¾ JË@ é¯C« Equivalent ú ¯A¾Ó Erase i‚Ó Era áÓ P Ergonomic ÉÒªË@ HAJ J K. Error-based testing Error correcting memory Z¡m Ì'@ éj’Ó èQ»@ X Error detection and correction   ZA¢kZÈ@ iJ j’ ð ¬A‚»@ Error handling  Z¡mÌ'@ ém.Ì'AªÓ Error indicator Z¡k Qå ZÐ Error message Z¡k éËAƒP Error recovery  Z¡mÌ'@ YªK. iJ j’ Error Z¡k Escape character ñÊm Ì'@ ¬Qm × Escape sequence Escape ñÊm Ì'@ Escrow Esim Essential complexity  úæ Aƒ@ YJ ®ªK Eta abstraction Eta conversion Eta expansion Eta reduction E-tex Ethernet Ethics   †CgZÈ@ ÕΫ ,H. @X@ , AJ.’@ ,Èñ“@ Evaluation strategy Evaluation    Õç' ñ®JJ ÒJJJ Òm' Evaluator Event-driven Event HYg Every C¿ Evolutionary algorithm    éK Pñ¢ éJ ÓPP@ñ k Evolutionary computation Evolutionary programming    éK Pñ¢ ém.×QK. Evolution strategy      éK Pñ¢ éJ m.'@Qƒ@ Exa-

Exabyte IK AK.A‚»@ Exact ÐAK Example ÈAJÓ Exception handler

Exceptions H@ZA J Jƒ @ Exception ZAJ Jƒ@  Excercise áK QÖß Excl Exclamation mark   Ij. ªJË@ éÓC« Exclamation point .  ÉJ ÊîE éÓC« Exclude  úæ J‚ Executable content øYJ ®J K øñJm× Executable file øYJ ®J K ­ÊÓ Executable øYJ ®J K Execute YJ ®J K Execution ÉJ ª®K Executive  ø YJ ®JK Exhaustive testing  ÉÓAƒ PAJ.Jk A,®ÒªÓ PAJ.Jk @ Existential quantifier Existing Xñk. ñÓ Exist AJ k,Xñk. ñÓ Exit h. ðQk Expanded memory manager Expanded memory page frame Expanded memory 骃ñÓ èQ»@ X Expanded   ¨
fƒñÓ ,YJÓ,†A¢JË@ ©ƒ@ð Expand ©J ƒñK Expansion card   骃ñK é¯A¢. Expansion slot   ©J ƒñKI. ®ƒ Expansion ©J ƒñK Expected location    I. ®KQÖÏ@ ©¯ñÖÏéJ.®KQÖÏ@ àA¾ÖÏ@ Expect    ©¯ñJJ.®KP @ Expert system Q J.k ÐA¢  Expire    éJ kC’Ë@ é’ ®K @ Explicit parallelism Explicit type conversion Exploit èQ ª K Explore ¨C¢Jƒ@

Exponential-time algorithm áÓ QË@ éK
ƒ@ÐPP@ñ k f Exponential-time ø
ƒ@ áÓ P f Exponential ø
ƒ@ f Exponent €@ Exporting PY’Ó Export  QK Y’ Expression tree Expression Q J.ªK Expunge I¢ƒ Extended . Extended memory manager Extended memory 骃ñÓ èQ»@ X  Extend YK YÖß Extensible database Extensible   YK YÒJË ÉK.A¯ Extensional Extensional equality Extensionality

Extension X@YJÓ @ Extent External data  éJ k. PAg HA KAJ K. External memory   é Jk. PAg èQ»@X External  éJ k. PAg Extract hQj Jƒ@ . Extranet I K@ Q‚» @

Extra ú¯A “ @ Eyedropper I’ JÒ,ƒñƒAg . E-zine à P@ F Facsimile   ɓB@ ‡J.£ éj‚ Factor Factorial H. ðQå”Ó Factor of proportion  I. ƒAJK ÉÓAªÓ Factory ÉÒªÒ,ªJ’Ó Fact éÓñʪÒ,ª ¯@ð Fade ÈZA’  Failback Failfast Failover resource Failover  ɂ®Ë@ PðAm .' Failure-directed testing Failure fencing Failure ɂ¯ Fail ɂ¯ Fallback procedure  ©k. @QË@ H@Z@Qk . @ Fall back Q  Ì  ©k. @ Ë@ éËAg ú ¯ Cm 'éðñk.
fË@ Fallback    ©k. @QË@ éËAg ú¯ CmÌ'éðñk.
fË@ Fall forward Fallout ¡®ƒ Fall over Fall through Fall thru False Farkled Farm é«P QÓ Fast ©K Qå Fatal error hXA¯ Z¡k Fatal exception Fatal hXA¯ ,ÉKA ¯ Fat binary Fat client Fault-based testing Fault monitor Fault tolerance   Z¡mÌ éK.Aj. JƒB@ Fault tolerant Fault tree analysis Faulty ¡Êª,«ðY’Ó Fault ¡Êª,«Y“ Favorite  I. jJÒ,ʒ®Ó Fax »A¯ Feasible Feature creep Feature  èQ Ó Feedback control Feedback ɪ¯ XP Feed-forward Feed Õæ®Ê K Feeper Femto- Fence  i. J‚. ¯ZA« Fetch-execute cycle Fetchmail Fetch IÊg. Fiber optics   . ¬AJ ËZÈ@ HAK Qå”. éJ J ®K ,ÐñÊ« Fibre optics   ¬AJ ËZÈ@ HAK Qå”. éJ J ®K ,ÐñÊ« Field mouse É®m Ì'@ èPZ ¬ Field-programmable gate array Field-replaceable Field separator Èñ®k ɓA¯ Fields involved é£Pñ JÖ Ï@ Èñ®m Ì'@ Fields Èñ®k Field É®k Fiery FIFO Bð@ h. PAg ,Bð@Ég@YË@ Figure ɾƒ File compression ­ÊÓ ¡ª “ File control block   HA ®ÊÖÏAK. ÕºjJË@ èQ»@X éÊJ» File descriptor leak  ­ÊÖÏ@ ­“@ð H. Qå„ File descriptor ­ÊÖ Ï@ ­“@ð

File extension ­ÊÖ Ï@ èX@Y JÓ @

Filename extension ­ÊÓ Õæ @X@YJÓ @ File name ­ÊÓ Õæ @ Filename ­ÊÓ Õæ @

File permissions ­ÊÓ àð X @ File server HA ®ÊÓ ÐXAg

File signature ­ÊÓ ZA’Ó @ File system HA ®ÊÖ Ï@ÐA¢  Filesystem HA ®ÊÓ ÐA¢  Files HA ®ÊÓ File transfer ­ÊÖ Ï@É®K File type ­ÊÖ Ï@ ¨ñK File ­ÊÓ Filing system Fillcolor ZCÓZÈ@ àñË Fill-out form

Fill ZÉÓ@ Filtering   iJ ƒQ K, éJ ®’ Filter promotion    l QÖÏ@ éJ ¯QK Filter èA ®’Ó Financial AJ ËAÓ Find   úΫ PñJª,Jm'. Fine grain   ‡J ¯X Ik Fine-tune    . é®J ¯X é®Ë@ñÓ Finger úΫ ɒm'

Finish ÈAÒ»A,ÓAÖß@,ZAîE @ Finite automata   Ì   ùëAJJÓ é»Qm '@ ø ZA®ÊK Finite differencing Finite state machine Finite  ù ëAJJÓ Firebottle     Q     (éƒA‚Ë@ ú ¯ HAKð ºËZÈ@ ) h. ZH èPðPA¯ Firefighting PAJË@ éÓðA ®Ó Firewall machine   PAJË@ ÈQ« P@Yg. éË@ Firewall øPAK P@Yg . Firing †C£ @ Firmware  éJÒ ’Ó HAJ m.×QK. Firmy First class module First customer ÈðZÈ@ àñK QË@ . First generation computer ÈðZÈ@ ÉJ m.Ì'@ H. ñƒAg First generation language  ÈðZÈ@ ÉJ m.Ì'@ éªË First in first out Bð@ h. PAg ,Bð@Ég@YË@ First-in, first-out Bð@ h. Qm' Bð@Ég@YË@ First normal form First-order logic   Q  ék. PYË@ ø ð@ ‡¢JÒ,J. K Ë@ AJ Ëð@ ‡¢JÓ First-order  Q ék. PYË@ AJ ËðA,J. K Ë@ ú Íð@ Fit-to-window     èY¯AJË ù ®¯@ñK Fit  I. ƒAJK Fixed disk IJÓ Q¯ Fixed point . Fixed point combinator Fixed-point  éʓA®Ë@ IK .AK Fixed width font QªË@ IK .AK¡ k Fixed width IK .AK Q« Fixed-width IK .AK Q« Fixed iJ ʒJË@ IK .AJ,jJ j’JË@ IK .AJ, J.JÓ Fixpoint

Fix hC“@ Flag ÕΫ Flamage Flame Flame off Flamewar Flaming Flap Flapping router Flash memory Flash  ‡K QK. Flat address space Flat file Flatten Flat thunk Flat i¢‚Ó Flavorful †@ YÒÊK Z Ó, éêº JÊK Z Ó . ú Î . ú Î Flavor †@ YÒ,Òª£, éêº K Flip Flip-flop Floating head Floating point Floating-point accelerator Floating-point arithmetic Floating point underflow Floating-point éÓZAªË@ éʓA ®Ë@ Floating underflow Float (verb) ñ®£ Float Qk

Flood †Q « @ Floor  ‡K.A£,PðX Floppy disk drive éKQÖ Ï@ @Q¯ZÈ@ ¼Qm× Floppy disk àQÓ Q¯ Floppy drive àQÓ Q¯ ɪ ‚Ó Floppy àQÓ Floptical øZñ“ àQÓ Q¯ Flow chart  àAK Qk. ¡¢m× Flow control      àAK Qm.Ì'@ éJ.¯@QÒ,®¯YË@ éJ.¯@QÓ Flower key  (€ñ JJ»AÒÊK . Ag) èXPñË@ hAJ®Ó Flow of control Flow  àAK Qj. ,®¯X Flush Fly page Flytrap Focus group Focus èPZH Fold . Fold case  Folder YÊm.× Follow-on bus Follow-up Fontwork ñ¢m Ì'@ ÉÒªÓ Font ¡k Foo Foobar Foogol Footer Foot-net Footnote  úήƒ ÓAë ,úήƒ ‡J ʪK Footprint For Fora Force  ñ®Ë@ Forecast ©¯ñ K Foreground     ékñË@ éJ ÓAÓ@,Q¢ JÖ Ï@ éJ ÓAÓ@ Foreign key Fork  ©‚k. @Q®K @ For loop Formal argument Formal methods Formal parameter úξƒ ¡‚Ó Formal review Format (noun)   (à Q m× ,­ÊÓ) éJJ ë ,(‘) ‡‚ Formatted ZúæêÒ,«A’Ó Formatting Format (verb)   (à Q m× ,­ÊÓ) éJJ îE ,(‘) ‡J ‚K Format  éJJ îE Form factor Form feed Formulas Formula  éªJ “ Form ɾƒ, èPAÒ Jƒ@ Forum øYJJÓ Forward analysis Forward chaining Forward compatibility    úÎJ.®J‚Ö Ï@ ÐAj. ‚ZÈéJ ÊJ.®J‚Ö Ï@ ‡K.A¢JË@ Forward compatible    ÐAj. ‚ZÈ@ úÎJ.®J‚Ò, ®¯@ñJË@ úÎJ.®J‚Ó Forward delta Forward engineering Forwarding Forwards compatibility Forwards compatible

Forward ÐAÓZÈ@ úÍ@ Foundation  éƒZÑ,‚ ƒZH Four-colour glossies Four colour map theorem Four colour theorem Fourth generation computer ©K.@QË@ ÉJ m.Ì'@ H. ñƒAg Fourth generation language  ©K.@QË@ ÉJ m.Ì'@ éªË Fourth normal form Fractal compression ø Pñ‚» (Pñ“) ¡ª“ Fractal dimension øPñ‚» YªK. Fractal ø Pñ‚» Fraction Q儻 Fragile I. ¢ªË@ ©K Qå Fragmentation   èZQm .' Fragment ¼ Frame buffer PA£ZÈ@ à@ñ“ Frame grabber H@PA£ZÈ@ ¡®JÊÓ Frame pointer Frame rate PA£ZÈ@ ÈYªÓ Frame relay PA£ZÈ@ ÉJ®J K

Frame set H@PA£ @Õ®£ Frames per second   éJ KAJË@ ú ¯ PA£@ Framework ɾJë

Frame PA£@ Framing specification Free disk space Free software  èQk HAJ m.×QK. Free space é«PA ¯ ékA‚Ó Free variable    ‡J Ê£ ù ªJÓ,@Qk ù ªJÓ Freeware èQm Ì'@ l×@QË@ . .  Freeze YJ Òm.' Free Qk Frequency division multiple access Frequency division multiplexing Frequency QK@ñ K, XQ K Frequently asked question   éK.ñk. @ ð éËZ€@ Friction feed Frobnicate Front-end Front-end processor   ÈA’B ¡J ƒð lÌ.'AªÓ Front end   éJ ÓAÓ@ éK AîE Front side bus Frotzed Fry Fudge factor Full-custom Full-duplex Full-duplex Switched Ethernet    È@YK.ZÈ@ ú æJK ÉÓA¿ IKQîDK Full-motion video é»Qm Ì'@ ÉÓA¿ øZQÓ Full outer join

Full pathname ÉÓA¿ PA‚Ó Õæ @ Full screen éƒA ‚Ë@ ZÉÓ Fully associative cache Fully lazy lambda lifting Functional database        é JK@ Q¯@ HA KAJ K. èY«A¯ , é JË@X HA KAJ K. èY«A¯ Functional dependency    ù®J £ð XAJ ®K @, éJ ®J £ð éJ ªK.AK Functionality   éJ ®J £ñË@ éK XZIË@ Functional language   éJ ®J £ð éªË Functional programming language    éJ ®J £ð ém.×QK. éªË Functional programming   éJ ®J £ð ém.×QK. Functional program ù®J £ð l×. AKQK. Functional requirements   éJ ®J £ð ÐðQË, éJ ®J £ð C¢JÓ Functional specification   éJ ®J £ð 鮓@ñÓ Functional testing ù®J £ð PAJ.Jk @ Functional unit   éJ ®J £ð èYgð Functional ù®J £ð Function application    é®J £ð ‡J J.¢ Function call  é®J £ð ZA«YJƒ @ Function complete Function key  é®J £ð hAJ®Ó Function   é®J £ð, éË@X Functor

Furniture HA K@ Fusion    PAîD”@ , é«AÓ@ , éËAƒ@ , éK.@X@ Future date testing Fuzzy computing   é’ÓA « éJ.ƒñk Fuzzy logic  ú G.AJ.“ ‡¢JÓ Fuzzy subset   é’ÓA« ú «Q¯ èQÓP Fuzzy translation (úæªÖ Ï@) é’ÓA «Y Jʂ Q K Fuzzy variable Fuzzy ÑîD.Ò,J K.AJ.“ G Gallery è
’JÓ ,†@ðP Game tree f Game  éJ.ªË Gamma correction Gamma AÓAg. Gamut Gap   ¨@Q¯ , èñm.¯ , èQª K Garbage collect Garbage collection Garbage  HC ’ ¯, éK A®K Gas plasma display   éJ ÓPCK . Q« éƒA ƒ Gas PA « Gated  éK.@ñK. Q.« @PAÓ Gateway  éK.@ñK. Gate  Q.ªÓ, éK.@ñK. General g ú ÍAÔ . A,ÓA« Generate YJ ËñK Generation ÉJ k. ,YJ ËñK Generator X
fËñÓ Generic identifier ÕæÔ« ¬QªÓ Genericity  éJ ÓñÔ« Generic markup Generic programming   é‚ Jk . ém.×QK. Generic resource ÕæÔ« XPñÓ Generic thunk Generic type variable «  ¨ñJË@ Õæ Ô ù ªJÓ Generic ÐA« Genetic algorithm   éJ K@Pð éJ ÓPP@ñ k Genetic programming file   úG@Pð ém.×QK. ­ÊÓ Genre Geographical ú ¯@Qªk. Geometric ú æ YJë Geometry éƒY Jë

Get (úΫ) ɒk@ Ghost  ÉÒêÓ I. K𠩯ñÒ,j‚K Giga- Gigabit Gigabyte IK AK.AªJ « Gigaflop Glass Glass box testing Glitch   éÊ«, éK.ZAƒ Global device Global index Global interface     éÒJ Ô« éêk. @ð, éJ ËAÔg@ éêk. @ð Globalisation . Global resource « ú ×ñÔ XPñÓ Global variable «Q  ú ×ñÔ ªJÓ Global ú×ñÔ« Glue language Glue †A’Ë,Z@Q ª, ªÖ ޕ Glyph   éK QÓQË@ èPñ’Ë@ Goal Y’®Ò, ¯Yë Go gold Gold IëYË@ (àYªÓ) Golf ball printer . Gopher Gorilla arm Gorp Go to record Go voice Go  ‡Ê¢A,J.ëX@ Grab handle Grab  ‘J .¯ Gradient  h. PY K Grain I m' Grammar analysis . Grammar Y«@ñ¯ Grammatical inference Graph colouring Graphical user interface   éJ ÓñƒP ÐYjJ‚Ó éêk. @ð Graphical ú×ñƒP Graphics accelerator úGAJ K. ¨ f Qå„Ó Graphics adapter Graphics adaptor Graphics card  HAJ ÓñƒP é¯A¢. Graphics HAJ ÓñƒP Graphic workstation Graphic úGAJ K. Graph plotter Graph reduction Graph rewriting system Graph àAJ J.Ó Gravel Gray Gray code ø Q³ PAÓP Gray-scale image    ø XAÓQË@ ék. PYJÓ èPñ“ Gray-scale  ø XAÓQË@ h. PYJÓ Grayscale øXAÓQË@ hPYJÓ . Greater or equal ðA‚Ó ð@ áÓ Q»@ . Greater than áÓ Q»@ . Greater áÓ Ñ¢« @,áÓ Q.»@ Greatest common divisor Ñ¢«ZÈ@ ¼Q‚Ö Ï@ Õæ A®Ë@ Greatest lower bound Greedy èQå Green lightning Green monitor

Green Qå” k @ Grey-scale øXAÓQË@ PYJÓ Grick Grid  éºJ .ƒ Grok Gronked Group attribute   é«ñÒm.× é®“ Group identifier  é«ñÒm.× QªÓ Group object Groupware Group  HA«ñÒm .× h. / é«ñÒm.× Growth Ñj ’ ñÖ ß Grunge Gry Guaranteed scheduling Guard €PAg Guess  á Òm' Guest ­J “

Guideline H@XA ƒP @ Guide ÉJ ËX Guru ðPñ« H Hacker Q»Aë Hack value   ¼AêË@ éÒJ ¯ Hack ¼Aë Hairy ball  Hair Y®ªÓ ,‘ÓA « Haiti  ú æK Aë Half-duplex ' èAm. B@ ø XAg@ Half-Sphere èQ» ­’  Halftone   éJ ®’ é«AJ.£ Halfword éÒÊ¿ ­’  Halting problem     ­¯ñK éʾ‚Ó ,¬A®K @ éʾ‚Ó Halt   ¬A®K @,†C«@ Handbook  I.  J» Handheld YJ ËAK. ÈñÒm× Handle (noun)  ‘J .®Ó Handler Èð@YÓ Handle (verb) ÉÓAªK Handle Qå ZÐ Handout HñJºÓ , éj JÓ . Handshake ÈA’ZÈ@ éÓA ¯@ Handshaking     ÈA’¹Â»Â¯Ã@ éÓA¯@ ,ÈA’¹Â»Â¯Ã@ YJ »ZH Hang  ‡J ʪK Haptic interface   éJ ‚ÖÏ éêk. @ð Haptic   ÖÏAK. ‡ÊªJÓ ,úæ„ÖÏ Hard code Hard-coded    éJ Ò’Ó éJ m.×QK. HAÒJ ʪK Hard coding Hard copy    éJ ¯Pð éj‚ Hard disk drive Iʓ Q¯ †ñ‚Ó Hard disk .  IK .AK Q¯ Hard drive  I. ʓ Q¯ Hard limit øñ¯ Yg Hard link count     éJ.ʒË@ ¡.@ðQË@ Y« , éJ.ʒË@ ¡.@ðQË@ Y« Hard linking Iʓ ¡.P Hard link .  éJ.ʓ éʓð Hard return Hard sector  I. ʓ ¨A¢¯ Hardware circular buffer Hardware handshaking  øXAJ« ÈA’@ YJ »ZH Hardware XAJ« Hard wrap Hash bucket Hash character Hash coding Hash collision Hash function    èZQm .' éË@X Hashing Hash table Hash èZ Qm ' . Hassle h. A«P @ Hatching  ÉJ Ê¢  Head Header file   é‚ ðQË@ ­ÊÓ Header  é‚ ðQK Heading Head normalisation theorem Head-strict Headword Heap Heartbeat   Iʯ é’J .K Heat sink  .  èP@Qk é«ñËAK. Heat slug Heavy metal Heavyweight à PñË@ ÉJ®K

Height ¨A® KP @ Hello packet

Hello, world ÕËAªË@ AîE @ ,AJ.kQÓ Help èY«A‚Ó Henry Here document Heterogeneous network   é‚Aj. JÓ Q « éºJ.ƒ Heterogeneous Aj. JÓ Q « Heterogenous Aj. JÓ Q « Heuristics testing  éJ .‚ºË@ PAJ.Jk @ Heuristic  éJ .‚» Hexadecimal øQå„« Iƒ Hexidecimal Hex Iƒ Hi Hibernate HAJ .ƒ Hidden file ù® m × ­ÊÓ Hidden  × ZI. JmÖ, J®m Hidef

Hide ZA® k @ Hierarchical database     éK Qm. HA KAJ K. èY«A¯ Hierarchical file system  øQm. HA ®ÊÓ ÐA¢  Hierarchical navigation   øQm. i®’ Hierarchical routing ú×Që éJ k. ñK  Hierarchical øQm. Hierarchy   èQm. High colour à@ñËZÈ@ ú ÍA« High definition  YK YjJË@ ú ÍA« High density é¯A JºË@ úÍA« Higher-order function    éJ.KQË@ éJ ËA« éË@X Higher-order macro Highest   éÒJ ¯ úΫ@,úΫ·Â»Â¯Ã@ High-level language úÍAªË@ øñJ‚Ö Ï@ éªË

Highlighting P@QK @, éKAK @ . . High light P@QK .@ Highlight  Q Öß High memory area    éJ ËA« èQ»@X 鮢JÓ High speed serial interface      é«Qå„Ë@ éJ ËA« éJ ʂʂ éêk. @ð High ©® KQÓ ,úÍA« Hill climbing ÈCJË@ ɂ Hindi  éK YJêË@ Histogram   ø P@QºK h. PYÓ ,ú j. J‚ ú GAJ K. Õæ P History t' PAK Hit rate  éK.A“B@ ÈYªÓ Hog Hole éj J¯ ,I®K Home box . Home directory úæ„ ZP ÉJ ËX Home page   éK @YJ.Ë@ éj®“ Homepage   éJ ‚ ZP éj®“ Home ÈQ Ó Homogeneous Aj. JÓ Homogenous Aj. JÓ Homomorphism Hook  á KðQË@ ú¯ é¯A“ @ ©“ñÓ Hop Hopping

Horizontal application ù®¯ @ ‡J J¢ . Horizontal encoding ù®¯ @ Q ÓQK

Horizontal line ù®¯ @¡k Horizontal loop combination Horizontally  AJ ®¯@ Horizontal microcode Horizontal scan rate ù®¯ZÈ@ i‚ÖÏ@ ÈYªÓ

Horizontal tabulation éJ ®¯ @ éËðYg . Horizontal ù®¯ @ Host adaptor ­J ’Ó @
JêÓ Host bus adapter  f ­J ’Ó ɯAK ú¾Ó Host computer ­J ’Ó HñƒAg Host-host layer .  ­J ’Ò ®J ’Ó é®J.£ Hostname ­J ’Ó Õæ @ Host number  ­J ’Ö Ï@Õ¯P Host-resident  ­J ’Ö Ï@ úΫ Õæ®Ó Host ­J ’Ó Hotlink á kAƒ ¡.@P Hotlist é«ZA ƒ éÓZA ¯ Hot-plugging Hot spot éËA ª¯ é¢ ®K Hot-swappable Hot swapping  ø Pñ¯ ÉJ “ñK Hour é«Aƒ Housekeeping   éK Q ’m 'Q K.@YK Hover Hover link Hub ¨PñÓ Hue   àñË@ h. PYK Humanist technology    ¬YêË@ éJ KA‚ @ éJ J ®K Humor é¯@Q £ Hung Hybrid multiprocessing á jêË@ émÌ'AªÖÏ@ Yª JJ jêË@ Z@QkZÈ@ Yª K . . . . Hybrid testing áj . êÓ PAJ.Jk @ Hybrid á j. ë Hypercube †ZA ¯ ©ºÓ Hyperlink é¯ZA ¯ éʓð Hypermedia  éJ ¢.@QK ZAƒð Hyperspace  ù ¢.@QKZA’¯ Hypertext †ZA ¯ ‘ Hyperware  é¯ZA¯ HAJ m.×QK. Hyphenate Hyphenation Hyphens ɓñË@ HAÓC« Hypotenuse QKð I Icelandic éK YJʂ ZÈ@

Iceland @YJʂ @ Iconic interface    éJ Kñ ®K @ éêk. @ð Icon   éKñ ®K @ Ideal úÍAJÓ Identification ­K QªK Identifier  éK ñêË@ I .JÓ,QªÓ Identify ¬ Qª K Idle YÓAg Ignore ÉëAm.' Illegal Illumination  QK ñJ KèZA“ @ Illustration   Q ‚®K ,iJ “ñ JÖÞ PQK ñ’ Image format   èPñ’Ë@ éªJ “ Image map Image processing  Pñ’Ë@ ém.Ì'AªÓ Image recognition Image sequence    Pñ“ I. ¯AªKPñ“ ©K.AK Image èPñ“ Imaging Immediate version Ég. A« P@Y“A,K Pñ¯ P@Y“@ Impact printer Imperative language   éK PAJ.k. @ éªË Implement Implementation Implicit parallelism    ú æҒË@ è@P@ñÖÏèéJJ ¯YË@ è@P@ñÖÏ@ Implicit type conversion •  • ' ú æÖÞ ¨ñK éËXAJ.Ó,AJ JÖÞ ¨ñK ÉK ñm Implies Õæ”,ÊÖ Þ„,Kñk Imported XPñJ‚Ó

Importing X@Q Jƒ @ Imports H@XP@ð Import X@Q Jƒ@ Impossible  Iª’J‚Ò,ÊJ j‚Ó Imprecise probability . Inactive ÉÓAg In-band Inbox XP@ñË@ †ðY J“ Incantation  èYK ñªK Inch  é“ñK. Include file Include war Include  á Ғ  Including subdirectories Inclusive Incoming XP@ð Incomparable Incompatible  ‡¯@ñJÓ Q « Increase   Y«A’ ,YK @Q«A®KP @,PAJ» @ Incremental analysis Incremental backup Incremental constraint solver Incremental  ø YK @QK Increment ? YK QÓ Indented Indent style Indent  ék@P@ Independent É®J‚Ó Indexing Index €Qê¯ Indicate  Indicator Qå ZÐ ,È@X Indice Indirect addressing   èQå AJ.Ó Q « éKñ J« Indirect address Qå AJ.Ó Q « à@ñ J« Indirection Induction AJmÌ'@ Inductive inference Inductive relation Infeasible path Infect øYªK Inference Inference engine Inference rule Infimum Ñ¢«ZÈ@ úGXZÈ@ @YmÌ'@ Infinite loop   éK ZAîEB é®Êg Infinite set Infinite øZAîEB  Infinity ùëAJ KB @ Infix notation úÎg@X IK ñJ K Infix syntax Inflate Information highway     HAÓñʪÖ Ï@ ‡K Q¢,KAÓñʪÖ Ï@ 麂. AÓñʪÖÏ@ èXAg. Information overload Information superhighway Information HAÓñʪÓ Info HAÓñʪÓ

Infrared QÔg@ Im ' Infrastructure    é JJm' éJ K. Inheritance Inherited HðPñÓ Inhertence Initialise Initialization Initialization file  éJJ îE ­ÊÓ Initialize  ZÉJ ª ‚Ë@ øYJ . K,ZúæîE Initializing Initials

Initial øZ@YJ.,K Z@YJK.@ Initiate Initiator Init state Injection á ®k Inkjet printer Ink printer  Q.g éªK.A£ Inline Inline image Inline template Inner Inner join Inner product Inode In-order traversal Input device ÈAgX@ PAêk . Input method  ÈAgXZÈ@ é®K Q£ Input side Input ÉgX Inquire  ÈZA‚Q.jJƒ @ In row Inscription Insensitive version Inserted ÉgYÒ,k . ñÓYÓ Insertion point ÐAm¯ZÈ@ éÓC« Insertions Insertion sort Insert mode ÈAgXZÈ@ ¡ÒNk @PXZÈ@ ¡Öß . Insert h. @PX@ Inside (centered) Inside  ú æ£AJ.,Êg@YJ K@ñk. Inspection X
®® K ,ZA’®Jƒ@ Installable file system f Installation  I J.K Installed user base Installer H
J.JÓ Install f  I J.K Instance method Instance variable Instance èQÓ Instantiate Instantiation Instant messenger ø Pñ¯ Ƀ@QÓ Institution Instruction mnemonic Instruction pointer Instruction prefetch Instruction scheduling  HAÒJ ʪJË@ éËðYg. Instruction set Instruction set architecture Instruction   éÒJ ʪK Instrument éË @ Insufficient  Integer iJ m• Y« Integral l×. YÓ Integrated circuit Integrated development environment  ÉÓA¾JÖ Ï@ QK ñ¢JË@ éJ K. Integrate l×. YK Integration testing Integration l×. X Integrity constrain Integrity ÉÓA¾K Intellectual property   éK Qº®Ë@ éJ ºÊÖÏ@ Intelligent backtracking Intelligent database   ú»X HAJ ¢ªÓ èY«A¯ Intelligent key Intelligent terminal ú»X ¬@Q¢Ó Intensional Intensity èYƒ Interaction Interactive development environment Interactive úÍXAJ.K Interactivity  éJ Ê«A®K Intercept Interconnect  ɓð éºJ.ƒ Inter-exchange carrier Interface analysis Interface card Interface  éêk. @ð Interference Ég@Y K Interlace Interlaced Interlaced image Interlacing Interleave Interleaving Intermediate code Intermediate ¡ƒñ JÓ Intermercial Internal field separator

Internal frame úÎg@X PA£@ Internal   éJ J£AK . , éJ Êg@X Internationalization International ú ÍðX Internet address I K QKZÈ@ à@ñ J«

Internet number I K QK @Õ¯P Internetworking

Internet I K QK @ Interoperability Interoperable database Inter-packet gap Interpolation Interpret Interpreted ®Ó Interpreter  Ñk. QÒ,KAÔ gQK Inter-process communication . Interrupt handler Interrupt list Interrupt priority level   ¨A¢®KZÈ@ éK ñËð@ øñJ‚Ó Interrupt request  ¨A¢®KZÈ@I. Ê£ Interrupt ¨A¢®K@ Intersect Intersection IËA’Jª£A ®K Interupt . Interval Interworking

Intranet I K@ QK @ Intuitionism  é JƒYg Intuitionistic logic  ú æîE YK. ‡¢JÓ Intuitionistic probability Intuition  éë@YK. Intuitive úæ Yg Invalid Õæʃ Q « Invariant Inverse comment convention Inverse º« Inverted index Invert º« Invisible  ù ®k Invoke ZA«YJƒ@ Involved PñJÓ Irrational number Irrefutable Isochronous Isochronous transfer Isolated XQ® JÒ,Ë Qª JÓ Isometric joystick Isometry Isomorphic Isomorphism Isomorphism class Italic ÈZAÓ Item Qå”J« Iteration P@QºK Iterative deepening Iterator J Jag Jam €YºJÓAg P Jewel case Jitter  ék. Qk. Qå  AªKP @ Job control    éÒêÖÏ@ éJ.¯@QÓ Job number éÒêÖ Ï@Õ¯P Job ɪ ƒ Joint ’®Ó ú Î Join ÐAҒ @ Journal  éJ ÓñJ Ë@ Joy stick H. AªË·Â»Â¯Ã@ A’« Joystick HAªËZÈ@ A’« Jukebox . Jumper PA ® ®,£A¢  Jumpstart Jump table Jump trace buffer Jump   PðAm .' ,Q ®¯ Junction  éÊJ “ñK Junk mail  éËAK.P YK QK. Junk   ÐAë Q «, éÓAÔ¯ Justification è@ XAm × Justified øXAm × Justify è@ XAm × Just-in-time    I¯ñË@ ú ¯ AÓAÖß K Kamikaze packet   éK PAjJK@ éÓQk Kangaroo code   éK Qª J» èQ®ƒ Keep ¼QK Kernal   I. ÊË@, è@ñJË@ Kernel panic Q«X ,¨AJ KP @ Kernel è@ñ K Kerning  ¬QkZÈ@ á J ®K Key binding hAJ®ÖÏ@ AJ.KP@ Keybind hAJ®ÖÏ@ AJ.KP@ Keyboard focus       iJ KA®ÖÏ@ ékñË Q »QK ,iJ KA®ÖÏ@ ékñË èPZH. Keyboard  iJ KA ®Ó ékñË Key-encrypting  iJ KA ®ÖÏAK. Q ®‚Ë@ Key escrow hAJ®Ö Ï@ áÖ ßZÐ Key field hAJ®Ö Ï@É®k Key frame úæ„ ZQË@ PA£ZÈéJ ƒAƒZÈ@ PA£ZÈ@ Keypal   éʃ@QÓ ‡K Y“ Key stroke PP é¢ ª “ Keystroke PP é¢ ª “ Keyword in context    †AJ ‚Ë@ ú¯ éJ kAJ®Ó éÒÊ¿ Keywords  éJ kAJ®Ó HAÒÊ¿ Key word   éJ ƒAƒ@ éÒÊ¿ Keyword   éJ ƒAƒ@ éÒÊ¿ Key hAJ®Ó Kiboze Killer poke Kill ÉJ¯ Kilobaud XñK.ñÊJ » Kilobits per second    éJ KAJË@ ú ¯ IK.ñÊJ » Kilobit IK .ñÊJ » Kilobyte IK AK.ñÊJ » Kiloflops     éJ KA JË@ ú¯ éÓZA« 颮K ñÊJ » Kilometer  QÓñÊJ » Kilo- ÊJ » Kiosk É£ ,pñ» Knapsack problem    éJ. J®mÌ'@ ú¯ éʾ‚Ó Knowbot  é¯QªÓ HñK . Know-how   èQ.g, éK @PX Knowledge-based system  é¯QªÖÏ@ úΫ úæJ .ÓÐA¢  Knowledge base ¬PAªÓ èY«A ¯ Knowledge level é¯QªÖ Ï@ øñJ‚Ó Knowledge representation   é¯QªÖÏ@ ÉJ JÖ ß Knowledge é¯QªÓ L Label edge router Label switched path Label switching  HAª ¯QË@ ÉK YJ.K Label   éJ ҂ Lag ñ£AJ .K Lambda abstraction Lambda-calculus Lambda expression Lambda lifting Lambda @YÓB Lamp-post error Landscape  ù ®¯@  Language-based editor éª Ë@ « úæJ Ó Qm× úÎ . Language-sensitive editor éªÊ Ë €A‚k Qm× Language éªË Laptop computer ÈñÒm× H. ñƒAg Laptop ÈñÒm× HñƒAg Larges . Laser printer  PQ Ë éªK.A£ Laser PQ Ë Last call optimisation Last-in first-out  Bð@ h. PAg ,@Qk@Ég@YË@ Latch Latency Èñ“ñË@ áÓ P Lattice   Q«, éºJ .ƒ Launcher ‡Ê¢Ó Launch icon Launch YJ ®J K Lavender ú×@Q m Ì'@ Law àñ KA ¯ Layer  é®J.£ Layout   ‡‚N¢J ¢m' Laziness ɂ» Lazy evaluation  Èñ‚» Õæ ®K Lazy list éËñ‚» éÓZA ¯ Leader XZ@P Leading  Q ø XAJ ®,J ‚ Z Ëð@ Leaf é¯Pð Leaky heap Leak  I KQå„ Leap second . Leased line Qk. ZСk Least fixed point Least recently used Least significant bit Least upper bound Lee Left arrow øPA‚ ÑîD Left brace   éK PA‚ èQå•Ag Left bracket  (ø )PA‚ €ñ¯ Left join Left-justify   PA‚ Ë è@XAm× Left outer joint Left outside Left parenthesis ø PA‚ ÈCë Left PA‚ Legacy code úG@Q K èQ ® ƒ Legacy software    éJ K@QK l×. @QK. Legacy system úG@Q KÐA ¢  Legalese    HAJ Kñ KA ®,KAJ ¯ñ®k Legal  ú GñKA¯ Legend  èPñ¢ƒA,KAjÊ¢’Ó ÉJ ËX Lemma Length Èñ£ Lenient evaluation

Less than áÓ É¯@

Less ɯ@ Let floating Letter éËAƒP Level one cache   ðZÈ@ øñJ‚ÖÏ@ áÓ (lÌ.'AªÓ) éJ K.Ag Level-sensitive scan design Level two cache   Ì  ú GAJË@ øñJ‚ÖÏ@ áÓ (l.'AªÓ) éJ K.Ag Level øñJ‚Ó Lexeme Lexer Ì Qå„J ÊK@Éjm
ƒ Lexical analyser øñªË Ém×  Lexical analysis øñªÓ ÉJ Êm' Lexical scope Lexical scoping Lexicon Ñj. ªÓ Liar paradox Libraries HAJ .JºÓ Library routines  éJ .JºÓ ©J “ Library  éJ.JºÓ License agreement    ‘J k QË@ éJ ¯A®K@ License ‘J kQ K Liechtenstein Life-cycle   èAJ k èPðX Life science ZAJ kZÈ@ ÕΫ Life  èAJ k LIFO  Bð@ h. PAg ,@Qk@Ég@YË@ Lifted domain ¨ñ¯QÓ ÈAm.× Light client ­J ®k ÉJ Ô« Light pen  ­J ®k Õί Light pipe Light-weight process   à PñË@ é®J ®k éJ ÊÔ« Lightweight à PñË@ ­J ®k Light PñK Like this @Yë ÉJÓ Like ÉJÓ Lilo ºJJ Ë ÉÒm× Limes Limit XðYg Linear address space Linear argument Linear assignment Linear function   éJ ¢k éË@X Line arguments Linear logic ù¢k ‡¢ JÓ Linear map   éJ ¢k é¢ Qk Linear programming   éJ ¢k ém.×QK. Linear space Linear transfer ù¢k É®K Linear transformation ' ù ¢k ÉK ñm Linear type ù¢k ¨ñK Linear  é J¢k Line buffering   ¡mÌ'@ áK ñ’Q¢‚Ë@ áK ñ’ Line conditioning Line discipline Line editor × ù ¢k ‘ Qm Line feed Q¢ƒ YK ðQ K Linen Line of code èQ ® ‚Ë@ áÓ Q¢ƒ Line pattern Line printer  ñ¢k éªK.A£ Line probing Lines per minute   é®J ¯YË@ ú¯ Pñ¢ƒ Line starve Linewrap Line Q¢ƒ Linkage editor HCJ “ñJË@ Qm× Link editing  éʓð ÉK YªK Linked list éËñ“ñÓ éÓZA ¯ Linked to úÍ@ ɓñÓ Linker ɓñÓ Linking ÉJ “ñK Link loader HC“ð ÉÒm× Link rot éJ ®« éʓð Links HC“ð Link éʓð Linux ºJJ Ë Liquid crystal display ÉJ.Ë@ ÈZAƒ @QªÓ List comprehension Listing Q« Listless   éÓZA¯ àðYK . Lists ÐZ@ñ¯ List ékZB Literal ù¢ ®Ê,J ¯Qk Literate programming Literature HA ®ËZÕË@ Lite ­J ®k Little-endian Loadable kernel    ÉJ ÒjJË ÉK.A¯ è@ñK Loadable   ÉJ ÒjJË ÉK.A¯ Load-balancing Load balancing   ÉJ ÒjJË@ éK P@ñÒ,ÊÒm Ì'@ éK P@ñÓ Loading ÉJ ÒjJË@ øPAg. Load ÉÔg Local area network    éJ Êm× é®¢JÓ éºJ.ƒ Local bus   éJ Êm× éʯAg Local data sources  éJ Êm× HA KAJ K. PXA’Ó Local disk m× Q¯ ú Î Local echo úÎm× øY“ Local exchange carrier Locale  éJ Êm× H@X@Y« @ Local file m× ­ÊÓ ú Î Localhost I‚êÊ m Ì Local host úÎm× ­J ’Ó Localisation Localised Locality Localization á £ñK Localize Local loopback addresses Local loop   éJ Êm× é®Êg Locals Local variable ×  AJ Êm ù ªJÓ Local × ø
fÊm Location ©¯ñÓ Locator ©¯@ñÖ Ï@ Ym × Locked file Èñ® ®Ó ­ÊÓ Locked up Locked á ÓZÐ Lock-in

Locking †C « @,ÈA® ¯@ Lock É® ¯ Logarithmus dualist Logarithm Õç'PA «ñË Log file Éj. ‚Ë@ ­ÊÓ Logging in  øQ¯YË@ ÈñkYË@ øPAg. Logical address ù®¢ JÓ à@ñ J« Logical complement Logical disk   ù ®¢JÓ Q¯ Logical-hostname  ù®¢JÓ ­J ’Ó Õæ @ Logical network    éJ ®¢JÓ éºJ.ƒ Logical relation    éJ ®¢JÓ é¯C« Logical shift left   øPA‚ ù®¢JÓ Q ª K Logical shift right   úæJ Öß ù®¢JÓ Q ª K Logical shift   ù®¢JÓ Q ª K Logical  ù ®¢JÓ Logic emulator ù®¢ JÓ ú»Am× Logic gate    éJ ®¢JÓ éK.@ñK. Logic programming    éJ ®¢JÓ ém.×QK. Logic variable     éJ ®¢JÓ èQ ª JÓ Logic ‡¢ JÓ Log in Login banner Login directory h. ñËñË@ ÉJ ËX Login name h. ñËñË@ Õæ @ Login prompt h. ñËñË@ Im × Login shell  h. ñËð é¯Y“ Login h. ñËð Log off Logon øQ¯X iJ¯ Logout h. ðQk Log out  øQ¯X h. ðQk Logo PAªƒ Log Ém. Longitudinal parity Look and feel €A‚kZÈ@ ð Q¢ JÖ Ï@ Look-up table Lookup Im ' . Look Q¢  @ Loopback file Loopback  ¨Ag. Qƒ@ Loop combination Loop fusion Loop through Loop  QºK , é®Êg,P@QºJK. Y®JK Loose bytes  éº®Ó HA JK AK. Lossless audio compression  èPA‚k àðYK . Hñ’Ë@ ¡ª “ Lossless  èPA‚k àðYK . Lossy audio compression   èPA‚m'. úGñ“ ¡ª “ Lossy à@Qå„ k Loss ¨AJ “ Love I. k Low-bandwidth ‘ ® j JÓ ék ñÓ Èñ£ . Low earth orbit (¨A® KPZÈ@) ‘ ® j JÓ úæ•P @ P@YÓ Lowercase

Lower-case Q ª“ ¬Qk Lower set  úGX@ é«ñÒm.× Lower Stream

Lower ɯ@ Lowest úGXZÈ@ Low-level language ‘ ® j JÖ Ï@ øñJ‚Ö Ï@ éªË Low memory area é’ ® j JÓ èQ»@ X 鮢 JÓ Low ‘ ® j JÓ Lub Luminance Lump uncurrying Lurker €Y JÓ Lurking €Y JK Lurk €YJK Lvalue   éÒJ ¯ M Machine address   éË@à@ñJ« Machine code éË B@ éªË Machine-collating  Machine cycle éË B@ èPðX Machine language    éËB@ éªË Machine learning  ªK éËB@ ÕÎ  Machine éË @ Macroblock  Q J.»I. ËA¯ Macrology ðQ»AÖÏ@ ÕΫ Macro processor Q J.» lÌ.'AªÓ Macros ðQ»AÓ Macro ×  « ¡J m ,ø
fÊ¿ ,Õæ Ô ,©ÓAg. Magazine  éÊm.× Magenta úG@ñk. P@ Magic bullet   éK Qm é“A“P Magic number  ø Qj‚Ë@ Õ¯QË@ Magic  ø Qm Magnetic disk  ú æ„J £AJªÓ Q¯ Magnetic stripe úæ„J £AJ ªÓ ¡ Qå Magnetic tape drive   ú æ„J £AJªÓ ¡ Qå †ñ‚Ó Magnetic tape  ú æ„J £AJªÓ ¡ Qå Magneto-optical disk  ø Qå”. úæ„J £AJªÓ Q¯ Magnetostrictive delay line Mail bomb    éK YK QK. éÊJ.J ¯ Mailbox  YK QK. †ðYJ“ Mail bridge YK Q.Ë@ Qå„k. Mail client YK QK. àñK .P Mail delivery YK Q.Ë@ ÉJ “ñK Mailer YK QK. I«AK . Mail exploder YKQË@ Qj®Ó . . Mail filter YK QK. l QÓ Mail gateway Mail host YK QK. ­J ’Ó Mail hub Mailing list    éK YK QK. éÓZA¯ Mail merge YK Q.Ë@ l×. X Mail path YK Q.Ë@ PA‚Ó Mail server YK Q.Ë@ÐXAg Mail services YK Q.Ë@ HAÓY g Mail user agent YK Q.Ë@ÐYjJ‚Ó ÉJ Ô« Mail YK QK. Main board   éJ ‚ ZP ékñË Mainboard   éJ ‚ ZP ékñË Mainframe úæ„ ZP H. ñƒAg Main memory   éJ ‚ ZP èQ»@X Maintainer script á ’Ó ñ¢m× Maintainer á ’Ó Maintenance  éKAJ “ Major delivery   èQ J.» éÊJ “ñK Major release   éÓAë èP@Y“ @ Make ɾƒ Malfunction Pñ’¯ Mall Malta A¢ËAÓ

Management èP@X @ Manager widget  QK YÖÏ@ è@X@ Manager QKYÓ

Manage èP@X @ Manifest section Manipulation  I. «CK Man page èY«A‚Ö Ï@ éj ®“ Mantainer  ù®J.Ó Mantissa   Ì ø Q優Ë@ €AƒZÈéK Q優Ë@ ZQm. '@ Manual testing  ø ðYK PAJ.Jk@ Manual ÉJ ËX Mapped memory   éJJ ªÓ èQ»@X Mapped  éJJ ªÓ Mapping á ªK  Map to úÍ@ á ªK Map  Z@Qk h. / é¢ Qk Marble ÐAgP Marginalia HAJ ‚ÓAë Margin Ó@ñë h. / ÓAë Marked only Marked ÕÎªÓ Marker object Õæ @ð ¬Yë Marker primitive Marker Õæ @ð Mark-sweep garbage collection Markup Mark éÓC« Marshalling Mask  ¨AJ¯ ,H. Am.k Masquerading QºJ K Master boot record   (Q®Ë@ úΫ) úæ„ ZQË@ ¨C¯B@ Ém. Master driver  úæ„ ZP †ZAƒ Master server úæ„ ZP ÐXAg Master-slave  ©“A g/YJ ‚. ª“A f/J ‚ ZP ,©K.AJ/«ñJ .JÓ éJ. KQ K Master ú æ„ ZP ,ú Íð@ Matching éÓZ@ñÓ Match   ‡K.A¢ Material èXAÓ ,XAJ« Mathematical   ú G.A‚j, J“AK P Math HAJ “AK P Matrixes HA ¯ñ ®’Ó Matrix é¯ñ ®’Ó Maximal free expression Maximin Maximize Q J.ºK Maximum segment size Maximum ú支ZÈ@

Max ú支@ Meaning ú GAªÓ h. / úæªÓ Mean ¡ƒñJÓ Measurement  €AJ ¯ Measure  €AJ ¯ Mechanism   éJ Ë@ Median Media type ZAƒñË@ ¨ñK Media ZAƒð Medium  ¡ƒð, é¢J ƒð Meeting   ù®JÊÓ ,ZA®Ë ,¨AÒJk . @ Meg Megabits per second     éJ KAJË@ ú ¯ HA’J.JË@ á KCÓ Megabyte IK AK.Aj. JÓ Megaflop Megaflops Mega- Bj. JÓ Meltdown PAîD”@ Member function ÐYj J‚Ö Ï@ éË@X Membership function éK ñ’ªË@ éË@X  Member variable ñ’« Q ª JÓ Member ñ’« Memetic algorithm Memo function   èQ»YÖÏ@ é®J £ð Memoisation Memoised function Memoization Memoized function

Memorandum PA’j Jƒ @,Qå”m × Memory access  èQ»@X h. ñËð Memory address space èQ»@ YË@ à@ñ J« ékA‚Ó Memory heap èQ»@ X €YºK Memory leak   èQ»@XH. Qå„ Memory location èQ»@ YË@ ©¯ñÓ Memory management èQ»@ X èP@X@ Memory protection   èQ»@X éK AÔg Memory èQ»@ X Memo èQ» YÓ,Qå ”m × Menubar   éÓZA®Ë@ ¡ Qå Menu bar  ÐZ@ñ®Ë@ ¡ Qå Menu item éÓZA ¯ éKA g Menu éÓZA ¯ Mercury delay line øQ»Q Ó Q gZH¡ k Merge l×. X Mesh  éºJ.ƒ Message block   éËAƒQË@ I. ËA¯ Message board €A ®JË@ HAgñË Message catalog  éËAƒQË@ àAJ K. Message digest function Message of the day ÐñJË@ éËAƒP  Message passing ÈZAƒQË@ QK QÖß Message switching Messages ÈZAƒP Message éËAƒP

Metacharacter úΫ@ ¬Qk Meta-data Metadata

Metafile úΫ@ ­ÊÓ Metaheuristic

Metainformation úΫ@ HAÓñʪÓ

Meta key úΫ@ hAJ®Ó

Metalanguage úΫ@ éªË Metal àYªÓ

Metaphone úΫ@ ­ KAë Metaprogram úΫ@ l×. AKQK. Metasyntax

Meta úΫ@ Meter QÓ Methodology  éJ j. îDÓ Method  é®K Q£ Metric space Q Q ø ÖÏ@ ÈAj. ÖÏéK ÖÏ@ZA’®Ë@ Metric Q ø Ó Mice à@PZ ¬ Microcentury   AJ. KQ®K éJ KA K 6.52 Microcode  ðQºJ Ó èQ®ƒ Microcomputer ðQºJ ÓI. ƒAg Microcontroller Qª’Ó ÕºjJÓ Microelectromechanical system øQêm× ú¾JKA¾J ÓðQê» ÐA¢  . Microfortnight ðQºJ Ó àA«ñJ .ƒ@ Microkernel èQ ª’Ó è@ñ K Microlog  ðQºJ Ó Q¯X Micrometre  ðQºJ Ó QÓ Micron àðQºJ Ó Microperation  ðQºJ Ó éJ ÊÔ« Microphone àñ ¯ðQºÓ Microprocesor ðQºJ Ó lÌ.'AªÓ Microprocessor ðQºJ Ó lÌ.'AªÓ Microprogramming  ðQºJ Ó ém.×QK. Microsecond  ðQºJ Ó éJ KA K Micro ðQºJ Ó Micro- QºJ Ó Middle-endian Middleware Midi øYJ ÖÏ@ Mid-level network

Miles ÈAJ Ó@ Millennium bug   éJ ®ËZÈ@ èQå„k Millennium meltdown Millimeter Q ÒÊÓ Millisecond éJ KA K Ó úÎ Milli- JÊÓ Mill éKñkA£ Mind mouse Mind uploading Minicomputer Q ª“ IƒAg Minifloppy .  Q ª“ àQÓ Q¯ Mini icons   èQ ª“ HA Kñ ®K @ Minimal automaton Minimax Minimize  Q ª’  Minimum úGXZÈ@ Miniport Minor fault Minus infinity Minus ‘¯A K Minute   é®J ¯X Mirrored  €ñºªÓ Mirroring øð@QÓ QKñ’  Mirror site è@QÓ ©¯ñÓ  Mirror è@QÓ Miscellaneous ¨ñJ JÓ Misfeature Missile address pðPA’Ë@ à@ñ J« Mistake Z¡k Mixer device   ¡Êg èQ êj. J£Cg PAêk . Mnemonic key Q   ø »YK hAJ®Ó Mnemonic øQ»Y K QÓP Modal logic Modal ðQå„Ó Mode bi Model checking Modeling Modelling   ÉJ º‚ ,h. XAÒJË@ ZA‚@, ék. YÖß Model h. XñÖß ,ɾƒ Modem ÐXñÓ Moderator ¬Qå „Ó Modern ø Q唫 Mode ©“ð Modification Qª K  Modified Q ªÓ Modifier key  Q ªÓ hAJ®Ó  Modifier Q ªÓ Modify ÉK YªK Modular arithmetic Modular øPAJ ªÓ Modulate àP Modulation ÕæK QË@ Module   éJ ¢Öß èYgð Modulo arithmetic Modulo operator Modulo  €AJ ®Ó Molecule ZøQk . Monadic Monitor Monkey, scratch ¡‚» ,XQ¯ Monkey sort øXQ¯ PQ ¯ Monkey up úΫZÈ XQ¯  Monochrome àñ Ë@
KXAg@ Monoid f Monospace Monotonic  I.  KP Month QîD Moose call More ú¯A “@  Morphing ɾ‚Ë@ Q ª K Mosaic (øZA‚®J ‚¯ .) ZA‚®J ‚¯ Most general unifier Most significant bit  Motherboard ÐZÈ@ ékñ Ë@

Mother AÓ@ Motion é»Qk Mounting  I. J»QK Mount point    I. J»QK 颮K Mount Õæ• Mouse droppings Mouse grab    èPZ­Ë@ é’J .¯ Mouse mat

Mouse-over èPZ ¬  úΫ PðQÓ Mouse pad èPZ ­Ë@ èXAƒð

Mouse trails èPZ ­Ë@ QK@ Mouse  èPZ¬ Move ½K Qm' Multiboot ¨C¯ZÈ@ Yª JÓ Multibyte IK AJË@ Yª JÓ . Multicast addressing èYª JÓ é«@ X @ éKñ J« Multicast backbone

Multicast èYª JÓ é«@ X @ Multiclick Yª JÓ ¡ª “ Multihomed hos Multihomed host Multihost disk   á ®J ’Ö Ï@ YªJÓ Q¯ Multilayer perceptron  Multilingualization HA ª Ë@ Yª K Multimedia èYª JÓ ZAƒð Multi-part key  Z@Qk . ZÈ@ YªJÓ hAJ®Ó Multipart ÐA‚¯B@ Yª JÓ Multiple access Yª JÓ ÈñkX Multiple boot ¨C¯B@ Yª JÓ Multiple inheritance ­«A ’Ó HP@ñ K Multiple perspective software development    Q £AJÖÏ@ YªJÖÏ@ l×. @QË@ QK ñ¢ Multiple value    éÒJ ®Ë@ YªJÓ Multiplexed Õæ”Ò, ®«A ’Ó Multiplexer ÈAƒPZÈ@ Yª JÓ Multiplexing Yª JÓ ÈA’@ Multiplex printer Multiple Yª JÓ Multiply  ­«A ’ Multiprocessing Z@Qk. B@ YªJÓ Multiprocessor   lÌ.'AªÖÏ@ YªJÓ Multiprogramming    èYªJÓ ém.×QK. Multiscan Yª JÓ i‚Ó  Multiselection YªJÓ PAJ Jk @ Multisync Multitasking ÐAêÖÏ@ Yª K Multi-threaded Multithreaded Multi-threading Multithreading Multi threading    øYªKI. ª‚ Multiuser system  á ÓYjJ‚Ö Ï@ YªJÓ ÐA¢  Multi-way branch Mumble ÑêÒîE Munching squares Museum ­j JÓ Mute Õæ»@ Mutual exclusion  ÈXAJ.JÓ ZAJ Jƒ@ Mutually recursive ÈXAJ.JÓ Qº JÓ Mutual recursion ÈXAJ.JÓ P@QºK Mux N Naive h. XA‚. K QK. Name capture Named pipe    èAÒ‚Ó ÈA’@ éK.ñJ.K @ Named Stream Named ùÒ‚Ó Name resolution   Õæ ZÈ@ Q Öß Name service switching Namespace Õæ B@ ékA‚Ó

Names ZAÖÞ @ Name Õæ @ Nanocomputer  úÍ@I. ƒAg ñKAK Nanometre QÓ ñKA K Nanosecond  éJ KA K ñKA K Nanotechnology   ñKA JË@ éJ J ®K Nano- ñKA K Narrowband †A¢ JË@ úæ• Narrowing   ‡ J’  National character Native code   éK Q¢¯ èQ®ƒ Native compiler øQ¢¯ ©Òm.× Native øQ¢¯ Natural deduction ùªJ J.£ Õæ„k Natural language processing    éJ ªJ J.£ éªË ém.Ì'AªÓ Natural language   éJ ªJ J.£ éªË Natural number  ùªJ J.£ Õ¯P Nature  éªJ J.£ Navigate ékCÓ Navigating QjJ. K Navigation key PAm'.ZÈ@PP Navigation i®’  Navigator hCÓ Negation by failure Negative acknowledgement Net

Netcafe I K QK @ úæê®Ó Netiquette    éºJ.‚Ë@ ú¯ ÉÓAªJË@ H. @X@ Netizen Netmask   éºJ.‚Ë@ ¨AJ ¯ Netting Network-address ú¾J.ƒ  à@ñ J« Network byte order   ú¾J.ƒ IK AK. I.  KQK Network card   éºJ.ƒ é¯A¢. Network close Network database    éºJ.‚Ë@ úΫ HA KAJ K. èY«A¯ Networked I‚Ó Network engineer  . éºJ.ƒ €YJêÓ Networking HA¾J .‚Ë@ ¡.P Network interface card    éºJ.‚Ë@ éêk. @ð é¯A¢. Network interface controller   éºJ.‚Ë@ éêk. @ð ÕºjJÓ Network layer reachability information Network layer   éºJ.‚Ë@ é®J.£ Network management   éºJ.‚Ë@ èP@X@ Network mask   éºJ.‚Ë@ ¨AJ ¯ Network meltdown Network node    éºJ.‚Ë@ èY®« Network number    ÈA’B@ éºJ.ƒ Õ¯P Network operating system   éºJ.‚Ë@ ÉJ ª ‚ ÐA¢  Network operator  éºJ.‚Ë@ ɪ ‚Ó Network redirector Network segment  ú¾J.ƒ ©¢J®Ó Network storm   éºJ.ƒ 鮓A« Network, the  éºJ.‚Ë@ Network transparency Network  éºJ.ƒ Neural nets Neural network Neuron I’« Neutrosophic . Neutrosophic logic Neutrosophic probability Neutrosophic set Neutrosophic statistics Never  A¢¯ ,ZYK.@ Newbie ZYJJ.Ó  Newer or from t' PAK áÓ ð@ Yg. @  Newer than áÓ Yg. @ News feed Newsgroups  éK PAJ.k @ HA«ñÒm .× News group  PAJ.k @ é«ñÒm.× Newsgroup  PAJ.k @ é«ñÒm.× Newsletter  PAJ.kZÈ@ èYK Qk. News reader PAJkZÈ@ øZPA¯ . News PAJ.k @ New talk YK Yg. IK Yg New text YK Yg. ‘ New YK Yg. Next  ú ÍAJË@ Nibble Õæ” ¯ NIC Niceness value Nice  ­J ¢Ê,¯ñÊg Nickle ɾJË@ Nick name PAªJ‚Ó Õæ @ Nick  I. ®Ë@ Night mode JË ¡Öß ú Î Nipple éÒÊg No assignment Node èY ®« Noise shaping i’Ë@ ÉJº‚ . Noise i. Jm.• ,l. • Non-algorithmic procedure

Noname Õæ @ »Â»Â¯Ã Noncluster mode  úΒk B ¡Öß ,ø Xñ®J« B ¡Öß Nondeterminism Nondeterministic Nondeterministic automaton Nondeterministic polynomial time Non-existant Xñk. ñÓ Q « None  Yg@B,àðYK. ,Zú æ B Non-impact printer Non-inclusive Non-interlaced Nonintrusive testing Nonlinear ù¢kB

Non-optimal solution ÉJÓ @  Ë Ég Non parity úkðPB Non-polynomial . Nontrivial ÈYJJ.Ó Q « No numbering X@YªK àðYK . Non-uniform quantising logarithmic compression Non-volatile memory   èQK A¢JÓ Q « èQ»@X Non-volatile storage  QK A¢JÓ Q « áK Q m' Non-volatile QK A¢JÓ Q « Nonvolatile QK A¢JÓ Q « Normal distribution ùªJ J.£ ©K Pñ K Normal form øXA« ɾƒ Normalisation  ©J J.¢JË@ Normalised I. £ Normalize  P@QºJË@ É®K Normal order reduction Normal vector Normal ùªJ J.¢,K XA« Normed space Norm PAJ ªÓ Northbridge  ú ÍAÖÞ Qå„k. North ÈA҂Ë@ Notation áK ðYK Not between Note Notebook ÈñÒm× HñƒAg Not empty . ¨PA¯ Q « Not equal to úÍ@ ÈXAªÓ Q « Not equal ÈXAªÓ Q«

Notice PAªƒ@ ,àC« @

Notification PAªƒ@

Notify PAªƒ@ Notwork  éºJ.ƒ No-write allocation No B N-th Roo N-tier Nu-calculus Nullary Null modem ÐXñÓ CK   . Null pointer Zúæ B Qå ZÐ

Null string é«PA ¯ ¬Qk @ éʂʃ Null ÐY« Numbering Õæ¯Q K Number sign Number Õ¯P Numeral  ø Y« Numerator ¡‚.  Numeric øY« øYm.'.@ Nybble IK AK. ­’ Nym server QÊJ ÓP ÒJ K@ ©k. @P O Obi-wan error Object code Object file úæ•Q « ­ÊÒ, “Q «É ®Ó Object identifier Object-orientation  éJ k. ñJË@ éJ “Q « Object-oriented Object-oriented analysis  éJ k. ñJË@ úæ•Q « ÉJ Êm' Object-oriented database    é JKZA¿ HA KAJ K. èY«A¯ Object-oriented design   éJ k. ñJË@ úæ•Q« Õæ Ғ Object-oriented language   éJ k. ñJË@ éJ “Q « éªË Object-oriented programming    HA KZA¾ Ë éêk. ñÓ ém.×QK. Object oriented  éJ k. ñJË@ ú æ•Q« Objects ¬@Yë·Â»Â¯Ã@ Object àZA¿ Oblique stroke Oblique ÈZAÒ,¯Qj JÓ Observational equivalence Observations HA ¢kCÓ ,H@Y“Q K Obsolete  ¡J.Ó ,¼ðQÓ Occam Occasion   éJ.ƒAJÓ , é“Q¯ Occlude @Y‚ Occurence HðYg Occurrence HðYg Occurs check Octal  ú GAÖß Octet   éJ KAÖ ß October  ÈðB@ áK Qå„ Octothorpe Offline ɒJÓ Q « Offset  ék@P @,XñJ k Off-side rule Off-topic ¨ñ“ñÖÏ@ h. PAg Off ‡Ê ªÓ OK ‡¯@ñÓ Older or from

Older than áÓ ÐY¯@ Old  Õç' Y¯ On all pages HAj ®’Ë@ C¿ úΫ One-line fix Ones complement One-Time èYg@ð èQÓ, èQÓ On even pages  éJ k. ðQË@ HAj ®’Ë@ úΫ One-way function One-way hash function Ongoing PAg. Online ɒJÓ On odd pages  éJ k. ðQË@ Q « HAj ®’Ë@ úΫ On the line ¡mÌ'@ úΫ Onto Ontology Xñk. ñË@ ÕΫ On ÉÒªK Opacity éÒ J« Opaque ÕæªÓ Open box testing Open-collar worker Opening Open source hñJ®Ó PY’Ó Open switch hñJ®Ó È@YJ.Ó (@PP) Open iJ¯ Operand ÉÓAªÓ Operating system  ÉJ ª ‚ ÐA¢  Operational database    éJ ÊÔ« HA KAJ K. èY«A¯ Operational requirements   éJ ÊÔ« HAg . AJ Jk @, éJ ÊÔ« HAJ .Ê¢JÓ Operational semantics Operational test and evaluation Operational testing Operation code  éJ ÊÔ« PAÓP Operations HAJ ÊÔ« Operation  éJ ÊÔ« Operator overloading Operator ÉÓA«

Optical character recognition ¬ðQmÌ'@ úΫ øQå”. ¬Qª K Optical diff Optical fiber  éK Z ¬AJ Ë@ Optical fibre  éK Z ¬AJ Ë@ Optical grep Optical mouse   éK Zñ“ èPZ¬ Optimal ÉJÓZÈ@

Optimise éÊ JÓ @ Optimising compiler

Optimization éÊ JÓ @ Optimized ÉJÓZÐ Optimize ÉJÒ JK Optional ø PAJ k Options H@PAJ k Option PAJ k Orange  úÍA®KQK . Order Order-embedding Ordering Ordinal Ordinate Organization é»Qå „Ë@ , éÒ ¢ JÓ Organizer Ñ¢ JÓ Organize  Õæ ¢JK Org éÒ ¢ JÓ Orientation   èAm.'@ , éJ k. ñK , ék. ñK Origin

Original úΓ@ Orphaned i-node Orphan process  Õæ JK Z@Qk. @ Orphan ÕæJK Orthflow Orthogonal instruction set   èYÓAªJÓ HAÒJ ʪK èQÓP Orthogonal YÓAªJÓ Or ð@ Other Qk @ Outbox  PXA’Ë@ éJ.Ê« Outer Outer join Outgoing h. PAg Outline font J’® K¡ k ú Î Outline   ù¢J ¢m' Õæ P , è
f¢k Output device Output h. Qk Outside-in testing Outside á« h. PAf,k . PAmÌ'@ ú¯ Outsourcing Overclocking   éJ KA ®J ÖÏ@ ‘J ¯ Overflow ‘J ¯ Overhead úGA ¯ñ ¯ Overlap Overlapping I»@QK Overlay . Overloading  Override PðAm .' Overriding Overrun Overrun screw Overuse strain injury Overview Overwrite     úΫ éK.AJ», éJ ¯ñ¯ éK.AJ» Own Owner ½ËAÓ P Package éÓ Qk Packed decimal Packet driver   ÐPP †@ñ‚. ÓQk †@ñƒ Packet mode éÓ Qk ¡Ò O éÓ PP ¡Öß Packet radio Packet sniffer éÓ Qm Ì'@ ‡‚ J‚Ó Packet-switched éÓ Qm Ì'@ KYJK ú Î . Packet switching   éÓPQË@ È@YK.@, éÓQm Ì'@ È@YK.@ Packet writing     éÓPQË@ éK.AJ», éÓQm Ì'@ éK.AJ» Packet éÓ PP Pack  éJ.Ê« Padded cell Padding Pagebreak    èYK Yg. éj®“ é¯C¢@ Paged address AJ j®“ à@ñ J« Paged memory új®“ èQ»@ X Paged AJ j®“ Page fault éj ®’Ë@ Z¡k

Page frame éj ®’Ë@ PA£@ Page in éÊ g@X éj ®“ Pagelet Page mode új®“ ¡Öß Page out   ék. PAg éj®“ Pager Pages Page éj ®“ Paging    IK .AJË@ Q®Ë@ úÍZð áÓ èQ»@YË@ HAj ®“ ÈA®JK@ Pain in the net Paint  é«AJ.“ ,áëX Pair h. ðP Palettes

Palette window à@ñËZÈ@ ékñË PA£@

Palette à@ñË @ ékñË Palmtop Panelize Panel ékñË Pane hñË Panic Panic message   Q«X éËAƒP ,¨AJ KP @ éËAƒP Papermail Paper-net Paper tape   ú ¯Pð ¡ Qå Paper †Pð Paraconsistent probability Paradigm Paradox é’ ¯A J JÓ Paragraph èQ ®¯ Parallel computer  (ÉJ ª ‚Ë@) P@ñ JÓ HñƒAg Parallel computing   . (ÉJ ª ‚Ë@) éK P@ñ JÖ Ï@ éJ.ƒñmÌ'@ Parallelism  ø P@ñK Parallelograms  ¨C“ B@ éK P@ñ JÓ Parallelogram  ¨C“ZÈ@ ø P@ñJÓ Parallel port  ø P@ñJÓ Y®JÓ Parallel processing   éK P@ñ JÓ ém.Ì'AªÓ,P@ñ JÓ Z@Qk. @ Parallel processor  P@ñ JÓ lÌ.'AªÓ Parallel random access machine P@ñ JÓ øZ@ñ‚« XA ® K éJºÓ Parallel reduction   P@ñ JÓ ÉJ Ê®K ,‘J ®J K Parallel resource P@ñ JÓ XPñÓ Parallel-service   éK P@ñ JÓ éÓYg Parallel P@ñ JÓ Parameters HA¢ƒñÖ Ï@ Parameter ¡ƒñÓ Parametric polymorphism    颃ñÖÏ@ ÈA¾ƒZÈ@ éK YªK Parametric ù¢ƒñÓ Paranoid programming  HAJ KPZÈ@ àñ Jk . ém.×QK. Parcel .  éËAK.,Qå• Parent directory ÐZÈ@YÊj. ÖÏ@ Parentheses àAƒñ ¯ Parent level Parent process Parent structure Parent widget Parent window ɓZÈ@ PA£ZÈ@

Parent øñK.@ Parity bi Parity bit   éJ k. ðQË@ IJ .,k. ð@QË@ IK . Parity error úkðQË@ Z¡k Parity .  éJ k. ðP Parser generator Parser HQªÒ,Êm× . Parse H. @Q«@ Parsing H@Q«@ Partial equivalence relation . Partial evaluation   øZQk . á ÒJK ZQk . á Òm' Partial function  éK ZQk . È@X Partial key ø ZQk. hA®Ó Partially ordered set     I.  KQË@ éK ZQk . èQÓP Partial ordering   ø ZQk. I.  KQK Partial PAj JÒ,K ZQk . Participants àñ»PA ‚Ó Partitioned data set Partitioning   Õæ ‚®KèZQm.' Partition Õ愯 Passing Passive grab Passive matrix display  ú æ.ʃ é¯ñ®’Ó ðX @QªÓ Passive úæʃ Passphrase  . Qå  èPAJ.« Password aging Qå„Ë@ éÒÊ¿ ÐXA®K Password field Qå„Ë@ éÒÊ¿ É®k Password Qå  éÒÊ¿ Pass QKQÖß

Paste †A’Ë @ Patch (noun) éª ¯P Patch pumpkin Patch (verb)  ©J ¯QK Patch éª ¯P Path coverage testing Pathname separator  ‡K Q£ Õæ @ ɓA¯ Pathname  ‡K Q£ Õæ @ Paths HA ¯Q£ Path PA‚Ó Patience Q.“ Pattern matching HñʃZÈ@ ‡¯@ñ K Pattern recognition . Pattern ¡Öß Paused     ­J ¯ñJË@ I ¯ZÐ,(AJ J¯ð) ­¯ñJÓ Pause I ¯ZÐ ­ ¯ñ K Peephole optimisation Peer-to-peer Q ¢ JJË@ Q ¢  Peer Q ¢  Pending signal Pen Õί Percentage  éK ðZÐ Percentual øðZÐ Percent  èZÕËAK. Perceptron Perf Periodic group øPðX ¨ñÒm.× Periodic  éK PðX Period èPðX Peripheral device ú¯Q£ PAêk . Peripheral ú ¯Q£ Permanent file ÐZ@X ­ÊÓ Permanent link ÐZ@X ¡.@P Permanent ÐZ@X Per-message

Permission à X @ Permutation  éËXAJ.Ó Perplexity  èQ f,»AK.P@ Persistence P@QÒJƒ@ Persistent link QÒJ‚Ó ¡.@P Persistent memory èQÒ J‚Ó èQ»@ X Persistent QÒJ‚Ó Personal Personal computer  úæ”m QKñJ J.Ò» Perspective  Pñ¢ JÓ, ék. Q¯ Pessimising compiler Peta- Petabyte Petaflops Phase alternating line Phase Pñ£ Philippines á J. JÊJ ®Ë@ Philosophy é®‚Ê ¯ Phishing Phone mail  ù ®KAë YK QK. Phone   ­JîD ,®KAë Phosphor fatigue Phyiscal Physical addressing éƒñÒÊÓ éKñ J« Physical address €ñÒÊÖÏ@ à@ñ JªË@ Physical file €ñÒÊÓ ­ÊÓ Physical layer   éƒñÒÊÖÏ@ é®J.¢Ë@ Physical memory address éƒñÒÊÖ Ï@ èQ»@ YË@ à@ñ J« Physical memory       AJ ®J ®k èXñk. ñÖÏ@ èQ»@YËèéƒñÒÊÖÏ@ èQ»@YË@ Physical   Xñk. ñË@ ù®J ®j,ƒñÒÊÒ,ƒñ‚m× Pica Pi-calculus Pick aperture Picker button Picking  ZA®JK @,PAJ Jk @ Pico- Picosecond Pictogram Pictograph Picture element èPñ“ Qå”J« Pictures Picture èPñ“ Pie  PZA¢¯ h. / èQ ¢¯ Piggybacking Pin Pin feed Ping Ping-flood Pinging

Ping-pong XP ð Y g @ Pin-out Pipeline Pipeline break Pipelined Pipeline processing   éK XP@ñK ém.Ì'AªÓ Pipeline stall Pipelining èXP@ñÓ

Pipe HñJ.K @ Piping . Piracy éJ“Q ¯ Pirate àA“Q ¯ Pitch èñ¢ k Pixelize Pixels H@Pñ’ J« Pixel ɂºK. Pixmap Placeholder àA¾Ö Ï@ ½ƒAÓ Placement Place àA¾Ó , ékAƒ Plaid screen Plain text ¬Qå• ‘ Plain window éÊÓA¿ èY ¯A K Plain (‘) XQm.× Plants Plastic Platform é’ JÓ Play by electronic mail Player ZPA®,J «B . Play ZQ¯A,ʪ ‚, ¯ Q« @ Plenum cable Pleonasm Pling Plonk Plotter A¢k Plot (verb)  ¡k ,¡J ¢m' Plug and play   ÉJ ª ‚ ð .¯ Plug-in editor kit Plug-in ú ¯A“@ àñºÓ Plugin ‡jÊÓ Plus Plus every  Pocket calculator Ì    I. Jm. éJ.ƒAg éË@ Pocket computer I. Jm.Ì H. ñƒAg Podcast èQå „ Point-and-grunt interface Pointed domain Pointer grab Pointer swizzling Pointer Qå ZÐ Pointing device Q ƒZ H PAêk . Pointing stick Q ƒZ IË@ A’« Point of presence   Xñk. ñË@ 颮K Point of sale terminal   ©J K. 颮K ¬@Q¢Ó Point-to-point protocol      颮K úÍ@ 颮K †A®J Ó Point   Qå„JK , 颮K Policy group Policy issues  éJ ƒAJ ƒ àðZ € Policy repository Policy  éƒAJ ƒ Polish  éK YJËñJ .Ë@ Polling    Q H. AjJKA,JK ñ’J«@ ¯@ Polygon ©Ê’Ó Polyline Polylithism Polymorphic lambda-calculus Polymorphic ÈA¾ƒZÈ@ Yª JÓ Polymorphism   ÈA¾ƒZÈ@ éK YªK Polynomial-time Polynomial-time algorithm Polynomial  éK XðYg Polyvinyl chloride Pool ñk Pop Pop-down menu éËY‚ Ó éÓZA ¯ Popup menu Pop up  ‡J.JÓ Popup   é®J.JÓ èY¯AK Portability     É®J Ë éJ ÊK.A¯ Portable   ÉÒmÌ ÉK.A¯ ,ÈñÒm× Portal  éK.@ñK. ,HAK. Porting . Portmapper Y ® JÖ Ï@ A¢k Portmap  Y¯AJÖ Ï@ é¢ Qk Port monitor  Y®JÖÏ@I. ¯@QÓ Port number Y ® JÖ Ï@Õ¯P Portrait   èQK ñ’ Portugal ÈAª KQK . Portuguese  éJ ËAª KQ.Ë@ Port Y ® JÓ Pose  éJ ª“ð Position Positional  AJ KA¾Ó,AJ ª¯ñÓ Posted write-through Posterize

Poster ‡’ÊÓ ,àC« @ Postfix notation  ‡jÊÓ IK ñJ K Postfix syntax Posting Postmaster YK Q.Ë@ ¨PñÓ Post office problem YK Q.Ë@IJºÓ ɾ‚Ó Post-order traversal .

Post (ɪ¯) ɃP@, éËAƒP Potential difference Potential master Potential primary Pound on Pound sign    (àPð èYgð) É£QË@ éÓCª,îD Jm.Ì'@ éÓC« Pound  (à Pð) É£P ,(éÊÔ«) éJ Jk . Power cycle Powerdomain

Power management é¯A¢Ë@ èP@X @ Power-on Power-on self-test   ¨C¯ZÈ@ YJ« ú G@YË@ ‘j®Ë@ Power save mode é¯A¢Ë@ PAgX@ ¡Öß Powerset Power èPY ®Ë@ , é¯A¢Ë@ Pragma Pragmatic     ù ª¯@ð ,úΪ¯ ,ù ªK@PX Precharge Precision é¯X Predecessor Predicate calculus Predicate logic Predomain Pre-emptive multitasking øZA¯ñË@ HAÒêÖ Ï@ Yª K Preferences HCJ ’ ®K Preference ÉJ ’ ®K Prefix notation ZYJ.Ó IK ñJ K Prefix syntax Prefix  éKXAK. Preformat        éK YJ êÖß éJJ îEéK YJ êÖß é«A“@ Pre-order Pre-order traversal Prepaging  Prepare Q ’m ' Prepend Preprocessor   øYJ êÖß lÌ.'AªÒ,J ®J.ƒ lÌ.'AªÓ Pre-sales support rep Presence detect  Yg. @ñJË@ ¬A‚»@ Presentation Presentation layer Presets Presiding Press ¡ª “ Pretzel key Prevention @Y“,Q¢k Preventive maintenance    éK ZA¯ð éKAJ “ Preventive øZA¯ð Prevent   I Jm .' ,ZA®K@ Preview .  éJK AªÓ Previous  ‡K.A‚Ë@ Primary cache     éJ ‚ ZP éJ K.Ag, éJ Ëð@ éJ K.Ag Primary key Primary management domain Primary window úæ AƒZÈ@ PA£ZÈ@

Primary úÍð@ Prime number theorem Prime time Primitive Principal type úæ„ ZP ¨ñK Principal ú æ„ ZP Printable      é«AJ.¢Ë ZúæêÓ, é«AJ.¢Ë ÉK.A¯ Printed circuit board Printed ¨ñJ.¢Ó Printer port  é«AJ.¢Ë@ Y®JÓ Printer  éªK.A£ Printing ©J.¢ Print server   é«AJ.£ Õ®ÊÓ Print ©J.£ Priority inheritance   éJ ËðZÈ@ éK@Pð Priority interrupt Priority inversion   éJ ËðZÈ@ HC®K @ Priority queue  . éK ñËðB@ ­“ Priority scheduling   éK ñËðZÈ@ éËðYg. Priority  éK ñËð@ Privacy  éJ “ñ’k Private hostname  úæ•ñ’k ­J ’Ó Õæ A,J ’m ­J ’Ó Õæ @ Private-key cryptography Private Ag Priviledge PAJ JÓ@ Privileged instruction      PAJ JÓ@ H@X ú æ Ó éÒJ ʪK Privilege PAJ JÓ@ Probabilistic automaton

Probabilistic éJ ËAÒJk @

Probability †ñ JËAÒ Jk @ Problem report  ɾ‚Ó á« QK Q®K Problem state ɾ‚Ö Ï@ éËAg Problem ɾ‚Ó Procedural language   éK Z@Qk. @ éªË Procedure call

Procedure Z@Qk. @ Process code

Process file émÌ'AªÓ ­ÊÓ,Z@Qk @ ­ÊÓ . . Process identifier Z@Qk. B@ ¬QªÓ Processing   YJ ®J JË@ øPAg. , éÊÓAªÖÏ@ øPAg. ,‡J J.¢JË@ øPAg. Processor bus Processor farm Processor time  lÌ.'AªÖÏ@ (ÉJ ª ‚) áÓ P Processor lÌ.'AªÓ Process scheduling    ém.Ì'AªÖÏ@ éËðYg. ,Z@Qk. ZÈ@ éËðYg. Process status  Z@Qk. B@ éËAg Process table Z@Qk. B@ ÈðYg. Process  é JÊÔ« Production system  h. AJK@ÐA¢ Product  i. JJÓ Professional programming  éJ JêÓ YJʂ QK Professional services  éJ JêÓ HAÓY g Profile    èQk . ñÓ èQ ‚. A®“@ñÒ,®K QªK ­ÊÓ Profiling data Program counter × × ú m. QK. X@Yª,m. AKQK. X@Y« Programmer l×Q. .Ó Programming fluid Programming language Programming  ém.×QK. Programs l×. @QK. Program transformation Program l×. AKQK. Progress bar  ÐY®JË@ ¡ Qå Progressive coding  Q  ø Y®K ÓQK Progress ÐY®K Project assurance Projection A®ƒ@ Projective plane Project management  ©K PA‚Ó èP@X@ Project planning     ¨ðQå„Ó Q K.YJ«ðQå„Ó Õæ ¢JK Project ¨ðQå„Ó Promiscuous mode Promote    èY«A‚Ó, éJ ¯QK Prompt Ik Proof theory

Proof HAJ .KA,KAëQK . Propagation PA‚K@ Propeller key ©¯@X hAJ®Ó Properties HA ®“@ñÓ ,ZA’k Property   éJ ºÊÓ , éJ “Ag Proportional   I. ƒAJJÓ ,úæƒAJK Propositional calculus . Propositional logic Proposition   h@Q¯A,kQ®Ò,K ZP Proprietary ¼ñÊÓ Protected mode ùÒm× ©“ð Protected workbook Protected ùÒm× Protection  éK AÔg Protect  g éK AÔ Protocol analyser Õæ @QÓ Ém× Protocol class 0    éK Q®“ †A®J Ó èZ¬ Protocol converter  †A®J Ó ñm× Protocol layer   †A®J ÖÏ@ é®J.£ Protocol stack Protocols Õæ @QÓ Protocol  †A®J Ó Prototyping  ék. YÖß Provably difficult Provably unsolvable  Provider Q¯ñÓ Provide Q ¯ñK Provision Proxy gateway Proxy server ÉJ »ñKÐXA g Proxy ÉJ »ð Pseudo-device PAêk . éJ.ƒ Pseudo-random number øZ@ñ‚« éJƒ Y« . Pseudo-terminal ¬@Q¢Ó éJ.ƒ Pseudo éJ.ƒ Pubic directory Public directory « × ú ×ñÔ Ém. Public domain software  × ú ×ñÒªË@ ÈAj. ÖÏ@ HAJ m. QK. Public domain ¨A‚Ó Public-key cryptography Public-key encryption    ú ×ñÒªË@ hAJ®ÖÏAK. éJ ÒªJË@ Public « ú ×ñÔ Publisher Qå„ P@XQå  AK Publish Qå„ Pull-down list Pull-down menu Pull media

Pull Qj. ,K.@YJk . A,J.m Pumpkineer Pumpking ¨Q¯ Pumpkin  á ¢®K Punch card   I®K é¯A¢. Pure functional language  .  éJ ¯A“ éJ ®J £ð éªË Pure lambda-calculus Purely functional language   ú¯A“ ɾ‚ . éJ ®J £ð éªË Purge   éJ kC’Ë@ éK AîE Pushable module Push-button ¡ª “ @PP Push media ©¯X ZAƒð Push ©¯X Put procedure Pyramid ÐQë Q Quadratic ùªJ K.QK Quadrature  éJ «AK.P Quadruplex Quality assurance  èXñm.Ì'@ YJ »ZH Quality control  èXñm.Ì'@ áÓ Y»ZIË@ Quality of service  HAÓY mÌ'@ èXñk. Quality  èXñk. Quantifier Quantity  éJ Ò» Quantum Quantum computer ú×ñÒ» H. ñƒAg Quantum computing   éJ ÓñÒºË@ éJ.ƒñmÌ'@ Quantum do Quarantine  éJ J ªK.P@ Quarter Query expansion Query ÐCªJƒ@ Ques Question mark ÐAê® JƒB@ éÓC« Queue PñK.A£ Quickstart  ©K Qå (ÉJ ª ‚) ZYK. Quiesce Quintillion Quit èPXA ªÓ Quorum device

Quorum ÑîD @ h. / ÑîD Quotation €AJJ¯@ . Quota ÑîD @, é’k Quoted   ­¢J®Ò,‚.J®Ó Quotelike Quote  €AJ.J¯@ Quotient Õ愯 Quoting R Race condition PAª K éËAg Rack-mounted Radial ú«Aªƒ Radio button Radio group Radiosity  éJ «Aªƒ Radio ñK X@P Radius Q¢¯ ­’  Radix  ø PYg. Y« Raise ©¯P Random-access memory Random numbers    éK Z@ñ‚« X@Y«@, éK Z@ñ‚« ÐA¯P@ Random testing Random  ø Z@ñ‚« Range øYÓ Rank éËQ Ó Rapid prototyping Raster file   ú æÓA‚ ­ÊÓ Raster font ù¢®K¡ k Rastergram Raster graphics       úæÓA‚  ¡J ¢m'éJ JÓA‚  HAJ ÓñƒPéJ JÓA‚  HAJ KAJ K. Rasterising Rasterizing Raster op Raster subsystem Raster   ú æÓA‚Ë@ i‚ÖÏ@ ñ¢k Rate é«Qå  ,YªÓ Rating    QK Y®K, ék. PYË@ YK Ym' Rational Ratio  éJ.‚ Rave on Raw data ÐAg HAJ ¢ªÓ Raw mode Raw ÐAg Ray casting Ray tracing Ray èQk Re-

Reachable éJ Ë@ ɓñJÓ , éJ Ë@ Èñ“ñË@ áºÖ ß Readable ZðQ®Ó Read-ahead Read-eval-print loop Read-only Read only ¡®¯ ZðQ®Ó Readout Read-write Ready I. ëZIÓ, QëAg . Read èZ@Q ¯ Reality check Real mode Real number Real path Real-time structured analysis ' ø Pñ¯ ø ñJ K. ÉJ Êm Real-time øPñ¯ Realtime ø Pñ¯ Real user ùª¯@ñË@ ÐYj J‚Ö Ï@ Real   ù®J ®k Reassembly

Reboot ¨C¯@ èXA« @ Recalculate Receipt ÉJ “ñK Receive Received Receiver  ÉJ.®J‚Ö Ï@ Receptivity Recipe     éK Q ’m ' ékZB , 鮓ð Recipient Recognition ¬Qª K

Reconnect ÈA’@ èXA« @ Record (verb)  ÉJ j. ‚ Record   éÊJ j. ‚ Recovery  ¨Ag. Qƒ@ Recover  ¨Ag. Qƒ@ Rectangle  ÉJ ¢‚Ó Rectangular Recurrence Recurse Recursion theory Recursion èXðAªÓ Recursive definition øP@QºK ­K QªK Recursive descent parser Recursive type Recursive   ©K.AJÓ ,Ég@YJÓ Redex Redirection  éJ k. ñK èXA«@ Redirectort Redirect output Redirect  éJ k. ñK èXA«@ Redisplay QªË@ Yg Redocumentation

Redo ɪ¯ èXA« @, èXA« @, èXA«ZÈ@ éÊgQÓ Redraw Reduce ‘®K Reduction strategy Reduction ‘®K Redundancy Redundant array Red zone

Red QÔg@ Re-engineering Re-entrant Ref Refactoring  ©J ’JË@ èXA«@ Reference counting ù ªk. QÓ @Yª,ªk. @QÖÏ@ @Y« Reference ©k. QÓ Referential integrity ùªk. QÓ ÉÓA¾K Referentially transparent Referential transparency     éJ ¯A®‚Ë@ éJ ªk. QÓ, éJ ªk. QÓ éJ ¯A®ƒ Referer ÈYK

Referral éËAg @ Reflexive domain Reflexive »A« Refreshable braille display Refreshable display   €Aª KZ È ÉK.A¯ @QªÓ Refreshable   €Aª KZ È ÉK.A¯ Refresh rate IK YjJË@ ÈYªÓ

Refresh €Aª K @ Refuse ‘ ¯P Refutable ñ ¯QÓ Regenerate  YJ ËñK èXA«@ Regex Regional network       éK Q¢¯ éºJ.ƒ , éJ ÒJ ʯ@ éºJ.ƒ Region Õæʯ@ ,Q¢¯ Register allocation Register assignment Registered port Éj. ‚Ó Y®JÓ Register set Register spilling Register-true Register  ÉJ j. ‚ Registration  ÉJ j. ‚Ë@ Registry Éj. ‚Ó Regression Regression curve Regression testing

Regular expression ù¢Öß Q J.ªK Regular graph Regular Ñ¢ JJÓ Regulate Reify Reincarnation, cycle of Reinstallation Rejected ñ ¯QÓ Reject ‘ ¯P Relational algebra Relational calculus Relational database management system Relational database    éJ £AJ.KP@ HA KAJ K. èY«A¯ Relational data model Relational language Relational model ú¯ZC« ¡Öß Relationship Relation é¯C« Relatively prime Relative pathname Relative path ú æ.‚ PA‚Ó Relative úæ‚ Relay host . Relay  ÉK YJ.,ËA®JÓ Released version

Release P@Y“@ Relevance     éK Q Öß é®J £ð Reliability  HAJ .K, é®K Reliable communication Relief  èYm.' Reload   ÉJ Òm' èXA«@ Rely on úΫ YÒJªK Remailer Remaining  †AK. Remark é¢kCÓ Reminder

Remind Q »YK Remote access YªK á« XA ® K .  Remote control YªK. á« Õºm' Remote echo YJ ªK. øY“ Remote login Remote monitoring YªK á« éJ ¯@QÓ . . Remote procedure call YªK. á« Z@Qk. @ ZA«YJƒ@ Remote shell Remote YJ ªK. ,YªK. á« Removable disk Removable È@QÓ Removed Remove invisible content

Remove éË@ P @ Rename    éJ ҂ èXA«@ Rendering   Q ’ Render    (Q “ .¬) Q ’ Rendezvous Y«ñÓ Renew YK Ym.'@ ReNice h'
ƒ Reorganize   Õæ ¢JK èXA«@ Repaginate éj ®’Ë@ X@Y«@ èXA«@ Repagination éj ®’Ë@ X@Y«@ èXA«@ Repair  iJ ʒ Repeater XQÓ Repeating group Repeat loop XQ K é®Êg Repeat   YK XQKP@QºKèXA«@ Repetition Repetitive strain disorder Repetitive strain injury Replaceable unit Replacement algorithm Replacement  ÈCg@ ,È@YJ.ƒ@ Replace  ÈYJ.ƒ@ Replicate QºK ,­«A’ Replication P@QºK, 鮫A ’Ó Reply @XP Report  QK Q®K Repository Q®Ó Representation Requeriments Request for proposal Request IÊ£ Required . Requirements analysis Requirement   h. AJ JkA,J.Ê¢JÓ Require IÊ¢ Reseller . Resend Reserved block Reserved memory   èPñj . m× èQ»@X Reset button    ø [email protected]@ ©“ñË èXA«@PP Reset X@XQƒ@ Resident Õæ®Ó Residual  ù®J.JÓ Resizable    €AJ ®Ë@ Q ª JË ÉK.A¯ Resize handle Resize pointer Resize   Õæ j. m' èXA«@ Resolutions H@P@Q ®Ë@ Resolution   éKAJ .ƒ@ Resolver library  Resolver ÈAg Resolve   È
fÊf,¯ f Q®,Êg Resource bundle  XPñÓ éÓQk Resource control XPñÒÊK. Õºm' Resource fork  XPñÓ éJ.ªƒ Resource group Resource-group Resource monitor  XP@ñÖÏ@I. ¯@QÓ Resource pool XP@ñÓ ñk Resource state XPñÖÏ@ éËAg Resource status XPñÖÏ@ éËAg Resource type XPñÖÏ@ ¨ñK Resource XPñÓ Respawn Response time   éK.Aj. JƒB@ I ¯ð Response  éK.Ag. @ Responsible ÈðZÓ Restart   ÉJ ª ‚ èXA«@ Restore XAªJƒ@ Restriction PA’J¯@ Restrict PA’J¯@ Restructuring   éʾJ ë èXA«@ Result éjJ JË@

Resume ­ KZ Iƒ @ Rete Retrieve ¨AgQƒ@ , èXAª Jƒ@ ,Im .  . Retry @Ym.× ÈðAg Return from interrupt Return èXñ« Reusability ÈAÒªJƒZÈ@ éK P@QºK

Reuse ÈAÒªJƒZÈ@ P@QºJËAÒª JƒZÈ@ èXA« @ Reversed €ñºªÓ Reverse engineering   éJ ‚º« ém.×QK. Reverse polish syntax Reverse €ñºªÓ Revert ºªK Revision éªk @QÓ . Revocation ÈA¢.@,I. m Revoke É¢J. K ,I. j‚ Revolutions per minute    é®J ¯YË@ ú ¯ H@PðX Rhombus á ªÓ Rhythm  ¨A®K @ Rich object Right brace   éJ J Öß èQå•Ag Right bracket  (ù)JJ Öß €ñ¯ Right-click  á ÒJ Ë@ úΫQ®JK Right join Right-justify   á ÒJ Ë è@XAm× Right outer join Right outside Right parenthesis úæJ Öß ÈCë

Right Am”,JJ Öß Ring network    ɾ‚Ë@ éJ ®Êg éºJ.ƒ Rings I ®Êg Ring topology   ù®Êg úÆÊKè Ripcording Rip   éJ Ô¯P ZAƒð q‚ Robot HñK .ðP Robus Role PðX Roll Rollback Rolling upgrade Room é¯Q «

Root account øPYg. H. A‚k Root bridge

Root directory PYm.Ì'@ ÉJ ËYË@ Root disk  ø PYg. Q¯ Root file system øPYg HA ®ÊÓ ÐA¢  . Root mode øPYg. ¡Öß Root node    éK PYg. èY®« Root user name øPYm.Ì'@ ÐYjJ‚Ö Ï@ Õæ @ Root version

Root øPYg. ,PYg. Roses Rotary debugger Rotate Èñk P@X ,PðYK Rotational latency Rotation object Rotation objects Rotations per minute    é®J ¯YË@ ú ¯ H@PðX Rotation à@PðX Rough translation    éJ . KQ®K éÔgQK Rounded rhombus . Rounded square PðYÓ ©K.QÓ Round-robin Round-trip time Round PðYÓ Routed Route flapping Routeing Routeing domain Router ék. ñÓ Route  ‡K Q£ Routine  èQ Kð Routing table éJ k. ñK ÈðYg. Routing éJ k. ñK Row-level locking Row ­“ ,Q¢ƒ

RSS Feed R RSS Feed èQå „ PY’Ó Rude Rulers Ruler èQ¢‚Ó Rule èY«A ¯ Run code Runic Run-length encoding Run level  ÉJ ª ‚ øñJ‚Ó Runnable process  úÎ Jª ‚ Z@Qk. @ Run time Run-time environment Jª ‚ áÓ P ¡Jm× ú Î Run-time error  úÎ Jª ‚ áÓ PZ¡ k Run-time library   úÎ Jª ‚ áÓ P éJ.JºÓ Runtime library   úÎ Jª ‚ áÓ P éJ.JºÓ Run-time support  úÎ Jª ‚ áÓ P Ñ«X Run-time system  úÎ Jª ‚ áÓ PÐA ¢  Runtime system  úÎ Jª ‚ áÓ PÐA ¢  Runtime  ÉJ ª ‚Ë@ áÓ P Run-time  úÎ Jª ‚ áÓ P Run YJ ®J K S  Safe mode áÓ @ ©“ð Safety-critical system Safety   éK A¯ð ,áÓ@ Safe áÓ @ Salt substrate Salt iÊÓ Salutation ÐC‚. . JkQK Salvage Sample rate àAJ J«ZÈ@ YªÓ Sample ú«  Sampling frequency àAJ J«ZÈ@ XQK Sampling rate àAJ J«ZÈ@ ÈYªÓ

Sampling àAJ J« @ Sandbender Sandbox    Èñ“ñË@ YK Ym' éJ Ë@ Sanity check Sans Sanskrit   éJ K Qº‚‚Ë@ Sans serif   († QªÓ Q «) HA J’« àðX áÓ Satisfiability problem f Saturation  ©J.‚ Save ¡ ®k Say ɯ Scalability ©ƒñJË@ éJ ÊKA¯  . Scalable resource €AJ®Ë@ ƒ XPñÓ, éJ ¯QË ÉKA¯ XPñÓ ú Î . Scalable service       éJ ¯QË éÊK.A¯ éÓYg Scalable   YK YÒJË ÉK.A¯ Scalar ƒ (Y«) ú Î Scale   Õ΃ ,€AJ ®Ó Scaling Scan line i‚ÖÏ@¡k Scanner ém AÓ Scan path i‚ÖÏ@ PA‚Ó Scan register i‚ÖÏ@ Cm. Scan i‚Ó Scenario  (ɒ®Ó) YîD„Ó éK.AJ» Schedueler  éËðYg. l×. AKQJ.,ËðYm.× Schedueling  éËðYg. Scheduel ÈðYg. Schedule manager   éËðYg. úæ„Ó, éËðYg. Ñ¢ JÓ Scheduler  éËðYg. l×Q. .Ò,ËðYm.× Schedule ÈðYg. Scheduling  éËðYg. Schematic capture Schematic type variable Schematic ' ù ¢J ¢m Schema ¡m × Scheme é¢ k ,¡m × Scientific ù ÒÊ« Scope †A¢ 

Scoring PQk @,P@Qk @ Scratch disk   é‚ .Qk Q¯ Scratch file  é‚ .Qk ­ÊÓ Scratch  éK @YK. ,€QîE Screen blanker éƒA ‚Ë@ ‘J JÓ . Screen capture éƒA ‚Ë@ A®JË @ Screen editor éƒA ‚Ë@ Qm× Screen lock éƒA ‚Ë@ É® ¯ Screen popping Screen reader éƒA ‚Ë@ øZPA¯ Screen refresh Screensaver éƒA ‚Ë@ é¢ ¯Ag Screen scraper Screen server éƒA ‚Ë@ ÐXAg Screen sharing Screenshot é¢ ®Ë Screen éƒA ƒ Screw Y‚®K ,½®Ó Scrip Scripting Scripting language Script language Script × ú æ” l. AKQK. Scrollable list      ‡ËQ Ë éÊK.A¯ ékZB Scroll arrow QK QÒJË@ ÑîD Scrollbar  ‡ËQË@ ¡ Qå Scroll box  QK QÒJË@ †ðYJ“ Scrolling ‡Ë QË@ Scroll pane ‡Ë QË@ hñË  Scroll ­Ë Scrozzle Scruffies Scuzzy Search engine Im ' ¼Qm× Searching . Search problem Search string Search term  IjJ .Ë@ iÊ¢’Ò,JjJ .Ë@ èXQ®Ó Search Im ' Secondary cache . Secondary key   ú GAK hAJ®Ó Secondary storage  ' ø ñKAK áK Qm Secondary  ø ñKAK Second generation computer  úGAJË@ ÉJ m.Ì'@ H. ñƒAg Second generation language  úGAJË@ ÉJ m.Ì'@ éªË Second level cache Second normal form Second úGA K Section  éJ.ªƒ Sector interleave Sector interleaving Sector mapping Sector map   ¨A¢®Ë@ é¢ Qk Sector éJ ªƒ ,¨A¢¯ .  Secure áÓ @ Security breach

Security àAÓ @ Seeking AJ «Aƒ Seek time  ù ª‚Ë@ áÓoK@Y‚Ë@ áÓP Seek ùªƒ Segfault Segmentation and reassembly Segmentation fault Segmentation Õ悮K Segmented address space Segment 骢 ¯ Selection ù®JJÓ Selector Select  ZA®JK@ Self-test øZA®Ê K ‘m¯ Selvage Semantic Semantic gap Semantic network Semaphore Semiautomatic  øZA®ÊK éJ.ƒ Semi bold Semicolon Semicolons Semi light Sendding Sender ɃQÓ Send-Monitor

Send ÈAƒP@

Sense €A‚kA,êj. JÓ Sensitive €A‚k Sensor m .× Sentence éÊÔ g Separate compilation . Separator ɓA¯ September  ÈñÊK @ Sequencer ©K.AJË@ Ñ¢ JÓ Sequence   éJ ËAJÓ Sequential codec Sequential coding Sequential file matching Sequential processing      úÍAJÓ YJ ®J KéJ ËAJÓ ém.Ì'AªÓ Serialise Serial line ú΂ʂ ¡k ,ɂʂÓ ¡k

Serial port ú΂ʂ Y® JÓ Serial processing Serial ɂʂÓ Serif   (HA ®K QªK) HA J’« Servelet Serverlet Server room ÐXAm Ì'@ é¯Q « Server-side include Server-side   ÐXAmÌ'@ YJ« ,ÐXAmÌ'@ ÉJ.¯ áÓ ,ÐXAmÌ'@ éJ kAK áÓ Servers ÐX@ñk Server ÐXAg

Serve ÐYg @ Serviceability éÓY m Ì'@ èPY ¯ Service interface   éÓYmÌ'@ éêk. @ð Service provider     éÓYjÊK. XðQÒ, JK QKZÈ@ éÓYg Q¯ñÓ, éÓYmÌ'@ Q¯ñÓ Service éÓY g Servlet Session layer Session  é‚Êg. Set abstraction Set associative cache Set complement Set comprehension Set-Operation Set theory Setting

Settings H@X@Y« @

Settling time P@Q®JƒB@ (úÍ@ Èñ“ñË@) áÓ P Set-top box Set up Setup I JK . Set á ªK Seven layer model Severity èñ‚ ¯ , èY ƒ Sexadecimal Sha-bang Shabang Shading  ÉJ ʒ  Shadow file Shadowing  ÉJ Ê¢  Shadow ram Shadow É£ Shaft Shallow binding Shaped text Shape ¬C « ɾƒ Shared-address ÑëA‚Ó à@ñ J« Shared memory é» Q‚Ó èQ»@ X Shared object ¼Q‚Ó àZA¿ Shareware  éJ J. ’ HAJ m.×QK. Share ¼Q‚Ó ,ÑîD Shar file Sharpen Sharpness Yg , é¯X ,hñ“ð Sharp XAg Sheets  éJ ¢«@ Sheet é¯Pð Shelf A¯P Shell procedure Shell scrip Shell script Shell variable Shell é¯Y“ Shielded twisted pair Shift left logical Shift right logical

Shift ék@ P @ Ship Shockwave Shopbot Shortcut key PA’JkB@ hAJ®Ó Shortcut Qå”Jm ×

Shortest job first Bð@ Q唯B@ éÒêÖ Ï@ Shorthand Shovelware Show table Show Q«@ Shriek Shrink  ‘J Ê®K Shut down   ÉJ ª ‚Ë@ ¬A®K @ Shutdown        ÉJ ª‚Ë@ á« ¬
f¯ñJÒ,ÊJ ª‚Ë@ ¬A®K @ Side bar úæKAg . ¡ Qå Side-effect . úæKAg . Èñª®Ó Sig . Sigma Signalling rate H@PA ƒZÈ@ ÈYªÓ

Signal èPA ƒ@ Signature block

Signature ZA’Ó @ Significance úæªÓ, éËBX Sign   èPAƒ@,QÓ Qª ¯ñK Silently úGñºƒ Silicon chip Silo Silver bullet Simple multicast protocol Simple path Simplex Simplex method Simplex printer Simple ÉîD. „¢J ‚. Simship Simulated annealing  áK YÊJË@ èA¿Am× Simulation èA¿Am × Simultaneous shipment ø Pñ¯ ÈAƒP@ Since saving Since Y JÓ Sine Sine wave Singapore èPñ ® ª Jƒ Single assignment Single-attached Single-duplex Single-electron transistor Single ended Single inheritance èYgñÓ éK@Pð Single inlinememory moduleviewing pipeline Single-instance Single-precision Single quote Single sign-on  øXAg@ ÈñkX ÉJ j. ‚ Single sourcing Single static assignment Single system Singleton variable Single-user mode YJ kñË@ ÐYjJ‚Ö Ï@ ¡Öß Single YK Q¯ Sink Sitename ©¯ñÓ Õæ @ Site ©¯ñÓ Size  骃 ,Ñm.k Skewness Skew ¬@Qm ' @ Skip ù¢m ' Skolemisation Skrog Skulker Sky ZAÖÞ Slant Slash Slave cycle Slave driver Slave server Slave YJ.« Sleeping ÐZAK Sleep ÐñK Slice  ém' Qå Slider QK QÒJË@ ¡ Qå Slide   ‡ËQK , ém' Qå Sliding-window Slog Slogan PAªƒ Slot éj J¯ Slow terminals  éJJ ¢. ¬PA¢Ó Slow Zù¢. Smail Smalles Smart Smart card Smart terminal   èPñ¢JÓ éJ ¯Q£ Smash case Smash sum Smiley  éÓA‚K.@ Smooth Ñ«AK Snaf Snag Snail mail Snap Snap dump Sneakernet Sniffer   éºJ.‚Ë@ I. ¯@QÓ Sniff Õæ„J‚ ,®‚ J‚

Snooze èñ ® «, èZA ® « @ Social science number Socket  .®Ó Softcopy Soft key Soft limit Soft link Soft return Software audit   l×. AKQ.Ë@ ‘m¯ ,l×. AKQ.Ë@ éK.A¯P Software bug Software development kit    l×. @QK. QK ñ¢ éJ. J®k Software development life cycle Software enabling Software engineering  HAJ m.×Q.Ë@ éƒYJë Software handshaking Software interrupt Software law Software life-cycle Software metric Software patent Software piracy   l×. @Q.Ë@ éJ“Q¯ Software pirate  l×. @Q.Ë@ àA“Q¯ Software reliability l×. AKQ.Ë@ Èñ« Software theft  l×. @Q.Ë@ é¯Qå Software tool   ém.×Q.Ë@ è@X@ Software  éJ m.×QK. Soft wrap Softy Solarization Solid-state storage device Solid Iʓ Solution . Sorted  I. KQÓ ,PðQ ®Ó Sorting  I KQ KPQ ¯ Sort order . Sort PQ ¯ Sound card  Hñ’Ë@ é¯A¢. Soundness Sound Hñ“ Source code escrow Source code   é Jʓ·Â»Â¯Ã@ èQ®J ‚Ë@ Source language Source package Source route Source routing Source tree Source PY’Ó Southbridge Ì Ì ú G.ñJm. '@ Qå„m. '@ Space bar ¨@Q ®Ë@ hAJ®Ó Spacebar ¨@Q ®Ë@ hAJ®Ó Space complexity Space leak Space ÈAm.× ,¨@Q¯ ,ZA’ ¯ Spacing  èY«AJ.Ó Spaghetti code Spamdex Spamming Spam i. «QÓ YK QK. Spanning tree algorithm Span   éëQK. ,¨A‚@

Spare ù£AJ Jk @ Sparse Spawn       éK PY,«A¯YKZÈ@ 颮N ¯AJ.KZÈ@ 颮K Speaker Spec Special character Special file Specialisation ‘m ' Specialized ‘j JÓ Specials HAJ “Ag Special Ag Specific address ‘m × à@ñ J« Specification Specific markup  Specify YK Ym' Specular Speculative evaluation Speculative execution

Speech recognition ÐC¾Ë@ úΫ ¬QªJË@ Speech synthesis Speed é«Qå  Spellcheck    èZi. îDË@ éªk. @QÓ Spelling ZAjë . Spell ZCÓ@ Sphere èQ» Spider Spike Spill àA ¯ñ£ Spiral Spiral model Splash screen   éK @YJ.Ë@ éƒA ƒ Splash  ZYK. éƒA ƒ Split brain Split pane Split ÐA‚®K@ Splot Spoofing Spoof ÉjJK Spooler Spool  èQºK. Spreadsheet Spread sheet HA‚k é¯Pð Spread spectrum communications . Sprite Sprocket feed Spyware  m .' l×. AKQK. Square bracket  ©K.QÓ €ñ¯ Square numbers   éªK.QÖÏ@ X@Y«ZÈ@ Square ©K.QÓ Squatting  ZA’¯Q®Ë@ (€ñÊg. ) Stabilize Stack compression Stacked Stack frame Stacking order Stack loader Stack overflow Stack pointer é“QË@ Qå ZÐ Stack segment   é“QË@ áÓ Pñj . m× ©¢®Ó Stack traceback Stack Pé“P Staircase Staircasing Stake Standalone Stand alone éK@ YK ÐZA¯ . Standard deviation øPAJ ªÖÏ@ ¬@Qm'B@ Standard disclaimer Standard error  úæ AJ ¯ Z¡k Standard for robot exclusion Standard input  úæ AJ ¯ ÉgX Standard interpretation Standard output  úæ AJ ¯ h. Qk Standard semantics Standard  ú æ AJ ¯ Standby ù£AJ Jk@ Star network   éÒm.' ɾƒ úΫ éºJ.ƒ Start bi Starting ZYK. Start tag Startup files ZYJ.Ë@ l×. AKQK. HA ®ÊÓ Startup  ÉJ ª ‚Ë@ ZYK. Start  éK @YK. Star  éÒm.' State diagram Stateless State machine Statement State transition diagram State éËAg Static allocation Statically typed   Static analysis á»Aƒ ÉJ Êm' ,IK .AK ÉJ Êm' Static database management system Static field  IK .AKÉ ®k Static link Static linking Static nested scope Static nested scoping Static random access memory Static scope Static typing Static  úGñº‚. K.AK Statistical time division multiplexing

Statistical øZA’k@

Statistics HAK ZA’k@ Stats Statusbar Status bar HAÓñʪÖ Ï@ ¡ Qå Status éËAg Steganography Stemmer Stemming Step increment Stepwise refinement Step èñ¢ k Stereogram Stereotype Sticky analysis Sticky bit Sticky content Sticky data Sticky keys Sticky notes Stochastic øZ@ñ‚« Stock-keeping unit Stone Stop bit Stopping Stop ¬ñ ¯ð Storage pool Storage space áK Q jJË@ Ñm.k Storage  áK Q m' Store and forward Stored procedure Store  áK Q m' Storm Streaming Stream-oriented Stream ‡¯Y K, ‡¯X Strength reduction Stress testing Stretch Stretched Strict evaluation Strict ÐPA“ Strikeout Strikethrought Strikethrough ¡k 颃ñJJ ,K.ñ¢‚Ó String reduction String variable String éʂʃ Stripchart program Stripe Stripe set Striping  Strip ¨Q K, 鮃 Stroke font object Stroke ÐY’ Strongly connected component Strongly typed Strong typing Struct Structural recursion Structured analysis Structured design Structure diagram Structured language Structured programming Structure  éJ K. Stub network Stub  èPYK. Stupid-sort

Style Hñʃ@ Sub . Subband encoding Subclass   éJ «Q¯ èZ¬ Subdirectory Sub directory ú«Q¯ ÉJ ËX Subdivision Subfield ú«Q¯ É®k Sub folder ú«Q¯ YÊm.× Subject Subject index ©J “@ñÖ Ï@ ÉJ ËX Subject-oriented programming Sublanguage Submenu Submission ¼@Qƒ@ Submit ɃP@ ,¼Qƒ@ Subnet Subnet address Subnet mask    éJ «Q®Ë@ éºJ.‚Ë@ ¨AJ ¯ Subnet number Subnetting Subroutine Subscribed Subscribe  ÉJ j. ‚ Subscribing Subscript Subscription  ÉJ j. ‚ Subset Subshell support Substituted Substitution Substrate Substring Substructure Subsystem Subtitle Subtotal ú«Q®Ë@ ¨ñÒj. ÖÏ@ Subtract Subtype Subtyping

Succeed hAm.' Successor Sufficiently small AJ ¯A¿ Q ª“ Sufficient ú ¯A¿ Suffix é®kB Suggestion h@Q¯@ Suggest h@Q¯@ Summary ‘jÊÓ Sum (noun) ¨ñÒm.× Sum (verb) ©Ôg. Sum ¨ñÒm.× ,©Ôg. Sun-stools Super Superblock Superclass Supercombinators Supercompilation Supercomputer Superhighway Superimpose Super minicomputer Superordinate Superpipelined Superscalar Superscript Superset Supertype Superuser Supervisor mode ¬Qå „ÖÏ@ ©“ð Support èY«A‚Ó ,Ñ«X Supremum Surfaces Surface ékA‚Ó Surfing Surjection Surjective Surrogate key Suspend  ‡J ʪK Suspension  ­J ¯ñK Suspicious éJ ¯ ¼ñº‚Ó

Swallow ©ÊK.@ Swap file   éK QëA¢Ë@ èQ»@YË@ ­ÊÓ Swap partition Swapped in Swapped out Swapping Swap space Swap ÉK YJ.K Sweden YK ñ‚Ë@ Swedish  éK YK ñ‚Ë@ Switchboard Switched virtual circuit Switched virtual connection Switching Switching hub ÉK YJ.K ¨PñÓ Switchover Switch statement Switch Èñm' Switzerland @Qå„ ñƒ Swung dash Symbolic inference Symbolic link   éK QÓP éʓð Symbolic logic øQÓQË@ ‡¢ JÖ Ï@ Symbolic mathematics Symbols PñÓP Symbol QÓP Symlink   éK QÓP éʓð Symmetric key cryptography Symmetric multiprocessing     é®ÊJm× èYªJÓ ém.Ì'AªÓ Symmetric multiprocessor Symmetric Q£A J JÓ Synchronized Synchronize éJÓ@ QÓ Synchronous key encryption Synchronous áÓ@ Q Ó Sync level Sync pulse Sync éJÓ@ QÓ Synflood Synonym ring Synonym ¬X@ QÓ ,¬X@QÓ Syntax Syntax directed translation Syntax error  éÊÒm.Ì'@ ZAJK . ú¯ Z¡k Syntax tree Synthesis áK ñºK Synthetic image   éJ «AJ¢“@ èPñ“ Sysadmin System administration ÐA¢ JË@ èP@X@ System administrator ÐA¢ JË@ QKYÓ  System analysis ÐA¢ JË@ ÉJ Êm' ,ÐA¢ JË@ ‘m¯ System analyst System beep System bell ÐA¢ JË@ €ñ¯A K System board ÐA¢ JË@ hñË System bus System call System catalog System controller System kernel ÐA¢ JË@ è@ñ K System management System manager System message System name System number System operator System programming language   ÐA¢ JË@ ém.×QK. éªË Systems analysis Systems analyst System settings Systems jock System software ÐA¢JË@ l×. AKQK. Systems operator Systems programmer  éÒ¢B@ l×Q. .Ó Systems programming   éÒ¢ B@ ém.×QK. System state ÐA¢ JË@ éËAg System testing   ÐA¢ JË@ éK.Qm.' System tray System type ÐA¢ JË@ ¨ñK System unit ÐA¢ JË@ èYgð System ÐA¢  Systolic array T Table ÈðYg. Tag Õæ ð Taskbar HAÒêÖ Ï@ ¡ Qå Task éÒêÓ Technology éKA ®K Template IËA¯ Tentative . øZAîE Q « Terminal  é J¯Q£ Terminate ZA’ ¯ Ternary Theme éÖ Þ Threading  I. ª‚ Thread 邯A JÓ Tilde èYÓ Timeout éÊêÓ Toggle ÉK YJ.K Token Track  Triangular numbers éJÊJÖ Ï@ X@Y«ZÈ@ Tweak Typesetting U Ubiquitous computing Ultra-large-scale Umount Unary Unary operator Unasserted Unavailable Q¯ñJÓ Q « Unchanged  Q ªÓ Q « Uncompression Uncountable Uncover Uncrypted Uncurrying Undelete Underflow Under line Underline Underlining Underscore  úήƒ Q ¢‚ Undocumented feature Undo (ÉK YªK) ©k. @QK Unexpected error  ©¯ñJÓ Q «Z¡k Unfold Ungroup Unicode Ym ' ð@ Unification Unifier Uniform resource Uniform Resource Identifier XPñÖÏ ú×A¢  ¬ QªÓ Unify Uninstall Uninstaller Union Uniprocessor Unique Unique key Unique sales point Unit in last place Unit testing Unit èYgð Universal address Universal quantifier Universal thunk Universe of discourse University  éªÓAg. Unix ºKñK Unknown Èñêm.× Unlink Unload

Unlock É® ®Ë@ ZAªË @ Unmark Unmarked Unmount Unnamed ù҂Ó Q « Unnormalised Unprotect Unproto Unpublished Unread Unread only Unrestricted  Pñ’m× Q « ,X
J®Ó Q « Unsent f Unshielded twisted pair Unspecified  Ym× Q « Unsubscribe  ÉJ j. ‚Ë@ ZAªË @ Unsupported Ðñ«YÓ Q « Untitled àñ JªÓ Q « Untyped Unzip ­ÊÖ Ï@¡ª “ ½¯ Up Uparrow  Update IK Ym' Updating Upgradeability Upgrade   éJ ¯QK Upload ©¯P Upper Upper bound

Upper case Q J.» ¬Qk Upper memory block Upper Stream Upright Upstream PAJ JË@ øXñª’,K.AJ ‚ZÈ@ øXñª“ Uptime Upward closure Urban legend Urgent Ég. A« URI URL ú×A¢  XPñÓ à@ñ J« Usability Usage ÈAÒªJƒ@ Use User acceptance testing User account ÐYj J‚Ö Ï@HA‚k User agent . ÐYjJ‚Ö Ï@ ÉJ »ð User base User-defined User directory User-friendly Ð@Yj JƒB@ ÉîD User id User identifier ÐYj J‚Ö Ï@ ¬ QªÓ User interface User interface copyright Username User name ÐYj J‚Ó Õæ @ User ÐYj J‚Ó Utility-coder Utility window Utility  éÊJ ƒð V Vacuum tube ¨Q ®Ó ÐAÖޕ Valency Validate •   ém áÓ ‡jJË@ Validation éÓCƒ áÓ ‡m ' Validity  éJ kC“ Valid Õæʃ Value added reseller Value added retailer     é¯A’Ó éÒJ ¯ ðX †Q®Ó ¨ZAK. Value-added   éÒJ ®Ë@ ¬A’Ó Values Õæ¯ Value    Õæ ¯ h. / éÒJ ¯ Vampire tap Vanilla Vanity domain Vaporware Var Variable declaration Variable Q ª JÓ Variance  Variant Q ª JÓ Variations H@ Q ª K Vector font Vector graphics  éJ êj. JÓ HAJ ÓñƒP Vector processor Vector space Vector éj. JÓ Veeblefeetzer Vendor ¨ZAK. Ventilator card   éK ñîE é¯A¢. Verbage Verbatim copy Verbose I. J¢Ó Verification    ‡J ®m' Verified  Verify ‡®k Versions H@P@Y“@

Version P@Y“@ Vertex Vertical application Vertical bar øXñÓA« ¡ Qå Vertical blanking Vertical drive Vertical encoding Vertical interval Vertical loop combination Vertically AK XñÓA« Vertical microcode Vertical refresh Vertical refresh rate Vertical scan rate Vertical úæ ZP Very-large-scale Via Video adapter Video card  HAK ZQÓ é¯A¢. Video compression ø ZQÓ ¡ª“ Video conference øZQÓ ¨AÒJk . @ Video conferencing Video dial tone Video display terminal Video interface  ñK YJ ¯ éêk. @ð Video memory Video (random Video random Video random access memory Video terminal   é JKñK Q ®ÊK éJ ¯Q£ Video  éK ZQÓ Viewer Qê¢Ó View model Viewport QªË@ Y ® JÓ View transform View volume

View PAê£ @ Vim Violation †Q k Viole Virgule Virtual address øQëA¢Ë@ à@ñ JªË@ Virtual cache Virtual circuit Virtual connection Virtual Console Virtual device Virtual disk Virtual hos Virtual machine øQëA£ PAêk . Virtual memory   éK QëA£ èQ»@X Virtual path Virtual point of presence Virtual reality Virtual server  ø QëA£ Õ®ÊÓ Virtual úæ•Q ¯ Virus €ðQ ¯ Visibility  éK ZP Visible bell ø ZQÓ €Qk. Visible ø ZQÓ Visited link Visit  èPAK P Visual bell Visual editor Visualisation Visualization  éK ZQÓ ÐñƒP Visual language Visual programming Visual programming environment Visual programming language Visual øQå”. Viz Voice mail  úGñ“ YK QK. Voice recognition Volatile memory   èQK A¢JÓ èQ»@X Volatile storage Volatile variable Volatile QK A¢JÓ Volume Ñm.k Von Neumann architecture Von Neumann integer  iJ j’Ë@ àAÓñJ K àñ ¯ Y« Von Neumann, John àAÓñJ K àñ ¯ àñk . Von Neumann machine   àAÓñJ K àñ ¯ éË@ Von Neumann ordinal W Waiting PA¢ JK@ Wait state PA¢ JK@ éËAg

Wait Q¢JK @ Walk off the end of

Walk úæ„Ó@ Wall clock time Wallpaper   éƒA ‚Ë@ éJ ®Êg Wall ZAg Wank Want list Warchalk Wardialer Wardriving Warez

Warning P@Y K @  Warn QK Ym' Warranty àAÒ ’Ë@ Washing machine éËA‚ « Watch I¯@P Watermark  . éK ZAÓ éÓC« Water ZAÓ Wave division multiplexing Wavelength division multiplexing Wavelet Wavetable Wavetable synthesis Wave  ék. ñÓ Wavyline Weakly typed Weak typing Web browser  éºJ.‚Ë@ ­’JÓ Webcam Web cam   éJ ºJ.ƒ èQÓA¿ Webcasting Webhead Weblint Weblog Web master  ©¯ñÓ QK YÓ Webmaster  ©¯ñÓ QK YÓ Webmin Webmistress Webmonkey Webpage Web page   éJ ºJ.ƒ éj®“ Webserver  éºJ.‚Ë@ ÐXAg Web server  I. Kð Õ®ÊÓ Website I K QKB@ úΫ ©¯ñÓ Web smith Web Hð Wedgie . Weekday PAîE Weekend  ¨ñJ.ƒZÈ@ éÊ¢«

Weeks ©J K.Aƒ@

Week ¨ñJ.ƒ@ Weighted search àðPñÓ Im '. Weight à Pð Well-connected Well-known port ¬ðQªÓ Y ® JÓ Well-ordered set Whacker Whalesong Wheel bit While White box testing White paper   ú æ®KYJ‚Ó Whitespace ɓA¯ White trash

White ‘J K.@ Wide area é’ Q« ékA‚Ó

Wide character ‘ Q« ¬Qk Widge Widget Widget class Widget instance Widget set

Widow éÊÓP @ Width Q« Wi fi Wi-fi Wiggles Wiki ú ¾K ð Wild card ZAgñë é¯A¢ . . Wildcard ÈYK. ¬Qk Winbind Window control Window frame èY ¯A JË@ PA£@ Window gravity Window icon    èY¯AJË@ éKñ ®K @ Windowing system Y ¯@ñ JË@ ÐA¢  Window list  Y¯@ñJË@ ékZB Window manager Y ¯@ñ JË@ Ñ¢ JÓ Window raster Windows messaging Window system Y ¯@ñ KÐA ¢  Windows Y ¯@ñ K Window èY ¯A K Wired ú¾Êƒ Wireframe model Wireless bitmap Wireless local area network     éJ ºÊƒB éJ Êm× é®¢JÓ éºJ.ƒ Wireless ú¾ÊƒB Wish list With copy éj‚  ©Ó Within epsilon of With ©Ó Wizard mode YƒQÓ ¡Öß Wizard YƒQÓ Word processing  HAÒʾË@ ém.Ì'AªÓ Word processor ñ’ lÌ.'AªÓ Word size  éÒÊ¿ Ñm.k Word spamming Words HAÒÊ¿ Wordwrap Word wrap HAÒʾË@ ¬A ® JË@ Word éÒÊ¿ Work Work area ÉÔ« 鮢 JÓ Work around Workaround Workbook €@Q» Workflow ÉÒªË@ Q ƒ Work group  ÉÔ« é«ñÒm.× Workgroup  ÉÔ« é«ñÒm.× Working Working directory Working memory Working set Working set model Work in progress  PAm .'ZÈ@ YJ ¯ ÉÔ« Worksheet ÉÔ« é¯Pð Workspace object Workspace switch Workspace ÉÒªË@ ékA‚Ó Work station ÉÔ« é¢m × Workstation ÉÔ« é¢m ×

Workweek ÉÔ« ¨ñJ.ƒ@ World-readable  AJJ ÖÏA« ZðQ®Ó World ÕËA« Wormhole Wormhole routing

Worm I K QK @ èXðX Wound around the axle Wrap Wrapper ¬C « Wrapping Wrats nest Write-back Write buffer Write-only language Write-protect  éK.AJºË@ Y“ ùÒm' Write queue  éK.AJ» ­“ Write side  éK.AJ» IKAg . Write-through . Write-thru

Write IJ» @ Writing system  . éK.AJ» ÐA¢  X X-axis ÉJ “A¯ZÈ@ Pñm× ,€ PñjÖÏéJ J ‚Ë@ Pñm× Xor X-y plane XA’ËAJ ‚Ë@ i¢ƒ. XA’ËAJ ‚Ë@ øñJ‚Ó Y Y-axis  PñjÖÏ@ Years H@ñ Jƒ Year éJƒ

Yellow Q®“ @ Yes ѪK Yocto- Yotta- Yottabyte Z Z-axis ú æJ ªË@ PñjÖÏ@ Z-buffer IKQÓ I ¯ZÐ à Q m × Z clipping . Zepto Zero assignment Zero-content   Z@ñJkB@ Õç' Y« ,øñJjÖÏ@ ¨PA¯ Zero-order Zero state   éK Q®“ éËAg Zero Q®“,@PA®“@ ©’ Zetta- Zettabyte Zigzag Zigzagline Zip file ñª ’Ó ­ÊÓ Zombie process Zombie ú æ.ÓðP Zone †A¢ 

Zoning ‡£A JÓ úÍ@ Õ悮K Zoom in  Q J.ºKP
J.» Zoom Out f Zoom out  Q ª’P
fª“ Zoom Q J.ºK ,P
J.» Zoo  f HA K@ñJ mÌ'@ é®K Yg 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 permit ted 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, INDIRE CT, 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.

Document generation: Djihed Afifi, [email protected]    †ZAKñÊË ø X €@ ú G. ø Q¯ é’kP . é£ñ ®m × †ñ ®m Ì'@ É¿ . Arabeyes.org , 2006 q‚Ë@ †ñ ®k (SGML DocBook)      ð@ PY’ÖÏ@ éJJ ë ú ¯ éKðYK. ð@ ÉK YªJË@ YªK. Ð@YjJƒB@ð ©K PñJË@ èXAªK. i҂   RTF P ostScript PDF HTML (SGML  : éJ KB@ ðQå„ËAK. (tÌ'@... ð@ ð@ ð@ ð@ éªÒj. ÖÏ@ HA JJ êË@       ¬Q¢Ë@ ZCë@ð èYë ðQå„Ë@ éÖßA¯ ð èC«@ Pñ»YÖÏ@ q‚Ë@ †ñ®k Q¢‚. A®JkB@ ÕæK à@I. m.' (SGML DocBook)       Q  . éK PY’Ó È@ èQ®‚Ë@ éJJ ë ú ¯ ©K PñJË@ èXA«@YJ« ªK àðYK. èAKX@ Pñ»YÖÏ@       ¬Q¢Ë@ ZCgZð , èYë ðQå„Ë@ éÓZA¯ð , èC«@ Pñ»YÖÏ@ q‚Ë@ †ñ®k Q¢ƒ YJ ËñKÕæK à@I. m.'   Q      èXA«@YJ« é«ñÒj. ÖÏ@ ú ¯ Aë ¯ñKÕæK øQk@ X@ñÓ ø @ ð@/ð ‡J KñJË@ ú ¯ @ðQê¢ àZð , èAKX@ Pñ»YÖÏ@ RTF PostScript PDF  × DTD   ×    ð@ ð@ úÍ@ éËñm , áÓ Qk@ ¨ñK úÍ@ éËñm ) éªÒj. ÖÏ@ éJJ êË@ ú ¯ ©K PñJË@  .(øQk@ éJJ ë ø @ ð@        Q   áÓ ¬Q¢Ë@ ZCg@ ©Ó ñë AÒ» QK @H. Q« ú ¾K ð ‡K Q¯ 颃@ñK. @Yë ‡J KñJË@ YJ‚Ó ¯ñKÕæK :ÐAë       •  '  • B.¬Yë ø ZÈ éJ¯AJ Ë ð@ èPAj. JË@ È i. JJÖÏ@ éJ.ƒAJÓ HAKAÖÞ ø @ AîD ¯ AÖß. , éJ¢J.Ó ð@ ém Qå• HAKAÖÞ ø @  Q  Q      ' Xñ’®Ó « ð@ Qå AJ.Ó « ð@ Qå AJ.Ó,‘ ñªK ø @ á« éJ ËðZÓ ø @ QK @H. Q« ú ¾K ð ‡K Q¯ ÉJ Òm áºÖß         ‡k ð@ hAK.P@ ð@ HAKAJ K. èPA‚k ; éÊK YK. HAÓYg ð@ ©Êƒ ZAJJ¯@ Aë ú ¯ AÖß.) ù ªJ.K ð@ ú G.A®« ð@ Ag ð@          «   IKA¿ Z@ñƒ AîD Ê« éJ .‚Ë@ é¯C«  ƒZH Õç' ú æË@ éK Q¢JË@ IKA¿ AÒêÓ (ÉÔ ú ¯ ÉgYK ð@;Ð@YjJƒ@          ᫠ɾƒ øZH. ZQ¢ úæË@ð ,(½ËX Q « ð@ ÈAÒëZÈ@ éJҒJÓ) éJ KYÓ ð@ éÓPB ð@ éK Y®« éK ÈðZÓ   .Qå ”Ë@ @Yë ÉJÓ ¨ñ¯ð áÓ QK YjJË@ Õç' ñË úæk ,‡J Kñ JË@ @Yë Ð@YjJƒ@

[email protected] × ,ù ®J ®« XAêk. : ém. QK.