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

úGQ« øQ Êm.'@ English . Arabic Technical Computing Dictionary    èQmÌ'@ ©K PA‚Ö Ï@I. KQªK ‡K Q¯ Free Software Arabisation Team http://wiki.arabeyes.org/Technical_Dictionary

Version: 2.0.24-06-2016 June 24, 2016

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 Access memory, XA ® J Ë@ èQ »@X , Accessory, , ú ÍAÒ» Access point, PñJªË@ 颮K A . Account, H. A‚k Abort, A êk@ . Accounting management, HA KA‚mÌ'@ QJ‚ Abortive release,  . ‘ êm.× (ú¾J.ƒ) ¨A¢®K@  Accumulator, Ñ» QÓ Abscissa, éʓA¯ Accuracy, é¯X Absolute, (éÒJ¯) (é)®Ê¢Ó Acknowledgment, Qºƒ , àA ¯Q « Absolute address, ‡Ê ¢Ó à@ñ J « Acoustic coupler, Absolute path,  Acquire,  ‡Ê¢ÓPA‚Ó H. A‚»@ Absolute pathname, ‡Ê ¢ÓPA‚Ó Õæ @ Acronym,  Action, Abstract, XQ m.× Z@Qk. @ Abstract class, Activate,    XQm.× ­J “ É Jª®K,¡ J‚K Active,  Abstract data type, XQm.× HA KA JK. ¨ñK ¡ J‚  Activity,  Abstract datatype, XQm.× HA KA JK. ¨ñK A‚ Actor, Abstract interpretation, XQm.× É KðAK É«A¯  Actuator,   Abstraction, Y KQm.' ɪ‚Ó Abstract machine,    Adapt,  èXQm.× éË@ ­J JºK Abstract method,   Adapter, èXQm.× é® KQ£ ­J ºÓ Abstract syntax,   Adaptive answering,    èXQm.× é JK. é J® JºK éK.Ag. @ Abstract syntax tree,     Adaptive learning,  ªK èXQm.× é JK. èQm. ù ® J JºK ÕÎ Accelerated Graphics, Adaptive routing,   ù ® JºK é Jk. ñK Accelerator,  Add,  ¨Q å„Ó é¯A“@ Accent, é»Qk Add-In, Accept,  Add-in, ÈñJ.¯ ¬A’Ó Acceptance testing,   Additional, ÈñJ.®Ë@PAJ.Jk@ ú ¯A“@ Additive, Access, XA ® K ú×AҒ @ Addon, Access control list,    XA®JËAK. ÕºjJË@ éÖßA¯ Addon CD, Accessibility,   ékAK@ Address, à@ñ J « Accessible,  hAJÓ Address book,  áK ðAJ « Q¯X Access level, XA ® J Ë@ øñJ‚Ó Address bus,  Algebraic structure,   áK ðAJ «É¯AK é KQ.g. é JK. Addressee, Algorism,  é JË@ ɃQÓ é JÓPP@ñ k Addressing,  Algorithm,  éKñ J « é JÓPP@ñ k Adjacency,  Alias,  PðAm.' é JJ » Adjacent, Aliasing,  PðAm.× á ‚ Adjust, Aliasing bug,   ¡J.“ á ‚ ÉÊg Admin, Align,  QK YÓ è@XAm× Administration,  Alignment,  èP@X@ è@XAm× Allocate, Administrative, øP@X@ Allow, Administrator, hAÖÞ QK YÓ Alpha, Advance, ÐY®K A®Ë@ Alpha channel,   Advanced, ÐY®JÓ A®Ë@ èAJ¯ Alphanumeric, ' Affix, èY K@ P ø XY« ø Ym. .@ ALSA,      Agenda, èQ º® Ó éÓY®JÖÏ@ é JKñ’Ë@ ºJ JË é JK. Alter, Q  Agent,  ñ® Ó  JªK Alteration, Aggregate, QJª K ÉÒm.× Alternating, Aggregate type, úGðAJ K ÉÒm.× ¨ñK . Alternative, Aggregation,  ÉKYK © JÒm.' . Amount,  Aggregator,  éJÒ» ©Ò m.× Amper, Q Aging, ÐXA®K J.Ó@ AGP, Amplify,  Õæ j’ Agree, ‡¯@ñ Ó Amplitude, 骃 Agreement,  Analog, †A®K@ Q ¢  Airbrush,  Analogue computer,   é«AJ.“ X@XQÓ úÎKAÖß H. ñƒAg  Alarm, éJ.J Ó Analysis, É JÊm' Alarm clock, éJ.J Ó Anchor, ¡.QÓ Aleph, ­Ë@ Anchoring, ZAƒP@ Alert,  AND, P@YK@ , é JJ.K ð Alert box, Angle,  é JJ.JË@ P@ñk é Kð@P Algebraic data type, Q  Angle bracket,  ø .g. HAKA JK. ¨ñK èPñ‚ºÓ Animate,  Approximation algorithm,   ½ KQm' I. KQ®K é JÓPP@ñ k Arabisation, Animation,  ' éº KQm Arabization, Anisotropy, Arbitrary, Annotate,  ù®J» ‡J ʪK Arc,  Annotation,   €ñ¯ é JƒA g , ‡J ʪK Architecture,  Announce, éJK àC«@ . Archive, Announcement, ­JƒP @ àC«@ Archive site,  Anonymous, ù®JƒP @ ©¯ñÓ Õæ B@ Èñêm.× Archiving,  Answer mode,  鮃P @ éK.Ag. B @¡Öß Antialias, Area, 鮢J Ó Anti-aliasing,   Area grid,  á‚Ë@ éË@P@ ékA‚ÖÏ@ HA ªK.QÓ Antialiasing,   Arena,  á‚Ë@ éË@P@ éJ.Êg Antisymmetric, ÉKA ÒJÓB Argument, ù¢ªÓ Anti virus, Arity,  HA ƒðQ ¯ XA’ Ó é J.KP Antivirus, Arrange,   HA ƒðQ ¯ XA’Ó I.  KQK Antivirus software, Arrangement,    HA ƒðQ ®ÊËXA’Ó l×. AKQK. éJ. KQK Anytime algorithm,    Array,  é JJ¯ð B é JÓPP@ñ k é¯ñ®’Ó API,    HA ® JJ.¢JË@ ém.×QK. éêk. @ð Arrow, ÑîD Apostrophe,  A JÊ« éʓA¯ Arrowhead, ÑîD €@P Appear, Pñê£ Arrow key, ÑîD„Ë@ hAJ® Ó Append,  Article,   †AmÌ'@ éËA®Ó Artifact, Applet, i. Öß QK. Artificial intelligence, Application,   ú«AJ ¢“@ ZA¿X ‡J J.¢ Artificial neural network,    Application Launcher,    é J«AJ¢“@ é J.’« éºJ.ƒ ‡J J.¢JË@ɪ‚Ó Artwork, Applix, Ascender, Apply,   Y«A“ ‡J J.¢ Ascending,  Appointment, Y«ñÓ ø Y«A’ Ascending order,  Approval,  øY«A’ IKQ K P@Q¯@ . Ascii, Approve,  ú¾ƒ@ P@Q¯@ Aspect, Approved,  Qê¢ Ó é JÊ« †XA’Ó Approximate,  ú æ. KQ®K Aspect-oriented programming,   Audiographic teleconferencing, é ê k. ñ Ó é m.×QK. ùªÖÞ ¨AÒJk. @ ' QëA¢ÖÏAK. YªK. á« ù ¢ J¢m Aspect ratio,   Audit,   é J«AK. éJ.‚ ‡J ¯YK Authenticate, Assembler,  ©Ò m.× Authentication,   Assembly code,   †AJJƒ@ © JÒm.' èQ®ƒ Authentication ticket,     Assembly language,    †AJJƒ@ éÒJ‚¯ é Jª JÒm.' éª Ë Asserted, Authenticity, ém• Authentify, Assertion, Y J»ñK Author, Asset management,  ­Ëñ Ó HA¾ ÊJÒÖÏ@ Q  J‚ Assign, Authorization, l' Qå” Authorize, Assignment, XAJƒ@ Auto,  Assignment problem,   úÍ@ (ém.×QK.) á  JªK éËA‚Ó Autocompletion,    Assistant, Y«A‚Ó ù KA®ÊKÐAÖß@ Autoconfiguration,  Associative array,   úÍ@¡J“ é J¢.@QK é¯ñ®’Ó . Autodetect,  Associative memory,   úÍ@ ­‚» é J¢.@QK èQ»@X Asterisk, Autofill,  ú Í@ZÉÓ Asymmetric,  Autoloader,   × Q£ AJJÓB ú Í@ÉÒm Asymmetrical, Automata theory,     øQ£A J KB É Jª ‚Ë@ é JK@ YË@ HB B@ é KQ¢  Asymmetrical modulation,  Automated testing, úÍ@PAJ.Jk@ Asynchronous,   ú æÓ@QKB Automatic, úÍ@ Asynchronous logic,  úæ Ó@Q KB ‡¢J Ó Automatically,  A JË@ Atom,  èPX Automation,   úÍ@É Jª ‚ Atomic,  ø PX Automaton, úÍ@ɪ J‚Ó Atomicity,  Autotrace, úÍ@ ©JK At sign, @ éÓCªË@ . Auxiliary, ú¯A “@ Attach, †A ¯P@ Auxiliary storage, ú¯A “@ áK Q m ' Attachment, ‡¯Q Ó Availability, Q¯ñ K Attempt, éËðAm× Available,  Attribute,  Q¯ñJÓ é J“Ag Avatar, PAJ¯ @ Audio, ùªÖÞ Average, ¡ƒñJÓ Audiographic, ù¢J¢m ' ùªÖÞ Average seek time,    颃ñJÓ I m'. èYÓ Away, Backup rotation,    I. KA« ù £A JJk@ I. ¯AªK Away message,  Backup software,  H. A J« éËAƒP A JJk@ l×. AKQK. Axial, × Backward analysis, Ì ' ø Pñm ­Êm '@ úÍ@ É JÊm Axiom,  Backward chaining, é JîE YK. ­ÊmÌ'@ úÍ@ Y®“ Axiomatic semantics,   Backward compatibility,    é JîE YK. HA JËBX  H@P@Y “B @ ‡¯@ñ K Axiomatic set theory,   é®K.A‚Ë@ é JîE YJ.Ë@ HA «ñÒj. ÖÏ@ é KQ¢  Backward compatible, AJ® Êg ‡¯@ñ JÓ Axis, Pñm× Balance, à P@ñ K B Ban, Babbleprint,   Bandwidth,  é¯ñ¢JÓ éҒ. †A¢J Ë@ Q g Back, ¨ñk. P Banner, éJ¯B Backbone, XAÔ« Bar, ¡ Qå Backbone site, «  Bareword, ø XAÔ ©¯ñÓ Back door, Base, èY «A¯ , €Aƒ@ ÐA¢JÊË ø Qå ÉgYÓ Backend,  Baseband, úæ Aƒ@ †A ¢ ù ®Êg úæîDJÓ Back-end,   Base class, úæ Aƒ@ ­ J “ é J®Êg é KAîE Background,  Baseline, é J®Êg ú æ Aƒ@¡k Background directory, Base memory,   é JƒAƒ@ èQ»@X Background processing,   é J®ÊmÌ'@ ú¯ ém.Ì'AªÓ Basename, úæ Aƒ@ Õæ @ Back link, Batch,  Backlog, 骯X Batcher, HA ª¯X lÌ'AªÓ Backport, ú愺«ÉÔg . Batch file, HA ª¯ Y Ë@ ­Ê Ó Back-propagation, ù® Êg PA‚K@ Batching,  Back quote,   © J¯YK éÊKAÓA JÊ« éʓA¯ Batch processing, HA ª¯Y ËAK émÌ'AªÓ Backronym, AJ‚º« Q kñÓ Õæ @ . . . Battery,  Backside cache, é KPA¢. ù®Êg AJ.m× Baud, XñK Backslash, ú愺«ÉKA Ó¡k . Baud rate, XðAJË@ÈYªÓ Backspace, ­Ê jÊ Ë ¨@Q ¯ . Bay,   Backtick,   éjJ¯ éÊKAÓA JÊ« éʓA¯ Beam, Backtrace, Beamer,  Backtracking,  HAK. ù®Êg ©J.K Beam search,  ' Backup,      © JÓA«X Im . é J£A JJk@ éj‚ ,ù £A JJk@ q‚ ,ù £A JJk@ Beep, BIOS, Q ®“ Beeper,  Bipolar,   Q®’Ó I. ¢®Ë@ ù KAJK Bit,     Behavior, ¼ñʃ èPX, é JKAJK, éJK . Bell, Bit block transfer,     €Qk. IK. éÊJ»É®K Bell curve, Bit depth, I JË@ ‡Ô « ú æ Qk. úæjJÓ . Benchmark,  Bit gravity,   Z@XB@ €A J¯ IJ .Ë@ é JK.XAg. Best effort,  Bitmap,    (... éÓYg) Yêk. ɒ ¯@ é JKAJK é£PAg Beta,  Bitmap display,  AJ K. ù ¢®K Q« Beta abstraction,   Bitmap font,  AJ K. Y KQm.' ù ¢®K¡k Beta conversion,  Bit mask,   AJ K. É Kñm' IJ.Ë@ ¨AJ¯ Beta reduction,  Bit pattern,     AJ K. È@Qg@ é JKAJK éʂʂÓ Bit plane,   Beta testing, AJ K. PAJ.Jk@ é JKAJK i¢‚Ó Beta version,  Bit rate,  AJ K. P@Y“@ IJ.Ë@ÈYªÓ Bibliography, Bit slice,     ©k. @QÖÏ@ HA JKAJK ém' Qå BiDi, Bit string,  HA JKAJ K éʂʃ  Bidi, èAm'B@ éJKA J K Bitwise,  . ú æK. Bidirectional printing, èAm'B@ éJKA J K é«AJ£ Bitwise complement, . . Blacklist, Big-endian, QJºJ¯Q £ . Blank, Bijection,  ¨PA¯ ,¨@Q¯ ÉK.A®K Blend, Bilinear patch,     é JKAJK 骯P Blending, h. Q Ó Binary, ùKA J K Blink, ‘ JÓð Binary coded decimal,    A JKAJK QÓQÓ øQ儫 Blinking cursor, ‘.AK Qå ñÓ Binary exponential backoff,   Bloat, ù KAJK ú æ @ Xñ¯P Binary large object, •  Block,    Ñm ù KAJK áKA¿ éÊJ»,Q¢k , Y“ Binary package,   Block buffer, é JKAJ K éÓQ k Blocked, Binary search, ùKA J K I m' ¨ñJÜØ .  Binary tree,    Blocked record,     é JKAJ K èQm. éÊJºÓ éÊ Jj. ‚ Block-structured,   Bind, ¡.P ÉJ» é JK. ðX Binding, Block (unit), éÊJ» Binding handle,    AJ.KP@ ‘J.®Ó Block (verb), Y JÒm.' Binding-time analysis,   AJ.KPB@ I ¯ð É JÊm' Blog,   Bounce message,   éKðYÓ H. ñKð éËAƒP Blogosphere, Bound,   Bluetooth, Y J®Ó Boundary scan, Blur,  øXðYg i‚Ó hñ“ð ÐY« , (Õæ P) é JK.AJ.“ Boundary value analysis, Blu-ray, Bounded, ×  Blur image,   XðYm , èAJJÓ éÖßA« èPñ“ Boundedly complete, Board,  ékñË Bounding box,  é£Ag@ ©K.QÓ Body, á Ó Bound variable, Bogon filter, Box,  †ðYJ “ ,©K.QÓ Bold,  á m' Boxed comment,   Bolt, ©K.QÓ ‡J ʪK Bpp, Boo, Brace,  Book,  èQå•Ag H. AJ» Bracket, €ñ¯ Bookmark, éÓC« Bracket abstraction, €@ñ¯B@YKQm' Book mark, ©¯ñ Ó éÓC« . Braille, ÉK@QK Boolean, ù®¢J Ó . Branch, ¨Q¯ Boot, ¨C¯@ Branch coverage testing, ¨Q® JË@ éJ¢ª KPA JJk@ Boot block, ¨C¯@ éÊJ» . Branch delay slot, ¨Q® JË@ÉJêÖß éjJ¯ Boot image, ¨C¯@ èPñ “ Branch prediction,     Booting,  ¨Q®JË@ ©¯ñK ¨C¯@ Brand, Boot loader,   ¨C¯B@ÉÒm× Breadth-first search, Bð@ Q ªËAK. I jJ.Ë@ Bootloader,   × ¨C¯@ ÉÒm Break, Q儻 Bootrom,        (¡®¯ èZðQ®Ó ¨C¯@ èQ»@X) ¨C¯@ ­¯X Break point, Q儻 颮J ,«A¢®K@ 颮K Boot server,  ¨C¯@ ÐXAg Breakpoint, 骣A®ÖÏ@ 颮K Bootstrap,    QKñ JJ.ÒºË@É Jª‚ Y JêÖß ÐA¢ Break (program), ¨A¢®K@ Bootstrap loader,   ¨C¯@ ÉÒm× Break statement,   ¨A¢®K@ èPAJ.« Boot virus,  ¨C¯@ €ðQKA¯ Bricks, H. ñ£ Border, Yg Bridge, Qå„k. Bot,  úÍ@ Bridge (noun), Qå„k. Bottom, É®ƒ@ Bridge (verb), Bottom-unique, Qå„k. Briefcase,   éJ. J®k Bounce, YKQK Brightness, ¨ñ¢‚Ë@ Bus, ɯA K Broadband,    Bus arbitration,  ©ƒ@ð †A¢ ,©ƒ@ð ø XXQK †A¢ ɯ@ñJË@ Õºk Broadcast, Bus cycle,   I K. ɯ@ñK èPðX Broadcast quality video,    Bus device,  é J«@X@ èXñk. H@ X é JKQÓ É¯AK PA êk. Brochure,   Bus error,  éƒ@Q»,I.  J» ɯAK A¢k Broken, Business to business,   Pñ‚ºÓ,H. ñ¢ªÓ ÉÔ«ð ÉÔ« á K. èQk. AJÓ Broken line,  Bus master,  ¨ñ¢®Ó¡k ɯ@ñK  KP  Browse, i® ’ Bus mastering, ɯ@ñ K éƒAKP Browser, Bus network,      i®’JÓ é J¢k éºJ.ƒ , é KðQå„Ó éºJ.ƒ Brush,  Bus priority,   èAƒQ ¯ ɯ@ñK é KñËð@ Brute force,     Bus request,  é JƒA¯ èñ¯ ɯAKI. Ê£ Brute force attack,     Bus sizing,   é JƒA®Ë@ èñ®ËAK. Ðñj. ë ɯ@ñK Õæj. m' BTP, Bus watcher,   Bubble, ɯAJË@I. ¯@QÓ Busy, Èñª ‚Ó Buddy, IkA“ . Button, Buffer, PP à@ñ“ Buffered write-through, Button binding, P@PP @¡.P Buffering, Button grab, Buffer overflow, Buzz, à@ñ’ Ë@ àA¯ñ£ QK.QK.  Bypass,  Bug, éÊ« PðA m.' Bug fix, Byte, ø Q k , I KAK ÉÊg hC“@ . . Byte addressing,   Bug fix release, HA JKA Öß éKñ J « iÊ ’ÓP@Y“@  Bug tracking system,  Byte-code,     ÈCg éªK.AJÓÐA¢  é JKAÖß èQ®ƒ Byte-code compiler,     Q Build, ZAJ K. é JKAÖß èQ®ƒ Ñk. Ó Byte-code interpreter,      Built-in, á Ò’ Ó é JKAÖß èQ®ƒ ÈðñÓ Bullet,   Byte compiler,     Q é“A“P ,X@YªK é KQ» é JKAÖß èQ®ƒ Ñk. Ó Byte order,     Bulletin Board, €A ®K ékAƒ HA JKAÖß I.  KQK Bulletin board system, H@Qå „J Ë@ ékñËÐA¢  C Bullet list, C, Bundle, ú æ Bundled, Cable, ÉJ.» Burn, Cable modem, ÐXñÖÏ@ÉJ.» Cache, Camera, èQ ÓA¿

Cache block, ×   Cancel, AJ.m éÊJ» ZAªË@ Cache coherency,  AJ.m× ½ƒAÖß Candidate key, l  QÓ hAJ® Ó

Cache conflict, AJm × ú¯ PA ªK Canonical,  . ú GñKA¯ Cache consistency,  AJ.m× ½ƒAÖß Canonical name, éJÊ« ¬PA ªJÓ Õæ @

Cache controller,  Canonicity,   AJ.m× ÕºjJÓ é JKñ KA ¯ Cache hit,  AJ.m× éK.A“@ Canvas, (Õæ QË@) 骯P Cache lease, Capability,   èPY¯ Cache line, AJm × Q¢ƒ . Capacity, 骃 Cache memory, AJ.m× Caps,

Cache miss, Caption,  AJ.m× ZA¢k@ ékñË hQå Caching,   I ¯ñ Ó áK Q m' Capture, A®JË@ Caching-only,  ¡®¯ ZI. k Captured image, é¢ ®JÊÓ èPñ “ Caching server,   éJJ.m' ÐXAg ,ZI. k ÐXAg Card, é¯A ¢ CAD, . Card cage, HA ¯A ¢ ‘® ¯ Calculate, . HA‚k Cardinality, . úæ„ JKP Calculation, HA‚k . Cardinal number, úΓ@XY« Calculator, éJƒAg . Card slot, HA ¯A ¢ éjJ¯ Calendar,  . Õç' ñ®K Caret,   Calibration, éªJ.¯

