Newsgroups: soc.culture.vietnamese
\nFrom: lam@tesla.ece.wisc.edu
\nSubject: Glossary of Computer Science terms
\nMessage-ID:
\nOriginator: daemon@media-lab.media.mit.edu
\nOrganization: SCV Relay
\nDate: Mon, 7 Dec 1992 21:14:18 GMT
\nLines: 649<\/p>\n
Thu+a ca’c Netters :<\/p>\n
Sau -da^y la` mo^.t ba?ng -do^’i chie^’u danh tu+` Vie^.t-My~-Pha’p ve^`
\ntin ho.c. Mong ca’c Netters go’p y’ kie^’n.<\/p>\n
———————————————————————-<\/p>\n
Attached is a draft glossary of Vietnamese computer terms and their
\nEnglish and French equivalents, that were compiled by the folks at the
\nInstitute of Informatics (Vie^.n Tin ho.c) in Viet Nam as part of an
\neffort in the publication of a general encyclopedia.<\/p>\n
#include <\/p>\n
—– Begin Included Text ——————————————-<\/p>\n
Wilhelm Schickard (1592-1635)
\nBlaise Pascal (1623-1662)
\nGottfried Wilhelm Leibniz (1646-1716)
\nCharles Babbage (1791-1871)
\nGeorge Boole (1815-1864)
\nHoward Aiken (1900-1973)
\nJohn von Neumann (1903-1957)
\nGrace Murray Hopper (1906-1992)
\nAlan Turing (1912-1954)
\nPhan Ddi`nh Die^.u (1936- )<\/p>\n
A<\/p>\n
ACM (Association for Computing Machinery)
\nASCII (American Standard Code for Information Interchange)
\nan go^ ri’t [xem thua^.t toa’n]
\nan toa`n du+~ lie^.u (data security)
\na?nh nhi. pha^n (bit image)
\na?nh bo^. nho+’ (bitmap)<\/p>\n
B<\/p>\n
bai (byte; byte)
\nba`n ddie^`u khie^?n (console; console, pupitre)
\nba`n phi’m (keyboard; clavier)
\nba`n phi’m chu+~ – so^’ (alphanumeric keyboard; clavier alphanume’rique)
\nba?n (version)
\nba?n ghi (record; enregistrement)
\nba?n in (listing)
\nba?n ma^~u (prototype)
\n\tma?ng (array; tableau)
\nba?ng ti’nh ddie^.n tu+? (spreadsheet)
\nba?o ma^.t (confidentiality; confidentialite’)
\nba?o tri` (maintenance; maintenance)
\nba(m (hashing)
\nba(ng ddu.c lo^~ (perforated tape)
\nba(ng tu+` (magnetic tape)
\nbi`a ddu.c lo^~ (perfored card)
\nbi`a ddie^`u khie^?n (control card; carte de controle)
\nbie^n di.ch (compilation)
\nbie^’n (variable; variable)
\nbie^’n cu.c bo^. (local variable)
\nbie^’n toa`n cu.c (global variable)
\nbit (tu+` tie^’ng Anh, vie^’t ta(‘t cu?a binary digit)
\nbie^?u die^~n tri thu+’c (knowledge representation)
\nbo’ buo^.c (coercion)
\nbo^’ tri’ trang (pagination)
\nbo^. chuye^?n ddo^?i (converter (ADC, DAC); convertisseur (AIN, NIA))
\nbo^. chu+~ (font)
\nbo^. co^.ng (adder)
\nbo^. dda xu+? li’ (multiprocessor)
\nbo^. dde^’m (counter; compteur)
\nbo^. ki’ tu+. (character set; alphabet)
\nbo^. ma~ (code set)
\nbo^. ma~ ASCII [xem ASCII]
\nbo^. ma~ mo+? ro^.ng (extended code set)
\nbo^. ma~ VSCII [xem VSCII]
\nbo^. nho+’ (memory)
\nbo^. nho+’ a?o (virtual memory)
\nbo^. nho+’ a^?n (cache memory)
\nbo^. nho+’ chi’nh (main memory)
\nbo^. nho+’ ke^’t ho+.p (associate memory)
\nbo^. nho+’ dde^.m (buffer)
\nbo^. nho+’ ddo^.ng (dynamic memory)
\nbo^. nho+’ pha^n trang (paged memory)
\nbo^. nho+’ phu. (secondary memory)
\nbo^. nho+’ RAM (Random Access Memory)
\nbo^. nho+’ ROM (Read Only Memory)
\nbo^. nho+’ ti~nh (static memory)
\nbo^. no^’i ghe’p (interface)
\nbo^. pha’t sinh tu+. ddo^.ng chu+o+ng tri`nh (automatic program generator)
\nbo^. thi’ch u+’ng (adaptor; adaptateur)
\nbo^. tri`nh (package; progiciel hoa(.c produit – programme)
\nbo^. vi xu+? li’ (microprocessor)
\nbo^. xu+? li’ (processor)
\nbo^. xu+? li’ trung ta^m (CPU)
\nbu’t sa’ng (light pen)
\nbuy’t (bus)<\/p>\n
C<\/p>\n
CAD\/CAM
\nCD-ROM
\nca`i dda(.t (implementing; implementation)
\nca(‘t da’n (cut-paste)
\nca^u le^.nh (statement; instruction)
\nca^`n vu. (server; serveur)
\nca^.p nha^.t (update; mise a` jour)
\nca^’p pha’t (allocation; allocation)
\nca^’t giu+~ (save)
\nca^’u hi`nh (configuration; configuration)
\nca^u le^.nh (statement; instruction)
\nca^’u tru’c (structure; structure)
\nca^’u tru’c ca^y (tree structure)
\nca^’u tru’c du+~ lie^.u (data structure)
\nca^’u tru’c danh sa’ch (list structure)
\nca^’u tru’c chu+o+ng tri`nh (program structure)
\nca^’u tru’c ddie^`u khie^?n (control structure)
\nca^’u tru’c ma.ng ma’y ti’nh (network structure)
\n\tchu+o+ng tri`nh co’ ca^’u tru’c (structured program)
\nca^y (tree; arbre)
\ncha(~n le? (parity; parite’)
\ncha(.n (blocking)
\ncha^?n ddoa’n (diagnostic; diagnostique)
\nche da^’u tho^ng tin (information hiding)
\nchen ha`ng (preempting; pre’emption)
\nche^’ ba?n ddie^.n tu+? (desktop publishing)
\nche^’t ta(‘c (deadlock)
\nchie^’u (projection)
\nchi? le^.nh (command)
\nchi? so^’ (index)
\nchip (chip; pastille)
\ncho.n ddu+o+`ng (routing; routage)
\ncho^`ng (stack; pile)
\nchua^?n (standard)
\nchua^?n ho’a (standardization; normalisation)
\nchuye^?n ddo^?i (conversion; conversion)
\nchuye^?n ma.ch (switching; commutation)
\nchu’ gia?i (comment; commentaire)
\nchu+’ng minh ddi.nh ly’ (theorem proving)
\nchu+’ng minh tu+. ddo^.ng (automatic proof)
\nchu+o+ng tri`nh (program; programme)
\nchu+o+ng tri`nh bie^n di.ch (compiler)
\nchu+o+ng tri`nh chi’nh (main program)
\nchu+o+ng tri`nh con (subroutine; sous-programme)
\nchu+o+ng tri`nh ddi’ch (object program)
\nchu+o+ng tri`nh thu+? (test program)
\nchu+o+ng tri`nh go^’c (source program)
\nchu+o+ng tri`nh tie^.n i’ch (utilities; utilitaires)
\ncon cha.y (cursor; curseur)
\ncon chuo^.t (mouse)
\ncon tro? (pointer; pointeur)
\nco^ng nghe^. pha^`n me^`m (software engineering; ge’nie logiciel)
\nco^ng nghe^. tri thu+’c (knowledge engineering)
\nco^?ng (gate; port)
\nco^?ng song song (parallel port)
\nco^?ng no^’i tie^’p (serial port)
\nco+ che^’ la^.p lua^.n
\nco+ so+? du+~ lie^.u (data base; base de donne’es)
\nco+ so+? du+~ lie^.u pha^n ta’n (distributed data base)
\nco+ so+? tri thu+’c (knowledge base; base de connaisance)
\nco+` (flag; drapeaux)
\ncu’ pha’p (syntax; syntaxe)
\ncu+?a so^? (window; fene^tre)<\/p>\n
D<\/p>\n
da.ng Backus-Naur (BNF)
\ndanh mu.c (directory; catalogue)
\ndanh sa’ch (list)
\nda.y ho.c nho+` ma’y ti’nh
\n\tky’ he^. (signature)
\nda^’u pha?y ti~nh (fixed point; virgule fixe’)
\nda^’u pha?y ddo^.ng (floating point; virgule flotante)
\nda^’u ta’ch (delimiter)
\ndi. bo^. (asynchronous)
\ndi.ch (translation)
\ndi.ch che’o (cross-translation)
\ndi.ch chuye^?n (shift)
\ndi.ch tu+. ddo^.ng (automatic translation)
\ndi.ch vu. du+~ lie^.u
\ndi.ch vu. vie^~n tin
\ndo`ng du+~ lie^.u (data flow)
\ndo.n ra’c (garbage collection)
\ndung lu+o+.ng bo^. nho+’ (capacity)
\ndung sai (fault tolerant)
\ndu+ thu+`a (redundant)
\ndu+~ lie^.u (data)<\/p>\n
Dd<\/p>\n
dda chu+o+ng tri`nh (multiprogram)
\ndda na(ng (general purpose)
\ndda nhie^.m (multitasking)
\ndda xu+? li’ (multiprocessing)
\ndda(.c ta? (specification)
\ndda^`u cuo^’i (terminal)
\ndda^`u ddo.c\/ghi (read\/write head)
\ndde^` mo^ (demonstration)
\ndde^. qui (recursion)
\nddi~a tu+` (disk)
\nddi~a cu+’ng (hard disk)
\nddi~a me^`m (floppy disk)
\nddi~a quang (optical disk)
\nddi.a chi? (address)
\nddi.a chi? tuye^.t ddo^’i (absolute address)
\nddi.a chi? tu+o+ng ddo^’i (relative address)
\nddi.a chi? a?o (virtual address)
\nddie^.n toa’n [xem tin ho.c]
\nddie^`u khie^?n ho.c (cybernetics)
\nddie^`u khie^?n so^’ (digital control)
\nddie^`u kie^.n (condition)
\nddi.nh danh (identification)
\nddi.nh ddi.a chi? (addressing)
\nddi.nh vi. (location)
\nddo.c (read)
\nddo’ng go’i (packing)
\nddo^` ho.a ma’y ti’nh (computer graphics)
\nddo^`ng du.ng (reentrant)
\nddo^. pha^n gia?i (resolution)
\nddo^. ddo hie^.u na(ng (performance)
\nddo^. phu+’c ta.p (complexity)
\nddo^. phu+’c ta.p thua^.t toa’n
\nddo^. phu+’c ta.p ti’nh toa’n
\nddo^. tin ca^.y (reliability)
\nddo^’i (argument)
\nddo^’i sa’nh (match)
\nddo^’i thoa.i ngu+o+`i-ma’y (man-machine dialog)
\nddo^’i tu+o+.ng (object)
\nddo^`ng bo^. ho’a (synchronization)
\nddo+n the^? (module)
\nddo+n vi. ddie^`u khie^?n (control unit)
\nddo+n vi. ddie^`u khie^?n ngoa.i vi (peripheral control unit)
\nddo+n vi. so^’ ho.c va` logic
\nddo+n vi. xu+? li’ trung ta^m (CPU)
\nddu’ng dda(‘n (correctness)
\nddu.ng ddo^. (collision)<\/p>\n
E<\/p>\n
ETHERNET<\/p>\n
G<\/p>\n
ga’n (assignment; affectation)
\ngia? le^.nh (pseudocode)
\ngia?i ma~ (decode; decodage)
\ngiao die^.n (interface)
\ngiao di.ch (transaction)
\ngiao thu+’c (protocol; protocole)
\ngiao tie^’p
\n\tdda^`u no^’i (connector)
\nghi (write)
\ngo.i (call)
\ngo.i theo gia’ tri. (call by value)
\ngo.i theo te^n (call by name)
\ngo.i theo tham kha?o (call by reference)
\n\tlie^n ho+.p (pipeline)
\ngo+~ lo^~i (debug)<\/p>\n
H<\/p>\n
ha`m (function; fonction)
\nha`ng ddo+.i (queue)
\nhe^. chuye^n gia (expert system)
\nhe^. dde^’m
\nhe^. dde^’m nhi. pha^n (binary numeration)
\nhe^. ddie^`u ha`nh (operating system; syste`me d’e’xploitation)
\nhe^. ddie^`u ha`nh CP\/M
\nhe^. ddie^`u ha`nh DOS
\nhe^. ddie^`u ha`nh UNIX
\nhe^. ddie^`u ha`nh ma.ng (network operating system)
\nhe^. pha’t trie^?n (development system)
\nhe^. qua?n tri. co+ so+? du+~ lie^.u (data management system)
\nhe^. tho^’ng (system)
\nhe^. tho^’ng phu+’c ta.p (complex system)
\nhe^. ddie^`u pho^’i (monitor)
\nhe^. tro+. giu’p quye^’t ddi.nh
\nhie^?n thi. (display)
\nhie^.u ba`i (token)
\nhie^.u u+’ng phu. (side effect; effet de bord)
\nho.a tie^’t [xem i co^n]
\nho.c tu+. ddo^.ng
\nho^` so+ (document)
\nho+.p di.ch (assembling)
\nho+.p ngu+~ (assembly language)
\nho^.p thu+ (mail box)<\/p>\n
I<\/p>\n
IBM (International Business Machines)
\nIFIP (International Federation for Information Processing)
\nISO (International Organization for Standardization)
\ni co^n (icon)<\/p>\n
K<\/p>\n
ke^nh (channel)
\nke^’ thu+`a (inheritance; he’ritage)
\nke^’ thu+`a bo^.i (multiple inheritance)
\nke^’t ghe’p (binding)
\nke^’t ghe’p ddo^.ng (dynamic binding)
\nke^’t no^’i (joint)
\nke^’t xua^’t (output)
\nkha? chuye^?n (portability)
\nkha? ta’i ddi.nh vi. (relocatable)
\nkhai ba’o (declaration)
\nkha(?ng ddi.nh (assertion)
\nkhoa?n mu.c (item)
\nkho^’i (block; bloc)
\nkho+?i dda^`u (initialization; initialization)
\nkho+?i ddo^.ng la.i (mo^`i la.i) (reboot)
\nkho+?i ta.o [xem kho+?i dda^`u]
\nkhuo^n da.ng (format; format)
\nki’ch hoa.t (activate)
\nkie^?m chu+’ng (verification)
\nkie^?m thu+? (test)
\nkie^’n tru’c ma’y ti’nh
\nkie^?u (kie^?u du+~ lie^.u) (type)
\nkie^?m tra kie^?u (type checking)
\nkie^’n tru’c ma’y ti’nh
\nkie^?u (kie^?u du+~ lie^.u) (type)
\nkie^?u du+~ lie^.u tru+`u tu+o+.ng (abstract data type)
\nkie^?u ddo^.ng (dynamic type)
\nkie^?u ma.nh (strong type)
\nkie^?u ti~nh (static type)
\nki’ pha’p (notation)
\nki’ pha’p Ba Lan (Polish notation)
\nki’ pha’p giu+~a (infix notation)
\nki’ pha’p sau (postfix notation)
\nki’ pha’p tru+o+’c (prefix notation)
\nki’ tu+. (character)
\n\tda^’u ca’ch (blank; blanc)<\/p>\n
L<\/p>\n
LAN (vie^’t ta(‘t cu?a Local Area Network)
\nla`m mi.n (refining; rafinement)
\nla(.p (iteration)
\nla^`n ngu+o+.c (backtracking; retour arrie`re)
\nla^.p li.ch (scheduling)
\nla^.p lua^.n (reasoning) [xem co+ che^’ la^.p lua^.n]
\nla^.p lua^.n tu+. ddo^.ng (automatic reasoning)
\n\tsuy lua^.n lu`i (backward chaining)
\n\tsuy lua^.n tie^’n (forward chaining)
\nla^.p lua^.n xa^’p xi? (approximate reasoning)
\nla^.p tri`nh (programming; programmation)
\nla^.p tri`nh co’ ca^’u tru’c (structured programming)
\nla^.p tri`nh ha`m (functional programming)
\nla^.p tri`nh logic (logic programming)
\nla^.p tri`nh hu+o+’ng ddo^’i tu+o+.ng (object-oriented programming)
\nle^.nh (instruction)
\nle^.nh macro
\nli’ thuye^’t ti’nh toa’n (computation theory)
\nlie^n he^. ngu+o+.c (feedback)
\nlie^n ke^’t (link)
\nlie^n la.c (communication)
\nlo~i tu+` (xuye^’n tu+`)
\nlo.c
\nlo^~i (error; bug)
\nlo+`i go.i (call) [xem go.i]
\nlo+’p (class)
\nlu+u ddo^` (flowchart; organigramme)<\/p>\n
M<\/p>\n
ma~ (code; code)
\nma~ ho’a (coding)
\nma.ch (circuit)
\nma.ch ti’ch ho+.p (intergrated circuit)
\nma.ch in (printed circuit)
\nma`n hi`nh (screen)
\nma`n hi`nh tinh the^? lo?ng (LCD – Liquid Crystal Display)
\nma.ng (network; re’seau)
\nma.ng cu.c bo^. (local area network; re’seau local)
\nma.ng ma’y ti’nh (computer network; re’seau des ordinateurs)
\nma.ng Petri (Petri network; re’seau de Pe’tri)
\nma’y a?o (virtual machine)
\nma’y in (printer)
\nma’y in ma tra^.n (matrix printer) [xem ma’y in kim]
\nma’y in do`ng (in ro^.ng) (line printer)
\nma’y in kim (dot printer)
\nma’y in la de (laser printer)
\nma’y in phun (ink-jet printer)
\nma’y que’t hi`nh (scanner)
\nma’y ti’nh (computer; ordinateur)
\nma’y ti’nh bo? tu’i (pocket calculator; calculatrice)
\nma’y ti’nh tu+o+ng tu+. (analog computer; calculateur analogique)
\nma’y ti’nh Pho^n No^i man (von Neumann machine; machine de von Neumann)
\nma’y ti’nh ca’ nha^n (personal computer)
\nma’y ti’nh mini (minicomputer)
\nma’y ti’nh lo+’n (mainframe)
\nma’y Turing (Turing machine; machine de Turing)
\nma’y ve~ (plotter; traceur de courbes)
\nma’y vi ti’nh (micro-computer; micro-ordinateur)
\nma(.c ddi.nh (default)
\nma(.t na. (mask)
\nma^.t ddo^. (density; densite’)
\nma^.t hie^.u (password)
\nma^.t ma~ (cryptography)
\nma^~u (pattern)
\nmie^`n (region; domain)
\nmo’c no^’i (link)
\nmodem (vie^’t ta(‘t cho Modulator-Demodulator)
\nmo^ddun (module; module) [co`n go.i la` ddo+n the^?]
\nmo^’i no^’i
\nMOS (vie^’t ta(‘t cu?a Metal Oxide Semiconductor)
\nmo^ hi`nh (model)
\nmo^ pho?ng (simulation)
\nmo^ to+ suy lua^.n (inference engine)
\nmo^i tru+o+`ng la^.p tri`nh (programming environment)
\nmo^’t (mode)
\nmo^`i (boot) (co`n go.i la` kho+?i ddo^.ng)
\nmo^`i la.i (reboot) [xem kho+?i ddo^.ng la.i]
\nmo+ nuy [xem thu+.c ddo+n]<\/p>\n
N<\/p>\n
na.p (load)
\nne’n (compress)
\nnga(‘t (interruption)
\nnga^n ha`ng du+~ lie^.u (data bank; banque de donne’es)
\nngoa.i vi (peripheral)
\nngo^n ngu+~ ba^.c cao (high-level language; langage e’volue’)
\nngo^n ngu+~ la^.p tri`nh
\nho+.p ngu+~ (assembly language)
\n\tALGOL (vie^’t ta(‘t cu?a ALGOrithmic Language)
\n\tCOBOL (vie^’t ta(‘t cu?a COmmon Business Oriented Language)
\n\tFORTRAN (vie^’t ta(‘t cu?a FORmula TRANslator)
\n\tLISP (vie^’t ta(‘t cu?a LISt Processing)
\n\tPL\/I (vie^’t ta(‘t tu+` Programming Language One)
\n\tBASIC (Vie^’t ta(‘t tu+` Beginner’s All-purpose Symbolic Instruction Code)
\n\tSIMULA
\n\tPASCAL
\n\tNgo^n ngu+~ C
\n\tPROLOG (vie^’t ta(‘t cho PROgramming in LOGic)
\n\tADA
\n\tMODULA 2
\n\tSMALLTALK
\nngo^n ngu+~ thua^.t toa’n (algorithmic language)
\nnguye^n li’ gia?i (resolution principle)
\nngu+~ ca?nh (context; contexte)
\nngu+~ nghi~a (semantics; se’mantique)
\nngu+~ nghi~a ki’ hie^.u (denotational semantics; denotationelle
\nsemantique)
\nngu+~ nghi~a thao ta’c (operational semantics; operationnel semantique)
\nngu+~ nghi~a tie^n dde^` (axiomatic semantics)
\nngu+o+`i ma’y [xem ro^ bo^’t]
\nnha~n (label, tag; e’tiquette)
\nnha^.n da.ng (pattern recognition; reconnaissance des formes)
\nnha^.n da.ng tie^’ng no’i
\nnha^.n bie^’t ba(`ng thi. gia’c
\n\thie^?u ngo^n ngu+~ tu+. nhie^n va` nha^.n bie^’t tie^’ng no’i
\nnha^’t qua’n (consistence)
\nnha^’t the^? (integrity)
\nnha(.t le^.nh (fetch)
\nnhi. pha^n (binary) [xem he^. co+ so^’ hai]<\/p>\n
O<\/p>\n
o^to^mat (automaton; automate)
\no+ristic (phu+o+ng pha’p) [heuristic method; me’thode heuristique]
\no^? ddi~a (disk driver)
\no^? ddi~a a?o (virtual driver)<\/p>\n
P<\/p>\n
pha.m vi (scope)
\npha?n ho^`i [xem lie^n he^. ngu+o+.c]
\n\tca^’p ba^.c (hierarchy; hie’rarchie)
\npha^n chia tho+`i gian (time sharing)
\npha^n chu`m (clustering)
\npha^n ddoa.n (segmentation)
\npha^n loa.i (classification)
\npha^n ta’ch (decomposition; de’composition)
\npha^n ti’ch cu’ pha’p (syntactical analysis; analyse syntaxique)
\npha^n ti’ch du+~ lie^.u (data analysis)
\npha^n ti’ch he^. tho^’ng (systems analysis)
\npha^n trang (paging; pagination)
\npha^`n cu+’ng (hardware)
\npha^`n me^`m (software)
\npha^`n vu+~ng (firmware)
\nphie^n (session)
\nphie^’u (bi`a) (card)
\npho?ng ta.o (emulation)
\npho^ng (chu+~) (font)
\nphu. thuo^.c ha`m (functional dependency)
\npixel (vie^’t ta(‘t cu?a picture element)
\nphu+o+ng pha’p (method; me’thode)
\nphu+o+ng pha’p lua^.n (methodology)
\nphu+o+ng pha’p o+ristic (heuristic method) [xem o+ristic]
\npha^n ti’ch tre^n xuo^’ng (top-down analysis)
\npha^n ti’ch du+o+’i le^n (bottom-up analysis)<\/p>\n
Q<\/p>\n
qua’ ta?i (overloading)
\ntin ho.c qua?n li’ (management; gestion)
\nqua?n tri. du+~ lie^.u (data management)<\/p>\n
R<\/p>\n
ra~nh (track)
\nre~ nha’nh (branch; rupture dese’quence, branchement)
\nro^ bo^’t (robot; robot)
\nro+`i ra.c (discrete)<\/p>\n
S<\/p>\n
sa(‘p xe^’p (sort)
\nsinh so^’ nga^~u nhie^n (random number generation)
\nsie^u ma’y ti’nh (supercomputer)
\nsie^u ngu+~ (metalanguage)
\nsoa.n tha?o (edit)
\nsong song (parallelism; paralle’lisme)
\nso^’ ho’a (digitize)
\nso+ ddo^` kho^’i (flow chart)
\nca’p quang (optical cable)
\nspun linh (spooling)
\nta’i du.ng (reusability)
\nna(ng lu+.c ti’nh toa’n (computing power; puissance de calcul)<\/p>\n
T<\/p>\n
ta`i nguye^n (resource; ressource)
\nta^.p le^.nh (instruction set)
\nte^n go.i (name, identifier)
\nte^.p (file; fichier)
\ntham bie^’n (parameter)
\ntham kha?o (reference)
\nthanh ghi (register)
\nthanh ghi chi? so^’ (indexed register)
\nthanh ghi ddoa.n (segment register)
\nthanh ti’ch lu~y (accumulator)
\nthao ta’c vie^n (operator)
\ntha?o chu+o+ng vie^n (ngu+o+`i la^.p tri`nh) (programmer)
\ntha^m nha^.p (access)
\ntha^n thie^.n ngu+o+`i su+? du.ng (user-friendly)
\nthe^? hie^.n (interpretation)
\nthe^? nghie^.m (instance)
\nthe^’ he^. ma’y ti’nh (computer generation; ge’ne’ration d’ordinateurs)
\nthie^’t bi. hie^?n thi. (display)
\nthie^’t bi. ngoa.i vi (peripheral) [xem ngoa.i vi]
\nthie^’t ke^’ co’ ma’y ti’nh ho^~ tro+. (CAD: computer-aided design)
\nthie^’t ke^’ he^. tho^’ng (systems design)
\nthoa’t ra (escape)
\ntho^ng ba’o (message)
\ntho^ng di.ch (interpretation; interpre’tation)
\ntho^ng tin (information; information)
\ntho+`i gian tha^m nha^.p (access time)
\ntho+`i gian chu ki` (cycle time)
\ntho+`i gian thu+.c (real time)
\nthuo^.c ti’nh (attribute)
\nthu tha^.p du+~ lie^.u (data acquisition)
\nthu tha^.p tri thu+’c (knowledge acquisition)
\nthu? tu.c (procedure; proce’dure)
\nthua^.t toa’n (algorithm)
\nthu+ ti’n ddie^.n tu+? (electronic mail; messagerie e’lectronique)
\nthu+ vie^.n chu+o+ng tri`nh (library; bibliothe`que)
\nthu+.c ddo+n (menu) [xem mo+ nuy]
\ntie^`n to^’ (prefix)
\ntie^’n tri`nh (process)
\ntie^’p ca^.n (approach)
\ntie^’p ca^.n tre^n xuo^’ng (top-down approach)
\ntie^’p ca^.n du+o+’i le^n (bottom-up approach)
\nti`m kie^’m (search)
\nti`m kie^’m nhi. pha^n (binary search)
\ntin ho.c (informatics; informatique)
\ntin ho.c ho’a (computerize)
\ntin ho.c pha^n ta’n (distributed information systems)
\ntoa’n ha.ng (operand)
\ntoa’n lamdda ( -calculus)
\ntoa’n tu+?, phe’p toa’n (operator)
\ntoa`n ve.n (integrity)
\nto^’i u+u ma~ (code optimization)
\nto^’i u+u tho+`i gian (time optimization)
\nto^?ng ho+.p tie^’ng no’i (speech syntheses; synthe`se de la parole)
\nto^?ng kie^?m tra (checksum)
\nto^?ng qua’t (genericity)
\ntra.m la`m vie^.c (workstation)
\ntreo (hang)
\ntri’ tue^. nha^n ta.o (artificial intelligence)
\ntri`nh (routine)
\ntri`nh bie^n di.ch (compiler; compilateur)
\ntri`nh ddie^`u pho^’i (supervisor, scheduler; superviseur)
\ntri`nh ho+.p di.ch (assembler)
\ntri`nh soa.n tha?o (editor; editeur)
\ntri`nh tho^ng di.ch (interpreter)
\ntrong suo^’t (transparency; transparence)
\ntro^.n (merge)
\ntro^’ng tu+` (drum)
\ntrung ta^m ti’nh toa’n (computing center; centre de calcul)
\ntruye^`n du+~ lie^.u (data transmission; transmission de donne’es)
\ntruye^`n tho^ng (communication) [xem lie^n la.c]
\ntruye^`n tho^ng ba’o (message passing)
\ntru+o+`ng (field)
\ntru+`u tu+o+.ng (abstract)
\ntru+`u tu+o+.ng du+~ lie^.u (data abstraction)
\ntru+`u tu+o+.ng ha`m (function abstraction)
\ntru+`u tu+o+.ng tie^’n tri`nh (process abstraction)
\ntru+.c tuye^’n (on-line)
\n\tgia’n tuye^’n (off-line)
\ntua^`n tu+. ho’a (serialization; se’rialisation)
\ntu`y cho.n (option)
\ntu+` (word)
\ntu+` ddie^?n (dictionary; dictionnaire)
\ntu+` ddie^?n du+~ lie^.u (data dictionary)
\ntu+` kho’a (keyword; motcle’)
\ntu+. ddo^.ng (automatic)
\ntu+. ddo^.ng ho’a (automatization)
\ntu+. ddo^.ng ho’a va(n pho`ng (office automation; bureautique)
\ntu+o+ng ho+.p (compatibility; compatibitite’)
\ntu+o+ng ta’c (interaction; interaction)
\ntu+o+ng tranh (concurrency)<\/p>\n
U<\/p>\n
u+u tie^n (priority)<\/p>\n
V<\/p>\n
VSCII (Vietnamese Standard Code for Information Interchange)
\nVLSI (very large scale intergation)
\nva`o\/ra (input\/output)
\nva(n pha.m (grammar; grammaire)
\nvi la^.p tri`nh (micro programming)
\nvi ru’t (virus)
\nvi tin ho.c (microcomputing; micro-informatique)
\nvie^~n tho^ng (telecommunications; te’le’communication)
\nvie^~n tin (remote processing)
\nvie^~n tin ho.c (telematics; te’le’matiques)
\nvo`ng so^’ng (life cycle)
\nvo? (shell)<\/p>\n
X<\/p>\n
xa^u (string; chaine)
\nxe^ ma pho (semaphore; se’maphore)
\nxo^? (dump)
\nxu+? li’ (processing)
\nxu+? li’ tua^`n tu+. (sequential processing)
\nxu+? li’ song song (parallel processing)
\nxu+? li’ vec to+ (xu+? li’ ba?ng) (vector processing)
\nxu+? li’ a?nh (picture processing, image processing)
\nxu+? li’ tho^ng tin (data processing; traitement de l’information)
\nxu+? li’ va(n ba?n (text processing; traitement de texte)<\/p>\n
—– End Included Text ——————————————-<\/p>\n