Call, Carriage return, úÍ@ ©k. QÓ,Q¢‚Ë@ úÍ@ ¨ñk. P (¬Q m×)Q¢‚Ë@ Callback, (ÐA¢ ) Z@YK XP Carrier, ɯA K,É ÓAg Call-by-name, Õæ BAK Z@YK . Carrier scanner,  Call-by-need,  ÉÓ@ñk ém AÓ ék. AmÌ'AK. Z@YK Carrier signal, éÊÓAg èPA ƒ@ Call-by-reference, ©kQÖÏAK Z@YK . . Cartesian coordinates,     Call-by-value,   é JKPA¾ KX HA JK@Yg@ éÒ J®ËAK. Z@YK Cartesian product,  Call-by-value-result,     úGPA¾ KXZ@Yg. éÒ J®Ë@ éj. JJK. Z@YK Cartridge, Callee, øXAJÓ Cascade, úÍAJK Calling convention,  Z@YK †A®K@ Cascaded list,     ék. PY Ó éÖßA¯ Callout, Z@YK Cascading style sheet, Call-with-current-continuation,  Case,   éʓ@ñÖÏAK. Z@YK éËAg é JËAmÌ'@ Case based reasoning,   á Q  Central arbiter, éÊJÓB@ úΫ  .Ó º®K ù £ñJ J« ø Q»QÓ Õºk Case (font), Ì  Q Central office,  (¬Qm '@) éËAg ,(¬ðQk) .» ø Q»QÓI. JºÓ Case insensitive,   Central processing unit,    ¬ðQmÌ'@ Q.º K. QKAJÓ Q « é KQ »QÖÏ@ ém.Ì'AªÖÏ@ èYgð Case Sensitive,  Centum call second,    ¬QmÌ'@ éËAmÌ €A‚k ÈA’@ é JKA K éJÓ Case-sensitive,  Ì Q Cepstrum, Q ¬QkB@ éËAm  ÜØ Ðð ‚.ƒ Case sensitivity,   Certificate,  ¬ðQmÌ'@ Q.º K. QKAK èXAîD Case statement,   Certify, éËAg èPAJ.« XAîD @ Cast, Chad,   Casting, HAJ¯ Chad box,    Catalog,  HAJ¯ †ðYJ“ XQå„Ó ,h. ñËAJ» Chain,   Catch-all, Y J¯ , éʂʃ Catch-all-entry,  Change, Q  Ég@YÖÏ@ É¿ ‘ J.¯  JªK Categories,  Change management, Q   HA ® J’  JªJË@ èP@X@ Changeover,   Category, éJ ¯ Q  JªJÊËX@YªJƒ@ Catenet, Channel, èA J ¯

Cathode ray tube,   Channel service unit,     ø XñKA¿ H@Qk H. ñJ.K@ é KñJ¯ é JÓYg èYgð Cationic cocktail,  × Chaos,   ú Gñ JKA¿ ÈñÊm €@ñƒ Cause-effect graphing, ' Chapter, ú æ.J.‚Ó ú æ.J.ƒ ¡ J¢m ɒ¯ CC,    t AJ K (3) ; ém AJ Ó (2) ; é JKñ K.Q» éj‚ (1) Char, ¬Qm× CD, Character, ¬Q m× CDE panel,    úæ” Õºm' ékñË Character device, CD-ROM, ú¯Qm× PAêk.

Character encoding, ¬Q kB@ Q ÓQK Cell, éJÊg Character encoding scheme,  Cell encoding, ¬PAm× Q ÓQK¡¢m× A KCmÌ'@ Q ÓQK Character graphic, ú¯Q m× Õæ P Cellphone, øñÊg ­ KA ë Characteristic function, èQ ÜØ éË@X Cellular, øñÊg Character key,  Cellular automata,     ú¯Qm× hAJ®Ó é KñÊg é JË@ HC ª J‚Ó  Character map, ¬Q kB@ é¢Qk Cellular automaton, øñÊg úÍ@ɪ J‚Ó Character repertoire, ¬PA m× XQå„Ó Cellular multiprocessing, éKñÊg èXY ªJÓ émÌ'AªÓ . Character set,  Center, ¬Qk@ é«ñÒm.×  Centered, Character set identifier, ×  ¡ƒñ Ó ¬PAm Õ®£ ¬Q ªÓ Centimeter,  Character string, ×  QÒ JJƒ ¬PAm éʂʃ Char cell, ×  Chmod, ¬Qm é JÊg Charityware, Q × Choice, PAJJk@ ø g l. AKQK. Charmap, ¬PA m× é£PAg Choose, PA JJk@ Chooser, Charset,  ¬PAm× Õ®£ Chroma, Chart,  Chroma key, ú GA JK. Õæ P , é£A¢k Chase pointers, ¨A Kñj’’’ ®K Qå ñ Ó Chromatic number, . ú GñËXY« Chat, éƒXPX Chrome, Chatchup, Chrominance,  é JKA ÓðQºË@ Chat room,    Cipher,  éƒXPX é¯Q« èQ® Jƒ Chat script,   éKXA m× ñ¢m× Ciphertext, Q® ‚Ó ‘  Check, Y»AK , ‘m¯ Circle, èQ K@X Check (a button), Circuit, èP@X Check bit,  ‘j®Ë@ IK. Circuit switched, È@YKB@ ø PðX Check box,  . Q ƒAK †ðYJ “ Circuit switching,

Checkbox, Q    Circular buffer, × ƒAK éKAg ø PðX ¡®m Checkbox menu,      Circumflex,   Q ƒAK ©K.QÓ H@PA Jk éÖßA¯ éªJ.¯ Checkered, Citizen journalism, Checkout, I. m Class, ­ J “

Checkpoint, ‡®jJË@ 颮K Class hierarchy, ¬A J “@ éËCƒ Checksum, Ï    Classic,   ¨ñÒj. Ö @ ‡J ¯YK ø XA JJ«@ ,ø Y JÊ®K Child, Classical logic,   ø ñJK. ø Y JÊ®K ‡¢JÓ Child directory, Classification,  ø ñJK. É JËX ­J ’ Child process,   Classify,  é KñJK. é JÊÔ« ­J ’ Child record,    Class library,  é KñJK. éÊ Jj. ‚ ¬AJ “@ éJ.JºÓ Child status,   Class method,   é KñJK. éËAg é J®J “ é® KQ£ Child structure,   Classpath, é KñJ K. é JK. Child version,   Class variable, Q  é KñJ K. éj‚ ­J“ ªJÓ Child window, Clause, ú«Q¯ PA£@ YJK. Clean,  Chip, [HA ¯A ¯P] é¯A ¯P ­J ¢ ,­J ¢K Chip box, HA J¯ †ðY J “ Clear, ñm× Clear box testing, Chip set,  l'@Qå é«ñÒm.×  Click, Q®K Cluster file, Y‚k ­Ê Ó Click (noun), èQ ®K Clustering, Y‚k Click (verb), Q®K Cluster member, Y‚k ñ’ « Client, Cluster node,       É JÔ« Xñ®J « èY®«, éÊ J’k èY®« Client-server, Cluster-transport,  ÐðXAgð É JÔ« Y‚k É®K Coalesced sum, Client-server model, ÐXAgð É JÔ« h. XñÖß Coarse grain, Client-side,  á ‚k I k É JÒªË@ éêk. á Ó . Coax,  Clip art, é“A’¯ PñjÖÏ@YjJÓÉJ.» Coaxial, Clipart,    PñjÖÏ@YjJÓ é JJ ¯ é“A’¯ Coaxial cable, × Clipboard, é¢ ¯A g ø Pñm ɓñÓ Cocktail shaker sort, Clip board,    Cg PQ ¯ HA“A’¯ ékñË Code, Clip list, HA “A’¯ éÖß A¯ Codebase, èQ ® ƒ èY «A¯ Clip mask,    é“A’¯ ¨AJ¯ Codec, Clipping, PA ÓQÓ Clipping plane, Coded character set, Q ÓQ Ó ¬PA m× Õ®£ Code division multiplexing, Clock,  é«Aƒ Code folding, Clock rate,   é«Aƒ é«Qå Code management,   èQ®ƒ Q  J‚ Clock speed, éJKA ®JÖÏ@ é«Qå Code position, Q ÓP ©“ñ Ó Clone, pA‚ Jƒ@ ,q‚ J‚Ó Code (program), èQ ® ƒ Clone device, q‚ J‚Ó PA êk . Code segment, èQ ® ƒ 骢¯ Close, †C «@ Code (symbol), Q ÓP Closed set, é®ʪ Ó é«ñÒm× . Code violation, PA ÓQË@(Y«@ñ¯) †Q k Closed surface,   é®ÊªÓ ékA‚Ó Code walk,   èQ®ƒ éªk. @QÓ Closed term, ‡Ê ª ÓYg Codomain, Close routine,    †C«@ èQ Kð Coefficient, ÉÓAªÓ Closure,  †C«@ Cognitive architecture,   « Closure conversion, é J»@PX@ èPAÔ Collaboration, Cloud computing, àðA ªK Collapse, Clover key, É® K hAJ® Ó ù £ Collate, Clumsy, A £ ÐPP Collect,  Cluster, Xñ®J «, éʒk A®JË@ Collection,  Command line interface,  é«ñÒm.× QÓ@ðB@Q¢ƒ éêk. @ð

Collision, ÐXA’ Command-line interpreter, QÓ@ð@Q¢ƒ Èðñ Ó Collision detection,  Command line option, HA ÓXA’ ­‚» QÓ@ð@Q¢ƒ PA Jk

Colocation, ú¾J.ƒ É J“ñK Command line options, QÓ@ðB@Q¢ƒ H@PA Jk

Colon, àA J¢®K Command Prompt, QÓ@ð@ I m× Colophon,  Comma separated values,   áÖÏ@ XQk ɓ@ñ®K. éËñ’®Ó Õæ ¯ Color, Comment,  àñ Ë ‡J ʪK Color chooser,  Comment out,    à@ñË@ Q m× ‡J ʪK éË@P@

Color map, à@ñ ËB@¡¢m × Commercial a, YJ « éÓC« Colormap, Commit, à@ñË@¡¢m× ¨@Y K @ Color model, Common, à@ñË@ h. XñÖß ©KAƒ Color saturation,  Common carrier,  à@ñË@ ¨AJ.ƒ@ ø XA JJ«@ÉÓAg Colour, àñ Ë Common factor, ¼Q‚ÓÉÓA«

Colour depth, à@ñ Ë@ ‡Ô « Common properties, éÓA« ‘A ’k Colour look-up table, Communication,  à@ñËB@ á « I m'. ÈðYg. ɓ@ñK Colour model, Communication system,  à@ñË@ h. XñÖß ÈA’@ ÐA¢ Colour palette,  Compact,  à@ñË@ ékñË l×. YÓ Column, Compact disc,  XñÔ« l×. YÓ Q¯ Column span, Compaction, ¡ª “ Combination,  ' éª JÒm. Compactness preserving, ÐA’  ¡ ® k Combinator,     é J®¯@ñK éË@X Company, é»Qå„Ë@ Combinatory logic,    ù ®¯@ñK ‡¢JÓ Compare, éKPA ®Ó Combo box, ' XQå ð QK Qm ©K.QÓ Compatibility, ‡¯@ñ K Combobox, I. »QÓ ©K.QÓ Compatible, ‡¯@ñ JÓ Comma,  éʓA¯ Compilation,  ­K Qå” Command, QÓ@ Compile,  ­K Qå” Command button,  QÓ@PP Compiler, ¬Q å”Ó Command interpreter, QÓ@ð@ Èðñ Ó Compiler compiler,   Ñk. QÓÑk. QÓ Command key, QÓ@ hAJ®Ó Complement,   Commandline, éÊÒºK Complete, ÐAK Command line, QÓ@ðB@Q¢ƒ Complete graph,    Compression, éÊÓA¿ é¢ J¢m' ¡ª “ Complete inference system,  Computability theory,   ÉÓA¿ AJ.Jƒ@ ÐA¢ I.  ‚m' é KQ¢ Complete lattice, Computable,   I.  ‚jJÊËÉK.A¯ Complete metric space, ÉÓA¿ øQÓZA’ ¯ Computational complexity, Computational geometry, Completeness, ÈñÒ» Computational learning, Complete partial ordering, ÉÓA¿ ùK Q k IKQ K . . Computational molecular biology, A J kñ Ëñ J K Complete theory,    . . ÈñÒ» é KQ¢ é JK.ñƒAg é J KQ k. Complete unification, ÉÓA¿ Y JkñK Computational organochemistry, éKñ’ «ZAJÒJ»   Complexity, Y®ªK é JK.ñƒAg Compute, Complexity analysis,   HA‚k Y®ªKÉ JÊm' . Computer, Complexity class,   H. ñƒAg Y®ªK ­J“ Computer algebra system, Complexity measure,    Y®ªK €A J¯ Computer cluster,   úGñƒAg Xñ®J « Complex number, I»QÓXY« . . Computer cookie, HñƒAg øñÊg Complex programmable logic device, .      PA ê k. Computer ethics,   YJʂQÊË éÊK.A¯ Y®ªÓ ù®¢J Ó H. ñƒAg HA J¯Cg@ Computer-generated imagery,  Component, à ñºÓ Y Ëñ Ó QK ñ ’  H. ñƒAmÌ'AK. Component architecture, éJK ñºÓ èPA Ô« Computer language, HñƒAmÌ'@ éª Ë Component based development, á  . úΫ .Ó QK ñ¢ Computer law,  HA Kñ ºÖÏ@  H. ñƒAg àñKA¯ Component video, Computer literacy, H. ñƒAmÌ'AK. ÐAÖÏ @ Compose,  I. J»QK Computer network, Iƒ@ñk éºJƒ Composite, . . Computer program, Composite cable, H. ñƒAg l×. AKQK.

Composite drive, Computer security, QKñ JJ.ÒºË@ á Ó@ Composite video, Computer virus, Q ú G.ñƒAg €ð ¯ Composition,  I. J»QK Computer vision, úGñƒAg Qå” . . Compound command, I. »QÓQÓ@ Compute server, HA‚k ÐXAg . Compound key,   Computing,  I. »QÓ hAJ®Ó éJ.ƒñk Compress, ¡ª“ Computron, àñ K.ñƒAg Compressed, ñª ’Ó Concatenate, ÕË Compressed video,   é£ñª ’Ó é JKQÓ Concatenated key, ÐñÒÊÓ hAJ® Ó Compressibilty factor, Concentrator,  Aª’ B @ÉÓA« Q » QÓ Conceptualisation, éÒê® Ó Connection-oriented network service, é ÓY g      Concrete class,   ÈA’BAK. éêk. ñÓ é JºJ.ƒ èXYm× éJ¯ Connection pool, HBA ’@ ©Òm× Concrete syntax, øXAÓ ñm' . Connective,  Concurrency,  úÍA’@ ,¡.@P á Ó@Q K Connectors, Concurrent, Q   áÓ@ Ó,‡¯@QÓ Conservative evaluation, ¡ ¯A m× ÕæJ®K Concurrent processing,   邯AJ Ó ém.Ì'AªÓ Consistently complete, Condense, ­J JºK Console, Èñ‚ñ » Condensed, Q k. ñÓ,­JºÓ Consolidate, Õæ«YK,Y J£ñK Condition, Constant, I K.AK Condition out,   Qå © KQ®K Constant angular velocity, éJKAK éKð@P é«Qå Conduit, . øQm× Constant applicative form,   . I K.AK ù® JJ.¢ ɾƒ Cone, ðQm × Constant folding, I K.AK ù£ Confidence test,   é®KPAJJk@ Constant linear velocity,    . éJK.AK é J¢k é«Qå Confidential,  Constant mapping, ø Qå Configuration,  Constraint,   ¡ J.’ Q儯 ,Y J¯ Configuration item, ÉJº‚ Qå”J « Constraint functional programming,  ×    é m. QK. Configuration management, é KY J¯ é J® J£ð Configuration programming,   Constraint satisfaction,  É Jº‚ ém.×QK. Xñ J¯ ZA“P@ Configure, Constructed type, ¡J.“ ú æJ.Ó ¨ñK Confirm,  Constructive, Y J»AK ù KAJK. Confirmation, Constructive solid geometry,    Y J»AK é JKAJK. éJ.ʓ éƒYJë Conflation, Constructor, úGAK. Conflict,    ‘¯AJK,H. PA’ Consultant, PA‚‚Ó Congestion,  àA®Jk@ Contact, Ƀ@QÓ Conjunction,  à@Q¯@ Contact (noun), é¯Q ªÓ Connect,  ÈA’@ Contact (verb), ÈA’@ Connected graph,  Container,  ɒJÓ àA JJ.Ó é KðAg Connected subgraph,  Container class, ɒJÓ ú «Q¯ àA JJ.Ó ¨@ð ­J “ Connection,   ÈA’@ Content, øñJm× Connectionless protocol,   ÈA’@ àðYK. †A® JÓ Content addressable memory, øñJm× H@ X èQ »@X Connection-oriented,     ÈA’BAK. ék. ñÓ Y’®ÊËÉK.A¯ Content-based information retrieval, Controller,  I. m ÕºjJÓ øñJjÖÏ@ « á Ó HA ÓñÊªÓ úÎ . Control point, ÕºjJË@ 颮K Contention slot,   ¨PA JK éÊêÓ Control structure,   Õºm' é JK. Context, †A Jƒ Control unit, Õºm' èY gð Context clash,   †A Jƒ PAªK Conventional memory,   é JkC¢“@ èQ»@X Context-free, †A J‚Ë@ á «É®J‚Ó Converge, Y‚m' Context-free grammar,   †A J‚Ë@ á «É®J‚Ó ñm' Convergence,  XA‚k@ Context object, †A Jƒ á KA¿ Conversation, éKXA m× Context operator, †A Jƒ ÉÓA« Converse, (‡¢ J Ó) º«,ÉKñm' Context-sensitive,    †A J‚ËAK. QKAJÓ Conversion,  É Kñm' Context-sensitive menu,        èQKAJÓ H@PA Jk éÖßA¯ Conversion to iteration,  ' †A J‚ËAK. P@QºJË@ úÍ@ É Kñm Convert,  Context switch, †A Jƒ ÉKYJK É Kñm' .  Contextual menu,      Converting, É Kñm' é J¯A Jƒ H@PA Jk éÖßA¯ Convex hull, Continuation,      ÈA’@ ,(È@ðX ém.×QK.) éªK.AJÓ ,P@QÒJƒ@ Cooccurrence matrix, (éË@X) Cookie,  Continuation passing style,    麪» éªK.AJÓQ KQÖß H. ñʃ@ Cooperative, ú«AÔg Continue, P@QÒJƒ@ . Cooperative multitasking, úGðA ªJË@ÐAêÖÏ@XYªK Continuous, ɓ@ñJÓ,(¡k , éË@X) ɒJÓ ,QÒJ‚Ó Coordinate, ‡J ‚ K Continuous function, éʒJÓ éË@X Coordination language,    Continuous wave,   ‡J ‚K éªË éʒJÓ ék. ñÓ Coprocessor, Y«A‚Ó lÌ'AªÓ Contour, ¡Jm× . Coproduct,  Contraction,  úæKAg. hñJJÓ ‘ JÊ®K . . Copy, q‚ K Contract programmer, Y®« I m' l×QÓ . . Copy and paste,  Contrast,  ‡’Ë@ð q‚@ áK AJ.K Copying garbage collection, Contribution, éÒëA‚Ó Copyleft, Contributor, Copy left, Ñë A‚Ó © JÒj. ÊË q‚Ë@   Control, Õºm' Copy (noun), q‚ Control code,  Copy protection,   Õºm' QÓP q‚Ë@ á Ó é KAÔg ,q‚Ë@ é KAÔg Control file, Õºm' ­Ê Ó Copy right, Control flow, Copyright, †ñ ®mÌ'@ ñ ® m× ,Qå„J Ë@ †ñ ®k Copyrighted,   Ì × Crash dump,  †ñ®m '@ ñ®m ø PA JîE@ © KQ®K Copy (verb),  Crawler, éj‚ H. @X,­k@P CORBA, Create, AK.Pñ» ZA‚@ Core, Creation, I. Ë ZA‚@ Core class,   Credential,  é JJ£AK. éJ¯ XAÒJ«@ Core dump,  Credential cache,    á £AJ.Ë@ © KQ®K é KXAÒJ«@ é JK.Ag Core file, Credits, úæ£AK. ­ÊÓ H@XA ƒ@ Core gateway, Creeping featurism,  Q Core leak, H@ ÖÏ@ÈAîD @ Crisp,    Corner,  ­’ ®JÓ é Kð@P Critereon, Corollary, Corporate, Criteria, PA JªÓ Criteria range,  Corpus, Q  ºÓ HA®“@ñÖÏ@ÈAm.× Criterion, × Correct, iJ m• ½m Critical error, Correlation, ‡ËAªK h. Qk A¢k Critical section, Correspondence, ÐðC K h. Q k ZQk . Cron,  Correspondent, Õç'@ñ JÓ ,Õç'@ñ Ó é KPðYË@ Corrupt, Crop, A’J¯@ YƒA¯ Cross-assembler, Cos,  AJk. Cross compilation, Cost, é® Ê¿ Cross-compiler, Cost control callback, Cross-device link, Count,  Crossed,   X@YªK ©£A®K,I. ËA’ Cross-fade, Countable,   X@YªJÊËÉK.A¯ Crossfade, Counted, XðYªÓ Cross-fading,  Counting records,   Hñ®k YªË@ HC Jj. ‚ Crosshair, Country code, YÊJ.Ë@ Q ÓP Cross-over, Q Coupling, .ªÓ Coupon, Cross-platform, HA ’J ÖÏ@XYªJÓ Courseware, Cross-reference,  éËAg@ Covariance, Cruft, Cruft together, CPU, lÌ.'AªÓ Crack, Crumb, Crypt, Q  Crash, PA JîE@ ®‚ Cryptanalysis, éJÒªJË@ÉJÊm' Cyber-squatting, Cyborg, Cryptography, éJÒªJË@ ÕΫ Cycle,  Cryptology,   èPðX Q ®‚Ë@ ÕΫ Cyclebabble, CSS, ‘’ Cycle crunch, Ctrl, ÈQK Cycle drought, Cube,  Cycle of reincarnation,    I. ªºÓ t AJJË@ èPðX Cubing, Cycle server, Cumulative, Cyclic redundancy check,    ùÒ»@QK á « ø PðX ‡J ¯Y K CUPS, ZA¢k B@ Cyclic redundancy code, Curly bracket, Cyclomatic complexity, Current, úÍAg Cylinder, éK@ñ ¢ƒ@ Current directory, Ì ú ÍAm '@ É JËYË@ Current session,   é JËAmÌ'@ é‚Êm.Ì'@ D Current working,   Daemon, é KPAm.Ì'@ ÈAª ƒB@, é KPAm.Ì'@ ÈAÔ«B@ Curried function, Daisy chain,    é JJ.¯AªK éʂʃ Currying, Daisywheel printer,

Cursor, (èP A® Ë@) Qå ñ Ó Damage, PQå• Cursor keys,  Dangling pointer, úÍYÓ Qå ñ Ó Cursor plane,  Q ‡Ë ÖÏ@ i¢ƒ Dash, é£Qå Curve,  é JJ jJ Ó Dashboard, Custom, ‘’m× Data, HA KA JK. Customization,   ‘ J’m' Data abstraction, HA KA JJ.Ë@Y KQm.' Customize,  Data acquisition, HA J¢ªÓ(ÈA’jJƒ@) É J’m' Custom window,   éJkC¢“B@ èY¯AJ Ë@ Database,   HA KA JK. èY«A¯ Cut,  ‘¯ Database administrator,   HA J¢ªÓ èY«A¯ QK YÓ Cut and paste,   ‡’Ë@𠑯 Database analyst,   HA J¢ªÓ èY«A¯ ÉÊm× Cut buffer,   ‘®Ë@ à@ñ“ Database machine,     Cutover, HA J¢ªÓ èY«A¯ éJºÓ Database management system,   Cut-through switching, èY«A¯ Q K.YKÐA ¢  Cyber, HA J¢ªÖÏ@ Database manager,   Cyberbunny, HA KA JK. èY«A¯ QK YÓ Cybercafe, Database normalisation, Cybernetics,   Database query language,    ú ÍB@ ÕºjJË@ Y«@ñ¯ ÐCªJƒ@ éªË Cyberspace, HA KA JJ.Ë@ Database server,   Data packet,  HA J¢ªÓ èY«A¯ ÐXAg HA KA JK. éÓPP Data bus,  Data path, HA KA JJ.Ë@ɯAK HA KA JK. PA‚Ó Datacenter manager, Data processing,  HA KA JJ.Ë@ Q »QÓ QK YÓ HA KA JJ.Ë@ ém.Ì'AªÓ Data channel,   Data rate,  HA KA JJ.Ë@ èAJ ¯ HA KA JJ.Ë@É®KÈY ªÓ Data communications analyst, HC “@ñÓÉÊm× Data segment, HA KA JK 骢¯  . HA J¢ªÖÏ@ Data service,  HA KA JK. éÓYg Data compression,  HAKA JK. ¡ª“ Data service unit,    Data connection, HAKA JJ.Ë@ éÓYg èYgð Dataset, Data dictionary,   HAKA JK. €ñÓA¯ Data set,  HA KA JK. é«ñÒm.× Data dictionary file, HA KA JK €ñÓA¯ ­Ê Ó . Data set organization, HA KA JJË@ é«ñÒm× Õæ¢ J K Data driven,  . . HA KA JJ.Ë@ á Ó †A‚Ó Data striping, Data flow,    Data structure,  HAKA JJ.Ë@ ‡¯YK HA KA JJ.Ë@ é JK.  Dataflow, HA KA JK. ¬YK Data transfer bus, HA J¢ªÖÏ@É®K øQå„Ó  Data flow analysis,    Data transfer rate,   HAKA JK. ¬YKÉ JÊm' HA KA JJ.Ë@É®KÈ YªÓ Data flow diagram,     HAKA JJ.Ë@ ‡¯YK ¡m× Data type, HA KA JJ.Ë@ ¨ñK Data fork,    Datatype definition, HA J¢ªÓ ©‚ HA J¢ªÖÏ@ ¨ñK ­K QªK Data frame,    Data unit,  HA J¢ªÓ èY«A¯ PA£@ HA KA JK. èYgð Data glove,  HA KA JK. PA ®¯ Data warehouse, HA J¢ªÓ à Q m × Datagramt, Data warehousing,   HA J¢ªÖÏ@ àQ k Data hierarchy, HA KA JJË@ éJ ÓQë . Date, t' PAK Dataless client, HA J¢ªÖÏ@ á Ó úÍAg àñ KP . Datum, ù¢ªÓ Dataless management utility,    é JËAg Q K.YK 骮JÓ Daughter,  HA J¢ªÖÏ@ á Ó éÊ Jʃ Data link layer,  Daughterboard,   HA J¢ªÖÏ@ɓð é®J.£ éÊ Jʃ ékñË Daughtercard,   Data link level, HA J¢ªÖÏ@ɓð øñJ‚Ó éÊ Jʃ é¯A¢.  Day, Data logger, HA KA JK. Éj. ‚Ó Ðñ K Data logging, Day mode, ¡ÒJË@ ø PAîE Data mart,    Deactivate,  HA J¢ªÓ èY«A¯ †ñƒ É¢. Data mining,  Dead, HA KA JJ.Ë@ÈCª Jƒ@ I JÓ,É£A« Data model, Dead code, HA J¢ªÖÏ@ h. XñÖß Deadlock,   Data modeling,   †P AÓ, éÓP @ HA J¢ªÖÏ@ ék. YÖß Deadly embrace, Data modelling,  HA J¢ªÖÏ@ ék. YÖß Dealer, De facto standard,  Qj. JÓ ùª¯@ð PA JªÓ,úΪ¯ PA JªÓ Death code, Default, Deb, ùKYJ.Ó Default master, Debianize,  Default route, éJ  K.X Debug,   Defect, iJ ®JK I. J« Debugger,  Defect analysis,   i®J Ó ÉªË@É JÊm' Debugging, Defect density, ÉʪË@ é¯A J» Decay,  ÈðA ’ Deferral,  Dechunker, ZAg. P@ Define,  Decidability, Y KYm' ,­K QªK Decidable, Definite clause, Definite sentence, Decimal, øQå„« Definition,  Decimal point,  ­K QªK ø Q儫ɓA¯ Definitional constraint programming, Decision problem,    P@Q¯ éʾ‚Ó Deflate, ÒºJ Ó Decision support,  P@Q¯ Ñ«X Deflate compression, ÒºJ Ó¡ª “ Decision support database,   Ñ«X HA KA JK. èY«A¯ Deforestation,      P@Q®Ë@Ñ«X HA ÓñÊªÓ èY «A¯ ,P@Q®Ë@ éK.AªË@ éË@P@ , éK.AªË@ HAJJk. @ Defragment,    Decision theory,   éJ¢‚Ë@ éË@P@ P@Q®Ë@ é KQ¢  Defunct process,  Declaration, éJKC «,¨C K@ àA¯ Z@Qk. @ ,I JÓ Z@Qk. @ . Degree,  Declarative language,    ékPX é KQK Q®K éª Ë . Degrees,  Declare, àC «@ ,ZBX@ HAg. PX Degrees of freedom,   Decode, éKQmÌ'@ HAgPX Q ÓQK ½¯ . Deinstallation,    Decoder, I  J.JË@ ½¯ ,I  J.JË@ éË@P@ Deinterlace, Decompress, ¡ª“ ½¯ Dejagging, Decorative, ú¯Q k P Delay, Qg AK, éÊêÓ Decrease,    É JÊ®K, ­J ®m' ,‘ J®m' Delayed control-transfer, Delay instruction, Decrypt, éJÒªJË@ ½¯ Delay slot, Decryption,  Q ®‚ ½¯ Delegation, éKAJK, éJªK Dedicated line, QºÓ ¡k . . Delete, Deductive database,       ¬Yg é Jk. AJJƒ@ HA J¢ªÓ èY«A¯ Deletia, Deductive tableau,   ú k. AJJƒ@ hñË Deletion, ¬ Y g Deep,  ‡J Ô« Delimiter, Deep magic, Ym ×

Deliverable, ÕÎJ‚ Ó Derived class, é®J‚Ó éJ ¯ Delivery, Õæʂ Derived type, ‡J‚Ó ¨ñK Desaturate, Delta, È@X Descender, Delta conversion, ¡.Aë ,¬ñ‚m× Delta reduction, Descending, ú支A J K Demand,  IÊ¢ÖÏ@, èPðQå” Ë@ Descending sort,    . úÍPA JKI.  KQK Demand driven,   Descent function, èPðQå” ÊK. †A‚Ó Demand paged, èPðQå ” Ë@ új® “ Description, ­“ñ Ë@ Demand paging, Descriptor, ­“@ð Demo, Q« Deselect, ZA®JK@ÐY « Demodulate,    ÕæK QË@ ­‚» ,ÕæK QË@ ½¯ Design,  Õæ Ғ Demodulation,   Design pattern, Õæ KQË@ ­‚» Design recovery, Demo mode, újJ “ñ JË@ Q ªË@¡Öß Desk,  Demote,  IJºÓ, èY’ J Ó éJ.KQ Ë@ á Ó¡k . Desk check, Demo version,  úæJºÓ ‘m¯ újJ “ñ JË@ Q ªË@ èP@Y“@ . Deskside,   Denominator, Õæ A¯ I. JºÖÏ@I. KAg. , èY’JÖÏ@I. KAg. Denotational semantics, Desktop,  I. JºÓ i¢ƒ Deny, Desktop background,   ‘ ¯P I. JºÖÏ@ i¢ƒ é J®Êg Depeditate, Desktop database,     Dependability, I. JºÖÏ@ i¢ƒ HAKA JK. èY«A¯ Desktop environment,  Dependable software, I. JºÖÏ@ i¢ƒ ¡ Jm× Dependancy, Desktop manager, Dependence,  Desktop publisher,  Ï × AJ.KP@ , é JªJ.K I. JºÖ @ i¢ƒ PQm Dependency,  Desktop publishing,  Ï Q  é KXAÒJ«@ I. JºÖ @ i¢ƒ .« Qå„ Destination,  Deprecate, à@X @ Y’®Ó Destroy, Q  Deprecated, Pñj. êÓ ÓYK Destructor,  Deprecation,  ­ÊJÓ,Y JJ.Ó éK@X@ Detach, Depth, ‡Ô « ¨QK Depth-first search,  Detail,  Bð@ ‡ÒªËAK. I jJ.Ë@ É J“A®K Dereference, Detect, ­ ‚» Derivative, ‡J‚Ó Detection, ¬A ‚»@ Derived, ‡J‚Ó Detective, ­ ƒA¿ Deterministic, Deterministic automaton, Dictionary, €ñÓA¯ Devel, Difference, ¬C g ,†PA ¯ Develop, Pñ£ Difference equation, †PA ¯ éËXAªÓ Developement, QKñ¢ Differential, úΓA ® K Developer, Pñ ¢Ó Differential backup, úΓA ® K ù£AJJk@ q‚ Development,  QK ñ¢ Differential driver, Development environment,  QK ñ¢JË@¡ Jm× Differential line, úΓA ® K ¡k Diges, Device, PA êk. Device-dependent,  Digest,  èQ êj. JÊË ©“A g é“Cg Device driver, Digi-, Digit,  Device group, H@ Q êm' é«ñÒm× ,PA êk é«ñÒm× Õ¯P . . . .  Device-independent, Q   Digital, ùÔ¯P è êj. JË@ áÓ ú ÍC®Jƒ@ Device independent bitmap, Digital audio, ¯  ù Ô P Hñ“ Device name, Digital camera,         PAêm.Ì'@ Õæ @ é JÔ¯P QK ñ’ éË@, é JÔ¯P èQÒ» Device number,    PA êm.Ì'@ Õ¯P Digital carrier, ùÔ¯PɯA K ,ùÔ¯PÉÓAg Diacritic, Digital certificate,    é JÔ¯P èXAîD Diagonal,   ø Q¢¯ Digital computer, ùÔ¯PHñƒAg Diagonal line,  . ø Q¢¯ ¡k Digital dashboard, Diagram,  Digital electronics,    é£A¢k é JÔ¯P HA JKð QºË@ Dial,  ­Jë Digital envelope, ùÔ¯P ¬Q £ Dialer, Digital image,    é JÔ¯P èPñ“ Dialog, P@ñk Digitalize,  Dialog box, P@ñk ©K.QÓ Digital logic, éJ Ô¯QË@ ‡¢ J Ó Dialout Device, Digital service unit,     ÈAgXB @ PAêk. é JÔ¯QË@ éÓYmÌ'@ èYgð Dial-up, ù® KA ë IÊ£ Digital signature, ¯   . ù Ô P © J¯ñK Dialup,    Digital versatile disc,   ù ®KAë , é®KAêÓ ¨PAK. ùÔ¯P Q¯ Dial-up link,  Digitize, éJ Ô¯P Dial-up login,  ù ®Jë h. ñËð Digits, ÐA¯P@ Diameter,  Q¢¯ Dimension, €AJ¯ ,YªK Diamond, . €AÖÏ@ Dimensioning,  XAªK.B@ I  J.K ð@ ­K QªK Diamond key,   ú æ AÓ hAJ®Ó Dingbat, úæ JKQ K ¬Q m× Dictate, Q ® K Diode,  Discussion group,     ùKAJ KA Öޕ ¯AJ K é«ñÒm.× ,ÈXAm.' é«ñÒm.× Diplex, Disjoint union, × ' ' Directed acyclic graph, ɒ®ÖÏ@ ¨ñÊm XAm @ ,ɒ®JÓXAm @ Disk, Q¯ Directed graph, × ék. ñÓ ñ¢m Disk array,  Directed set,   @Q¯@ ­“P h. ñÓ èQÓP Disk controller,   Direct graphic,       Q®Ë@I. ¯@QÓ èQå AJ.Ó HAKA JK. , èQå AJ.Ó HA JÓñƒP Disk device group,     Q®Ë@ è@X@ é«ñÒm.× Direction, èAm.'@ Directional coupler, Disk drive, @Q¯@ ¼Qm× Disk duplexing,    Directive,  Q®Ë@ é JJ K ú æîD k. ñKQÓ@ Direct mapped cache,   Diskette,  ¡ J¢jJË@ èQå AJ.Ó é JK.Ag àQÓ Q¯ Direct memory,   Diskfull client, Q®Ë@Z Ó àñ KP èQå AJ.Ó èQ»@X ú Î . Diskless client,  Directory, ÉJËX øPA« àñK.P ,Q¯ àðYK. àñK.P Q®Ë@ á Ó Directory service,    Éj. ÖÏ@ éÓYg ,É JËYË@ éÓYg Diskless workstation, Directory stack,  Disk mirroring,    ÐñºK,YÊj. ÖÏ@ ÐA¿P ,É JËYË@ ÐA¿P Q®Ë@ é Kð@QÓ É JËYË@ Disk operating system,   Direct virtual, Q®Ë@ á ÓÉ Jª ‚ ÐA¢  Disk path,  Dirty,  Q¯ PA‚Ó Zø YK. ,t ð Disk striping, Disable,  É J¢ªK Disman, Disassemble,  ©Êg@ ,½¯ Dismiss, XAªK. @ ,ÈQ « Disassembly,  ©Êg ,½¯ Dispatch, XA® K @ Disc,  Q¯ Display, Q « Discard, YJ.K Display device, Disc drive, QªË@ PAêk. Display Manager, Disclaimer,  Display Report, é JËðñ‚ÓZCg@ Disconnect,   Display report,  ÈA’@ ©¢¯ QK Q®JË@ Q «@ Display standard, Disconnected, ¨ñ¢®Ó ,½¾® Ó ,¨ñÊm × Display terminal, Discrete, ©¢®JÓ,ɒ® J Ó Q« ¬@Q¢Ó Dissertation,  Discrete cosine transform, I jJ.Ó, ékðQ£@  Discrete Fourier transform, é KPñ ¯ @ é Ê Kñ m' Dissipation, XY JK   . 骢®JÖÏ@ Dissolve,  Discrete preorder, éK.@X@ Distance,   Discriminated union,    é¯A‚Ó,ɓA¯ ,†PA¯ ¡®JÓXAm' @ Distinct, Q Ø Discussion, P@ñk Ü Distort,   Documentor,  Z@ñJË@ , èñ‚ ‡K ñÓ Distribute, ¨Pð Dollar, PBðX Distributed, ¨Pñ Ó Do loop, P@QºJË@ é®Êg Distributed computing, Domain, †A ¢ Distributed database,    é«Pñ Ó HA KA JK èY«A¯ Domain address,  . É®mÌ'@ à@ñ J «,ÈAj. ÖÏ@ à@ñ J « Distributed file, ¨Pñ Ó ­ÊÓ Domain architecture,  ÈAj. ÖÏ@ èPAÔ« Distributed memory, é«Pñ Ó èQ »@X Domain calculus, Distributed system, Domain engineering,  ¨Pñ ÓÐA¢  ÈAj. ÖÏ@ éƒYJ ë Distributed systems,   Domain maturity, é«Pñ ÖÏ@ éÒ¢B@ ÈAj. ÖÏ@ i. ’ Domain model, Distribution,  éª KPñ K Domain name, Distribution list,   ÈAjÖÏ@ Õæ @ © KPñ JË@ éÖßA¯ . Domain selection, Distributive lattice, ÈAjÖÏ@PAJJk @  Q « ,ù ª KPñ K ½ K.A ƒ .  Domain-specific language,  ù ª KPñK XYm× ÈAm.× éªË Distributor,  Domain theory,  ¨PñÓ ÈAm.× é KQ¢  Dither,  ùÒëð É JÊ¢  Dot, 颮K

Dithering,   Dot address,     à@ñËB@ HAJ.K é J¢®K éKñ J « ,ù¢®K à@ñ J « Diverge, Dot file, ù¢®K ­Ê Ó Divergence, h@Q® K@ ,Y«AJK, †@Q ® K@ . . Dot matrix printer, A®J Ë@ é¯ñ ® ’Ó éªKA£ Divergent,  . úk@Q®K@ ,øY«AJ.K Dot notation,  . ù¢®K I KñJ K Divide, é҂¯ Dot pitch, 颮J Ë@ èñ ¢k Dividend, ÑîD„Ë@ l'P ,Ðñ‚®Ó  . Dotted, ¡®J Ó Division, é҂¯ Dotted quad, Division by zero,   Q®“ úΫ é҂¯ Double, ­«A ’ Ó Divisor,  Õæ A¯ Double click, àA KQ ®K

DMA, é KA.ÓA.K X Double-click, AgXðQ ÓQ®J K DNS, . Double density, ékðXQ Ó é¯A J» Docbook,     . ‡J KñJË@H. AJ» Double-duplex,  h. ðXQ Ó øñJJÓ Dock, ZAƒP@ Double-ended queue, ðX ­“ ,á JKAîE ðX PñKA£ Docking station,     . I. J»QK èY«A¯ á J KAîE Document,  Double-precision,  YJ‚Ó †YË@ h. ðXQ Ó Documentation,    Double quote,    ‡J KñK ék. ðXQ Ó €AJ.J¯@ éÓC« Doubly linked list,    Dual, á ¯Q¢Ë@ á Ó éËñ“ñÓ éÖßA¯ h. ðXQ Ó  Dual-attached, Down, BðQ K Dual boot,  Download, Q  h. XðQ ÓÉ Jª‚ É K K Downstream, Dual head, €@QË@ h. ðXQ Ó Downtime,  Dual-homed, ­J ¯ñJË@ á ÓP ÈQÖÏ@ úæ JÓ Down-time,   Dual-partition,    É Jª‚Ë@ ¬A® K @ á ÓP éÒ J‚®Ë@ ùKAJK Downward closed, Dual ported, Dpi,    Dual-stack,   é“ñJ.Ë@ ú ¯ 颮K éƒYºË@ h. ðXQÓ, éÓñºË@ h. ðXQÓ Draft, èXñ ‚Ó Dumb, èñJªÓ Drag, Dumb Terminal,  I. m èñJªÓ ¬@Q¢Ó Drag-and-drop, Dummy,   YÓAë ,úæ•@ Q¯@, é JÓX Drag and drop,   HC¯@ ð I. m Dump, hQ£ Dragging, I. kAƒ ,I. m Duplex, Drag-n-drop, h. ðXQÓ Drakconf, Duplicate..., ...pA‚ Jƒ@ Draw, Duplicate, PQºÓ Õæ P  Drawer, Duration, Ð@ðX , èY Ó Drawing, DVD, Õæ P Dword, Drawing Area,  Õæ QË@ 鮢J Ó Dyadic, Draw object(s), Dynamic, Drive,  ú»Qk @Q¯@ ¼Qm× Dynamic adaptive routing, Driver, Dynamically scoped, ­K QªK Drop, Dynamically typed,   Drop cable, A Jº JÓAJ KXH. ñJºÓ Dynamic analysis,  Dropdown, ú×AJ KXÉ JÊm' Dynamic binding, Drop-down arrow, È@Y‚@ ÑîD ,ÈY‚ ÓÑîD Dynamic database management system, ÐA¢  Drop-down list, È@Y‚@ ém' B, éËY‚ Ó ém' B     ú ×AJ KYË@ HAKA JJ.Ë@ èY«A¯ èP@X@ Drop-down menu, éËY‚ Ó éÖß A¯ Dynamic link, Droplet, Dynamic link library, Dynamic random access memory, Droplets, H@Q ¢¯ Dynamic routing,  Drop on the floor, ú ¾ JÓAJ KX é Jk. ñK Drugged, Dynamic scope, Druid, Dynamic scoping, Dry run,   Dynamic translation, éJÓAJ KXYJʂQ K ø PAJ.Jk@ É Jª‚ Dynamic typing,   Eighty-twenty rule,   é Jº JÓAJ KX éK.AJ» àðQå „ªKñ KA ÒJË@ èY«A¯

Eject, ¬ Y ¯@ E El(alpha), Eager evaluation, Electronic, Q Earliest deadline firs, ú Gð ºË@ Electronic commerce,    Earliest deadline first,   éJKð QºËB@ èPAjJË@ Bð@QºK.B@ ú支B@Y«ñÖÏ@ . Electronic data interchange,  Echo, HA KA J K. ÈXA J. K øY“ úGð QºË@ Echo cancellation, øY’Ë@ZAªË@ Electronic funds transfer, úGð QºË@ È@ñÓ@É®K E-commerce,     é JKðQºËB@ èPAj. JË@ Electronic funds transfer system,  E-ddress, É ® KÐA ¢  úGð QºËB@ È@ñÓB@ Edge,  é¯Ag Electronic magazine, éJKð QºË@ éÊm×  . Edit, ' Electronic mail,  QK Qm úGðQºË@Y KQK. Edition,   éªJ.£ ,QK Qm' Electronic mail address, Q ú Gð ºË@Y KQK. à@ñJ« Editor, PQ m× Electronic whiteboarding, Editor pane, Element, Qå”J « Editor panel, Ï  Elephant, PQjÖ @ ékñË É J¯ E-dress, Elevator controller, Edu,   Eliminate, ù Ò JʪK ,ø ñK.QK Education,  Elite,  é JK.QK ZAêk. ð ,àA J«@, éJ.m' Education contact,   Ellipse, ú¯ é Ê “ ,øñ K.QKÉ ƒ@Q Ó i. JÊë@ Q  Ï ø ñK. Ë@ ©JÒj. Ö @ Ellipsoid, újÊJÊë@ Edutainment,   . ø ñK.QK é J¯QK Em, Ð@ Effect, Q    KAK ,QKñÓ Email, Q Effective computable, ú Gð ºË@ Y KQK. E-Mail, Q Effective number of bits,  (úGð ºË@ )Y KQK. ÈAª®Ë@ IJ .Ë@XY« E-mail, úGð QºË@YKQK Effects, H@Q Kñ Ó . E-mail address, úGð QºË@ YKQK à@ñ J « Efficiency, é«Am' . . Email attachement,   Eigenvalue,      úGðQºË@Y KQK. ‡¯QÓ é JK@ X éÒ J¯ , é¯ñ®’ÖÏ (úG@X) Q ÜØ PYg. Embed, á Ғ  Eigenvector, úG@ X I Ó,Q ÜØ I Ó Embeddable,   Eigenvectort,   PAÒ¢CËÉK.A¯ ,QÒ¢ÊËÉK.A¯ Qj®J  K Q¢ @ Eight-bit clean, Embedded, á Ò ’ Ó Eight queens problem, Embedded system, PñÒ¢ÓÐA¢  Eight queens puzzle, Embedding, PAÒ¢@ ,QÒ£ Embosser, Engineering,  Y‚ m.× ,Õæ„ m.× ,P Q .Ó éƒYJë Emoticon, Q  Enhanced parallel port,  ø J.ªK ék. ð YJ‚Ó ø P@ñJÓ Y®JÓ Emphasis,  Enhancement, á ‚m' Empty, ¨PA¯ Enlarge, Q  Empty element tag, J.ºK Enlargement,   Emulate, Õæj’ ,pA®JK@ èA¿Am× Enqueue, Emulation,  × èA¿Am Enter, ÈñkX Emulator, ú»Am× Enterprise,  Y KYg. ¨ðQå„Ó(úΫÈAJ.¯@ ) Enable,  É Jª®K Entertainment,  Enabled, é J¯QK Entity, Enabling,  àA J» á ºÖß ,i‚¯ Entity-relationship diagram, Encapsulated Postscript, Entity-relationship model, ­Êª Ó I KQj’J‚« Encapsulation, Entries, ­J ʪ K HA KA g  Entropy, Enclosure, ­ ʪ Ó Entry,  Encode,  éÊgY Ó Q ÓQK, Q ÓQK Enumerated type,  Encoder,  XYªÓ ¨ñK Q ÓQK è@X@ Enumeration, Encoding, ZA’k@ ,X@YªK Q ÓQK Envelope, Encrypt,  ¬C«,¬Q£ é JÒªK Environment,  Encrypted, Q® ‚Ó éJ K. Encryption, Environment variable,  éJ K. Q ª JÓ End, ÐAJk Ephemeral, ùÖÞ ñÓ Endl, Ephemeral port, ùÖÞ ñÓ Y ® J Ó Endless, Episode, ù KAîE B ,ø YK.@ Endless loop,    Epoch,  é JëAJJÓB é®Êg H. A‚mÌ'@ ZYK. t' PAK Endnote, Epsilon, àñʂ. @ End of file,  ­ÊÓ éKAîE Equal, ÈX AªÓ ,ðA‚Ó Endpoint,    é KAîDË@ 颮K Equalizer, End tag, ÈX AªÓ Equation,  End-user, éËXAªÖÏ@ ùKA îEÐY jJ‚Ó Equational logic, Engage, Equipment, H@ YªÓ Engine, ¼Qm× Engineer, Equivalence class, éJ ¯A¾ Ó ­ J “ Equivalence class partitioning, Equivalence partitioning, Evolutionary algorithm,    é KPñ¢ é JÓPP@ñ k Equivalence relation, ñ ¯A¾ JË@ é¯C « Evolutionary computation, Evolutionary programming,    Equivalent, ú ¯ A¾Ó é KPñ¢ ém.×QK. Evolution strategy,      Era, á ÓP é KPñ¢ é Jm.'@Qƒ@ Exa-, Erase, i‚Ó Exabyte,  Ergonomic, I KAK.A‚»@ ÉÒªË@ HA JJ K. Exact, ÐAK Error, A¢k Error-based testing, Example, ÈAJÓ Exception,  Error correcting memory, A¢m Ì'@ éjj’Ó èQ »@X ZAJJƒ@ Exception handler, Error detection and correction,    ð ¬A ‚  »@ Exception handling, ZA¢k B@ iJ j’ Exceptions,  Error handling,  HA KAJ Jƒ@ A¢mÌ'@ ém.Ì'AªÓ Excercise,  Error indicator, A¢k Qå ñ Ó áK QÖß Excl, Error message, A¢k éËAƒP Exclamation mark, Ij ªJË@ éÓC« Error recovery, Ì  . . A¢m '@ YªK. iJ j’ Exclamation point,  É JÊîE éÓC« Escape, ñÊm Ì'@ Exclude, úæ J‚ Escape character, Ì × ñÊm '@ ¬Qm Exclusive OR,   Escape sequence, : éÒ¢ J Ó
Ë@ Escrow, Executable,  ø Y J®JK Esim, Executable content, øY J®J K øñJm× Essential complexity,   úæ Aƒ@Y J®ªK Executable file,  Eta abstraction, ø Y J®JK ­ÊÓ Execute,  Eta conversion, Y J®JK Eta expansion, Execution, Y J®J K Eta reduction, Executive,  E-tex, ø Y J®JK Exhaustive testing,    Ethernet, ÉÓAƒ PAJ.Jk@ ,‡ÒªÓPAJ.Jk@  Exist, Ethics, †C g B@ ÕΫ ,H@X@ , AJ’ @ ,Èñ“@ úk ,Xñk. ñÓ . . Existential quantifier, Evaluation,    Õç' ñ®K,á ÒJK,á Òm' Evaluation strategy, Existing, Xñk. ñÓ Evaluator, Exit, h. ðQk Event, HY g Expand, ©JƒñK Event-driven, Expanded, ©ƒñ Ó,YJÜØ ,†A ¢J Ë@ ©ƒ@ð Every,  É¿ Expanded memory, 骃ñÓ èQ »@X Expanded memory manager, Extensional equality, Expanded memory page frame, Extensionality, Extent, Expansion, © JƒñK External,  Expansion card,   éJkPAg 骃ñK é¯A¢. . External data,  Expansion slot,   éJkPAg HA KA JK © JƒñKI. ®ƒ . . External memory,   Expect,    éJkPAg èQ»@X ©¯ñK,I. ®KP@ . Extra, Expected location,    ú¯A“@ I. ®KQÖÏ@ ©¯ñÖÏ@,I. ®KQÖÏ@ àA¾ÖÏ@ Extract, Expert system, hQjJƒ@ Q J.k ÐA¢  . Extranet,  Expire,    I K@ Q‚»@ é JkC’Ë@ 钮K@ Eyedropper, Explicit parallelism, I ’JÓ ,€ñƒAg. Explicit state, E-zine, Explicit type conversion, àP@ Exploit,   èQªK F Facsimile,      Explore, ¨C¢Jƒ@ ɓB@ ‡J.£ éj‚ Fact,   Exponent, €@ éÓñÊªÓ ,©¯@ð Factor, Exponential, úæ @  Factorial, HðQå” Ó Exponential notation, éJ® KQ«@ éJ® JƒñÓ Pñ ÓP . Factor of proportion,  éÖß Y¯ I. ƒAJKÉÓAªÓ

Exponential-time,  Factory, ÉÒªÓ ,©J ’Ó ú æ @ áÓP Fade,  Exponential-time algorithm, á ÓQ Ë@ éJƒ@ÐPP@ñ k ÈðA ’  , úæ CK Fade in, Export,  QK Y’ Fade out, Exporting, PY’Ó Fail, ɂ¯ Expression, Q J.ªK Failback, Expression tree, Failfast, Expunge,  Failover,  I. ¢ƒ ɂ®Ë@ PðA m.'  Failover resource, Extend, Y KYÖß Extended, Failure, ɂ¯ Extended memory, 骃ñÓ èQ »@X Failure-directed testing, Extended memory manager, Failure fencing,  Extensible,   Fall back, Q  Ì Y KYÒJÊËÉK.A¯ ©k. @ Ë@ éËAg ú ¯ Ém '@ ,Zñj. ÊË@ Extensible database, Fallback, Q   Ì ©k. @ Ë@ éËAg ú ¯ Ém '@ ,Zñj. ÊË@ Extension,  Fallback procedure,  X@YJÓ@ ©k. @QË@ H@Z@Q k. @ Extensional, Fall forward, Fallout,  Fiber optics,   ¡®ƒ ¬A JËB@ HA KQå”. é JJ ®K ,ÐñÊ« Fall over, Fibre optics,    Fall through, ¬A JËB@ HA KQå”. é JJ®K ,ÐñÊ« Fall thru, Field, É®k

False, Field mouse, É®mÌ'@ èP A¯ Farkled, Field-programmable gate array, Field-replaceable, Farm, é«PQ Ó Fields,  Fast, © KQå Èñ®k Field separator,  Fatal, hXA¯ ,ÉKA ¯ Èñ®k ɓA¯ Fields involved,    Fatal error, hXA¯ A¢k é£PñJÖÏ@ Èñ®mÌ'@ Fatal exception, Fiery,  Fat binary, FIFO, Bð@ hPAg ,Bð@Ég@Y Ë@ Fat client, . Figure, ɾƒ Fault, ¡Ê« ,¨Y“ File, Fault-based testing, ­ÊÓ Fault monitor, File compression, ­Ê Ó¡ª “ Fault tolerance,  File control block,      A¢jÊË éK.Aj. JƒB@ HA®ÊÖÏAK. ÕºjJË@ èQ»@X éÊJ» Fault tolerant, File descriptor, ­Ê ÖÏ@ ­“@ð Fault tree analysis, File descriptor leak, ­Ê ÖÏ@ ­“@ð HQå„ Faulty, . ¡Ê« ,¨ðY’Ó File extension, ­Ê ÖÏ@ èX@Y JÓ@ Favorite,  I. jJÓ,ɒ®Ó File name, ­Ê Ó Õæ @ Fax,  »A¯ Filename, Feasible, ­ÊÓ Õæ @ Filename extension,  Feature,  ­ÊÓ Õæ @ X@YJÓ@ èQ Ó Feature creep, File permissions, ­Ê Ó àð X @ Feed,   Files,  Õæ ®ÊK HA®ÊÓ File server, Feedback, ¨AJ¢@ HA ®ÊÓÐXAg . Feedback control, File signature, ­Ê ÓZA’ Ó@ Feed-forward, File system, Feeper, HA ®ÊÖÏ@ÐA¢ Femto-, Filesystem, HA ® ÊÓÐA¢  Fence,  File transfer,  i. Jƒ ,‡KA« ­ÊÖÏ@É®K Fetch, File type, I. Êg. ­ÊÖÏ@ ¨ñK Fetch-execute cycle, File (verb), Fetchmail, Filing system, Fill, First-order logic,      ZÉÓ øð@ ‡¢JÓ,I.  KQË@ úÍð@ ‡¢JÓ ékPYË@ Fillcolor, ZCÓB@ àñ Ë . Fit,  Fill-out form, I. ƒAJK Filter,   Fit-to-window,    l QÓ èY¯AJÊË ù ®¯@ñK Filtering,   Fix, iJ ƒQ K, é J®’ hC“@ Filter promotion,    Fixed,         l QÖÏ@ é J¯QK iJ ʒJË@ IK.AK ,iJ j’JË@ IK.AK,I.JÓ Finalize,   Fixed disk,    ÈAÒ»@ ,ÐAÖß @ ,ÐAJJk@ I. JÓ Q¯ Financial, úÍAÓ Fixed Font, I K.AK¡ k Fixed point, Find, (úΫ) PñJ«, I m' . Fixed-point,    Fine grain,   éʓA®Ë@ IK.AK ‡J ¯X I. k Fixed point combinator, Fine-tune, é®J¯X é® Ë@ñÓ Fixed width, I K.AK Q « Finger, úΫɒm' Fixed-width, I K.AK Q « Finish, ÈAÒ»@ ,ÐAÖß@ ,ZAîE@ Fixed width font, Q ª Ë@ I K.AK¡ k Finite,  Fixpoint, ù ëAJJÓ Finite automata,   ùëAJ JÓ é»QmÌ'@ ùKA ®ÊK Flag, ÕΫ Finite differencing, Flamage, Finite state machine, Flame, Flame off, Firebottle, (éƒA ‚Ë@ ú¯ HA Kð QºËB@ ) lkAK èPðPA ¯ .. Flamewar, Firefighting,   PAJ Ë@ éÓðA®Ó Flaming, Firewall, Flap, ø PAKP@Yg. Firing,  Flapping router, †C£@ Firmware, Flash,  ‡K QK. Firmy, Flash disk, First class module, Flash memory,

First customer, ÈðB@ àñ K.Q Ë@ Flat, i¢‚Ó First generation computer, Ì Flat address space, ÈðB@É Jm. '@ H. ñƒAg Flat color, First generation language,  ÈðB@É Jm.Ì'@ éª Ë Flat file, First in first out,  Flatten, Bð@ h. PAg ,Bð@Ég@YË@ Flat thunk, First-in, first-out, Bð@ h. Qm' Bð@Ég@YË@ First normal form, Flavor, †@ Y Ó,Ѫ£ , éêºK First-order,    Flavorful,   ék. PYË@ úÍð@,I.  KQË@ úÍð@ †@YÒÊK. úæ ÊÓ, éêºJÊK. úæ ÊÓ Flip, Flip-flop, Follow-on bus, Follow-up, Float, Qk Floating head, Font, ¡k Floating point, Fontwork, ñ¢m Ì'@ ÉÒªÓ Floating-point, éÖß AªË@ éʓA® Ë@ Foo, Floating-point accelerator, Foobar, Floating-point arithmetic, Foogol, Floating point underflow, Footer, É J KYK Floating underflow, Foot-net, Float (verb), ñ®£ Footnote,   é JƒAg Flood, †Q « @ Footprint, For, Floor,  ‡K.A£ ,PðX Fora, Floppy, àQ Ó Force, èPY ®Ë@,ñ®Ë@ Floppy disk, àQ Ó Q¯  Forecast, ©¯ñ K Floppy disk drive,   × éKQÖÏ@ @Q¯B@ ¼Qm Foreground,     ékñÊË@ é JÓAÓ@ ,Q¢JÖÏ@ é JÓAÓ@ Floppy drive, àQ Ó Q¯ ɪ ‚Ó Foreign key, Floptical,  Fork,   ù Kñ“ àQÓ Q¯ ©‚ ,h. @Q®K@ Floss,   For loop, PA’Jk@ - PY’ÖÏ@ ékñJ®Ó èQmÌ'@ HA Jm.×Q.Ë@  Q PñJ®“ hQ“ áKð@ .K PX :Õæ B Form, ɾƒ , èPA ÒJƒ@ Flow,  àA KQk. ,‡¯X Formal argument, Formal methods, Flow analysis, ‡¯Y JË@ÉJÊm'

Flow chart,  × Formal parameter, úξƒ ¡‚ Ó àA KQk. ¡¢m Formal review, Flowchart, ‡¯Y JË@ éÖß A¯ Format, ‡‚  ,‡J ‚ K, éJ JîE Flow control, àA KQmÌ'@ éJ¯@Q Ó,‡¯Y Ë@ éJ¯@Q Ó . . . Format (noun), ×   Flower key,    (àQm ,­ÊÓ) éJ Jë ,(‘) ‡‚ (€ñ JJ» AÒÊK. Ag) èXPñË@ hAJ®Ó Formatted, Flow of control, Format (verb),     Flush, (àQ m× ,­ÊÓ) éJ JîE ,(‘) ‡J ‚K Fly page, Form factor, Flytrap, Form feed, Focus,  Formula,  èPñ K. éª J“ Focus group, Formulas, Fold, Forum, øYJJ Ó Fold case, Forward,  ÐAÓB@ úÍ@ Folder, YÊm.× Forward analysis, Forward chaining, Frame relay,   PA£B @É J®JK Forward compatibility, , J ® J ‚ ÖÏ@ ‡K A ¢ J Ë@ Frame set,    ú Î . . H@PA£@ Õ®£ úÎJ.®J‚ÖÏ@ÐAj. ‚B @ Frames per second,  é JKA JË@ ú¯ PA£@ Forward compatible, J®J‚Ó,‡¯@ñ JË@ J®J‚Ó úÎ. úÎ. Framework, ÐAj. ‚B@ ɾ Jë Forward delta, Framing specification, Forward engineering, Free, Qk Forwarding, Free disk space, Forwards compatibility, Free software,   Forwards compatible, èQk HA Jm.×QK. FOSS, Free space, é«PA ¯ ékA‚Ó Foundation,  Free variable,    邃ñ Ó , ƒAK ‡J Ê£ ù ªJÓ,Qk ù ªJÓ Four-colour glossies, Freeware, éJKA m× HA Jm×QK Four colour map theorem, . . . Freeze,  Four colour theorem, Y JÒm.' Frequency,    Fourier Analysis, Q ' QK@ñK ,XXQK  KPñ¯ É JÊm Frequency division multiple access, Fourth generation computer, É J m.Ì'@ H. ñ ƒA g Frequency division multiplexing, ©K@QË@ . Frequently asked question,   Fourth generation language,  éK.ñk. @ ð éÊJƒ@ ©K.@QË@É Jm.Ì'@ éªË Friction feed, Fourth normal form, Frobnicate, Fractal, Front-end, ø Pñ‚» Fractal compression, Frontend, ø Pñ‚» (Pñ“) ¡ª“ Fractal dimension, Front end,   øPñ‚»YªK. é JÓAÓ@ é KAîE Front-end processor,  Fraction, ÈA’CË¡ Jƒð lÌ.'AªÓ Q儻 Front side bus, Frag,   éÊJ¯ Frotzed, Fragile, I. ¢ªË@ © KQå Fry, Fragment, èQå „» FTP, ¨èX  Fudge factor, Fragmentation,   éKQ m.' Full, Frame, ÉÓA¿ PA£@ Full-custom, Framebuffer, Full-duplex, Frame buffer, PA£B @ à@ñ“ Full-duplex Switched Ethernet, Frame grabber,   H@PA£B @¡®JÊÓ Full-motion video, é»QmÌ'@ ÉÓA¿ ùKQ Ó Frame pointer, Full outer join, Frame rate, PA£B@ÈYªÓ Full pathname, ÉÓA¿ PA‚Ó Õæ @ Full screen,    Fuzzy translation,    éƒA‚Ë@ZÉÓ éÒîD.Ó éÔg. QK Fully associative cache, Fuzzy variable, Fully lazy lambda lifting, Function, G Functional, Gadget, ù ® J£ð Functional database,      Gallery, èY«A¯ , é JË@X HA KA JK. èY«A¯ QªÓ  Q  Game,  é JK@ ¯@ HAKA JK. éJ.ªË Functional dependency,     Game tree, XA J®K@ , é J® J£ð é JªK.AK ù® J£ð Gamma, AÓAg. Functionality,   é J® J£ñ Ë@ é KXAJË@ Gamma correction, Functional language,   Gamut, é J® J£ð éª Ë Gantt Chart,  Functional program, ù® J£ð l×AKQK IKAg. ¡¢m× . .  Functional programming,   Gap,  ¯   é J® J£ð ém.×QK. ¨@Q¯ , èñm. , èQªK Garbage,   Functional programming language, ém×QK éª Ë HC’¯ , é KA®K  . . Garbage collect, é J® J£ð  Garbage collection, Functional requirements, ÐðQ Ë, éJ® J£ð C¢JÓ  Gas, é J® J£ð PA « Functional specification,   Gas plasma display,   é J® J£ð 鮓@ñÓ é JÓPC K. Q « éƒA ƒ Functional testing,  Gate,  ù ® J£ð PAJ.Jk@ éK.@ñK. Functional unit,   Gated,  é J® J£ð èYgð éK.@ñK. Q.« PA Ó Function application,    Gateway,  é® J£ð ‡J J.¢ éK.@ñK. Function call,   Geek, é® J£ð ZA«YJƒ@ Function key,  General, úÍAÔg@ ,ÐA« é® J£ð hAJ®Ó . Generate,  Function (Mathematics), éË@X Y JËñK Generation,  Function (Programming), é® J£ð É Jk. ,Y JËñK  Functions (Programming), Generator, Y ËñÓ Functor, Generic, Fusion, ÐA« Generic identifier, Future date testing, Õæ Ô« ¬QªÓ Genericity,  Fuzzy, úGAJ“ ,ÑîDÓ é JÓñÔ« . . . Generic markup, Fuzzy computing,   é JK.AJ.“ éJ.ƒñk Generic Picker, Fuzzy logic,  úGAJ“ ‡¢J Ó Generic programming,   . . é‚ J k. ém.×QK. Fuzzy subset,   é’ ÓA« ú«Q¯ èQÓP Generic resource, Õæ Ô« XPñÓ Generic thunk, Golf ball printer, Gopher, Generic type variable, «   ¨ñJË@ Õæ Ô ù ªJÓ Gorilla arm, Genetic algorithm,   é JK@Pð é JÓPP@ñ k Gorp, Genetic programming file,   Go voice, úG@Pð ém.×QK. ­ÊÓ Genre, GPL, üªk. Geographical, Grab,  ú ¯@Qªk. ‘ J.¯ Geometric, Grab handle, ú æ YJë Geometry,  Gradient,  éƒYJ ë h. PY K Gesture,  Grain,  é»Qk I. J.m' Get, Èñ’k Grammar, Y«@ñ¯ Giga-, Grammar analysis, Gigabit, Grammatical inference, Gigabyte, Graph, I KAK.Aª J« àA JJ.Ó Gigaflop, Graph colouring, Glass, Graphic, ú×ñƒP Glass box testing,  Graphical, ú×ñƒP Glitch, éÊ« , éJKA ƒ . Graphical user interface, éJÓñƒP ÐYj J‚Ó éêk@ð Global, « . ú×ñÔ Graphics, Global device, HA JÓñƒP Global index, Graphics accelerator,  úGA JK. ¨Qå„Ó Graphics adapter, Global interface,  «   g  éÒ JÔ éêk. @ð , é JËAÔ . @ éêk. @ð Graphics adaptor, Globalisation, Graphics card,  Global resource, « HA JÓñƒP é¯A¢. ú ×ñÔ XPñÓ Graphic workstation, Global variable, «Q  ú ×ñÔ ªJÓ Graph plotter, Glue, †A ’Ë ,Z@Q«, © Öޕ Graph reduction, Glue language, Graph rewriting system, Gravel, Glyph,   é KQÓQË@ èPñ’Ë@ Gray, GNOME, ÐñJ Jk. Gray code, ø Qk. PAÓP GNU, ñJ k. Gray-scale, Go, ‡Ê ¢@ ,IëX@ Grayscale,  . ø XAÓP h. PYK Goal, Y’®Ó,¬Y ë Gray-scale image, Go gold, Greater, á ÓÑ¢ «@,á Ó Q.»@ Gold, I. ëYË@(àYªÓ) Greater or equal, ðA‚Ó ð@ á Ó Q.»@

Greater than, á Ó Q.»@ H Greatest common divisor,   Ñ¢ «B@ ¼Q‚ÖÏ@ Õæ A®Ë@ Hack, Greatest lower bound, ¼Aë Hacker, Q»Aë Greedy, èQå Hack value,   Greedy algorithm, ¼AêË@ éÒ J¯ Hair,  Green, Qå” k @ Y®ªÓ,‘ÓA« Green lightning, Hairy ball, Green monitor, Haiti, úæ KAë

Grey-scale, øXAÓQË@ PY JÓ Half-duplex, èAm'B@ øXAg@ Grick, . Half-Sphere, èQ » ­’  Grid,   éº J.ƒ Halftone,   Grok, é J®’ é«AJ.£ Gronked, Halfword, éÒÊ¿ ­’  Group,  Halt,   HA «ñÒm.× h. , é«ñÒm.× ¬A® K @ ,†C«@ Group attribute,   Halting problem,        é«ñÒm.× é®“ ­¯ñK éʾ‚Ó,¬A® K @ éʾ‚Ó Group identifier,  Handbook,  é«ñÒm.× QªÓ I.  J» Group object, Handheld, Y JËAK. ÈñÒm× Groupware, Handle, Growth,  Ñj’  ,ñÖß Handle (noun), ‘ J®Ó Grub, . Handler, Grunge, Èð @YÓ Gry, Handle (verb), ÉÓAªK Handout,   Gtk, ½Jk. H. ñJºÓ, éjJÓ Guaranteed scheduling, Handshake,    ÈA’B @ éÓA¯@ Guard, €PAg Handshaking,      ÈA’B @ éÓA¯@ ,ÈA’B @Y J»AK Guess, á ' Hang,  Òm ‡J ʪK Guest, Haptic,  ­J “ ÒÊËAK. ‡ÊªJÓ ,úæ„ÖÏ GUI,    Haptic interface,   é JÓñƒQË@ÐYjJ‚ÖÏ@ éêk. @ð é J‚ÖÏ éêk. @ð Guide, ÉJËX Hard code, Hard-coded, Guideline,   H@XAƒP@ Hard coding, Guru, ðPñ« Hard copy,    Gutter, é J¯Pð éj‚ Hard disk,  I K.AK Q¯ Hard disk drive,  I. ʓ Q¯ ¼Qm× Hard drive,  Heavy metal, I. ʓ Q¯ Heavyweight,  Hard limit, øñ¯ Yg à Pñ Ë@É J®K Hard link, Height,  ¨A®KP@ Hard link count, Hello packet, Hard linking,  I. ʓ ¡.P Hello World, ÕËAªËAK. Cë@ Hard return, Hello, world, ÕËAªË@AîE @,AJ.kQÓ Hard sector, Iʓ ¨A¢¯ . Help, èY «A‚Ó Hardware, XAJ« Henry, Hardware circular buffer, Here document, Hardware handshaking,    øXAJ«ÈA’@ Y J»AK Heterogeneous, A jJÓ Q« Hard wrap, . Heterogeneous network, é‚A jJÓ Q« éºJƒ Hash,  . . Y JJ.ÊK Heterogenous,  Hash bucket, Aj. JÓ Q « Heuristic,  Hash character, é J.‚» Hash coding, Heuristics testing,   Hash collision, é J.‚ºË@PAJ.Jk@ Hex, I ƒ Hash function,  '  éKQm. éË@X Hexadecimal, Hashing, øQå„« I ƒ Hexidecimal, Hash table, Hibernate, Hassle, HA Jƒ h. A«P@ . Hidden, Hatching,  úæ Jm× ,ù®m× á ¯QK . HD (Video), Hidden file, ù® m × ­Ê Ó Head, Hide, ZA®k@ Header,  Hidef, é‚ ðQK Header file,   Hierachy, é‚ ðQË@ ­ÊÓ ú×Që Headers,  Hierarchical, øQm. Heading,   à@ñJ« (2) é‚ ðQK (1) Hierarchical database,      Head normalisation theorem, é KQm. HAKA JK. èY«A¯ Hierarchical file system,  Headphone, øQm. HA ®ÊÓÐA¢ Headset, Hierarchical navigation,   øQm. i®’ Head-strict, Hierarchical routing,  Headword, ú ×Që é Jk. ñK Hierarchy,   Heap, èQm. Heartbeat,   High, ©® KQ Ó ,úÍA« I. ʯ é’J.K Heat sink,   High colour, èP@Qk é«ñËAK. à@ñËB@ ú ÍA« Heat slug, High definition,  Horizontal,  Y KYjJË@ ú ÍA« ù®¯@ High density,   Horizontal application,    é¯AJºË@ ú ÍA« ù®¯@ ‡J J.¢ Higher-order function,    Horizontal encoding,  éJ.KQ Ë@ é JËA« éË@X ù®¯@ Q ÓQK Higher-order macro, Horizontal line, ù®¯ @¡k Highest,   Horizontal loop combination, éÒ J¯ úΫ@,úΫB@ High-level language,   Horizontally,   øñJ‚ÖÏ@ é JËA« éª Ë A J®¯@ Horizontal microcode, Highlight, P@QK . @ Horizontal scan rate,  Highlighting,  ù®¯B@ i‚ÖÏ@ÈYªÓ P@QK . @ , éKAK. @ Horizontal tabulation,    High memory area,    éJ®¯@ éËðYg é JËA« èQ»@X 鮢J Ó . Host, High speed serial interface,     ­J ’Ó  é JËA« é Jʂʂ éêk. @ð é«Qå„Ë@ Host adaptor, ­J ’ Ó úæ  êÓ  Hill climbing, ÈCJË@ ɂ Host bus adapter,   ­J ’ÓɯAK ú ¾Ó Hindi,  Host computer, é KYJêË@ ­J ’ÓH. ñƒAg Histogram,   Host-host layer,  ø P@QºK h. PYÓ ,új J‚ úGA JK. Õæ P ­J ’Ò® J’Ó é®J.£ . History, t' PAK Host name, ­J ’ ÖÏ@ Õæ @ Hit, Hostname, ­J ’ Ó Õæ @ Hit rate,  éK.A“B@ ÈYªÓ Host number,  Hog, ­J ’ÖÏ@Õ¯P Host-resident,  Hold Down,    ­J’ÖÏ@ úΫ Õæ®Ó ‡J ʪJË@ ©ÓQ®K, ‡J ʪJË@ ©Ó¡ª “ Hot Key,    Hole,    hAJ®ÖÏ@ úΫ †A®K@ éjJ¯ ,I. ®K Hotlink, Home, ÈQ  Ó ákAƒ ¡.@P Home box, Hotlist, éªKA ƒ éÖß A¯ Hotplug, Home directory, ú æ„ JKP É JËX Hot-plugging, Home page, éK@YJË@ éj® “ . Hot spot, éËAª¯ 颮K Homepage,   é J‚ KP éj®“ Hot-swappable, Homogeneous, A jJÓ Hot swapping,  . ø Pñ¯ É J“ñK Homogeneous environment,   é‚Aj. JÓ éJ K. Hour, é«Aƒ Homogenous, Hourglass, Aj. JÓ Homomorphism, Housekeeping,   é KQ ’ m'Q K.@YK Hook,   á KðQË@ ú¯ é¯A“@ ©“ñÓ Hover, àA Óñk ,Ðñk Hop, Hover link, Hopping, Html, HTML,  Identifier,     ýGék é KñêË@ I.JÓ,QªÓ HTTP, ¨èék Identify, ¬ QªK Hub, ¨Pñ Ó Idle, á »Aƒ Hue,  Ignore,  àñÊË@ h. PYK ÉëAm.' Illegal, Humanist technology,    ¬YêË@ é JKA ‚@ é JJ ®K Illumination,   Humor, é¯@ Q £ QK ñJK, éKA“@ Hung, Illustration,  Q ‚®K ,iJ “ñ K ,Õæ P ,QK ñ’ Hybrid, Image,  á j. ë èPñ“ Hybrid multiprocessing, á  Image format,    , j. êË@ Z@Qk. B @XYªK èPñ’Ë@ éª J“ á j. êË@ ém.Ì'AªÖÏ@XYªK Image map, Hybrid testing,  Image processing,  á j. êÓPAJ.Jk@ Pñ’Ë@ ém.Ì'AªÓ Hyper, Image recognition, Hypercube,   Image sequence,    ‡KA¯ ©ºÓ Pñ“ I. ¯AªK ,Pñ“ ©K.AJK Hyperlink, Image stitching, Hypermedia, éJ¢@QK¡ A ƒð Imaging, . Immediately, Hyperspace, ù¢@QKZA ’ ¯ . Immediate version, Hypertext,  Ég. A«P@Y“@ ,øPñ¯ P@Y“@ ‡KA¯ ‘ Impact printer, Hyperware,   é®KA¯ HA Jm.×QK. Imperative language,   Hyphenate, é KPAJ.k. @ éªË Implement, Hyphenation, Implementation, Hyphens, ɓñË@ HA ÓC« Implicit parallelism,    è@P@ñ ÖÏ@, é J J ¯Y Ë@ è@P@ñ ÖÏ@ Hypotenuse,   QKð ú æҒ Ë@ Implicit type conversion,  • '  ,ú æÖÞ ¨ñKÉ Kñm I úæ Öޕ ¨ñK éËXAJ.Ó Iceland, @YJʂ @ Implies, Õæ• ,ÉÖ Þ ,øñ k Icon,   éKñ ®K@ Import, X@Q Jƒ@ Iconic interface,    é JKñ ® K@ éêk. @ð Imported, Importing, ID,  é Kñë Imports, Ide, éÊÓA¾JÓ QKñ¢ éJ K . Impossible, Iª’J‚Ó,ÉJj‚Ó IDE,    . éÊÓA¾JÓ QK ñ¢ éJ K. Imprecise probability, Ideal,  Inactive, ú ÍAJÓ ÉÓAg Identification,  Inactive window,   ­K QªK 颂 Q « èY¯AK In-band, Inbox,  Infect, XP@ñË@ †ðYJ “ øYª K Inference, Incantation,   èY KñªK Inference engine, Inch,  é“ñK. Inference rule, Include,  á Ғ  Infimum,  Ì Include file, Ñ¢«B@ úGXB@ Ym '@ Infinite, Include war, ù KAîEB Inclusive, Infinite loop,   é JKAîEB é®Êg Infinite set, Incoming, XP@ð Incomparable, Infinity,  ù ëAJKCË@ Incompatible,  Infix notation,  ‡¯@ñJÓ Q « úÎg@X I KñJ K Infix syntax, Increase,     Y«A’ ,Y K@QK ,¨A®KP@ ,PAJ»@ Inflate, Increment, ?YKQ Ó Info, HA ÓñÊªÓ Incremental,  øY K@QK Information, Incremental analysis, HA ÓñÊªÓ Incremental backup, Information highway,     麃 ,HAÓñʪÖÏ@ èXAg. Incremental constraint solver, HA ÓñʪÖÏ@ ‡K Q£ ,HA ÓñʪÖÏ@ Information overload, Incremental update,   ' ø Y K@QK I KYm Information superhighway, Indent, Infrared, QÔg@ I m' Indentation, ék@P@ Infrastructure,    Indented, é JJm' é JK. Inheritance, Indent style, ék@PB @Hñʃ@ . Inherited,  Independent,  HðPñÓ É®J‚Ó Inhertence, Index, €Qê¯ Initial,  Indexing, ùK@YK. ,ùK@YJK. @ Initialise, Indicate,  Initialization, YJêÖß Indicator, Qå ñ Ó,È@X Initialization file,  Indice, éJ JîE ­ÊÓ Initialize, Indirect address,  Qå AJ.Ó Q « à@ñJ« Initializing, Indirect addressing,   èQå AJ.Ó Q « éKñ J « Initials, Indirection, Initiate,  Initiator, Induction, I mÌ'@ Inductive inference, Init state,  Inductive relation, Injection, á ®k Infeasible path, Inkjet printer, Ink printer,  Instantiate, Q.g éªK.A£ Inline, Instantiation, Inline image, Instant messenger, øPñ¯ ÈAƒQÓ Inline template, Institution, Inner, Instruction,   Inner join, éÒ JʪK Instruction mnemonic, Inner product, Instruction pointer, Inode, Instruction prefetch, In-order traversal, Instruction scheduling,    Input,  HAÒ JʪJË@ éËðYg. ÉgX Instruction set, Input device, ÈAgX@ PA êk. Instruction set architecture, Input method,   ÈAgXB @ é® KQ£ Instrument, éË@ Input/output, Insufficient, h. @Qk@ ,ÈAgX@ Input side, Integer, iJ m• XY« Inquire,   ÈZA‚ ,Q.jJƒ@ Integral, l×YÓ In row, . Integrate, Inscription, l×. Y K Integrated, Insensitive version, Integrated circuit, Insert, h@PX@ . Integrated development environment, é J  K Inserted, . ÉgYÓ ,h. ñÓYÓ ÉÓA¾JÖÏ@ QK ñ¢JË@ Insertion point,   ÐAm¯B @ éÓC« Integration, l×. X Insertions, Integration testing, Insertion sort, Integrity, ÉÓA¾K Insert mode, ÈAgXB @¡Öß ,h. @PXB @¡Öß Integrity constrain, Inside, Intellectual property,   úæ£AK. ,Ég@X ,úG@ñk. é KQº®Ë@ é JºÊÖÏ@ Inside (centered), Intelligent backtracking, Inspect, Intelligent database,   ú»X HA J¢ªÓ èY«A¯ Inspection,     Intelligent key, Y®®K,ZA’®J ƒ@ Install,  Intelligent terminal, I  J.K ú»X ¬@Q¢Ó Installable file system, Intensional, Installation,  Intensity,   I  J.K èYƒ Installed user base, Interaction, Installer,  Interactive, I .JÓ úΫA®K Instance, Interactive development environment, Instance method, Interactivity,   Instance variable, é JÊ«A®K Intercept, Interpreter, Qå„ ®Ó Interchange File Format, Inter-process communication, Interconnect,  Interrupt, ɓð éºJ.ƒ Interest, Interrupt handler, Inter-exchange carrier, Interrupt list,

Interface,  Interrupt priority level,    éêk. @ð ¨A¢®KB @ é KñËð@ øñJ‚Ó Interface analysis, Interrupt request,  ¨A¢®KB@I. Ê£ Interface card, Intersect, Interference,  Intersection,   Ég@YK I. ËA’ ,©£A®K Interlace, Interupt, Interlaced, Interval, Interlaced image, Interworking, Interlacing, Intranet,   Interleave, IK@QK@ Intrusion detection system, Interleaving, Intuition, éë@YK Intermediate, ¡ƒñ JÓ . Intuitionism,  Intermercial, é JƒYg Intuitionistic logic,  Internal, éJJ £AK , éJÊg@X úæîE YK. ‡¢J Ó . Intuitionistic probability, Internal bug, úÎg@X IJ« . Intuitive, Internal error, úæ Yg úÎg@X A¢k Invalid, Internal field separator, Invariant, Internal frame, g@X PA£@ ú Î Inverse, º« International, úÍð X Inverse comment convention, Internationalisation, Invert, º« Internationalization, É KðYK Inverted index, Internet,  Q Invert Selection,   IK K@ PA JJkB @I. ʯ Internet address, I K QKB @ à@ñ J « Invisible,  ù ®k Internet number,   I KQK@ Õ¯P Invoke, ZA«YJƒ@ Internetworking, Involved,  Interoperability, PñJÓ I/O subsystem, Interoperable database, ú«Q¯ h. @Qk@ ,ÈAgX@ ÐA¢ Inter-packet gap, IP Address, © K@ à@ñ J « Interpolation, IRC, Interpret, Irrational number, Interpreted, ® Ó Irrefutable, Isochronous, Isochronous transfer, Jump table, Jump trace buffer, Isolated, XQ® J Ó,ÈQ ªJ Ó Isometric joystick, Junction,  éÊ J“ñK Isometry, Junk, Q  ¯ Isomorphic, I. J»@Q»,ÐAë «, éÓAÔ Junk mail, Isomorphism, Isomorphism class, Justification, è@ XA m× Justified, Italic, ÉKA Ó øXAm× Justify,   Item, Qå”J « é Kñ‚ Just-in-time,     Iteration, P@QºK I¯ñË@ ú ¯ AÓAÖß Iterative deepening, Iterator, K Kamikaze packet,   é KPAjJK@ éÓQ k J Kangaroo code,   é KQª J » èQ®ƒ Jag, KDE, ø Y J» Jam, €YºK,ÐA gP KDM, Jaz Drive, ékñJ® Ó é¯@ñ ‚Ë@ Keep, ¼QK Jewel case, Kernal,   I. ÊË@, è@ñJË@ Jitter,    ék. Qk. P,€AªKP@ Kernel, è@ñ K Job, ɪ ƒ Kernel panic, Q«X ,¨A JKP@ Job control,    éÒêÖÏ@ éJ¯@QÓ Kerning, . (¬QkB@) ­J ËAK Job number, éÒêÖÏ@Õ¯P Key, Key agreement, Join, ÐAҒ @ Keybind,   Joint, ’® Ó hAJ®ÖÏ@ AJ.KP@ ú Î Journal,  Key binding,  Ï  é JÓñ JË@ hAJ®Ö @ AJ.KP@ Journaling file system, Keyboard,  iJ KA ®Ó ékñË Joypad, Keyboard focus, ékñË Q »QK ,iJKA ® ÖÏ@ ékñË èP ñ K  . Joy stick, H. AªËB@A’« iJ KA®ÖÏ@ Joystick, Key (Button), H. AªËB@A’« PP JPEG,    Key-encrypting,    èPñ“ éJ JîE i. Jªk iJ KA®ÖÏAK. Q ®‚Ë@ Jukebox, Key escrow, hAJ® ÖÏ@ á Ößñ Ó Jump,   PðA m.' ,Q ®¯ Key field, hAJ® ÖÏ@É®k Jumper,  PA ®¯ , A¢ Key frame, úæ„JKQ Ë@PA£B@ ,úæ AƒB@PA£B@ Jumpstart, Key (Lock), hAJ® Ó Keymap control,    hAJ®Ó é¢ Qk Õºm' L Keypal,   éʃ@QÓ ‡KY“ Label,  é® J’Ë Key stroke, PP 颪 “ Label edge router, Label switched path, Keystroke, PP 颪 “ Label switching,    Key word, éJƒAƒ@ éÒÊ¿ HAª¯QË@É KYJ.K

Keyword,   Lag,  é JkAJ®Ó éÒÊ¿ ñ£AJ.K Keyword in context,     Lambda, @YÓB †A J‚Ë@ ú¯ é JkAJ®Ó éÒÊ¿ Lambda abstraction, Keywords,   é JkAJ®Ó HA ÒÊ¿ Lambda-calculus, Khaledali, Lambda expression, Kiboze, Lambda lifting, Kill, ÉJ¯ Lamp-post error, Kill app,  Landscape, l×. AKQK. ÉJ¯ úæ•Q« Killer poke, Language, éª Ë Kilo-, Language-based editor,  Ê J» éª ÊË@ úΫ úæ J.ÓPQm× Kilobaud, XñK.ñÊ J» Language-sensitive editor, éª ÊÊË €A‚k PQm× Kilobit, I KñÊJ» Laptop, . ÈñÒm× H. ñƒAg Kilobits per second,  éJKA JË@ ú¯ I KñÊJ» Laptop computer, . ÈñÒm× H. ñƒAg Kilobyte, I KAK.ñÊ J» Larges, Kiloflops,     Laser, é JKA JË@ ú¯ éÖßA« 颮K ñÊ J» PQ Ë Kilometer,  Laser printer,  QÓñÊ J» PQ Ë éªK.A£  Last call optimisation, Kiosk, É£ ,pñ» Kit, Last-in first-out,   Bð@ h. PAg ,@Qk@Ég@YË@ Latch, Knapsack problem,    éJ. J®mÌ'@ ú¯ éʾ‚Ó Latency, Knowbot,   Èñ“ñË@ á ÓP é¯QªÓ HñK. Latex, Know-how,    èQ.g , é K@PX LaTeX, Knowledge,  Lattice,  é¯QªÓ  Q«, éº J.ƒ Knowledge base,   Launch, ¬PAªÓ èY«A¯ Y J®J K Knowledge-based system,  Launcher,   é¯QªÖÏ@ úΫ úæJ.ÓÐA¢ ‡Ê ¢Ó Knowledge level, é¯Q ªÖÏ@ øñJ‚Ó Launch icon, Knowledge representation,   Lavender, é¯QªÖÏ@É JJÖß ú×@QmÌ'@ Law, àñ KA ¯ Layer,  Legend,  é®J.£ èPñ¢ƒ@,HA jÊ¢’ÓÉ JËX Lemma, Layout,  ¡ J¢m' Length, Laziness, Èñ£ ɂ» Lenient evaluation, Lazy evaluation, Èñ‚» ÕæJ®K Less, ɯ@ Lazy list, éËñ‚» éÖß A¯ Less than, á Óɯ@ Leader, YK@P Let floating,

Leading,  Letter,  ø XA J¯ ,ú æ„ JKP ,ú Íð@ éËAƒP Leaf,  é¯Pð Level, øñJ‚Ó Leak,  Level one cache,    I. KQå„ ðB@ øñJ‚ÖÏ@ á Ó (lÌ.'AªÓ) é JK.Ag Leaky heap, Level-sensitive scan design, Leap second, Level two cache,    úGAJË@ øñJ‚ÖÏ@ á Ó (lÌ.'AªÓ) é JK.Ag Leased line, Qk. ñ Ó¡k Lexeme, Least fixed point, Lexer, see lexical analyser Least recently used, Lexical analyser, × Least significant bit, ø ñªËÉÊm  Least upper bound, Lexical analysis, øñª ÓÉ JÊm' Lee, Lexical scope, Lexical scoping, Left, PA‚  Lexicon, Left arrow, Ñj. ªÓ ø PA‚  ÑîD Liar paradox, Left brace,   é KPA‚  èQå•Ag Libraries,   Left bracket,  HAJ.JºÓ (ø)PA‚  €ñ¯ Library,   Left-handed, éJ.JºÓ Library routines,  Left join, é J.JºÓ © J“ Left-justify,  License, PA‚ ÊË è@XAm× ‘ JkQ K Left outer joint, License agreement, Q    Left outside, ‘ Jk Ë@ é J¯A®K@ Liechtenstein, Left parenthesis, øPA‚  ÈCë Life,  Legacy, èA Jk Life-cycle,   èA Jk èPðX Legacy code, úG@Q K èQ ® ƒ Life science, ZAJkB@ ÕΫ Legacy software, éJK@Q K l×@QK . . LIFO,   Legacy system, Bð@ h. PAg ,@Qk@Ég@YË@ Lifted domain, Legal, úGñ KA ¯ ¨ñ¯QÓÈAm.× Ligature, Legalese,    HA JKñ KA ¯ ,HA J¯ñ®k Light, PñK Light client, Line pattern, ­J ®k É JÔ« Light pen,  Line printer,  ­J ®k Õί ñ¢k éªK.A£ Light pipe, Line probing, Lines per minute,   Light precipitation, Èñêm× Èñ¢ë é® J¯YË@ ú¯ Pñ¢ƒ . Line starve, Lightweight, àPñ Ë@ ­J ®k Linewrap, Light-weight process, à Pñ Ë@ é® J® k éJÊÔ« Link, ¡.@P Like, ÉJÓ Linkage editor, HC J“ñJË@PQm× Like this,  @Yë ÉJÓ Linked to, úÍ@ ɓñÓ Lilo, ºJ JËÉÒm× Linker, Limes, ɓñÓ Linking,  Limit, É J“ñK Yg Link loader, Limits, Link rot, éJ ® « éʓð Line, Q¢ƒ Links, HC “ð Linear, éJ¢k Linux, Linear address space, ºJ JË Linear argument,  Liquid crystal display, ÉJË@ÉKA ƒ @Q ªÓ Linear assignment, . List, ém' B Linear function,   é J¢k éË@X Listbox, Line arguments, List comprehension, Linear logic,  ù¢k ‡¢JÓ Listing, Q « Linear map,   Listless,   é J¢k é¢ Qk éÖßA¯ àðY K. Linear programming,   Lists, é J¢k ém.×QK. Linear space, Lite, ­J ®k Linear transfer, ù¢k É®K Literal, ù ¢®Ë ,ú ¯Qk Linear transformation, ' Literate programming, ù ¢k É Kñm Literature, Linear type, ù¢k ¨ñK HA ®Ëñ ÖÏ@ Little-endian, Line buffering,   ¡mÌ'@ áK ñ’ ,Q¢‚Ë@ áK ñ’ Line conditioning, Live CD,  ú k Q¯ Line discipline, Load,   É JÒm' ,ÉÔg Line editor, × Loadable,   ù ¢k ‘ PQm É JÒjJÊËÉK.A¯ Line feed,  Loadable kernel,   Q¢ƒ Y KðQK É JÒjJÊËÉK.A¯ è@ñK Linen, Load-balancing, Line of code,   Load balancing,    èQ®‚Ë@ áÓQ¢ƒ É JÒjJË@ éKP@ñ Ó,ÉÒm Ì'@ éKP@ñ Ó Local,  m× Logical, ù®¢J Ó ú Î Local area network,    Logical address,  é JÊm× é®¢J Ó éºJ.ƒ ù®¢J Ó à@ñ J « Logical complement, Local bus,   é JÊm× éʯAg Logical disk,   Local data sources,  ù®¢J Ó Q¯ é JÊm× HA KA JK. PXA’Ó  Logical-hostname,  Local disk, úÎm× Q¯ ù ®¢JÓ ­J ’Ó Õæ @ Logical network,    Locale,  éJ®¢J Ó éºJƒ é JÊm× .  Logical relation,    Local echo, úÎm× øY“ é J®¢JÓ é¯C« Local exchange carrier, Logical shift,  ù®¢J Ó Q  Jª K Local file, m× ­Ê Ó Logical shift left, øPA‚ ù®¢J Ó QJª K ú Î Local host, m× ­J ’ Ó Logical shift right, úæ JÖß ù®¢J Ó QJª K ú Î Localhost, Logic emulator,  úÎm× ­J ’ Ó ù®¢J Ó ú»Am× Localisation, Logic gate,    Localised, é J®¢JÓ éK.@ñK. Logic programming,    Locality, é J®¢J Ó ém.×QK. Logic variable,   Q  Localization, á £ñK é J®¢JÓ è  JªJÓ Localize, Login, h. ñËð Local loop,   Log in, é JÊm× é®Êg Local loopback addresses, Login banner, Locals, Login directory, h. ñËñË@É JËX Local variable,  m× ù ª JÓ Login name, ú Î h. ñËñË@ Õæ @ Location,  ©¯ñÓ Login prompt, h. ñËñË@ I m× Locator,  Login shell,  ©¯@ñÖÏ@XYm× h. ñËð é¯Y“ Lock,  É®¯ Logo, PAªƒ Locked,  Log off, áÓñÓ Logon, Locked file,  Èñ®®Ó ­ÊÓ Logout, Locked up, h. ðQk Lock-in, Log out, Longitudinal parity, Locking, †C «@ ,ÈA® ¯@ Look, Q¢ J Ó Log, Ém. Lookahead, Logarithm, Õç'PA «ñË Look and feel, Logarithmus dualist, €A‚kB@ ð Q¢JÖÏ@ Lookup,  ' Log file, Im . Éj. ‚Ë@ ­ÊÓ Look-up table, Logic, ‡¢ J Ó Loop,   PQº K , é®Êg ,P@QºJK. Y®J K M Loopback,  ¨AgQƒ@ Machine,   . H. ñƒAg , éË@ Loopback file,  Loop combination, Machine address, éË@ à@ñ J «  Loop fusion, Machine code, éËB@ éª Ë Loop through, Machine-collating, Loose bytes,   麺®Ó HA J KAK. Machine cycle, éËB@ èPðX  Loss, ¨A J“ Machine language, éËB@ éª Ë Lossless,    (è)Xñ®¯ Q « Machine learning, éËB@ ÕΪK Macro, Lossless audio compression, àðY K. Hñ ’Ë@¡ª “  Macroblock,  èPA‚k Q J.»I. ËA¯ Lossless compression,  Xñ®¯ Q «¡ª“ Macrology, ðQ»AÖÏ@ ÕΫ Lossy,  Xñ®¯ Macro processor, QJ» lÌ'AªÓ Lossy audio compression, . . Macros, ðQ»AÓ Lossy compression, Xñ®¯ ¡ª “  Magazine, éÊm× Love, . I. k Magenta, úG@ñk. P@ Low, ‘ ® j J Ó Magic, øQm Low-bandwidth,  ‘®jJÓ ék. ñÓ Èñ£ Magic bullet,   é KQm é“A“P Low earth orbit, (¨A® KPB @) ‘ ® j J Ó úæ•P @P@YÓ Magic number, øQj‚Ë@Õ¯Q Ë@ Lower,  ɯ@ Magnetic disk,  Lowercase, ú æ„ J£AJªÓ Q¯ Magnetic stripe, Lower-case, úæ„J£AJ ª Ó¡Qå Q ª “ ¬Qk Magnetic tape, Lower set,  úæ„J£AJ ª Ó¡Qå úGX@ é«ñÒm.× Lower Stream, Magnetic tape drive,   ú æ„ J£AJªÓ¡ Qå †ñ‚Ó Lowest, Magneto-optical disk,  úGXB@ øQå”. úæ„ J£AJ ª Ó Q¯ Magnetostrictive delay line, Low-level language, øñJ‚ÖÏ@ é’ ® j J Ó éª Ë Mail, Low memory area, é’ ® j J Ó èQ »@X 鮢J Ó Y KQK. Mail bomb,    Lub, é KY KQK. éÊJ.J ¯ Luminance, Mailbox,  Lump uncurrying, Y KQK. †ðYJ“ Mail bridge, Y KQ.Ë@ Qå„k. Lurk, €YJ K Mail client, YKQK àñ KP Lurker, ƒYJ Ó . . Mail delivery, Y KQ.Ë@É J“ñK Lurking, ƒYJ K Mailer, Y KQK. I «AK. Mail exploder, Manager, Y KQ.Ë@Qj. ®Ó QK YÓ  Manifest section, Mail filter, Y KQK. l QÓ Mail gateway, Manipulation,  I. «CK Manipulator, Mail host, Y KQK. ­J ’ Ó Mail hub, Man page, èY «A‚ÖÏ@ éj® “ Mailing list,    Man Pages, é KY KQK. éÖßA¯ àA ÓÉ JËX HA j®“ Mail merge, Mantainer,  Y KQ.Ë@ l×. X ù®J.Ó Mail path, Q Mantissa,   Ì Y K .Ë@PA‚Ó ø Q優Ë@ €AƒB@ ,ø Q優Ë@ZQm. '@ Mail server, Manual, Y KQ.Ë@ ÐðXAg É JËX Mail services, Manual page,   Y KQ.Ë@ HA ÓYg é KðY K éj®“ Mail to, Manual testing,  úÍ@ Y KQK. ø ðY K PAJ.Jk@ Mail user agent,  Map,  Y KQ.Ë@ÐYjJ‚ÓÉ JÔ« ¡@Qk h. , é¢ Qk Main board,   Mapped,  é J‚ KP ékñË éJ JªÓ Mainboard,   Mapped memory,   é J‚ KP ékñË éJ JªÓ èQ»@X Main body, Mapping, á  ú æ„ JKP Õæ„k.  JªK Mainframe, Map to, á  ú æ„ JKP H. ñƒAg úÍ@  JªK Main memory,   Marble, é J‚ KP èQ»@X ÐAgP Maintain, Margin,  Maintained, ÓAë Marginalia, HA J‚ÓAë Maintainer, á ’Ó Margins, úæ @ñk Maintainer script, á ’Ó ñ¢m × Marked, ªÓ Maintenance,  ÕÎ éKA J“ Marked only, Major delivery, Q   è J.» éÊ J“ñK Marker, Õæ @ð Major release,   éÓAë èP@Y“@ Marker object,  Õæ @ð ¬Yë Make, ɾƒ Marker primitive, Mark-sweep garbage collection, Malfunction,  Pñ’¯ MARKUP, Mall, Markup,  Malta, Õ¯P A¢ËAÓ Marquee, Malware,   éJ J.k é Jm.×QK. Marshalling, Manage,  Mask,  èP@X@ ¨AJ¯ ,H. Am.k Management,  èP@X@ Masquerading, QºJ K Master, Megabyte, úæ„ JKP , KP I KAK.Aj. JÓ Megaflop, Master boot record,  úΫ) úæ„ JKQË@ ¨C¯B@ Ém. (Q®Ë@ Megaflops, Master server, Meltdown, PAîD”@ ú æ„ JKP ÐXAg Member, Master-slave, ¨ñJ.JÓð ©K.AK ñ’« Match,   Member function,   ‡K.A¢ ÐYjJ‚ÖÏ@ éË@X Membership function,   Matching, éÓZ@ñÓ é Kñ’ªË@ éË@X Member variable,   Material, èXA Ó,XAJ« ñ’« Q ª JÓ Memetic algorithm, Math, HA J“A KP Memo, èQ »Y Ó ,Qå” m× Mathematical, úæ•A KP Memo function,   Matrix,  èQ»YÖÏ@ é® J£ð é¯ñ®’Ó Memoisation, Matrixes, Memoised function, Maturity, †A ®jJƒ@ Memoization, Memoized function, Max, ú支@ Maximal free expression, Memorandum, PA’ jJƒ@ ,Qå” m× Maximin, Memory, èQ »@X Maximize, Q  J.ºK Memory access, èQ »@X hñËð Maximum,  . ú支B@ Memory address space,   Maximum segment size, èQ»@YË@ à@ñJ« ékA‚Ó Memory heap,   MDI,    èQ»@X €YºK èXYªJÖÏ@ H@Y J ‚ÖÏ@ éêk. @ð Memory leak, èQ »@XH Qå„ Mean, ¡ƒñJÓ . Memory location, èQ »@Y Ë@ ©¯ñ Ó Meaning, úGA ªÓ h , úæ ªÓ . Memory management,   Measure,  èQ»@X èP@X@ €A J¯ Memory protection, èQ »@X éKAÔg Measurement, €AJ¯ Menu,   Mechanism,   éÖßA¯ é JË@ Menu bar, Õç'@ñ ®Ë@¡Qå Media, ¡A ƒð Menubar,   Median, éÖßA®Ë@¡ Qå Menu item,    Media type, ¡A ƒñË@ ¨ñK éÖßA¯ éKAg Mercury delay line,  Medium, ¡ƒð øQ»Q Ó Q gAK¡k Meg, Merge, l×. X Mega-, Mesh,  Bj. JÓ éºJ.ƒ Megabits per second,    á Mesh network,    é JKAJË@ ú ¯ HA’J.JË@  KCÓ é KðQ« éºJ.ƒ Message,  Microcentury,    éËAƒP AJ. KQ®K é JKA K 6.52 Message block,   Microcode,  éËAƒQË@I. ËA¯ ðQº JÓ èQ®ƒ Message board,  Microcomputer, €A ®JË@ HA gñË ðQº JÓI. ƒAg Message catalog,  Microcontroller, éËAƒQË@ àA JK. Qª ’Ó ÕºjJÓ Message digest function, Microfortnight, ðQº JÓ àA «ñJ.ƒ@ Message of the day,  ÐñJË@ éËAƒP Microkernel,  é KñK Message passing,  ÉKA ƒQË@ QKQÖß Microlog,  ðQº JÓ Q¯X Messages, ÉKAƒP Micrometre, Q Message switching, ðQº JÓ Ó Micron, àðQ º JÓ Messenger, ÈAƒQÓ Microperation, ðQºJÓ éJÊÔ« Meta, «@ úÎ Microphone, àñ¯ðQºÓ Metacharacter, úΫ@ ¬Qk Meta-data, Microprocesor, ðQº JÓ lÌ.'AªÓ Metadata,  Microprocessor, Ì é J®“ð HA KA JK. ðQº JÓ l.'AªÓ Microprogramming, × Metafile, úΫ@ ­Ê Ó ðQº JÓ ém. QK. Metaheuristic, Microsecond,  ðQº JÓ é JKA K Metainformation,  Middle-endian, úΫ@ HAÓñÊªÓ Middleware, Meta key,  úΫ@ hAJ®Ó Midi, Metal, øY JÖÏ@ àY ªÓ Mid-level network, Metalanguage, 骯 QÓ éª Ë Migrate, Metaphone, Miles, úΫ@ ­KA ë ÈA JÓ@ Metaprogram, Mill,  úΫ@ l×. AKQK. éKñkA£ Metasyntax, Millennium bug,   é J®ËB@ èQå„k Meter, QÓ Millennium meltdown, Method,  Millimeter,  é® KQ£ QÒÊÓ Methodology,  Millisecond,  é Jj. îD Ó é JKA K úÎÓ MIME, Metric, øQÓ Mime Type, Metric space, Q Q :úæ JK ¨ñK ø ÖÏ@ÈAj. ÖÏ@ ,ø ÖÏ@ZA’®Ë@ Mind mouse, 

Mice, à@ Q¯ Mind uploading, Micro, ðQº JÓ Minicomputer, Q ª “ I. ƒAg Micro-, Minifloppy,  Qº JÓ Q ª “ àQ Ó Q¯ Mini icons,   Modem, èQ ª “ HA Kñ ® K@ ÐXñÓ Minimal automaton, Moderator,  Minimax, ¬Qå„Ó Modern, Minimize,  øQ唫 Q ª ’ Modification, QJª K Minimum, úGX B@ Miniport, Modified, Q  Jª Ó Modifier, Q Minix, ºJ JÓ  JªÓ Minor fault, Modifier key, Q  Jª Ó hAJ®Ó Minor faults,  Modify, èQ ª“ ZA¢k@ É KYªK Minus,  ‘¯AK Modular, úæ J»QK Minus infinity, Modular arithmetic, . Minute,   Modularization, é® J¯X Modular Synthesis, Mirror,  è@QÓ  Modulate, àP Mirrored, €ñºªÓ  Modulation, ÕæK QË@ Mirroring, øð@QÓ QKñ’ Module,  Mirror site,   èYgð è@QÓ ©¯ñÓ Modulo,  Miscellaneous, €A J®Ó ¨ñJ JÓ Modulo arithmetic, Misfeature, Modulo operator, Missed call, I KA ¯ ÈA’@ Modulus, Missile address, pðPA’Ë@ à@ñ J « Molecule, ZøQ k. Monadic, Mistake, A¢k Monitor,  Mixer device,   HA¯QÓ ¡Êg èQ êm.' , Cg PA êk. . Monkey, scratch,   Mnemonic, øQ»Y K Q ÓP ¡‚» ,XQ¯ Monkey sort,  Mnemonic key, øXQ¯ PQ ¯ øQ »YK hAJ®Ó Monkey up,  Modal,  úΫB XQ¯ ðQå„Ó Mono, Modal logic, Monochrome, Modal (value),    àñ ÊË@ øXAg@ Õæ j. jJË@ éÒ J¯ Monoid, Mode, ©“ð Monolithic kernel, Mode bi, Monospace, Model, P@Q £ Monotonic,  Model checking, I.  KP Month, Modeling, QîD Moose call, Modelling,  ék. YÖß More, ú¯A “@ Multilayer perceptron, Morphing, Èñm' Multilingualization, HA ª ÊË@XYªK Mosaic, Multimedia, èXY ªJÓ¡A ƒð (ù KA‚® J‚¯ .) ZA‚® J‚¯ Most general unifier, Multipart, ÐA‚¯B@ XYªJÓ Most significant bit, Multi-part key, Z@Q k. B@XYªJÓ hAJ®Ó Mother, Ð@ Multiple, XYªJÓ Motherboard, ÐB@ ékñÊË@ Multiple access, XYªJÓ ÈñkX Motion, é»Qk Multiple boot, ¨C¯B@ XYªJÓ Mount, ɓð Multiple inheritance, ­«A ’ Ó HP@ñ K Mounting, IJ»QK . Multiple value, éÒJ®Ë@XYªJÓ Mount point,    ɓð 颮K Multiplexed, Õæ” Ó,­«A’ Ó Mouse, èP A¯ Multiplexer, ÈAƒPB@XYªJÓ Mouse Cursor,   èPA®Ë@ Qå ñÓ Multiplexing,   Mouse droppings, XYªJÓÈA’@ Multiplex printer, Mouse grab,    èPA®Ë@ é’J.¯ Multiply,  Mouse mat, ­«A’  Multiprocessing, Z@QkB@XYªJÓ Mouse-over, èP A¯  úΫ PðQÓ . Multiprocessor, Ì  Mouse pad, èP A® Ë@ èXA ƒð l.'AªÖÏ@XYªJÓ Multiprogramming,   × Mouse trails, èP A® Ë@QK@ èXYªJÓ ém. QK.  Multiscan, XYªJÓ i‚Ó Move, ½ KQm' Multiselection,   MSDOS, XYªJÓPA JJk@ €ðY.‚.Ó Multisync, MS, ‘  Multitasking, ÐAêÖÏ@XYªK MTU,  :ðéK Multi-threaded, Multiboot, ¨C¯B @XYªJÓ Multithreaded, Multi-threading, Multibyte,   I KAJ.Ë@XYªJÓ Multithreading, Multicast, èXY ªJÓ é«@X@ Multi threading, øXYªKI ª‚ Multicast addressing,     . èXYªJÓ é«@X@ éKñJ« Multi-touch, Multicast backbone, Multiuser system, á ÓYjJ‚ÖÏ@XYªJÓÐA¢  Multiclick, XYªJÓ¡ª “ Multi-way branch, Multihomed hos, Mumble, Multihomed host, ÑêÒîE Munching squares, Multihost disk, á ® J’ ÖÏ@XYªJÓ Q¯ Museum, ­j JÓ Mute, Nature,  Õæ» éª JJ.£ Mutual exclusion,  Nautilus, ÈXAJ.JÓZAJ Jƒ@ €C JKñ K Mutually recursive, Navigate,  ÈXAJ.JÓPQºJÓ ékCÓ Mutual recursion, ÈXAJ.JÓ P@QºK Navigating, QjJ. K Mux, Navigation, i® ’

N Navigation key, PAm'.B@PP Naive, Navigator, h. XAƒ ,ZøQK. hCÓ Negation by failure, Name, Õæ @ Negative acknowledgement, Name capture, Negative Binomial, Named, ùÒ‚Ó Neighborhood,

Named pipe,    Net,  èA҂ÓÈA’@ éK.ñJ.K@ éºJ.ƒ Named Stream, Netbook, Name resolution,  Õæ B@ Q  JÖß Netcafe,  Q  IK K@ úæê®Ó Names, Þ Netiquette,    ZAÖ @ éºJ.‚Ë@ ú¯ ÉÓAªJË@H. @X@ Name service switching, Netizen, Namespace,  Netmask,   Õæ B@ ékA‚Ó éºJ.‚Ë@ ¨AJ ¯ Nano-, Netscape,  ñKAK I. Jº‚ JK Nanocomputer,  Netting, úÍ@I. ƒAg ñKAK Network,  Nanometre, QÓ ñKA K éºJ.ƒ Nanosecond,  Network-address,  é JKA K ñKA K ú¾J.ƒ  à@ñJ« Nanotechnology,   Network byte order,     ñKAJË@ é JJ®K ú ¾J.ƒ I KAK. I.  KQK Network card,   Narrowband, é®J“ éÓQ k éºJ.ƒ é¯A¢. Network close, Narrowing,   ‡J  ’  Network database,    Native, éºJ‚Ë@ úΫ HA KAJK èY«A¯ É J“@ . . Networked, I ‚Ó Native code, É J“@ PA ÓP . Network engineer,  Native compiler, éºJƒ €YJêÓ øQ¢¯ ©Òm.× . NAT (Network address translation), Networking, HA¾ J.‚Ë@¡.P Natural deduction, Network interface card,     ùª JJ.£ Õæ„k éºJ.‚Ë@ éêk. @ð é¯A¢. Natural language,   Network interface controller,   é Jª JJ.£ éª Ë é ê k. @ð Õº jJ Ó éºJ‚Ë@ Natural language processing, éJªJJ£ éª Ë émÌ'AªÓ . . . Network layer,    Natural number,  éºJ.‚Ë@ é®J.£ ùª JJ.£ Õ¯P Network layer reachability information, Network management,    Next,  éºJ.‚Ë@ èP@X@ ú ÍAJË@ Network mask,   Nibble,  éºJ.‚Ë@ ¨AJ ¯ Õæ” ¯ Network meltdown, NIC, Network node,    Nice,  éºJ.‚Ë@ èY®« ­J ¢Ë,†ñÊg Niceness value, Network number,    ÈA’B@ éºJ.ƒ Õ¯P Nick,  Network operating system,   I®ÊË@ éºJ.‚Ë@É Jª ‚ ÐA¢  . Nickle, Network operator,  ɾJ Ë@ éºJ.‚Ë@ɪ ‚Ó Nickname,  Network redirector, é JJ » Network segment,   Nick name,  ú ¾J.ƒ ©¢J®Ó PAªJ‚Ó Õæ @ Network storm, éºJƒ é® “A« Night mode, JË¡Öß . ú Î Network, the,  Nipple,  éºJ.‚Ë@ éÒÊg Network transparency,   No, éºJ.‚Ë@ é J¯A®ƒ B Neural nets, No assignment, Neural network, NO-DAEMON,  ú æk. B Neuron, I. ’« Node,   Neutrosophic, èY®«  Neutrosophic logic, Noise, i. Jm.• ,l. • Neutrosophic probability, Noise shaping,   i. ’Ë@É Jº‚ Neutrosophic set, Non-algorithmic procedure, Neutrosophic statistics, Noname, Õæ @B Never,  ¡¯ ,@YK.@ Noncluster mode, ’k B ¡Öß ,øXñ®J «B¡Öß ú Î New, Y KYg. Nondeterminism, Newbie,  Nondeterministic, øYJJ.Ó Nondeterministic automaton, News, PAJ.k@ Nondeterministic polynomial time, News feed, None, Yg@B,àðY K ,Zúæ B News group, PAJk @ é«ñÒm× . . . Non-existant, Q Newsgroup,  Xñk. ñÓ « PAJ.k@ é«ñÒm.× Non-impact printer, Newsgroups,  Non-inclusive, é KPAJ.k@ HA «ñÒm.× Non-interlaced, Newsletter,  PAJ.k B@ èY KQk. Nonintrusive testing, News reader, PAJk B@ øZPA¯ . Nonlinear, ù¢kB News Site,  øPAJ.k@ ©¯ñÓ Non-optimal solution, ÉJÓ@  ËÉg New talk, YKYg I KYg . Non parity, úkðPB New text, Y KYg. ‘ Non-polynomial, . Nontrivial, ÈY JJÓ Q« N-th Roo, . N-tier, No numbering,  X@YªK àðYK. Nu-calculus, Non-uniform quantising logarithmic compres- sion, Nudge,  Non-volatile,  Q Null, ÐY« QK A¢JÓ « Nullary, Nonvolatile, QKA¢JÓ Q« Null modem, ÐXñÓCK Non-volatile memory,   Q  . èQK A¢JÓ « èQ»@X Null pointer,   Zúæ CË Qå ñÓ Non-volatile storage, QKA¢JÓQ« áK Q m ' Null string, é«PA ¯ ¬Q k@ éʂʃ Norm, PAJªÓ Number, Õ¯P Normal, ùªJJ£ ,øXA« . Number Converter, ÐA¯P B@ Èñm× Normal distribution, ùªJJ£ ©KPñ K  . Numbered List, éÔ¯QÓ éÖß A¯ Normal form,  øXA« ɾƒ Numbering,   Normalisation,   Õæ ¯QK © JJ.¢JË@ Number sign, Normalised,  Number Theory,   I. £ ÐA¯PB@ é KQ¢  Normalize,   P@QºJË@ÉÊ® K Numeral, Normal order reduction, ø XY« Numeral system, Normal vector, Y«ÐA¢  Normed space, Numerator,  ¡‚ . North,  Numeric, ' ÈA҂Ë@ ø XY« ø Ym. .@ Northbridge,  Nybble,  ú ÍAÖÞ Qå„k. I KAK. ­’ Notation, Nym server, áK ðYK QÊ JÓP Ò JK@ ©k. @P Not between, Note, O Obi-wan error, Notebook, ÈñÒm× H. ñƒAg Object, Not empty, ¨PA ¯ Q« á KA¿ Object code, Not equal, ÈXAªÓ Q« Object file, Not equal to, úæ•Q« ­ÊÓ,Q«É®Ó úÍ@ ÈXAªÓ Q « Object identifier, Notice, PAªƒ@ Object-orientation,  é Jk. ñJË@ é J“Q « Notification, é JJ.K Object-oriented, Notifications, Object oriented, é Jk. ñJË@ úæ•Q « Notify, © JÊJK Object-oriented analysis,  . é Jk. ñJË@ úæ•Q «É JÊm' Notwork,  éºJ.ƒ Object-oriented database,     No-write allocation, é JKA¿ HAKA JK. èY«A¯ Object-oriented design,   One-Time,    é Jk. ñJË@ ú æ•Q« Õæ Ғ èYg@ð èQÓ, èQÓ Object-oriented language,   On even pages,  é Jk. ñJË@ é J“Q « éª Ë é Jk. ðQ Ë@ HA j®’Ë@ úΫ One-way function, Object-oriented programming,   é JKA¿ ém.×QK. One-way hash function, Objects, ¬@Y ëB@ Ongoing, PAg Oblique, . ÉKAÓ,¬QjJÓ Online,   Oblique stroke, ð@ I K QKB @ úΫ (Zúæ ) ,ɒJÓ (‘m )  Q Q Observational equivalence, IK KB @ .« On the line, Observations,  ¡mÌ'@ úΫ HA ¢kCÓ,H@Y “QK Onto, Obsolete,   ¡J.Ó ,¼ðQÓ Ontology, Occam, Opacity, éÒJ« Occasion,   éJ.ƒAJÓ, é“Q¯ Opaque, ÕæªÓ Occlude,  Y‚  Open, iJ¯ Occurence, HðY g Open box testing, Occurrence, HðY g Open-collar worker, Occurs check, Openid,   ékñJ®ÖÏ@ é KñêË@ Octal,  Opening, ú GAÖß Octet,   Open source,  é JKA Öß hñJ®ÓPY’Ó October,  Open switch,   ÈðB@ áK Qå„ hñJ®ÓÈ@YJ.Ó(PP) Octothorpe, Operand, ÉÓAªÓ OEM, Operating system,  É Jª ‚ ÐA¢  Off,  ‡ÊªÓ Operation,  é JÊÔ« Offline,  ɒJÓ Q« Operational database,    é JÊÔ« HA KA JK. èY«A¯ Offset, ' àAm P Operational requirements, , é J Ê Ô« HA J Ê ¢ J Ó Off-side rule,   . é JÊÔ« HA g. A JJk@ Off-topic, Operational semantics, ¨ñ“ñÖÏ@ h. PAg Operational test and evaluation, OK,  ‡¯@ñÓ Operational testing, Old,  Õç' Y¯ Operation code,  Older or from, é JÊÔ« PA ÓP Operations,  « Older than, á ÓÐY¯@ HA JÊÔ Operator, On, ÉÓA« ÉÒª K Operator overloading, On all pages,   HAj®’Ë@ É¿ úΫ Optical, One-line fix, ù Kñ“ Ones complement, Optical character recognition,   Orthflow, úΫ ø Qå”. ¬QªK ¬ðQmÌ'@ Orthogonal,  Optical diff, YÓ AªJÓ Orthogonal instruction set,    Optical fiber,  HA Ò J Ê ª K èQ ÓP é Kñ“ ¬A JË@ èY ÓAªJÓ Optical fibre, éKñ “ ¬A JË@ OSD,  Optical grep, Other, Qk @ Optical mouse,   é JKñ“ èPA¯ Outbox, PXA’Ë@ éJÊ« . Optimal, ÉJÓB@ Outer, Outer join, Optimise, éÊJÓ@ Outgoing, Optimising compiler, h. PAg  Optimization,   Outline, '  éÊJÓ@ ù ¢ J¢m Õæ P , é¢k Optimize,   Outline font, J’® K¡ k éÊJÓ@ ú Î Output, Optimized, ÉJÓAÓ h. Qk Output device, Option, PAJk Outside, Optional, á « h. PAg ,h. PAmÌ'@ ú¯ ø PA Jk Outside-in testing, Options, H@PA Jk Outsourcing, Or, Overclocking,   ð@ é JKA ® JÖÏ@ ‘ J¯ Orange,  úÍA®KQK . Overflow, ‘ J¯ Order, Overhead,  Order-embedding, úGA¯ñ¯ Overlap, Ordering, Overlapping,  Ordinal, I. »@QK Ordinate, Overlay, Overload,   Org, éÒ¢ J Ó ­K QªJË@ èXA«@ Overloading, Organization, é»Qå„Ë@, éÒ¢ J Ó Override,  Organize,  PðAm.' Õæ ¢JK Overriding, Organizer, Ñ¢ J Ó Overrun, Orientation,   Overrun screw, èAm.'@ , é Jk. ñK , ék. ñK Origin, Overuse strain injury, Overview, Original, úΓ@ Overwrite,       Orphan,  úΫ éK.AJ», é J¯ñ¯ éK.AJ» ÕæJ K Own, Orphaned i-node, Owner, Orphan process,  ½ËAÓ Õæ J K Z@Qk. @

Palette, à@ñ Ë@ ékñË P Palettes, Pack,  éJ.Ê« Palette window,  à@ñËB@ ékñËPA£@ Package, éÓQ k Palmtop, Packager, Pane, Packed decimal, hñË Panel,  Packet,  ékñË éÓPP Panelize, Packet driver, Panic, Packet mode,   éÓQk ¡Öß , éÓPP¡Öß Panic message,    Packet radio, Q«X éËAƒP ,¨A JKP@ éËAƒP Paper,  Packet sniffer,  Ì    †Pð éÓQm '@ ‡‚J‚Ó Papermail, Packet-switched,  éÓQ mÌ'@ úÎ KYJ.K Paper-net, Packet Switching, Paper tape, ú¯Pð ¡Qå Packet switching,   éÓPQ Ë@È@YK. @ , éÓQ mÌ'@ È@YK. @ Paraconsistent probability, Packet writing,     Paradigm, éÓPQ Ë@ éK.AJ», éÓQ mÌ'@ éK.AJ» Padded cell, Paradox, é’ ¯AJ JÓ Padding, Paragraph, èQ ®¯ Page, éj® “ Parallel, P @ñJÓ Pagebreak, èY KYg éj® “ é¯C ¢@ . Parallel computer, (ÉJª ‚Ë@) P@ñ JÓHñƒAg Paged,  . új®“ Parallel computing,    (É Jª ‚Ë@) é KP@ñ JÖÏ@ éJ.ƒñmÌ'@ Paged address, új® “ à@ñ J « Parallelism, øP@ñ K Paged memory, új® “ èQ »@X Parallelogram, ¨C“ B@ øP@ñ JÓ Page fault,  éj®’Ë@ A¢k Parallelograms,   ¨C“ B@ é KP @ñJÓ Page frame, éj® ’Ë@PA£@ Parallel port, øP@ñ JÓ Y ® J Ó Page in,   éÊg@X éj®“ Parallel processing,     Pagelet, é KP@ñ JÓ ém.Ì'AªÓ,P@ñ JÓ Z@Qk. @ Parallel processor,  Ì Page mode, új® “ ¡Öß P@ñJÓ l.'AªÓ Parallel random access machine,  Page out,   XA ® K é J º Ó ék. PAg éj®“   Pager, P@ñJÓ ù K@ñ‚« Parallel reduction,   Pages, P@ñ JÓÉ JÊ®K ,‘ J®J K Paging, Parallel resource, P @ñJÓ XPñÓ Pain in the net, Parallel-service, éKP@ñ JÓ éÓYg Paint,  é«AJ.“ ,á ëX Parameter, ÉÓ AªÓ Pair, h. ðP Parameters, Parametric, Pass,  ù ¢ƒñÓ QK QÖß Parametric polymorphism,  Passcode,  ÈA¾ ƒB@ é KXY ª K PñJ.ªË@ éÒÊ¿ 颃ñÖÏ@ Passing, Paranoid programming, HAJKPB @ àñ J k ém×QK Passive, . . . . ú æ.ʃ Parcel,  Passive grab, éËAK. ,Qå• Passive matrix display,  Parent, øñK.@ ú æ.ʃ é¯ñ®’Ó ðX @QªÓ  Passkey, Parent directory, ÐB@YÊj. ÖÏ@ Passphrase, Qå  èPA J« Parentheses, àA ƒñ¯ . Parent level, Password, Qå  éÒÊ¿ Parent process, Password aging, Qå„Ë@ éÒÊ¿ ÐXA®K Parent structure, Password field,   Qå„Ë@ éÒÊ¿ É®k Parent window, ɓB@PA£B@ Paste, †A ’Ë@ Parity,  é Jk. ðP Patch,   Parity bi, 骯P Patch (noun),   Parity bit,     骯P é Jk. ðQË@ IK. ,h. ð@QË@ IK. Patch pumpkin,

Parity error, úkðQ Ë@ A¢k . Patch (verb), ©J¯Q K Parse,  É JÊm' Path,  PA‚Ó Parser, H. QªÓ,Ém× Path coverage testing, Parser generator, Pathname, PA‚ÖÏ@ Õæ @ Parsing, ÉJÊm' Pathname separator, PA‚ÖÏ@ Õæ @ ɓA¯ Partial, PAjJÓ ,ùKQk. Paths,  Partial equivalence relation, HA ¯Q£ Patience, Q Partial evaluation, ùK Q k á ÒJK ,ùK Q k á Òm ' .“ . . Pattern, Partial function,   ¡Öß é JKQ k. È@X Pattern matching,   Partial key, H. ñʃB@ ‡¯@ñK ù KQk. hA®Ó Pattern recognition, Partially ordered set, IKQË@ éJK Q k èQ ÓP . . Pause, I ¯ñ Ó ­ ¯ñ K Partial ordering,   ùKQk. I KQK Paused,      . ­J ¯ñJË@ I ¯ñ Ó,(A JJ¯ð) ­¯ñJÓ Participants, àñ »PA‚Ó Payload, Particle, Peak indicator,    Õæ ‚k. é J¯A®‚Ë@ Qå ñ Ó Partition, Õ愯 Pearson Correlation, Partitioned data set, Peephole optimisation, Partitioning,    Peer, Q Õ悮K, éKQ m.' ¢ Partition Table, Peer-to-peer, Q¢ J JË@Q¢  Pessimising compiler, Peta-, Pen,  Õί Petabyte, Pending signal, Petaflops, Pending signals,    Ï  Q  ? é J®J.JÖ @ HC K JË@ZAªË@ Phase, Pñ£ Percent,  éJÖÏAK. Phase alternating line, Percentage,  Phase Change Memory, é KñJÓ Percentual, Philippines, á JJÊJ® Ë@ ø ñJÓ . Perceptron, Philosophy, é® ‚ʯ Perf, Phishing, Performance, Phone, ­JîE ,­KA ë Period, èPðX Phone book, Periodic, éKPðX Phone mail,  ù ®KAë Y KQK. Periodic group, øPðX ¨ñÒm× Phosphor fatigue, . Phyiscal, Peripheral, ú¯Q £ Physical,   Peripheral device, Xñk. ñË@ ù® J®k ,€ñÒÊÓ ,€ñ‚m× ú¯Q£ PA êk. Physical address, €ñÒÊÖÏ@ à@ñ J ªË@ Perl, ÈQK . Physical addressing,   Perl Script, éƒñÒÊÓ éKñJ« ÈQ K. ‘ Physical file, €ñÒÊÓ ­Ê Ó Permanent, Õç'@X Physical layer, éƒñÒÊÖÏ@ é®J¢Ë@ Permanent file, Õç'@X ­Ê Ó . Physical memory,    Permanent link,  èQ»@YË@, é ƒñÒÊÖÏ@ èQ»@YË@ Õç'@X¡.@P    Ï Per-message, A J® J®k èXñk. ñÖ @ Physical memory address,   Permission, éƒñÒÊÖÏ@ èQ»@YË@ à@ñ J « Pica, Permutation,  éËXAJ.Ó Pi-calculus, Perplexity,  Pick aperture, èQ g ,¼AK.P@ Picker button, Persistence, P@QÒJƒ@ Picker Settings,  Q Persistent, QÒJ‚Ó H@X@Y«B @ g@ Persistent link, Picking,   ZA®JK@ ,PA JJk@ Pico-, Persistent memory,    èQÒJ‚Ó èQ»@X Picosecond, Personal, Pictogram, Personal computer,  Pictograph, ú æ”m H. ñƒAg Personal Package Archive, ÐQ mÌ'@ ­J ƒP @ Picture, èPñ “ úæ”j ‚Ë@ Picture element,  Perspective,  èPñ“ Qå”J« Pñ¢ J Ó, ék. Q¯ Pictures, Plants, Plastic, PID, éÒêÖÏ@ Q ÓP Platform,  Pie,  é’J Ó QKA¢¯ h. , èQ ¢¯ Piggybacking, Play,  ZQ¯@ ,ɪƒ ,¬Q «@ Pilot device, Playback, Play by electronic mail, Pin,   éʃ , èQK. @ Pin feed, Player,  øPA ¯ ,I. «B Ping, Plenum cable, Ping-flood, Pleonasm, Pinging, Pling, Plonk, Ping-pong, XP ð Y g @ Pin-out, Plotter, A¢k Pipe, Plot (verb),  H. ñJ.K@ ¡k ,¡ J¢m' Pipeline, Plug, Pipeline break, Plug and play,   Pipelined, É Jª‚ ð .¯ Pluggable Authentication Modules, Pipeline processing,   é KXP@ñK ém.Ì'AªÓ Plug-in, Pipeline stall, Plugin, ‡jÊ Ó Pipelining, èXP@ñ Ó Plug-in editor kit, Piping, Plus, Plus every, Piracy, éJ “Q¯ Pocket calculator,    Pirate, àA “Q¯ I. Jj. ÊË éJ.ƒAg éË@ Pocket computer, Pitch, èñ ¢k I. Jj. ÊËH. ñƒAg Podcast,     Pixel, ɂºK. (é JKñ“) èQå„ Pixelize, Point,   Qå ñ K , 颮K Point-and-grunt interface, Pixels, H@Pñ ’J « Pixmap, Pointed domain, PKI, Pointer, Qå ñ Ó Place,  Pointer grab, àA¾Ó, ékAƒ Pointer swizzling, Placeholder, Ï àA¾Ö @ ½ƒAÓ Pointing device,  Placement, Q ƒAK PA êk.

Plaid screen, Pointing stick, Q ƒAJË@A’« Plain, Point of presence,   (‘) XQm.× Xñk. ñË@ 颮K Plain text, Point of sale terminal,   XQm.× ‘ © JK. 颮K ¬@Q¢Ó Plain window,   Point-to-point protocol,      éÊÓA¿ èY¯AK 颮K úÍ@ 颮K †A® JÓ Poisson distribution, Portrait, ú Íñ£ Policy,  éƒA Jƒ Portugal, ÈAª KQK Policy group, . Portuguese,  é JËAª KQ.Ë@ Policy issues,   é JƒA Jƒ àðñƒ Pose,  Policy repository, é Jª“ð Position, Polish,  ©“ñÓ é KYJ ËñJ.Ë@ Positional,    Polling,  úGA¾Ó,ùª¯ñÓ k.  Post, (ɪ¯) ɃP@, éËAƒP Polygon, ©Ê’ Ó Postal Box,  Polyline, ø Y KQK. †ðYJ“ Polylithism, Posted write-through, Poster,  Polymorphic, ÈA¾ƒB@XYªJÓ ‡’ÊÓ,àC«@ Polymorphic lambda-calculus, Posterize, Postfix, Polymorphism,  ÈA¾ƒB@ é KXYªK Postfix notation,    Polynomial,  ‡jÊÓ I KñJK é KXðYg Postfix syntax, Polynomial-time, Posting, Polynomial-time algorithm, Polyvinyl chloride, Postmaster, Y KQ.Ë@ ¨Pñ Ó Post Office,  Pool, ñ k Y KQ.Ë@I. JºÓ Pooled Variance, Post office problem,  Y KQ.Ë@I. JºÓ ɾ‚Ó Pop, Post-order traversal, Pop-down menu,    éËY‚Ó éÖßA¯ Post Processor, H@Y gB@ lÌ.'AªÓ Pop up,  Postscript, ‡J.JÓ I KQj’J‚« Popup,     Potential difference, (...tÌ'@ éÖßA¯ , èY¯AK) é®J.JÓ Popup menu, Potential master, Potential primary, Port, Y ® J Ó Pound,  Portability,    (àPð) É£P ,(éÊÔ«) é JJk. É®JÊË é JÊK.A¯ Pound on, Portable, ÉÒjÊËÉKA¯ ,ÈñÒm× . Pound sign, èY gð) É£QË@ éÓC« , éJJ mÌ'@ éÓC« Portal,  . éK.@ñK. ,H. AK. (àPð Port (Development), Power, èPY ®Ë@ ,øñ¯ Porting, Power cycle, Portmap,  Powerdomain, Y¯AJ ÖÏ@ é¢ Qk Portmapper,  Power management,   Y®JÖÏ@A¢k é¯A¢Ë@ èP@X@ Power-on, Port monitor,  Y®JÖÏ@I. ¯@QÓ Power-on self-test,   Port number, Y ® J ÖÏ@Õ¯P ¨C¯B @YJ« ú G@YË@ ‘j®Ë@ Power save mode, é¯A ¢Ë@PAgX@ ¡Öß Press, ¡ª “ Powerset, Press and Hold,   Ppa, ‡J ʪJË@ ©Ó¡ª“ Pretzel key, PPA, Prevent,   PPP, I.  Jm.' ,ZA®K@ Pragma, Prevention, Y“ ,Q¢ k Pragmatic,   ùª ¯ @ð ,úΪ¯ ,ùªK @P X Preventive, ùKA ¯ð Pre-allocate, Preventive maintenance,    Precharge, é JKA¯ð éKA J“ Preview, éJ KAªÓ Precision, é¯X Previous,  Pre-configured, ‡K.A‚Ë@

Predecessor, Primary, úÍð@ Predicate calculus, Primary cache,     Predicate logic, é J‚ KP é JK.Ag , é JËð@ é JK.Ag Primary Colors,  Predomain, é JËð@ à@ñ Ë@ Primary key, Pre-emptive multitasking,    ù KA¯ñË@ HAÒêÖÏ@XYªK Primary management domain, Preference,  É J’®K Primary window, úæ AƒB@PA£B @ Preferences, HC J’ ® K Prime number, úÍð@XY« Prefix,  é®K.Aƒ Prime number theorem, Prime time, Prefix notation, @YJ.Ó I KñJ K Prefix syntax, Primitive, Preformat,        Principal, é KY JêÖß éJ JîE, é KY JêÖß é«A“@ ú æ„ JKP Pre-install, Principal type, úæ„JKP ¨ñK Pre-order, Print, Pre-order traversal, ©J.£ Prepaging, Printable,    é«AJ.¢ÊË Zú æêÓ, é«AJ.¢ÊËÉK.A¯  Print area,   Prepare, Q ’ m' é«AJ.¢Ë@ ékA‚Ó Prepend, Printed, ¨ñJ.¢Ó Preprocessor,  Ì  Ì Printed circuit board, ø Y JêÖß l.'AªÓ ,ù ®J.ƒ l.'AªÓ Pre-sales support rep, Printer,  éªK.A£ Presence detect,   Yg. @ñJË@ ¬A‚»@ Printer port, é«AJ¢Ë@ Y ® J Ó Presentation, . Printing, Presentation layer, ©J.¢  Print server,   Preset, é«AJ.£ Õ®ÊÓ Presets, Priority,  Presiding, é KñËð@ Priority inheritance,   é JËðB@ éK@Pð Priority interrupt, Processor farm, Priority inversion,   Processor time,  é JËðB@H. C®K@ lÌ.'AªÖÏ@(É Jª‚) á ÓP Priority queue, Process scheduling,   é ËðY g. ,Z@Q k. B@ é ËðY g. Priority scheduling,    é KñËðB@ éËðYg. ém.Ì'AªÖÏ@ Privacy,  Process status,  é J“ñ’k Z@Qk. B@ éËAg Private, Ag Process table, Z@Qk. B@ ÈðYg. Private hostname,  Prodigy, úÃXQ« Õæ @ ,ú æ” m ­J ’ Ó Õæ @ úæ•ñ’k ­J’ Ó Product,  i. JJÓ Private key, øQå hAJ®Ó Production system,  Private-key cryptography, h. AJK@ ÐA¢ Professional programming, éJJ êÓYJʂQ K Private Messages, é“Ag ÉKA ƒP Professional services,   Priviledge,  é JJêÓ HAÓYg PA JJÓ@ Profile, Privilege, PA JJÓ@ Profiling data, Privileged instruction,     Program, H@ X éÒ JʪK,ù ÜØ éÒ JʪK l×. AKQK. PA JJÓ@ Program counter, úm×QK X@Y« ,l×AKQK X@Y« Probabilistic,   . . . . é JËAÒJk@ Programmer, Probabilistic automaton, l×Q. .Ó Programming,  Probability,    ém.×QK. †ñK,ÈAÒJk@ Programming fluid, Problem, ɾ‚Ó Programming language, ém×QK éª Ë Problem report,   . . ɾ‚Ó á « QK Q®K Programs, l×. @QK. Problem state, ɾ‚ÖÏ@ éËAg Program transformation, Procedural language,   é JK@Qk. @ éªË Progress, ÐY®K Procedure, Z@Qk. @ Progress bar, ÐY®JË@¡Qå Procedure call, Progressive coding, øY®K Q ÓQK Process,  é JÊÔ« Prohibit, Process code, Q¢k Project, Process file,  ¨ðQå„Ó ém.Ì'AªÓ ­ÊÓ ,Z@Qk. @ ­ÊÓ Project assurance, Process ID,  Z@Qk. B @Õ¯P Projection,  A®ƒ@ Process identifier, Z@Qk. B@ ¬QªÓ Projective plane, Processing, øPAg , éÊÓAªÖÏ@ øPAg ,‡J J¢JË@ øPAg Project management,    . . . . © KPA‚Ó èP@X@ Y J®JJË@ Projector, Processor, Ì l.'AªÓ Project planning, ¨ðQå„Ó Q K.YK ,¨ðQå„Ó Õæ¢ J K Processor bus, Prolog,  Promiscuous mode, Provider, Q¯ñ Ó Promote,    Provision, èY«A‚Ó, é J¯QK Prompt, I m× Proxy, ¡ Jƒð Proof,  Proxy gateway,   HA J.K@ ,àAëQK. é¢ Jƒð éK.@ñK. Proof theory, Proxy server, ¡ Jƒð ÐXAg Propagation,   Pseudo, PA‚K@ éJ.ƒ Propeller key,  ©¯@X hAJ®Ó Pseudo-device, PA êk. éJ.ƒ Properties, HA ® “@ñÓ ,‘A ’k Pseudo-random number,   ù K@ñ‚« éJ.ƒ XY« Property,   é JºÊÓ, é J“Ag Pseudo-terminal, ¬@Q¢Ó éJ.ƒ Proportional,   Pubic directory, I. ƒAJJÓ ,ú æ.ƒAJK Proportional font, Public, « ú ×ñÔ Proposition,    h@Q¯@ ,hQ®Ó ,ø@P Public directory, ú×ñÔ« Ém× Propositional calculus, . Public domain,  Propositional logic, ¨A‚Ó Proprietary, Public key, úæ Ê« hAJ® Ó Public-key cryptography, Protect,  é KAÔg Public-key encryption, ú×ñÒªË@ hAJ® ÖÏAK éJÒªJË@ Protected, ùÒm× . Publish, Qå„ Protected mode, ùÒm× ©“ð Protected workbook, Publisher, Qå„ P@X ,Qå AK Pull,  Protected workbooks, éJÒm× ÉÔ« IJ» Qk. ,H. @YJk. @ ,I. m . Pull-down list, Protection,  é KAÔg Pull-down menu, Protocol,  †A® JÓ Pull media, Protocol analyser, Pumpkin,  Õæ @QÓÉÊm× á ¢® K Protocol class 0,    Pumpkineer, é KQ®“ †A® JÓ éJ¯ Protocol converter,  Pumpking,  †A® JÓ ñm× ¨Q¯ Protocole, Punch card,   I. ®K é¯A¢. Protocol layer,   Pure functional language,    †A® JÖÏ@ é®J.£ é J¯A“ é J® J£ð éª Ë Protocols, Õæ @QÓ Pure lambda-calculus, Protocol stack, Purely functional language,    ɾ‚. é J® J£ð éªË Prototyping,  ú¯A“ ék. YÖß Purge,   Provably difficult, é JkC’Ë@ é KAîE Provably unsolvable, Push, ©¯X Provide, Pushable module, Q ¯ñK Pushbuttom, Quotation,  €AJ.J¯@ Push-button,  Quote,  ¡ª“ PP €AJ.J¯@ Push media, Quoted,   ©¯X ¡Aƒð ­¢J®Ó ,.J®Ó Put procedure, Quotelike, Pyramid, Quotient,  ÐQë Õ愯 Quoting, Q Qword, , ú«AKPI»QÓ , Qå•AJ « éªKP@ á ÓI»QÓ Quadratic,  . . . . ù ª JK.QK ú «AK.P Quadrature, © JK.QK Quadruplex, R Race condition,   Quality,  PAªK éËAg èXñk. Rack-mounted, Quality assurance,  èXñmÌ'@ YJ»AK Radar map,  . P@X@QË@ é¢ Qk Quality control,  Ì  èXñm. '@ áÓY»AJË@ Radial, ú«Aªƒ Quality of service,  HA ÓYmÌ'@ èXñk. Radio, Quantifier, ñ KX@P Radio button,  Quantity,  ZA®JK@PP é JÒ» Radio group, Quantum, Radiosity, éJ«Aªƒ Quantum computer, ú×ñÒ»HñƒAg . Radius,  Quantum computing,   Q¢¯ ­’ é JÓñÒºË@ éJ.ƒñmÌ'@ Quantum do, Radix, øPYg. XY« RAID, Quarantine,  é J JªK.P@ Quarter, Raise, ©¯P Query,  Random,  ÐCªJƒ@ ù K@ñ‚« Query expansion, Random-access memory, Ques, Random numbers,    é JK@ñ‚«X@Y«@, é JK@ñ‚«ÐA¯P@ Question mark, ÐAê® JƒB@ éÓC« Random testing, Range, Queue, PñK.A£ øYÓ Quickstart,  Rank, Q © KQå (É Jª ‚) ZYK. éË Ó Quiesce, Rapid prototyping, Quintillion, Raster,   ú æÓA‚Ë@ i‚ÖÏ@ ñ¢k Quit,  èPXAª Ó Raster file, úæÓA‚ ­Ê Ó

Quorum, ÑîD @ h. ,ÑîD Raster font, ù¢®K¡ k Quorum device, Rastergram, Quota,   Raster graphics,   ÑîD @, é’k é JJÓA‚ HA JÓñƒP  Rasterising, Real-time, úG @ Rasterization, Real time, Rasterizing, Real-time structured analysis, ' Raster op, ø ñ JK. É JÊm Raster subsystem, ø Pñ¯ Real user,   Rate,   ùª¯@ñË@ÐYjJ‚ÖÏ@ é«Qå ,YªÓ Reassembly, Rating,    QK Y®K, ék. PYË@Y KYm' Rebase, Ratio,  Reboot,   éJ.‚ ¨C¯@ èXA«@ Rational, Recalculate, Rave on, Receipt,  Raw, É J“ñK Receive, Raw data,  Received, (é JËðA)ÓAg HA J¢ªÓ Raw memory,   Receiver,  èXQm.× èQ»@X ÉJ.®J‚ÖÏ@ Raw mode, Receptivity, Ray,  Recipe,     èQ k é KQ ’ m' ém'B, 鮓ð Ray casting, Recipient, Ray tracing, Recognition,  Re-, ¬QªK Reconnect, ÈA’@ èXA «@ Reachable,  ß é JË@ ɓñJÓ , é JË@ Èñ“ñË@ áºÖ Record,   Read,   éÊ Jj. ‚ èZ@Q¯ Record (verb),  Readable,  É Jj. ‚ ZðQ®Ó Recover,  Read-ahead, ¨Ag. Qƒ@ Read-eval-print loop, Recovery, èXA ªJƒ@ Readme, Rectangle,  Read-only, É J¢‚Ó Rectangular, Read only, ¡®¯ ZðQ®Ó Recurrence, Readout, Recurse, Read-write, Recursion, èXðA ªÓ Ready,  Recursion theory, I. ëAJÓ,Q ëAg. Real,   ù® J®k Recursive, øP@QºK Reality check, Recursive definition, øP@QºK ­K QªK Real Memory,     é J® J®k èQ»@X Recursive descent parser, Real mode, Recursive type, Real number, Red, Real path, QÔg@ Realtime, Redemption, X@XQƒ@ Redex, Refuse, ‘ ¯P Redirect,   é Jk. ñK èXA«@ Refutable, ñ ¯Q Ó Redirection,   Regenerate,   é Jk. ñK èXA«@ Y JËñK èXA«@ Redirectort, Regex, Redirect output, Region, Õæʯ@ ,Q¢¯ Redisplay,  QªË@ Yg Regional network, éKQ¢¯ éºJƒ , éJÒJʯ@ éºJƒ Redo,  . . èXA«@ Register,  Redocumentation, É Jj. ‚ Register allocation, Redraw, Register assignment, Reduce,  ‘®K Registered port, Éj. ‚Ó Y®J Ó Reduction, ‘®K Register set, Reduction strategy, Register spilling, Redundancy, Register-true, Redundant, Registration,  Redundant array, É Jj. ‚Ë@

Red zone, Registry, Éj. ‚Ó Re-engineering, Regression, Re-entrant, Regression analysis, Ref, Regression curve, Regression testing, Refactoring, ©J ’JË@ èXA «@ Regular,  Reference, Ñ¢ JJÓ ©k. QÓ Regular expression, Q  Reference counting,   ù ¢Öß J.ªK ù ªk. QÓ Y« ,©k. @QÖÏ@ Y« Regular graph, Referential integrity, ùªk. QÓÉÓA¾K Regulate, Referentially transparent, Reify, Referential transparency,   Reincarnation, cycle of, , é J ª k. Q Ó é J ¯A ® ƒ éJ¯A ® ‚Ë@ éJªkQÓ Reinstallation,   . I  J.JË@ èXA«@ Referer, ÈY K Reject, ‘ ¯P Referral,  éËAg@ Rejected, ñ ¯Q Ó Reflexive, »A« Relation, é¯C « Reflexive domain, Relational algebra, Refresh, Relational calculus, €A ªK@ Refreshable,  Relational database,      €A ªKC ËÉK.A¯ é J£AJ.KP@ HAKA JK. èY«A¯ Refreshable braille display, Relational database management system, Refreshable display, Relational data model, Relational language, Refresh rate, I KYjJË@ÈYªÓ Relational model,  Rename, ù®KC«¡Öß Õæ B@ Q  Jª K Relationship, Render,    (Q “ .¬) Q  J’ Relative, úæ‚ Rendering, Q  Relatively prime,.  J’ Rendezvous, Relative path, Y«ñÓ úæ‚ PA‚Ó  Relative pathname, . Renew, Y KYm.'@ ReNice, see Nice Relay, ÉKYK ,ÈA®J Ó . Reorganize,   Relay host, Õæ ¢JK èXA«@ Release,  Repaginate, éj® ’Ë@X@Y«@ èXA «@ èP@Y“@ Released version, Repagination, éj® ’Ë@X@Y«@ èXA «@ Relevance,    Repair,  é KQ  JÖß é® J£ð iJ ʒ Reliability,    Repeat,  HA J.K, é®K Y KXQK ,P@QºK, èXA«@ Reliable communication, Repeater, XXQÓ Relief,  èYm.' Repeating group, Reload,   Repeat loop,  É JÒm' èXA«@ XXQK é®Êg Repetition, Rely on, úΫYÒJª K Remailer, Repetitive strain disorder, Repetitive strain injury, Remaining,  †AK. Replace,  Remark,  ÈYJ.ƒ@ é¢ kCÓ Replaceable unit, Remind,  Q »YK Replacement, ÈCg@ ,È@YJƒ@ . Reminder, Q »YK Replacement algorithm, Remote, Replicate, Y JªK. ,YªK. á « PQº K ,­«A’  Remote access, Replication,   YªK. á « XA®K P@QºK, 鮫A’Ó   Remote control, YªK. á « Õºm' Reply, XP Remote echo, Report,  Y JªK. øY“ QK Q®K Remote login, Reports,  QK PA®K Remote monitoring,   YªK. á « éJ.¯@QÓ Repository, ¨XñJ‚Ó Remote procedure call,  Representation, YªK. á « Z@Qk. @ ZA«YJƒ@ Remote shell, Requeriments, Removable, È@Q Ó Request, I. Ê£ Removable disk, Request for proposal, Remove,  Require,  éË@P@ I. Ê¢ Removed, Required, Requirement,   Response,  h. A JJk@ ,I. Ê¢JÓ éK.Ag. @ Reseller, Response time,     Resend, éK.Aj. JƒB@ I¯ð Reserved block, Responsible, Èðñ ‚Ó Reserved blocks,  Restart,   A‚Ë@I. Ë@ñ¯ É Jª‚ èXA«@ Reserved memory,   Restore,  èPñ j. m× èQ»@X XAªJƒ@ Reset,  Restrict,  Q ®’ PA’J¯@ Restricted,  Reset button,   Y J®Ó ù [email protected]@ ©“ñÊË èXA«@ PP Resident,  Restriction, PA’J¯@ Õæ ®Ó Resident memory,    Restructuring,   éÒ J®Ó èQ»@X éʾ Jë èXA«@ Residual,  Result,   ù®J.JÓ éjJ JË@ Resume,  Resizable,  Q   ­KAJƒ@ €A J®Ë@  JªJËÉK.A¯ Rete, Resize, '  Õæ j. m èXA«@ Retrieve,  Resize handle, I. Êg.  Resize pointer, Retry, @XYm.× ÈðAg Resolution, Q Ó Return, èXñ « Return from interrupt, Resolutions, H@P@Q ®Ë@    Reusability,    Resolve, ÉÊg ,†Q ¯ ,Ég ÈAÒªJƒB @ é KP@QºK  Reuse,     Resolver, ÈAg ÈAÒªJƒB @ P@QºK,ÈAÒªJƒB @ èXA«@ Resolver library, Reverse, €ñºªÓ Resource, XPñÓ Reversed, €ñºªÓ Resource bundle,  Reverse engineering,   XPñÓ éÓQ k é J‚º« ém.×QK. Resource control, ' Reverse polish syntax, XPñÒÊK. Õºm Resource element,  Reverse video, Qå”J ªË@ ­K QªKÕ ¯P ñ KY J®Ë@ º«@ Resource fork,  Revert, XPñÓ éJ.ªƒ ºª K Resource-group, Revision,  éªk. @QÓ Resource group, Revocation, ÈA¢.@ ,Im Resource monitor,  . XP@ñÖÏ@I. ¯@QÓ Revocation Certificate, Resource pool, XP@ñÓ ñk Revoke, É¢J. K ,I. j‚  Resource state, XPñÖÏ@ éËAg Revolutions per minute,    é® J¯YË@ ú ¯ H@PðX Resource type, XPñÖÏ@ ¨ñK Rhombus, á ªÓ Respawn, Rhythm,  ¨A® K @ Rich object, Root version, Rich Site Summary, Root Window, PY mÌ'@ èY ¯A K  . Right, l• ,á Öß Roses, Rotary debugger, Right brace,   é J JÖß èQå• Ag Rotate, Right bracket,  Èñk P@X ,PðYK (ù)J JÖß €ñ¯ Rotation, Right-click, á  à@PðX Ò JË@ úΫQ®J K Rotational latency, Right join, Rotation object, Right-justify,  á Ò JÊË è@XAm× Rotation objects, Right outer join, Rotations per minute,    Right outside, é® J¯YË@ ú ¯ H@PðX Rough translation,    Right parenthesis, éJKQ®K éÔgQK úæ JÖß ÈCë . . Round, Ring network,      PðYÓ É¾‚Ë@ é J®Êg éºJ.ƒ Rounded rhombus, Rings, I ®Êg Rounded square, PðYÓ ©KQÓ Ring topology,    . ù ®Êg ú ÆÊKè Round-robin, Rip,   Round-trip time, é JÔ¯P¡Aƒð q‚ Ripcording, Route,  ‡K Q£ Robot, Hñ K.ðP Routed, Robus, Route flapping, Routeing, Role, PðX Routeing domain, Roll, Rollback, Router, ék. ñÓ Rolling upgrade, Routine,  èQ Kð Room,  é¯Q« Routing, é Jk. ñK Root, PYg. Routing table, é Jk. ñK ÈðYg. Root account, ø PYg. H. A‚k Row, ­“ ,Q¢ƒ Root bridge, Row-level locking, Root directory, PYm.Ì'@ É JËYË@ RPM package, ᪫ éÓQ k Root disk,  RSS,  øPYg. Q¯ RSS Feed, Root file system,  øPYg. HA®ÊÓÐA¢ Rude, RootKit, Rule, èY «A¯ Root mode, øPYg. ¡Öß Ruler,  Root node,    èQ¢‚Ó é KPYg. èY®« Rulers, Root user name,  øPYm.Ì'@ ÐYjJ‚ÖÏ@ Õæ @ Run, Y J®J K Run code, Sandbox,    Èñ“ñË@Y KYm' é JË@ Runic, Sanity check, Run-length encoding, Sans, Run level,   Sanskrit,   É Jª‚ øñJ‚Ó é J KQº‚‚Ë@ Runnable process,  Sans serif,  úÎ Jª‚ Z@Qk. @ É KYÓ Q « Running applications, Satisfiability problem, Run time, Satisfy, Runtime,  Saturate, É Jª ‚Ë@ á ÓP Saturation,  Run-time, Jª ‚ á ÓP ©J.‚ ú Î Run-time environment,  Save, úÎ Jª ‚ á ÓP¡ Jm× ¡®k Save As, Run-time error, úÎJª ‚ á ÓP A¢k Say,  Run-time library,   ɯ úÎ Jª ‚ á ÓP éJ.JºÓ Scalability, ©ƒñJË@ éJÊKA¯ Runtime library, úÎJª ‚ á ÓP éJJºÓ . . Scalable,   Run-time support,  Y KYÒJÊËÉK.A¯ úÎ Jª‚ á ÓPÑ «X  Scalable resource, ƒ XPñÓ, éJ¯QÊËÉKA¯ XPñÓ Run-time system, Jª ‚ á ÓPÐA ¢   ú Î . ú Î €A J®Ë@ Runtime system, Jª ‚ á ÓPÐA ¢  Scalable service,       ú Î é J¯QÊË éÊK.A¯ éÓYg  S Scalar, ú΃ (XY«)  Scale, Safe, á Ó@  Scaling, Safe mode, á Ó@ ©“ð Scaling Factor, €AJ®Ë@ÉÓAªÓ Safety,   é KA¯ð ,á Ó@ Scan, Safety-critical system, i‚Ó Scan line, Ï Salt, iÊÓ i‚Ö @¡k Salt substrate, Scanner, ém AÓ Salutation,  Scan path, ÐCƒ ,I. JkQK i‚ÖÏ@PA‚Ó Salvage,    Scan register,  èXQmÌ'@ éÒ J¯ i‚ÖÏ@ Ém. Scenario,   Sample, ú« (ɒ®Ó) YîD„Ó éK.AJ» Sample Rate, Scheduel, ÈðYg. Sample rate,   Schedueler,  àA JJ«B @ YªÓ éËðYg. l×. AKQK. ,ÈðYm.× Sampling,  Schedueling, àA JJ«@ Sampling frequency,   Schedule, àA JJ«B @ XXQK ÈðYg. Sampling rate,  Schedule manager,    àA JJ«B @ÈYªÓ éËðYg. ú æ„Ó, éËðYg. Ñ¢JÓ Sandbender, Scheduler,  éËðYg. l×Q. .Ó ,ÈðYm.× Scheduling, éËðYg Scrip, . Script, Schema, ¡¢m× Scripting, Schematic,  ù¢ J¢m' Scripting language, Schematic capture, Script language, Schematic type variable,  Scroll, QK QÖß Scheme,  × é¢k ,¡¢m Scrollable list, ‡Ë Q ÊË éÊKA¯ ém' B Scientific, . ù ÒÊ« Scroll arrow, QKQÒJË@ÑîD Scientific notation,    éJÒÊ« HA ®JJ¢ Scrollbar,  . ‡ËQ Ë@¡ Qå Scope, †A ¢ Scrollbars,

Scoring, Scroll box,  PQk@,P@Qk@ QK QÒJË@ †ðYJ “ Scratch,   Scrolling,  .(Q®“) Zú æ B , é K@YK. ‡ËQË@ Scratch disk,   é‚.Qk Q¯ Scroll pane, ‡Ë Q Ë@ hñË Scratch file, é‚Qk ­Ê Ó Scrozzle, . Scruffies, Screen, éƒA ƒ SCSI, Screen blanker,  øQºƒ éƒA ‚Ë@ ‘ JJ.Ó Scuzzy, Screen capture,     éƒA‚Ë@ A®JË@ SC/XSpread, Screencast, h. @QkB @YJ« ­Ë Search, I m' Screen editor, éƒA ‚Ë@PQm× . Screenlet, Search Domains, I m'. HBA m.× Screen lock, éƒA ‚Ë@É® ¯ Search engine, I m'. ¼Qm× Screenname, Searching, Screen name, Search string, I jJË@ éʂʃ Screen popping, . Search term,  I jJ.Ë@ iÊ¢’Ó,I jJ.Ë@ èXQ®Ó Screen reader,     éƒA‚Ë@ øZPA¯ Second,  Screen refresh, ú GAK Screen saver, Secondary, øñKA K Secondary cache, Screen Saver, éƒA ‚Ë@ é¢ ¯A g Secondary Colors,   Screensaver, éƒA ‚Ë@ é¢ ¯A g é KñKAK à@ñË@ Screen scraper, Secondary key,   ú GAK hAJ®Ó Screen server,  Secondary storage,  ' éƒA ‚Ë@ÐXAg ø ñKAK áK Qm Screen sharing, Second generation computer, É Jm.Ì'@ H. ñƒAg Screenshot,     éƒA ƒ é¢®Ë ú GAJË@ Screw, Second generation language,  Ì  Y‚® K ,½®Ó ú GAJË@É Jm. '@ éªË Second level cache, Semicolon, Second normal form, Semi light, Section,   Send, (H. AJ») H. AK. , Õ愯 ÈAƒP@ Sendding, Sector,   éJ.ªƒ ,¨A¢¯ Sector interleave, Sender, ɃQÓ Sector interleaving, Send-Monitor, Sector map,   Sense,  ¨A¢®Ë@ é¢ Qk €A‚k@ , éj. JÓ Sector mapping, Sensitive, €A‚k Secure,  á Ó@ Sensor, m.× Secure channel,     éJÓ@ èAJ¯ Sentence,  g Secure keyboard, éÊÔ . Separate compilation, Security, àA Ó@ Separator, Security breach, ɓA¯ Seed, September, ÈñÊ K@ Sequence,   Seek, ùªƒ é JËAJJÓ  Sequencer, Seeking, ©K.AJJË@Ñ¢ J Ó A J«Aƒ Sequential codec, Seek time, ùª‚Ë@ á ÓP, à@Y‚ Ë@ á ÓP Sequential coding, Segfault, Sequential file matching, Segment,   骢¯ Sequential processing,   úÍAJJÓ Y J®J K, é JËAJJÓ ém.Ì'AªÓ Segmentation,  Õ悮K Serial,  Segmentation and reassembly, ɂʂÓ Serial console, Segmentation fault, Serialise, Segmented address space, Serial line, ú΂ʂ ¡k ,ɂʂÓ¡k Select, PAJJk@ Serial port,  Selection,  ú΂ʂ Y®JÓ ù®JJ Ó Serial processing, Selector, Serif,  Self-hosting, É KYÓ(¡k) Serve, Self-test, ùKA ®ÊK ‘m¯ ÐYg@ Selvage, Servelet, Semantic, Server, ÐðXAg Semantic gap, Serverlet, Semantic network, Server room,  Semaphore, ÐXAmÌ'@ é¯Q« Servers, ÐX@ñk Semiautomatic, ùKA ®ÊK éJƒ . Server-side,   Semi bold, YJ «,ÐXAmÌ'@ ÉJ.¯ á Ó,ÐXAmÌ'@ é JkAK á Ó ÐXAm Ì'@ Server-side include, Shadow ram, Shaft, Service,  éÓYg Shallow binding, Serviceability,  Ì   éÓYm '@ èPY¯ Shape,  Service interface,   ¬C« ɾƒ éÓYmÌ'@ éêk. @ð Shaped text, Service provider,   é ÓY g Q ¯ñ Ó, é ÓY mÌ'@ Q ¯ñ Ó Share, Q     ¼ ‚Ó,ÑîD éÓYj ÊK . XðQÓ,IKQKB @ Servlet, Shared-address, ¼Q‚Ó à@ñ J « Session,  Shared memory,  Q   é‚Êg. é» ‚Ó èQ»@X Session layer, Shared object, ¼Q‚Ó á KA¿ Set,  Shareware,  á  JªK é JJ. ’ HA Jm.×QK. Set abstraction, Shar file, Set associative cache, Sharp, Set complement, XAg Sharpen, Set comprehension, Set-Operation, Sharpness, Yg , é¯X ,hñ“ð Set theory, Sheet, é¯Pð Setting, Sheets,  é J¢«@ Settings, H@X@Y «@  Shelf, ¬P Settlement, éKñ‚ Shell, é¯ Y “ Settling time,  P@Q®JƒB@ (úÍ@ Èñ“ñË@) á ÓP Shell procedure, Set-top box, Shell scrip, Setup, Shell script, Set up, Shell variable, Shielded twisted pair, Setup (Configuration), X@Y«@ Setup (Installation),  Shift,  I  J.K ék@P@ Seven layer model, Shift key, hAJ® ÖÏ@ úΫ †A ® K@ Severity, èñ ‚¯ , èY ƒ Shift left logical, Sexadecimal, Shift right logical, Sha-bang, Ship, Shabang, Shockwave,  Shopbot, Shader, ÉÊ¢ Ó Shortcut,  Shading,   Qå”Jm× É Jʒ  Shortcut key,   Shadow, PA’JkB@ hAJ®Ó É£ Shadow file, Shortest job first, Bð@ Q唯B@ éÒêÖÏ@ Shorthand, Shadowing,  É JÊ¢ Shovelware, Show, Single assignment, PAê£@ Shred, Single-attached, Shriek, Single-duplex, Single-electron transistor, Shrink,  ‘ JÊ®K Single ended, Shutdown, Single inheritance,   Shut down,    èYgñÓ éK@Pð É Jª‚Ë@ ¬A® K@ Single inlinememory moduleviewing pipeline, Side bar,  Single-instance, ú æ.KAg. ¡ Qå Side-effect, Single-precision, úæKA g. Èñª®Ó Sig, . Single quote,  Single sign-on,  Sign, èPA ƒ@ ,Q ÓP ,©¯ñ K YgñÓ h. ñËð Single sourcing, Signal,   èPAƒ@ Single static assignment, Signalling rate,   Single system, H@PAƒB @ÈYªÓ Signature, Singleton, ZA’Ó@ Signature block, Singleton variable, Single-user mode, Significance,  Y JkñË@ÐYjJ‚ÖÏ@¡Öß úæªÓ, éËBX Sink, Silently, úGñ ºƒ Silicon chip, Site, ©¯ñ Ó Silo, Sitename, ©¯ñ Ó Õæ @ Silver bullet, Size,  骃 ,Ñm.k Simple, ÉîD ,¡ J‚. Size box,  Simple multicast protocol, ÐAm.kB@ †ðYJ“

Simple path, Skew, ¬@Q m'@ Simplex, Skewness, Simplex method, Skin, Simplex printer, Skip, ù¢m ' Simship, Skolemisation, Simulated annealing, áK YÊJË@ èA¿A m× Skrog, Skulker, Simulation, èA¿A m× Sky, Simultaneous shipment, ZAÖÞ ø Pñ¯ ÈAƒP@ Slant, Since, YJÓ Slash,    Since saving, éÊKAÓ é£Qå Sine, Slashed Cross, úæƒ €ðQ» Sine wave, Slave, ©K.AK Singapore, èPñ ® ª J ƒ Slave cycle, Slave server, Single, Y KQ¯ Sleep, Socket,  ÐñK .®Ó Sleeping, Õç'A K SOCKS Server, 'ðé“ ÈXAK Softcopy, Slice, '  ém Qå Soft key, Slide,  Q '  ‡Ë  K , ém Qå Soft keys,   Slider, ÈñjJË@ iJ KA®Ó Soft limit, Sliding-window, Soft link, SLIP, © J“ Soft return, Slog, Software, éJm×QK Slogan,  . . PAªƒ Software audit,   l×. AKQ.Ë@ ‘m¯ ,l×. AKQ.Ë@ éK.A¯P Slot, éjJ¯ Software bug, Slow, Zù¢ Software development kit,    . l×. @QK. QK ñ¢ éJ. J®k Slow terminals,  Software development life cycle, éJ J¢. ¬PA¢Ó Smail, Software enabling, Smalles, Software engineering,  ×Q  Smart, HA Jm. .Ë@ éƒYJë Software Foundation, Smart card, ¨PA¯ €A ƒ@ Software handshaking, Smart terminal,    èPñ¢JÓ é J¯Q£ Software interrupt, Smash case, Software law, Smash sum, Software life-cycle, Smiley, Software metric, Smooth, Ñ«AK Software patent, SMTP,  Software piracy,   ¨éJ“ l×. @Q.Ë@ éJ“Q¯ Snaf, Software pirate, ×Q  Snag, l. @ .Ë@ àA“Q¯ Software reliability, Snail mail, l×. AKQ.Ë@Èñ« Snap, Software theft,  l×. @Q.Ë@ é¯Qå Snap dump, Softweave, Snapshot, Soft wrap, Sneakernet, Softy, Sniff,  Solarization, Õæ„J‚  ,‡‚J‚  Sniffer,   Solid, Iʓ éºJ.‚Ë@I. ¯@QÓ . Solid lines,  Snippet,  Pñ¢‚Ë@ á ÓXY« ú支@ ©¢®Ó Solid model, Snooze,   èñ®«, èZA®«@ Solid-state storage device, Social Network, Solution, Social science number, Sort, PQ ¯ Sorted,  Special file, I. KQÓ,PðQ ®Ó Sorting,   Specialisation, ' I.  KQK,PQ ¯ ‘’m Sort order, Specialized, ‘’j JÓ Sound,  Specials, Hñ“ HA J“Ag Sound card,  Hñ ’Ë@ é¯A¢. Specific address, ‘’m × à@ñ J « Soundness, Specification,  Soundproofing, 鮓@ñÓ Specify,  Source, Y KYm' PY’Ó Specular, Source code,   é JʓB@ èQ® J‚Ë@ Speculative evaluation, Source language, Speculative execution, Source package, Speech recognition,  Source route, ÐC¾Ë@ úΫ ¬QªJË@ Speech synthesis, Source routing, Source tree, Speed, é«Qå Spell, Southbridge, úGñJ m.Ì'@ Qå„m.Ì'@ . Spellcheck,   Space, éJjîDË@ éªk@QÓ ÈAm.× ,¨@Q¯ ,ZA’ ¯ . . Spell checker,  Space bar, HA ¯A ‚ÖÏ@ èQ ¢‚Ó ù KCÓ@ ‡¯YÓ Spelling, Spacebar, ¨@Q ® Ë@ hAJ® Ó ZAj. ë Sphere,  Space character, Q  èQ» PñÓQË@ è ®‚ Spider, Space complexity, Spike, Space leak, Spill, Spacing,  àA ¯ñ£ èY«AJ.Ó Spinbox, Spaghetti code, Spiral, Spam, ÐAm  Spiral model, Spamdex, Splash,  Spamming, ZYK. éƒA ƒ Splash screen,   Span,   éK@YJË@ éƒA ƒ éëQK. ,¨A‚@ . Spanning tree algorithm, Split, ÐA‚®K@ Split brain, Spare,  ù£A JJk@ Split pane, Sparse, Splot, Spawn, Spoof, Speaker, ÉjJ K Spec, Spoofing, Spool, Special, Ag Spooler, Special character, Spread sheet,  Standard semantics, H. A‚k é¯Pð Spreadsheet,  Standby,  YJÜØ ÈðYg. ù £A JJk@ Spread spectrum communications, Star, éÒm' Sprite, . Star network,   Sprocket feed, éÒm.' ɾƒ úΫ éºJ.ƒ Start,  Spyware, ' × é K@YK. ‚m. l. AKQK. Start bi, Square, ©KQÓ . Starting, ZYK Square bracket,  . ©K.QÓ €ñ¯ Start tag,

Square numbers,   Startup,  éªK.QÖÏ@X@Y«B@ É Jª ‚Ë@ZYK. Squatting,  ZA’¯Q®Ë@ (€ñÊg. ) Startup files, ZYJË@ l×AKQK HA ® ÊÓ Stabilize, . . . Startup Program, ÉJª ‚ ZYK l×AKQK Stack,   . . . P , é“P State,  Stack compression, éËAg State diagram, Stacked, Stateless, Stack frame, State machine, Stacking order, Statement, Stack loader, State transition diagram, Stack overflow, Static,   Stack pointer,   úGñºƒ ,IK.AK é“QË@ Qå ñÓ Static allocation, Stack segment,   é“QË@ á Ó Pñ j. m× ©¢®Ó Statically typed, Stack traceback, Static analysis,     Staircase, á »Aƒ É JÊm' ,IK.AKÉ JÊm' Static database management system, Staircasing, Static field,  Stake, I K.AKÉ ®k Stalled, Static link, Standalone, Static linking, Static nested scope, Stand alone,   éK@YK. Õç'A¯ Static nested scoping, Standard, ø PA JªÓ,PA JªÓ Static random access memory, Static scope, Standard deviation, øPA JªÖÏ@ ¬@Qm'B@ Standard disclaimer, Static typing,

Standard error,  Statistical, úæ A J¯ A¢k ùKA’k@ Standard for robot exclusion, Statistical time division multiplexing, Standard input,   Statistics,  úæ A J¯ ÉgX HA JKA’k@ Standard interpretation, Stats, Standard output,   Status, éËAg ú æ A J¯ h. Qk Statusbar, Stress, ú¾ JKA¾ JÓ¡ª “ Stress testing, Status bar, HA ÓñʪÖÏ@¡ Qå Steganography, Stretch, Stemmer, Stretched, XYÜØ ,XYÒJÓ Stemming, Strict, ÐPA“ Step, èñ ¢k Strict evaluation, Stepwise refinement, Strikeout, Stereogram, Strikethrough,   Stereotype, ¡k 颃ñJ K ,H. ñ¢‚Ó Strikethrought, Sticky, Sticky analysis, String, ©¢®Ó Sticky bit, String reduction, Sticky content, String variable, Sticky data,  Strip, ¨Q K, 鮃 Sticky keys, Stripchart program, Sticky notes, Stripe, Stipple, Stripe set, Stochastic, ùK@ñ ‚« Striping, Stock-keeping unit, Stroke, ÐY’  Stock Ticker,  Stroke font object, :ù®J.JÖÏ@ àð Q jÖÏ@ Stone, Strongly connected component, Strongly typed, Stop,  ¬ñ¯ð Strong typing, Stop bit, Struct, Stopping, Structural recursion, Stop words, Structure,  Storage,  é JK. áK Q m' Structured analysis, Storage card,  áK Q jJË@ é¯A¢. Structured design, Storage pool, Structure diagram, Storage space, áK Q j JË@Ñmk Structured language, . Structured programming, Store, áK Q m ' Stub,  Store and forward, èPYK. Stored procedure, Stub network, Storm, STUN, Stupid-sort, Stream,    ‡¯YK, ‡¯X Style, Streaming, Stylesheet, Stream-oriented, Stylewriter, Strength reduction, Stylus, Sub, ú«Q¯ Subtract, Subband encoding, Subtype, Subtyping, Subclass,   é J«Q¯ éJ¯ Subdirectory, Succeed, hAm.' Successor, Sub directory, ú«Q¯ É JËX Subdivision, Sufficient, ú ¯A¿ Subfield,  Sufficiently small, AJ¯A¿ Qª “ ú «Q¯ É®k Sub folder, × Suffix, é®kB ú «Q¯ YÊm. Subject, Suggest, h@Q¯@ Subject index, © J“@ñÖÏ@É JËX Suggestion, h@Q¯@ Subject-oriented programming, Suite, Sublanguage, Sum, Submenu, ¨ñÒm.× ,©Ôg. Summary, Submission, ¼@Qƒ@ ‘jÊÓ Sum (noun), × Submit, ɃP@ ,¼Qƒ@ ¨ñÒm. Subnet, Sum (verb), ©Ôg. Subnet address, Sun-stools, Super, Subnet mask,     é J«Q®Ë@ éºJ.‚Ë@ ¨AJ¯ Superblock, Subnet number, Superclass, Subnetting, Supercombinators, Subnotebook, Supercompilation, Subroutine, Supercomputer, Subscribe,  É Jj. ‚ Superhighway, Subscribed, Superimpose, Subscribing, Super minicomputer, Subscript, Superordinate, Subscription,  Superpipelined, É Jj. ‚ Subset, Superscalar, Subshell support, Superscript, Substituted, Superset, Substitution, Supertype, Substrate, Superuser, PY g ÐYj J‚Ó Substring, . Supervisor mode,  Substructure, ¬Qå„ÖÏ@ ©“ð Subsystem, Support, èY «A‚Ó,Ñ«X Subtitle, Supremum, Subtotal, Surface, ékA‚Ó ú «Q®Ë@ ¨ñÒj. ÖÏ@ Surfaces, Symbolic mathematics, Surfing, Symbols, Surjection, PñÓP Symlink,   Surjective, é KQ ÓP éʓð Surrogate key, Symmetric,  Q£ AJJÓ Suspend,   Symmetric control, ‡J ʪK Symmetric key cryptography, Suspension, ­J ¯ñ K Symmetric multiprocessing,   ×   Ì Suspicious, é®ÊJm èXYªJÓ ém. 'AªÓ é J¯ ¼ñº‚Ó Symmetric multiprocessor, Svg, Sync, éJ Ó@Q Ó Swallow, ©ÊK@ . Synchronize,  Swap, éJÓ@QÓ È@YK. @ Synchronized, Swap file,   é KQëA¢Ë@ èQ»@YË@ ­ÊÓ Synchronous, Q  Swap partition, áÓ@ Ó Synchronous key encryption, Swapped in, Sync level, Swapped out, Sync pulse, Swapping, Synflood, Swap space, Synonym, Q Sweden, ¬X@ Ó,¬X@QÓ Y Kñ‚Ë@ Synonym ring, Swedish,  éKYKñ‚Ë@ Syntax,  é«A J“ Switch, Èñm' Syntax directed translation, Switchboard, Syntax error,  Ì Switched virtual circuit, éÊÒm. '@ ZAJK. ú¯ A¢k Syntax highlighting, Switched virtual connection, Syntax tree, Switching, Synthesis, Switching hub, ÉKYJK ¨Pñ Ó Synthetic image,   . é J«AJ ¢“@ èPñ“ Switch level, Yg@ð øñJ‚Ó Sysadmin, Switchover, System, Switch statement, ÐA¢ System administration, ÐA¢ J Ë@ èP@X@ Switzerland, @Qå„ ñƒ Swung dash, System administrator, ÐA¢ J Ë@ QK YÓ System analysis,  SYLK file, ­Ê ÓZA®JK@ ÐA¢JË@É JÊm' ,ÐA¢JË@ ‘m¯ System analyst, Symbol, Q ÓP System beep, Symbolic inference, System bell, ÐA¢ J Ë@ €ñ¯A K Symbolic link, éKQ ÓP éʓð System board, Symbolic logic,  ÐA¢JË@ hñË ø QÓQË@ ‡¢JÖÏ@ System bus, System call, Tap, èQ ®K System catalog, Tar archive, é£ñ ® m× ZA‚@ System Configuration,   ÐA¢JË@ HA® KQªK Target file,  System controller, ­ÊÓZA®JK@ System management, Task, éÒêÓ System manager, Taskbar, ÐAêÖÏ@¡ Qå System message, Tastkt, System name, TCLASS, System number, TCP/IP, System operator, Team, System programming language,   Tear-off, ÐA¢ J Ë@ ém.×QK. éª Ë Systems analyst, Technic, System settings, Technique,   Systems jock, é JJ®K Technology, éKA ®K System software, ÐA¢JË@ l×. AKQK. Telnet, Systems operator, Temp file, I ¯ñ Ó ­Ê Ó Systems programmer, éÒ¢ B@ l×QÓ . . Template, IËA¯ Systems programming,  × . éÒ¢B@ ém. QK. Temporary buffer,   (èAJ.m× èQ»@X) System state, ÐA¢ J Ë@ éËAg Tentative, ùKA îE Q« System testing,  ' ÐA¢JË@ éK.Qm. Term, System tray, iÊ¢’Ó Terminal,  System type, ÐA¢ J Ë@ ¨ñK é J¯Q£ Terminate, System unit,  .ZAîE@ ÐA¢JË@ èYgð Terminus, System Wide, Systolic array, TERM variable,  :Q  Jª JÊËÉK.A¯ Q « Ternary, T Test, PAJJk@ Tab, . àA‚Ë Test Module,   Tabbed, èYgñË@PAJ.Jk@ TeX, Table, ÈðYg. Text, Tablet, ‘ Text area,  Tabulation,  © JÊJJË@ ékA‚Ó éËðYg. . Text only,  Tag, Õæ ð ¡®¯ ‘ Tagging, Textual name, Èñ“ñÖÏ@ Õæ @ Talk, Theme,  Tall, éÖÞ Thesaurus, Q  ºÓ

Third-party, Tool menu, H@ðX B@ éÖß A¯ Third party, I ËAK ¬Q £ Tooltip, Third-party repository, Topic, ¨ñ“ñ Ó Thread,   邯AJ Ó Touchpad, ÖÏ ékñË Threading, Iª‚ Trace, . Track, Threshold,   : éJ.J«
Ë@ Track ball, Thumbnail, èQ ª ’Ó Tracker, Thumb Nails, Traffic, Tick, Transaction, Transcoder, Ticker Properties, éÖß A®Ë@ ‘A ’k Transfer,  Tilde, èY Ó É®K Tile, Transfer statement,   É®J Ë@ éÒ JʪK Time format,   Transitive,  I ¯ñË@ éJ Jë é KYªJÓ Timeout,    Translate, éÊêÖÏ@ I îDK@, éÊêÓ Ñk. QK Timer,   Ï Translucency, I¯ñÖ @ Transmission channel, Time stamp, úæ ÓP ©K.A£ Transparent, ¬A ® ƒ Timestamp,  ú æÓPÕæk Transpose, Time Zone,   é JJÓP 鮢JÓ Trash, HC ÒêÓ Timezone,  Tray, ú æÓP †A¢ Timing,  Tree,   I J¯ñK èQm. Tint,  Triangular numbers, éJÊJÖÏ@X@Y«B@ Tip, Trigger, Title, à@ñ J « Trim, Tivoization, Troubleshooting, Tty, TODO List,   ÐAêÖÏ@ éÖßA¯ Tuple, Toggle,  É KYJ.K Turing Machine,    Token, éËB@ ‡Ê« Tutorial, Tolerance,  é JkAÖÞ Tweak,  Toner, © Kñ¢ Type, Tool, è@X @ ¨ñK Type bindings,  Toolbar, é JJ.JË@ ¨ñK Toolchain, Type mismatch,  ¨ñJË@ ú¯ ¬CJk@ Toolkit, Typesetting, Uninstaller, U Union, Ubiquitous computing, Uniprocessor, Ultra-large-scale, Unique, Umount,  Unique key, ɒ¯ Unique sales point, Unable, èPY ®Ë@ÐY« Unary, Unit, èY gð Unary operator, Unit in last place, Unasserted, Unit testing, Universal, Unavailable,  Q¯ñJÓ Q « Universal address, Unchanged,  Q ª Ó Q « Universal quantifier, Uncompression, Universal thunk, Uncountable, Universe of discourse, Uncover, Unix, Uncrypted, ºK ñ K Uncurrying, Unknown, Èñêm.× Undelete, Unknown host,  ¬ðQªÓ Q « ­J ’ ‚Ó Underflow, Unlimited, Underline, Unlink, Under line, Unload, Underlining, Unlock,  Underlying, É®®Ë@ZAªË@ Unmark, Underscore, ® ƒ Q¢‚ Unmarked, ú Î Undo, (É KYªK) ©k. @QK Unmount, ɒ¯ Undocumented feature, Unmute, Unexpected end,     Unnamed, 骯ñJÓ Q «é KAîE ù҂ Ó Q « Unexpected error,  Unnormalised, ©¯ñJÓ Q « A¢k Unfold, Unprotect, Ungroup, Unproto, Unpublished, Unhide, PAê£@ Unread, Unicode, Xñº JKñ K Unread only, Unification, Unrestricted, × Q   Q Unifier, Pñ’m «,Y J®Ó « Unsent, Uniform resource, Unshielded twisted pair, Uniform Resource Identifier, XPñÖÏ ú×A¢ ¬QªÓ Unspecified, × Q Unify, XYm « Unstage, Uninstall, Unsubscribe, ÉJj‚Ë@ZAª Ë@ User base, . User-defined, Unsupported, Ðñ«YÓ Q« User defined,  Untitled, ÐYjJ‚ÖÏ@ á ÓXYm× àñJªÓ Q « User directory, Untyped, User-friendly,  Unzip, Ð@YjJƒB@ ÉîD ­ÊÖÏ@¡ª“ ½¯ User id, Up, Uparrow, User identifier, ÐYj J‚ÖÏ@ ¬ QªÓ  User interface, Update, I KYm' Updating, User name, ÐYj J‚Ó Õæ @ Upgrade,   Username,  é J¯QK ÐYjJ‚ÖÏ@ Õæ @ Upgradeability, Utility,  éÊ Jƒð Upload, ©¯P Utility-coder, Upper, Utility window, Upper bound, V Upper case, Q J.» ¬Qk Vacuum tube, Upper memory block, ¨Q®ÓÐAÖޕ Valency, Upper Stream, Upright, Valid, lÌ'A“ Upstream, Validate,     , éÊgYÖÏ@ HA KA JJ. Ë@) ém• á Ó ‡®m' Uptime, (...tÌ'@ ,l×@QË@ ­ KA £ð Upward closure, . . Validation,    Urban legend, éÓCƒ á Ó ‡®m' Valid chars,   Urgent, ÉgA« Õæ ʃ © J¯ñK . Validity,  Urgent condition, øPðQå• Qå é JkC“ Value,   URI, éÒ J¯ Url, Value-added,   éÒ J®Ë@ ¬A’ Ó URL, PA‚Ó Value added reseller, Usability, Value added retailer,     é¯A’ Ó éÒ J¯ ðX †Q®Ó ©KAK. Usage, ÈAÒªJƒ@ Values,  Õæ ¯ USB, (“ð@) ÐAªË@ úæ„Ê‚Ë@ɯA J Ë@ Vampire tap, Use, Vanilla, Vanity domain, User,  ÐYjJ‚Ó Vaporware, User acceptance testing, Var, User account, ÐYj J‚ÖÏ@HA‚k . Variable, Qª JÓ User agent, ÐYjJ‚ÖÏ@É J»ð Variable declaration, Variance, Very-large-scale, Vet, Variant,  éª KñJ K VFS,     Variations,  Q  . éK.AJºÊË éÊK.A®Ë@ Y£ HA ¢¢m× H@ ªK VGA, Vector, éj. JÓ Via, Vector font, Video,  Vector graphics,  é JKQÓ é Jêj. JÓ HA JÓñƒP Video adapter, Vector processor, Video card,  Vector space, HA JKQÓ é¯A¢. Veeblefeetzer, Video compression, ù KQÓ¡ª“ Vendor, Video conference, ©KAK. ùKQÓ ¨AÒJk. @ Video conferencing, Ventilator card,    é KñîE é¯A¢. Video dial tone, Verbage, Video display terminal, Verbatim copy, Video interface,  Verbose, ñ KY J¯ éêk. @ð I. J¢Ó Video memory, Verification,    ‡J ®m' Video (random, Verified, Video random access memory, Verify,    ' Video terminal,   ‡J ®m é JKñ KQ ®ÊK é J¯Q£ Version, P@Y“@ View, Q « Versioning,  èPY“@ Viewer, Qê¢ Ó Versions, H@P@Y “@ View model, Vertex, Viewport, QªË@ Y®JÓ Vertical, øXñÔ« ,úæ @P View transform, View volume, Vertical Alignment,  × øXñÓA« è@XAm Vim, Vertical application, Violation,  Vertical bar,  †Qk øXñÓA«¡ Qå Viole, Vertical blanking, Virgule, Vertical drive, Vertical encoding, Virtual, ùÒëð Vertical interval, Virtual address, øQëA¢ Ë@ à@ñ J ªË@ Vertical loop combination, Virtual cache, Vertically, A KXñÓA« Virtual circuit, Vertical microcode, Virtual connection, Vertical refresh, Virtual Console, Vertical refresh rate, Virtual Desktop,   I. JºÖÏ@ i¢ƒ é J®Êg Vertical scan rate, Virtual device, Virtual disk, Von Neumann, John, àA ÓñJK àñ ¯ àñ k Virtual hos, . Von Neumann machine,   Virtualization, àAÓñ JK àñ¯ éË@ Von Neumann ordinal, Virtual machine, øQëA£ PA êk . V-Sync, éJƒ@P éJ Ó@Q Ó Virtual memory,   é KQëA£ èQ»@X Virtual path, W Virtual point of presence, Waiting, PA¢ JK@ Virtual reality, Wait state, PA¢ JK@ éËAg Virtual server,  ø QëA£ Õ®ÊÓ Wall clock time, Virus, Q Wallpaper,   €ð ¯ éƒA ‚Ë@ é J®Êg Visibility, éKðP Wank, Want list, Visible, ùKQ Ó WAP, Visible bell, ùKQ Ó €Qk H. @ñË@ . Wap, Visit,  H. @ð èPA KP Warchalk, Visited link, Wardialer, Visual, ø Qå”. Wardriving, Visual bell, Warez, ù KQÓ €Qk. Visual editor, Warning, P@Y K@ Visualisation, Warranty, Visualization, àAҒË@ Watch,   Visual language, éJ.¯@QÓ Visual programming, Water, ZAÓ Visual programming environment, Watermark,   Visual programming language, é JKAÓ éÓC« Wave,  Viz, ék. ñÓ Wave division multiplexing, Voice mail,  úGñ“ Y KQK. Wavelength division multiplexing, Voice recognition, Wavelet, Voip, Wavetable, Volatile, QK A¢JÓ Wavetable synthesis, Volatile memory,   Wavyline, èQK A¢JÓ èQ»@X Volatile storage, Weakly typed, Volatile variable, Weak typing, Volume, k Web, Ñm. H. ð Von Neumann architecture, Web browser,   éºJ.‚Ë@ ­’JÓ Von Neumann integer, Web cam, iJ j’Ë@ àA Óñ JK àñ ¯ XY« White trash, Webcam, I. Kð @Q ÓA¿ Webcasting, Wide area network, 骃@ð éºJƒ Webhead, . Wide character, Weblint, ‘ Q« ¬Qk Widge, Weblog, Widget,  Web master,  ékX𠩯ñÓ QK YÓ . Widow,  Webmaster,  éÊÓP@ ©¯ñÓ QK YÓ Webmin, Width, Q « Webmistress, Wi-fi, Webmonkey, Wi fi, Webpage, Wiggles, Web page,    Wiki, é JºJ.ƒ éj®“ ú ¾ Kð Web server, Wild card, ZAgñë é¯A ¢ H. ð ÐðXAg . . Webserver,  Wildcard, éºJ.‚Ë@ÐXAg ÈYK. ¬Qk Winbind, Website, I K QKB@ úΫ ©¯ñ Ó Web smith, Window, èY ¯A K Wedgie, Window control, Week, Window frame,  ¨ñJ.ƒ@ èY¯AJË@PA£@ Window gravity, Weekday, PAîE Window icon,    Weekend,  èY¯AJË@ éKñ®K@ ¨ñJ.ƒB@ éÊ¢« Windowing system, Y ¯@ñ J Ë@ÐA¢  Weeks, © JK.Aƒ@ Window manager,  Weight, Y¯@ñJË@Ñ¢JÓ àPð Window raster, Weighted search,  ' àðPñÓ Im . Windows, Well-connected, PðY J Kð Windows messaging, Well-known port, ¬ðQ ªÓ Y ® J Ó Windows tiling, Well-ordered set, Window system, Whacker, Y¯@ñKÐA¢ Wipe, Whalesong, Wheel bit, Wired, ú¾Êƒ While, Wireframe model,

White, ‘ JK.@ Wireless, ú¾ÊƒB White box testing, Wireless bitmap, Whitelist, Wireless local area network,  ×     é JÊm 鮢JÓ éºJ.ƒ White paper, úæ ®KY J ‚Ó é JºÊƒB Wish list, Whitespace, ɓA¯ With, ©Ó Workstation, ÉÔ« é¢m× With copy,  Workweek, éj‚ ©Ó ÉÔ« ¨ñJ.ƒ@ Within epsilon of, World, ÕËA« Wizard,  YƒQ Ó World-readable,  A JÖÏA« ZðQ®Ó Wizard mode, YƒQ Ó¡Öß Worm,   I KQK@ èXðX Word, Qå”J «: éÒÊ¿ Wormhole, Wormhole routing, Word processing,  Ì HAÒʾË@ ém. 'AªÓ Wound around the axle, Word processor, ñ’ lÌ.'AªÓ Wrap, Words,  Wrapper, HAÒÊ¿ ¬C« Word size,  Wrapping, éÒÊ¿ Ñm.k Word spamming, Wrats nest, Wordwrap, Write,  I. J»@ Word wrap, HA ÒʾË@ ¬A ® JË@ Write-back, Work, Write buffer, Write-only language, Work area, ÉÔ« 鮢J Ó  Write-protect, éKAJºË@Y“ ùÒm' Workaround, É KAm' . Write queue,  Work around, éK.AJ» ­“ Write side,   Workbook, €@Q» éK.AJ»I. KAg. Write-through, Workflow, ÉÒªË@ Q ƒ Write-thru, Work group, ÉÔ« é«ñÒm× . Writing system, éKAJ»ÐA¢  Workgroup,  . ÉÔ« é«ñÒm.× WVLAN, Working, Working directory, X Working memory, X Align,  Working set, ­J “QK X-axis, × Working set model, ú æ Jƒ Pñm XDMCP socket,   Work in progress,  éJÊjÖÏ@ I »ñ‚Ë@ PA m.'B @Y J¯ ÉÔ« XML, Worksheet, «  ýæk ÉÔ é¯Pð Xor,  Workspace, ÉÒªË@ ékA‚Ó X server, Workspace object, Workspaces, ÉÔ« HA gA‚Ó Y Workspace switch, Y-axis, × ø XA“ Pñm Work station, ÉÔ« é¢m× Year, éJ ƒ Years, H@ñ J ƒ

Yellow, Q® “@ Yes, ѪK Yield, YKA « Yocto-, Yotta-, Yottabyte, Z Z-axis, × ú æ J« Pñm Z-buffer,   I. KQÓ I ¯ñÓ àQ m× Z clipping, Zepto, Zero, Q® “ Zero assignment, Zero-content, øñJjÖÏ@Q® “ , øñJjÖÏ@ ¨PA ¯ Zero-order, Zero state,   é KQ®“ éËAg Zetta-, Zettabyte, Zigzag, Zigzagline, Zip Drive,  I £ Q¯ Zip file, ñª ’ Ó ­Ê Ó Zombie, úæÓðP Zombie process, . Zone, †A ¢ Zoning,   ‡£AJÓ úÍ@ Õæ ‚®K Zoo,  HA K@ñ JmÌ'@ é® KYg Zoom, Zoom in,  Q J.ºK, Q.» Zoom Out, Zoom out,  Q ª ’ ,Qª “ FreeBSD Documentation License

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