Fa-Data Structure and

Algorithm

Ingilizce-Farsca

Sözlük

1183.Başlıq
A ‫ در ﻣﺑﻧﺎي دھدھﻲ‬10 ‫ رﻗﻣﻲ در ﻣﺑﻧﺎي ﺷﺎﻧزده ﻣﻌﺎدل ﻋدد‬، ‫ﺣرف اول از اﻟﻔﺑﺎي اﻧﮕﻠﯾﺳﻲ‬

abolfazl ‫ ﻧﺎﻣﻲ ﺑراي آﻗﺎﯾﺎن‬، ‫اﺑواﻟﻔﺿل‬

abolfazl esfandi <A href

absolute performance guarantee ‫ﺿﻣﺎﻧت ﻛﺎراﯾﻲ ﻣطﻠق‬

abstract ‫اﻧﺗزاﻋﻲ‬

abstract data type ‫داده ﮔوﻧﮫ اﻧﺗزاﻋﻲ‬

accepting state ‫ﺣﺎﻟت ﭘذﯾرﻓﺗﻧﻲ‬

Ackerman's function ‫ﺗﺎﺑﻊ آﻛرﻣن‬

Ackermann's function ‫ﺗﺎﺑﻊ آﻛرﻣن‬

activity ‫ﻓﻌﺎﻟﯾت‬

actual ‫واﻗﻌﻲ‬

acyclic ‫ﺑدور دور‬

acyclic digraph ‫ﮔراف ﺟﮭت دار ﺑﻲ دور‬.

acyclic directed graph ‫ﮔراف ﺟﮭت دار ﺑﻲ دور‬

acyclic graph ‫ﮔراف ﺑﻲ دور‬

adaptive heap sort ‫ﻣرﺗب ﺳﺎز ھرﻣﻲ ﺗطﺎﺑﻘﻲ‬

adaptive k-d tree ‫ درﺧت‬K-d ‫ﺗطﺎﺑﻘﻲ‬

adaptive sort ‫ﻣرﺗب ﺳﺎز ﺗطﺎﺑﻘﻲ‬

address calculation sort ‫ﻣرﺗب ﺳﺎز ﻣﺣﺎﺳﺑﮫ ﮔر آدرس‬

adjacency list ‫ﻟﯾﺳت ﻣﺟﺎورت‬

adjacency list representation ‫ﻧﻣﺎﯾش ﻟﯾﺳت ﻣﺟﺎورت‬

adjacency matrix ‫ﻣﺎﺗرﯾس ﻣﺟﺎورت‬

adjacency matrix representation ‫ﻧﻣﺎﯾش ﻣﺎﺗرﯾس ﻣﺟﺎورت‬

adjacent ‫ﻣﺟﺎور‬
admissible vertex ‫راس ﻣﺟﺎور‬

adversary ‫رﻗﯾب‬

algorithm ‫اﻟﮕورﯾﺗم‬

algorithmic decomposition ‫ﺗﺟزﯾﮫ اﻟﮕورﯾﺗﻣﻲ‬

algorithms ‫ اﺳم ﺟﻣﻊ اﻟﮕورﯾﺗم‬، ‫اﻟﮕورﯾﺗم ھﺎ‬

all pairs shortest path ‫ﻛوﺗﺎھﺗرﯾن ﻣﺳﯾر ﺑﯾن ھر دو راس‬

alphabet ‫اﻟﻔﺑﺎ‬

alternating path ‫ﻣﺳﯾر ﺗﻧﺎوﺑﻲ‬

alternating Turing machine ‫ﻣﺎﺷﯾن ﺗورﯾﻧﮓ ﺗﻧﺎوﺑﻲ‬

alternation ‫ﺗﻧﺎوب‬

amortize ‫ﺳر ﺷﻛن‬

amortized cost ‫ھزﯾﻧﮫ ﺳر ﺷﻛن ﺷده‬

amortized worst case ‫ﺑدﺗرﯾن ﺣﺎﻟت ﺳر ﺷﻛن ﺷده‬

ancestor ‫ﺟد‬

and ‫ ﻋﻣﻠﮕر ﻋطﻔﻲ‬, ‫و‬

ANSI ‫ﻣوﺳﺳﮫ اﺳﺗﺎﻧدارد ﻣﻠﻲ اﻣرﯾﻛﺎ‬

antichain ‫ﭘﺎد زﻧﺟﯾره‬

antisymmetric ‫ﭘﺎد ﻣﺗﻘﺎرن‬

approximation algorithm ‫اﻟﮕورﯾﺗم ﺗﻘرﯾﺑﻲ‬

arc ‫ﻛﻣﺎن‬

array ‫آراﯾﮫ‬

array index ‫اﻧدﯾس آراﯾﮫ‬

array merging ‫ادﻏﺎم آراﯾﮫ‬

articulation point ‫ﻣﻔﺻل‬

articulation vertex ‫ﻣﻔﺻل‬

artificial ‫ ﻣﺻﻧوﻋﻲ‬، ‫ﺳﺎﺧﺗﮕﻲ‬

assignment problem ‫ﻣﺳﺋﻠﮫ ﮔﻣﺎرش‬

association list ‫ ﻟﯾﺳت ﻣﺷﺎرﻛت‬, ‫ﻟﯾﺳت ﺷرﻛت ﭘذﯾري‬

‫‪associative‬‬ ‫ﺷرﻛت ﭘذﯾري ‪ ,‬ﻣﺷﺎرﻛت ‪ ,‬اﻧﺟﻣﻧﻲ‬

‫‪associative array‬‬ ‫آراﯾﮫ اﻧﺟﻣﻧﻲ‬

‫‪asymptotic‬‬ ‫ﻣﺟﺎﻧﺑﻲ‬

‫‪asymptotic analysis‬‬ ‫ﺗﺟزﯾﮫ و ﺗﺣﻠﯾل ﻣﺟﺎﻧﺑﻲ‬

‫ﻛران ﻣﺟﺎﻧﺑﻲ ‪asymptotic bound‬‬

‫ﻛران ﭘﺎﯾﯾن ﻣﺟﺎﻧﺑﻲ ‪asymptotic lower bound‬‬

‫‪asymptotic notation‬‬ ‫ﻧﻣﺎد ﻣﺟﺎﻧﺑﻲ‬

‫‪asymptotic space complexity‬‬ ‫ﭘﯾﭼﯾدﮔﻲ ﺣﺎﻓظﮫ ﻣﺟﺎﻧﺑﻲ‬

‫‪asymptotic time complexity‬‬ ‫ﭘﯾﭼﯾدﮔﻲ زﻣﺎن ﻣﺟﺎﻧﺑﻲ‬

‫ﻛران ﺑﺎﻻي ﻣﺟﺎﻧﺑﻲ ‪asymptotic upper bound‬‬

‫ﺗﺳﺎوي ﻣﺟﺎﻧﺑﻲ ‪asymptotically equal to‬‬

‫‪asymptotically tight bound‬‬ ‫ﻛران دﻗﯾق ﻣﺟﺎﻧﺑﻲ‬

‫‪augmenting path‬‬ ‫ﻣﺳﯾر اﻓزاﯾﺷﻲ‬

‫‪automata‬‬ ‫اﺗوﻣﺎﺗﺎ‬

‫‪automation‬‬ ‫اﺗوﻣﺎﺗون ‪ ,‬ﻣﺎﺷﯾن ﺧودﻛﺎر‬

‫‪automation simulation‬‬ ‫ﺷﺑﯾﮫ ﺳﺎز اﺗوﻣﺎﺗون ‪ ,‬ﺷﺑﯾﮫ ﺳﺎز ﻣﺎﺷﯾن ﺧودﻛﺎر‬

‫‪average‬‬ ‫ﻣﺗوﺳط‬

‫‪average case‬‬ ‫ﺣﺎﻟت ﻣﺗوﺳط‬

‫ھزﯾﻧﮫ ﺣﺎﻟت ﻣﺗوﺳط ‪average case cost‬‬

‫ﻣﯾﺎﻧﮕﯾن زﻣﺎن اﺟرا ‪average computing time‬‬

‫‪AVL tree‬‬ ‫‪.‬ﻣﻌرﻓﻲ ﺷد درﺧت ﻣﺗوازن درﺧﺗﻲ ﻣﺗوازن ﻛﮫ در ﺳﺎل ‪ 1962‬ﺗوﺳط دو رﯾﺎﺿﻲ دان روﺳﻲ ﺑﮫ ﻧﺎﻣﮭﺎي ‪ AVL ,‬درﺧت‬

‫‪B‬‬ ‫ﺣرف دوم از اﻟﻔﺑﺎي اﻧﮕﻠﯾﺳﻲ ‪ ،‬رﻗﻣﻲ در ﻣﺑﻧﺎي ﺷﺎﻧزده ﻣﻌﺎدل ﻋدد ‪ 11‬در ﻣﺑﻧﺎي دھدھﻲ‬

‫‪B+ tree‬‬ ‫‪ +B‬درﺧت‬

‫‪back edge‬‬ ‫ﯾﺎل ﺑرﮔﺷت‬

‫‪backtracking‬‬ ‫ﭘﺳﮕرد‬

‫‪backward‬‬ ‫رو ﺑﮫ ﻋﻘب‬

‫‪bag‬‬ ‫ﮔرداﯾﮫ ‪ ،‬ﻣﺟﻣوﻋﮫ ﭼﻧدﮔﺎﻧﮫ‬

‫‪balance‬‬ ‫ﺗوازن‬
balanced binary search tree ‫درﺧت دودوﯾﻲ ﺟﺳﺗﺟوي ﻣﺗوازن‬

balanced binary tree ‫درﺧت دودوﯾﻲ ﻣﺗوازن‬

balanced k-way merge sort ‫ ﻣرﺗب ﺳﺎز ادﻏﺎﻣﻲ‬k ‫راھﻲ ﻣﺗوازن‬

balanced merge sort ‫ﻣرﺗب ﺳﺎز ادﻏﺎﻣﻲ ﻣﺗوازن‬

balanced multiway merge ‫ادﻏﺎم ﭼﻧد راھﻲ ﻣﺗوازن‬

balanced node ‫ﮔره ﻣﺗوازن‬

balanced quicksort ‫ﻣرﺗب ﺳﺎز ﺳرﯾﻊ ﻣﺗوازن‬

balanced two-way merge sort ‫ﻣرﺗب ﺳﺎز ادﻏﺎﻣﻲ دو راھﻲ ﻣﺗوازن‬

Bellman-Ford algorithm ‫ﻓورد‬-‫اﻟﮕورﯾﺗم ﺑﻠﻣن‬

Benford's law ‫ﻗﺎﻧون ﺑن ﻓورد‬

best case ‫ﺑﮭﺗرﯾن ﺣﺎﻟت‬

best case cost ‫ھزﯾﻧﮫ ﺑﮭﺗرﯾن ﺣﺎﻟت‬

best first search ‫ﺟﺳﺗﺟوي ﺑﮭﺗرﯾن اول‬

BFS ‫ ﺟﺳﺗﺟوي ﺳطﺢ اول‬,

biconnected component ‫ﻣوﻟﻔﮫ دو ھﻣﺑﻧد‬

biconnected graph ‫ﮔراف دو ھﻣﺑﻧد‬

bidirectional bubble sort ‫ﻣرﺗب ﺳﺎز ﺣﺑﺎﺑﻲ دو ﺟﮭﺗﮫ‬

big O notation ‫ ﻧﻣﺎد‬O (‫)ﺑزرگ‬

bin sort ‫ﻣرﺗب ﺳﺎز ﺳطﻠﻲ‬

binary ‫دودوﯾﻲ‬

binary function ‫ﺗﺎﺑﻊ دودوﯾﻲ‬

binary GCD algorithm ‫م )ﺑزرﮔﺗرﯾن ﻣﻘﺳوم ﻋﻠﯾﮫ ﻣﺷﺗرك( دودوﯾﻲ‬.‫م‬.‫اﻟﮕورﯾﺗم ب‬

binary insertion sort ‫ﻣرﺗب ﺳﺎز درﺟﻲ دودوﯾﻲ‬

binary priority queue ‫ﺻف اوﻟوﯾت دودوﯾﻲ‬

binary relation ‫راﺑطﮫ دودوﯾﻲ‬

binary search ‫ﺟﺳﺗﺟوي دودوﯾﻲ‬

binary search tree ، ‫درﺧت ﺟﺳﺗﺟوي دودوﯾﻲ‬

binary trie ‫ﺗراي دودوﯾﻲ‬

bingo sort ‫ﻣرﺗب ﺳﺎز ﺑﯾﻧﮕو‬

binomial distribution ‫ﺗوزﯾﻊ دو ﺟﻣﻠﮫ اي‬

binomial heap ‫ھرم دو ﺟﻣﻠﮫ اي‬

bipartite graph ‫ﮔراف دو ﺑﺧﺷﻲ‬

bipartite matching ‫ﺗطﺎﺑق دو ﺑﺧﺷﻲ‬

bisector ‫ﻧﯾﻣﺳﺎز‬

bit ‫ ﻛوﭼﻛﺗرﯾن واﺣد ﺣﺎﻓظﮫ‬, ‫ﺑﯾت‬

bit vector ‫آراﯾﮫ ﺑﯾﺗﻲ‬

block ‫ﺑﻠوك‬

blocking flow ‫ﺷﺎره اﻧﺳدادي‬

blossom ‫ﺷﻛوﻓﮫ‬

boolean ‫ﺑوﻟﻲ‬

boolean expression ‫ﻋﺑﺎرت ﺑوﻟﻲ‬

boolean function ‫ﺗﺎﺑﻊ ﺑوﻟﻲ‬

bottleneck ‫ﮔﻠوﮔﺎه‬

bottleneck traveling salesman ‫ﻓروﺷﻧده دوره ﮔرد ﺑﺎ ﮔﻠوﮔﺎه‬

bottom-up radix sort ‫ﻣرﺗب ﺳﺎز ﻣﺑﻧﺎﯾﻲ ﭘﺎﯾﯾن ﺑﮫ ﺑﺎﻻ‬

bottom-up tree automaton ‫اﺗوﻣﺎﺗون درﺧﺗﻲ ﭘﺎﯾﯾن ﺑﮫ ﺑﺎﻻ‬

bound ‫ﻛران‬

boundary based representation ‫ﻧﻣﺎﯾش ﻣﺑﺗﻧﻲ ﺑر ﻛراﻧﮫ‬

bounded queue ‫ﺻف ﻛران دار‬

bounded stack ‫ﭘﺷﺗﮫ ﻛران دار‬

branch ‫ﺷﺎﺧﮫ‬

branch and bound ‫اﻧﺷﻌﺎب و ﺣد‬

branching ‫اﻧﺷﻌﺎب‬

breadth first search ، ‫ﺟﺳﺗﺟوي ﺳطﺢ اول‬BFS

Bresenham's algorithm ‫اﻟﮕورﯾﺗم ﺑرزﻧﮭﺎم‬

brick sort ‫ﻣرﺗب ﺳﺎز ﺧﺷﺗﻲ‬

‫‪bridge‬‬ ‫ﭘل‬

‫‪British Museum algorithm‬‬ ‫اﻟﮕورﯾﺗم ﻣوزه اﻧﮕﻠﯾﺳﻲ‬

‫‪Broujerd‬‬ ‫از ﺷﮭرھﺎي اﺳﺗﺎن ﻟرﺳﺗﺎن در ﻛﺷور اﯾران‬

‫‪brute force‬‬ ‫ﻛورﻛوراﻧﮫ‬

‫‪BSP tree‬‬ ‫‪ BSP‬درﺧت‬

‫‪BST‬‬ ‫درﺧت ﺟﺳﺗﺟوي دودوﯾﻲ ‪،‬‬

‫‪bubble sort‬‬ ‫ﻣرﺗب ﺳﺎز ﺣﺑﺎﺑﻲ‬

‫‪bucket‬‬ ‫ﺳطل‬

‫‪bucket array‬‬ ‫آراﯾﮫ ﺳطﻠﻲ‬

‫‪bucket sort‬‬ ‫ﻣرﺗب ﺳﺎز ﺳطﻠﻲ‬

‫روش ﺳطل ﺑﻧدي ‪bucketing method‬‬

‫‪Byzantine agreement prablem‬‬ ‫ﻣﺳﺋﻠﮫ ﻣﻌﺎھده روﻣﻲ‬

‫‪Byzantine generals‬‬ ‫ژﻧراﻟﮭﺎي روﻣﻲ‬

‫‪C‬‬ ‫ﺣرف ﺳوم از اﻟﻔﺑﺎي اﻧﮕﻠﯾﺳﻲ ‪ ،‬رﻗﻣﻲ در ﻣﺑﻧﺎي ﺷﺎﻧزده ﻣﻌﺎدل ﻋدد ‪ 12‬در ﻣﺑﻧﺎي دھدھﻲ‬

‫ﺣﺳﺎﺑﺎن ﺳﯾﺳﺗﻣﮭﺎي ارﺗﺑﺎطﻲ ‪calculus of communicating syste‬‬

‫‪canonical complexity class‬‬ ‫رده ﭘﯾﭼﯾدﮔﻲ ﻣﺗﻌﺎرف‬

‫‪capacitated facility location‬‬ ‫ﻣﻛﺎن ﯾﺎﺑﻲ ﺗﺳﮭﯾﻼت ﺑﺎ ظرﻓﯾت ﻣﺣدود‬

‫‪capacity‬‬ ‫ظرﻓﯾت‬

‫ﻗﯾد ظرﻓﯾت ‪capacity constraint‬‬

‫‪cascading cut‬‬ ‫ﺑرش ﻣﺗواﻟﻲ ‪ ،‬ﻗطﻊ ﻣﺗواﻟﻲ‬

‫‪cell‬‬ ‫ﺳﻠول‬

‫‪cell probe model‬‬ ‫ﻣدل وارﺳﻲ ﺳﻠول‬

‫اﺗوﻣﺎﺗون ﺳﻠوﻟﻲ ‪cellular automaton‬‬

‫‪centroid‬‬ ‫ﻣرﻛز ﺛﻘل‬

‫‪certificate‬‬ ‫ﮔواھﻲ‬

‫‪chain‬‬ ‫زﻧﺟﯾره‬

‫‪child‬‬ ‫ﻓرزﻧد‬

‫‪child field‬‬ ‫ﻓﯾﻠد ﻓرزﻧد‬

Chinese postman problem ‫ﻣﺳﺋﻠﮫ ﭘﺳﺗﭼﻲ ﭼﯾﻧﻲ‬

Chinese remainder theorem ‫ﻗﺿﯾﮫ ﺑﺎﻗﯾﻣﺎﻧده ﭼﯾﻧﻲ‬

Christofides algorithm ‫اﻟﮕورﯾﺗم ﻛرﯾﺳﺗﻔﺎﯾد‬

Christofides heuristic ‫ﻣﻛﺎﺷﻔﮫ ﻛرﯾﺳﺗﻔﺎﯾد‬

chromatic index ‫ﺷﺎﺧص رﻧﮕﻲ‬

chromatic number ‫ﻋدد رﻧﮕﻲ‬

Church-Turing thesis ‫ﺗورﯾﻧﮓ‬-‫ﺗز ﭼرچ‬

circuit ‫ﻣدار‬

circuit complexity ‫ﭘﯾﭼﯾدﮔﻲ ﻣدار‬

circuit value problem ‫ﻣﺳﺋﻠﮫ ارزش ﻣدار‬

circular ‫ داﯾره اي‬، ‫ﺣﻠﻘوي‬

circular list ‫ﻟﯾﺳت ﺣﻠﻘوي‬

circular node ‫ﮔره ﺣﻠﻘوي‬

circular path ‫ ﻣﺳﯾر دوري‬، ‫ﻣﺳر ﺣﻠﻘوي‬

circular queue ‫ﺻف ﺣﻠﻘوي‬

circular representation ‫ ﻧﻣﺎﯾش داﯾره اي‬، ‫ﻧﻣﺎﯾش ﺣﻠﻘوي‬

circularity ‫ داﯾره اي ﺑودن‬، ‫ﺣﻠﻘوي ﺑودن‬

circularity linked list ‫ﻟﯾﺳت ﭘﯾوﻧدي ﺣﻠﻘوي‬

class ‫ ﻛﻼس‬, ‫رده‬

clique ‫ﺧوﺷﮫ‬

clique problem ‫ﻣﺳﺋﻠﮫ ﺧوﺷﮫ‬

closure ‫ﺑﺳﺗﺎر‬

collective recursion‫ﺑﺎزﮔﺷت ﺗﺟﻣﻌﻲ‬

collision ‫ﺗﺻﺎدم‬

comb ‫ﺷﺎﻧﮫ‬

comb sort ‫ﻣرﺗب ﺳﺎز ﺷﺎﺧﮫ اي‬

Communicating Sequential Processes ‫ﭘردازه ھﺎي ﺗرﺗﯾﺑﻲ ﻣرﺗﺑط‬

commutative ‫ﺟﺎﺑﺟﺎﯾﻲ‬
comparison ‫ﻣﻘﺎﯾﺳﮫ‬

comparison based ‫ﻣﺑﺗﻧﻲ ﺑر ﻣﻘﺎﯾﺳﮫ‬

comparison based algorithm ‫اﻟﮕورﯾﺗم ﻣﺑﺗﻧﻲ ﺑر ﻣﻘﺎﯾﺳﮫ‬

comparison sort ‫ﻣرﺗب ﺳﺎز ﻣﻘﺎﯾﺳﮫ اي‬

competition ‫ ھﻣﻛﺎري‬, ‫رﻗﺎﺑت‬

competitive analysis ‫ﺗﺣﻠﯾل رﻗﺎﺑﺗﻲ‬

competitive ratio ‫ﻧﺳﺑت رﻗﺎﺑﺗﻲ‬

complement ‫ﻣﻛﻣل‬

complete binary tree ‫درﺧت دودوﯾﻲ ﻛﺎﻣل‬

complete graph ‫ﮔراف ﻛﺎﻣل‬

complete tree ‫درﺧت ﻛﺎﻣل‬

complex function ‫ﺗﺎﺑﻊ ﭘﯾﭼﯾدﮔﻲ‬

complexity ‫ﭘﯾﭼﯾدﮔﻲ‬

complexity class ‫رده ﭘﯾﭼﯾدﮔﻲ‬

component ‫ﻣوﻟﻔﮫ‬

computable ‫ﻣﺣﺎﺳﺑﮫ ﭘذﯾر‬

computable function ‫ﺗﺎﺑﻊ ﻣﺣﺎﺳﺑﮫ ﭘذﯾر‬

computer ‫ راﯾﺎﻧﮫ‬، ‫ﻛﺎﻣﭘﯾوﺗر‬

computing time ‫ زﻣﺎن اﺟرا‬، ‫زﻣﺎن ﻣﺣﺎﺳﺑﮫ‬

concave ‫ﻣﻘﻌر‬

concave function ‫ﺗﺎﺑﻊ ﻣﻘﻌر‬

concurrent ‫ھﻣزﻣﺎن‬

concurrent flow ‫ﺷﺎره ھﻣزﻣﺎن‬

configuration ‫ﭘﯾﻛرﺑﻧدي‬

conflict ‫ﺑرﺧورد‬

conjunction ‫ﺗرﻛﯾب ﻋطﻔﻲ‬

connected ‫ھﻣﺑﻧد‬

connected component ‫ﻣوﻟﻔﮫ ھﻣﺑﻧدي‬

‫‪connected graph‬‬ ‫ﮔراف ھﻣﺑﻧد‬

‫‪coNP‬‬ ‫ﻛو ان ﭘﻲ‬

‫‪constant‬‬ ‫ﺛﺎﺑت‬

‫ﺗﺎﺑﻊ ﺛﺎﺑت ‪constant function‬‬

‫‪continuous‬‬ ‫ﭘﯾوﺳﺗﮫ‬

‫‪continuous knapsack problem‬‬ ‫ﻣﺳﺋﻠﮫ ﻛوﻟﮫ ﭘﺷﺗﻲ ﭘﯾوﺳﺗﮫ‬

‫‪Cook's reduction‬‬ ‫ﻛﺎھش ﻛوك‬

‫‪Cook's theorem‬‬ ‫ﻗﺿﯾﮫ ﻛوك‬

‫‪cost‬‬ ‫ھزﯾﻧﮫ‬

‫‪counting sort‬‬ ‫ﻣرﺗب ﺳﺎز ﺷﻣﺎرﺷﻲ‬

‫‪critical‬‬ ‫ﺑﺣراﻧﻲ‬

‫‪critical activity‬‬ ‫ﻓﻌﺎﻟﯾت ﺑﺣراﻧﻲ‬

‫‪critical path‬‬ ‫ﻣﺳﯾر ﺑﺣراﻧﻲ‬

‫‪critical path problem‬‬ ‫ﻣﺳﺋﻠﮫ ﻣﺳﯾر ﺑﺣراﻧﻲ‬

‫‪cross edge‬‬ ‫ﯾﺎل ﻣﺗﻘﺎطﻊ ‪ ،‬ﯾﺎل ﻣﺟﺎور‬

‫‪cut‬‬ ‫ﺑرش‬

‫‪cut vertex‬‬ ‫راس ﺑرﺷﻲ‬

‫‪cutting plane‬‬ ‫ﺻﻔﺣﮫ ﺑرﺷﻲ‬

‫‪cutting theorem‬‬ ‫ﻗﺿﯾﮫ ﺑرﺷﻲ‬

‫‪cycle‬‬ ‫دور‬

‫‪cycle free‬‬ ‫ﺑدون دور‬

‫‪D‬‬ ‫ﺣرف ﭼﮭﺎرم از اﻟﻔﺑﺎي اﻧﮕﻠﯾﺳﻲ ‪ ،‬رﻗﻣﻲ در ﻣﺑﻧﺎي ﺷﺎﻧزده ﻣﻌﺎدل ﻋدد ‪ 13‬در ﻣﺑﻧﺎي دھدھﻲ‬

‫‪DAG‬‬ ‫‪.‬ﮔراف ﺟﮭت دار ﺑﻲ دور‬

‫‪DAG shortest paths‬‬ ‫ﻛوﺗﺎھﺗرﯾن ﻣﺳﯾر ھﺎ در ﮔراف ﺟﮭت دار ﺑﻲ دور‬

‫‪data‬‬ ‫داده‬

‫‪data base‬‬ ‫داده ﭘﺎﯾﮕﺎه ‪ ,‬ﭘﺎﯾﮕﺎه داده‬

‫‪data structure‬‬ ‫داده ﺳﺎﺧﺗﺎر ‪ ,‬ﺳﺎﺧﺗﻣﺎن داده‬

‫‪decidable‬‬ ‫ﺗﺻﻣﯾم ﭘذﯾر‬

decidable language ‫زﺑﺎن ﺗﺻﻣﯾم ﭘذﯾر‬

decision ‫ﺗﺻﻣﯾم‬

decision problem ‫ﻣﺳﺋﻠﮫ ﺗﺻﻣﯾم‬

decision tree ‫درﺧت ﺗﺻﻣﯾم‬

decode tree ‫درﺧت رﻣزﮔﺷﺎ‬

decomposable ‫ﺗﺟزﯾﮫ ﭘذﯾر‬

decomposable searching ‫ﺟﺳﺗﺟوي ﺗﺟزﯾﮫ ﭘذﯾر‬

decomposable searching problem ‫ﻣﺳﺋﻠﮫ ﺟﺳﺗﺟوي ﺗﺟزﯾﮫ ﭘذﯾر‬

decomposition ‫ﺗﺟزﯾﮫ‬

degenerate ‫ ﺗﺑﮭﮕون‬، ‫ﺗﻐﯾﯾر ﺷﻛل دادن‬

degenerate tree ‫درﺧت ﺗﺑﮭﮕون‬

degree ‫درﺟﮫ‬

degree-k graph ‫ ﮔراف درﺟﮫ‬k

delete ‫ﺣذف‬

dense ‫ ﺿﺧﯾم‬, ‫ ﻏﻠﯾظ‬, ‫ ﺛﻘﯾل‬, ‫ﻣﺗراﻛم‬

dense graph ‫ﮔراف ﻣﺗراﻛم‬

dense index ‫ﺷﺎﺧص ﭼﮕﺎﻟﻲ‬

depth ‫ﻋﻣق‬

depth first search ‫ ﺟﺳﺗﺟوي ﻋﻣق اول‬, DFS

depth first spanning tree ‫درﺧت ﭘوﺷﺎي ﺟﺳﺗﺟوي ﻋﻣﻘﻲ‬

deque ‫ﺻف دو ﺳر‬

derangement ‫ﭘرﯾش‬

descendant ‫ﻧواده‬

deterministic ‫ﻗطﻌﻲ‬

deterministic algorithm ‫اﻟﮕورﯾﺗم ﻗطﻌﻲ‬

deterministic finite automaton ‫ اﺗوﻣﺎﺗون ﻣﺗﻧﺎھﻲ ﻗطﻌﻲ‬, DFA

deterministic finite state automaton ‫اﺗوﻣﺎﺗون ﺣﺎﻟت ﻣﺗﻧﺎھﻲ ﻗطﻌﻲ‬

deterministic finite state machine ‫ﻣﺎﺷﯾن ﺣﺎﻟت ﻣﺗﻧﺎھﻲ ﻗطﻌﻲ‬

deterministic finite tree automaton ‫اﺗوﻣﺎﺗون درﺧﺗﻲ ﻣﺗﻧﺎھﻲ ﻗطﻌﻲ‬

deterministic pushdown automaton ‫اﺗوﻣﺎﺗون ﭘﺷﺗﮫ اي ﻗطﻌﻲ‬

deterministic tree automaton ‫اﺗوﻣﺎﺗون درﺧﺗﻲ ﻗطﻌﻲ‬

Deutsch-Jozsa algorithm ‫ ﺟوزا‬-‫اﻟﮕورﯾﺗم دوﯾﭻ‬

DFA ‫ اﺗوﻣﺎﺗون ﻣﺗﻧﺎھﻲ ﻗطﻌﻲ‬,

DFS ‫ ﺟﺳﺗﺟوي ﻋﻣق اول‬,

DFS forest ‫ﺟﻧﮕل ﺟﺳﺗﺟوي ﻋﻣق اول‬

diagonal ‫ﻗطر‬

diagonalization ‫ﻗطري ﻛردن‬

diameter ‫ﻗطر‬

dictionary ‫ ﻓرھﻧﮓ داده اي‬, ‫ ﻟﻐت ﻧﺎﻣﮫ‬, ‫دﯾﻛﺷﻧري‬

difference ‫ﺗﻔﺎﺿل‬

digraph ‫ﮔراف ﺟﮭت دار‬

Dijkstra's algorithm ‫اﻟﮕورﯾﺗم داﯾﻛﺳﺗرا‬

dimension ‫ اﻧدازه‬, ‫ﺑﻌد‬

diminishing increment sort ‫ﻣرﺗب ﺳﺎز ﺷﺎﻧﮫ اي‬

dining philosophers ‫ﻓﯾﻠﺳوﻓﮭﺎي ﮔرﺳﻧﮫ‬

directed acyclic graph ‫ ﮔراف ﺑﻲ دور ﺟﮭت دار‬, DAG

directed acyclic subsequence graph ‫ﮔراف زﯾر دﻧﺑﺎﻟﮫ ﺑﻲ دور ﺟﮭت دار‬

directed cycle ‫دور ﺟﮭت دار‬

directed edge ‫ﯾﺎل ﺟﮭت دار‬

directed graph ‫ﮔراف ﺟﮭت دار‬

discrete ‫ﮔﺳﺳﺗﮫ‬

discrete p-center p ‫ﻣرﻛز ﮔﺳﺳﺗﮫ‬

disjoint set ‫ﻣﺟﻣوﻋﮫ ﻣﺟزا‬

disjoint set data structure ‫داده ﺳﺎﺧﺗﺎر ﻣﺟﻣوﻋﮫ ﻣﺟزا‬

disjoint set forest ‫ﺟﻧﮕل ﻣﺟﻣوﻋﮫ ﻣﺟزا‬

disjunction ‫ﺗرﻛﯾب ﻓﺻﻠﻲ‬

distinct ‫ﻣﺟزا‬

distribute ‫ﺗوزﯾﻊ ﺷده‬

distribution sort ‫ﻣرﺗب ﺳﺎز ﺗوزﯾﻌﻲ‬

distributional complexity ‫ﭘﯾﭼﯾدﮔﻲ ﺗوزﯾﻌﻲ‬

divide and conquer ‫ﺗﻘﺳﯾم و ﺣل‬

divide and marriage before conquest ‫ﺗﻘﺳﯾم و ﺗرﻛﯾب ﭘﯾش از ﺣل‬

domain ‫داﻣﻧﮫ‬

Doomsday rule ‫ﻗﺎﻧون روز رﺳﺗﺎﺧﯾز‬

double direction bubble sort ‫ﻣرﺗب ﺳﺎز ﺣﺑﺎﺑﻲ دو ﺟﮭﺗﮫ‬

double hashing ‫در ھم ﺳﺎزي ﻣﺿﺎﻋف‬

double rotation ‫دوران ﻣﺿﺎﻋف‬

doubly ended queue ‫ ﺻف ﺑﺎ دو اﻧﺗﮭﺎ‬, ‫ﺻف دو ﺳر‬

doubly linked circular list ‫ﻟﯾﺳت داﯾره اي دو ﭘﯾوﻧدي‬

doubly linked list ‫ﻟﯾﺳت ﭘﯾوﻧدي دو طرﻓﮫ‬

downward ‫از ﺑﺎﻻ ﺑﮫ ﭘﺎﯾﯾن‬

dual ‫دوﮔﺎن‬

dynamic ‫ﭘوﯾﺎ‬

dynamic algorithm ‫اﻟﮕورﯾﺗم ﭘوﯾﺎ‬

dynamic array ‫آراﯾﮫ ﭘوﯾﺎ‬

dynamic hashing ‫در ھم ﺳﺎزي ﭘوﯾﺎ‬

dynamic programming ‫ﺑرﻧﺎﻣﮫ رﯾزي ﭘوﯾﺎ‬

dynamic tree ‫درﺧت ﭘوﯾﺎ‬

dynamization transformation ‫ﺗﺑدﯾل ﭘوﯾﺎ ﺳﺎزي‬

E ‫ در ﻣﺑﻧﺎي دھدھﻲ‬14 ‫ رﻗﻣﻲ در ﻣﺑﻧﺎي ﺷﺎﻧزده ﻣﻌﺎدل ﻋدد‬، ‫ﺣرف ﭘﻧﺟم از اﻟﻔﺑﺎي اﻧﮕﻠﯾﺳﻲ‬

edge ‫ﯾﺎل‬

edge coloring ‫رﻧﮓ آﻣﯾزي ﯾﺎﻟﻲ‬

edge connectivity ‫ھﻣﺑﻧدي ﯾﺎﻟﻲ‬

edge crossing ‫ﺗﻘﺎطﻊ ﯾﺎﻟﻲ‬

edge node ‫ﮔره ﯾﺎل‬

efficiency ‫ﻛﺎراﯾﻲ‬

element ‫ ﻋﻧﺻر‬, ‫ﻋﺿو‬

element uniqueness ‫ﯾﻛﺗﺎﯾﻲ اﻋﺿﺎ‬

EM ‫ ﺣﺎﻓظﮫ ﺧﺎرﺟﻲ‬,

EM data structure ‫داده ﺳﺎﺧﺗﺎر ﺣﺎﻓظﮫ ﺧﺎرﺟﻲ‬

empty ‫ﺧﺎﻟﻲ‬

entity ‫ﻣوﺟودﯾت‬

entry ‫ داده‬، ‫ دراﯾﮫ‬، ‫ ﻋﻧﺻر‬، ‫ ﻋﺿو‬، ‫ﺟﻣﻠﮫ‬

Euclid's algorithm ‫اﻟﮕورﯾﺗم اﻗﻠﯾدس‬

Euclidean algorithm ‫اﻟﮕورﯾﺗم اﻗﻠﯾدﺳﻲ‬

Euclidean distance ‫ﻓﺎﺻﻠﮫ اﻗﻠﯾدﺳﻲ‬

Euclidean Steiner tree ‫درﺧت اﺷﺗﺎﯾﻧر اﻗﻠﯾدﺳﻲ‬

Euclidean traveling salesman ‫ﻓروﺷﻧده دوره ﮔرد اﻗﻠﯾدﺳﻲ‬

Euclidean traveling salesman problem ‫ﻣﺳﺋﻠﮫ ﻓروﺷﻧده دوره ﮔرد اﻗﻠﯾدﺳﻲ‬

Euler cycle ‫دور اوﯾﻠري‬

Euler tour ‫ﺗور اوﯾﻠري‬

Eulerian graph ‫ﮔراف اوﯾﻠري‬

Eulerian path ‫ﻣﺳﯾر اوﯾﻠري‬

evaluation ‫ارزﯾﺎﺑﻲ‬

exchange sort ‫ﻣرﺗب ﺳﺎز ﺗﻌوﯾﺿﻲ‬

exclusive or ‫ ﯾﺎي اﻧﺣﺻﺎري‬, XOR

exhaust ‫ﭘردازش ﺷدن‬

exhibit ‫ﻧﺷﺎن دادن‬

existential state ‫ﺣﺎﻟت وﺟودي‬

expander graph ‫ﮔراف ﺗوﺳﻌﮫ دھﻧده‬

expansion ‫ اﻧﺑﺳﺎط‬، ‫ ﺑﺳط‬، ‫ﺗوﺳﻌﮫ‬

expansion phase ‫ﻣرﺣﻠﮫ ﺑﺳط‬

‫‪expected‬‬ ‫ﻣورد ﻧظر ‪ ،‬ﻣورد اﻧﺗظﺎر‬

‫‪exponential‬‬ ‫ﻧﻣﺎﯾﻲ‬

‫‪extended binary tree‬‬ ‫درﺧت دودوﯾﻲ ﺗﻌﻣﯾم ﯾﺎﻓﺗﮫ‬

‫‪extended Euclid's algorithm‬‬ ‫اﻟﮕورﯾﺗم اﻗﻠﯾدﺳﻲ ﺗوﺳﻌﮫ ﯾﺎﻓﺗﮫ ‪ ,‬اﻟﮕورﯾﺗم اﻗﻠﯾدﺳﻲ ﮔﺳﺗرش ﯾﺎﻓﺗﮫ‬

‫درھم ﺳﺎزي ﻗﺎﺑل ﺗﻌﻣﯾم ‪extendible hashing‬‬

‫‪external‬‬ ‫ﺧﺎرﺟﻲ‬

‫‪external memory‬‬ ‫‪ , EM‬ﺣﺎﻓظﮫ ﺧﺎرﺟﻲ‬

‫‪external memory algorithm‬‬ ‫اﻟﮕورﯾﺗم ﺣﺎﻓظﮫ ﺧﺎرﺟﻲ‬

‫‪ , EM data structure‬داده ﺳﺎﺧﺗﺎر ﺣﺎﻓظﮫ ﺧﺎرﺟﻲ ‪external memory data structure‬‬

‫‪external merge‬‬ ‫ادﻏﺎم ﺧﺎرﺟﻲ‬

‫‪external merge sort‬‬ ‫ﻣرﺗب ﺳﺎز ادﻏﺎﻣﻲ ﺧﺎرﺟﻲ‬

‫‪external node‬‬ ‫ﮔره ﺧﺎرﺟﻲ‬

‫ﻣرﺗب ﺳﺎز ﺳرﯾﻊ ﺧﺎرﺟﻲ ‪external quicksort‬‬

‫ﻣرﺗب ﺳﺎز ﻣﺑﻧﺎﯾﻲ ﺧﺎرﺟﻲ ‪external radix sort‬‬

‫‪external sort‬‬ ‫ﻣرﺗب ﺳﺎز ﺧﺎرﺟﻲ‬

‫‪extreme‬‬ ‫ﺧﯾﻠﻲ زﯾﺎد ‪ ,‬ﺑﻲ ﻧﮭﺎﯾت‬

‫‪extreme point‬‬ ‫ﻧﻘطﮫ ﻛﻧﺞ‬

‫‪F‬‬ ‫ﺣرف ﺷﺷم از اﻟﻔﺑﺎي اﻧﮕﻠﯾﺳﻲ ‪ ،‬رﻗﻣﻲ در ﻣﺑﻧﺎي ﺷﺎﻧزده ﻣﻌﺎدل ﻋدد ‪ 15‬در ﻣﺑﻧﺎي دھدھﻲ‬

‫‪facility‬‬ ‫ﺳﮭوﻟت‬

‫‪facility location‬‬ ‫ﻣﻛﺎن ﯾﺎﺑﻲ ﺗﺳﮭﯾﻼت‬

‫‪factorial‬‬ ‫ﻓﺎﻛﺗورﯾل‬

‫‪fast transpose‬‬ ‫ﺗراﻧﮭﺎده ﺳرﯾﻊ‬

‫‪feasible‬‬ ‫اﻣﻛﺎن ﭘذﯾر‬

‫‪feasible region‬‬ ‫ﻧﺎﺣﯾﮫ اﻣﻛﺎن ﭘذﯾر‬

‫‪feasible solution‬‬ ‫ﺟواب اﻣﻛﺎن ﭘذﯾر‬

‫‪feedback edge‬‬ ‫ﯾﺎل ﭘس ﺧورد‬

‫‪Ferguson-Forcade algorithm‬‬ ‫اﻟﮕورﯾﺗم ﻓرﮔوﺳن ‪ -‬ﻓرﻛﯾد‬

‫‪Fibonacci‬‬ ‫ﻓﯾﺑوﻧﺎﭼﻲ‬
fibonacci heap ‫ھرم ﻓﯾﺑوﻧﺎﭼﻲ‬

fibonacci heap tree ‫درﺧت ھرم ﻓﯾﺑوﻧﺎﭼﻲ‬

Fibonacci number ‫ﻋدد ﻓﯾﺑوﻧﺎﭼﻲ‬

Fibonacci numbers ‫اﻋداد ﻓﯾﺑوﻧﺎﭼﻲ‬

FIFO ‫ اوﻟﯾن ﺧروﺟﻲ‬- ‫ اوﻟﯾن ورودي‬,

finite ‫ ﻣﺣدود‬، ‫ﻣﺗﻧﺎھﻲ‬

finite automaton ‫اﺗوﻣﺎﺗون ﻣﺗﻧﺎھﻲ‬

finite Fourier transform ‫ﺗﺑدﯾل ﻓورﯾﮫ ﻣﺗﻧﺎھﻲ‬

finite set ‫ﻣﺟﻣوﻋﮫ ﻣﺗﻧﺎھﻲ‬

finite state automaton ‫اﺗوﻣﺎﺗون ﺣﺎﻟت ﻣﺗﻧﺎھﻲ‬

finite state machine ‫ﻣﺎﺷﯾن ﺣﺎﻟت ﻣﺗﻧﺎھﻲ‬

finite state machine minimization ‫ﻛﻣﯾﻧﮫ ﺳﺎزي ﻣﺎﺷﯾن ﺣﺎﻟت ﻣﺗﻧﺎھﻲ‬

finite state transducer ‫ﻣﺑدل ﺣﺎﻟت ﻣﺗﻧﺎھﻲ‬

first-in,first-out ‫ اوﻟﯾن ﺧروﺟﻲ‬- ‫ اوﻟﯾن ورودي‬, FIFO

fixed grid method ‫روش ﺗوري ﺛﺎﺑت‬

flash sort ‫ﻣرﺗب ﺳﺎز ﭘرﺗوي‬

flow ‫ﺷﺎره‬

flow conservation ‫ﺑﻘﺎي ﺷﺎره‬

flow function ‫ﺗﺎﺑﻊ ﺷﺎره‬

flow network ‫ﺷﺑﻛﮫ ﺷﺎره‬

Floyd-Warshall algorithm ‫ وارﺷﺎل‬- ‫اﻟﮕورﯾﺗم ﻓﻠوﯾد‬

Ford-Bellman ‫ ﺑﻠﻣن‬- ‫ﻓورد‬

Ford-Fulkerson method ‫ ﻓﺎﻛرﺳن‬- ‫روش ﻓورد‬

forest ‫ﺟﻧﮕل‬

formal ‫ ﻗراردادي‬, ‫ ظﺎھري‬, ‫رﺳﻣﻲ‬

formal language ‫زﺑﺎن رﺳﻣﻲ‬

formal methods ‫روش ھﺎي رﺳﻣﻲ‬

formal verification ‫درﺳﺗﻲ ﯾﺎﺑﻲ رﺳﻣﻲ‬

forward edge ‫ﯾﺎل رو ﺑﮫ ﺟﻠو‬

fractal ‫ﻓرﻛﺗﺎل‬

fractional knapsack ‫ﻛوﻟﮫ ﭘﺷﺗﻲ ﺗﻘﺳﯾم ﭘذﯾر‬

fractional knapsack problem ‫ﻣﺳﺋﻠﮫ ﻛوﻟﮫ ﭘﺷﺗﻲ ﺗﻘﺳﯾم ﭘذﯾر‬

fractional solution ‫ﺟواب ﻛﺳري‬

free ‫ رھﺎ‬, ‫ راﯾﮕﺎن‬, ‫آزاد‬

free edge ‫ﯾﺎل آزاد‬

free vertex ‫راس آزاد‬

front ‫اﺑﺗدا‬

full ‫ ﺗﻣﺎم‬, ‫ درﺳت‬, ‫ ﻛﺎﻣل‬, ‫ﭘُر‬

full array ‫آراﯾﮫ ﭘر‬

full binary tree ‫درﺧت دودوﯾﻲ ﭘر‬

fully dynamic graph ‫ﮔراف ﻛﺎﻣﻼً ﭘوﯾﺎ‬

fully dynamic graph problem ‫ﻣﺳﺋﻠﮫ ﮔراف ﻛﺎﻣﻼً ﭘوﯾﺎ‬

fully persistent data structure ‫داده ﺳﺎﺧﺗﺎر ﺗﻣﺎم ﻣﺎﻧدﮔﺎر‬

fully polynomial approximation scheme ‫ﺷﻣﺎي ﺗﻘرﯾب ﻛﺎﻣﻼً ﭼﻧد ﺟﻣﻠﮫ اي‬

function ‫ﺗﺎﺑﻊ‬

fuzzy edge ‫ﯾﺎل ﻓﺎزي‬

fuzzy graph ‫ﮔراف ﻓﺎزي‬

fuzzy node ‫ﮔره ﻓﺎزي‬

fuzzy set ‫ﺗﺎﺑﻊ ﻓﺎزي‬

G 9 ‫ ﺑﮫ ﺗوان‬2 = (‫ ﻋﻼﻣت اﺧﺗﺻﺎري ﮔﯾﮕﺎ )ﻣﯾﻠﯾون‬، ‫ھﻔﺗﻣﯾن ﺣرف از اﻟﻔﺑﺎي اﻧﮕﻠﯾﺳﻲ‬

game tree ‫درﺧت ﺑﺎزي‬

gamma function ‫ﺗﺎﺑﻊ ﮔﺎﻣﺎ‬

geometric optimization ‫ﺑﮭﯾﻧﮫ ﺳﺎزي ھﻧدﺳﻲ‬

geometric optimization problem ‫ﻣﺳﺋﻠﮫ ﺑﮭﯾﻧﮫ ﺳﺎزي ھﻧدﺳﻲ‬

global ‫ ﺟﮭﺎﻧﻲ‬, ‫ﺳراﺳري‬

global optimum ‫ﺑﮭﯾﻧﮫ ﺳﺎزي ﺳراﺳري‬

grand children ‫ﻧوه‬

graph ‫ﮔراف‬

graph coloring ‫رﻧﮓ آﻣﯾزي ﮔراف‬

graph drawing ‫ﺗرﺳﯾم ﮔراف‬

graph follower ‫دﻧﺑﺎل ﮔر ﮔراف‬

graph isomorphism‫ﯾك رﯾﺧﺗﻲ ﮔراف‬

graph partition ‫اﻓراز ﮔراف‬

graph theory ‫ﺗﺋوري ﮔراف‬

graphic data structure ‫داده ﺳﺎﺧﺗﺎر ﮔراﻓﯾﻛﻲ‬

greatest common denominator ‫ﺑزرﮔﺗرﯾن ﻣﺧرج ﻣﺷﺗرك‬

greatest common divisor ‫ ﺑزرﮔﺗرﯾن ﻣﻘﺳوم ﻋﻠﯾﮫ ﻣﺷﺗرك‬, GCD

greedy ‫ﺣرﯾﺻﺎﻧﮫ‬

greedy algorithm ‫اﻟﮕورﯾﺗم ﺣرﯾﺻﺎﻧﮫ‬

greedy heuristic ‫ﻣﻛﺎﺷﻔﮫ ﺣرﯾﺻﺎﻧﮫ‬

grid ‫ﺷﺑﻛﮫ‬

grid drawing ‫ﺗرﺳﯾم ﺷﺑﻛﮫ اي‬

Grover's algorithm ‫اﻟﮕورﯾﺗم ﮔراور‬

H ‫ھﺷﺗﻣﯾن ﺣرف از اﻟﻔﺑﺎي اﻧﮕﻠﯾﺳﻲ‬

halt ‫ﺗوﻗف‬

halting problem ‫ﻣﺳﺋﻠﮫ ﺗوﻗف‬

Hamiltonian cycle ‫دور ھﻣﯾﻠﺗﻧﻲ‬

hash ‫در ھم ﺳﺎزي‬

hash address ‫آدرس درھم ﺳﺎز‬

hash function ‫ﺗﺎﺑﻊ در ھم ﺳﺎز‬

hash table ‫ﺟدول در ھم ﺳﺎزي‬

Hausdorff distance ‫ﻓﺎﺻﻠﮫ ھﺎﺳدورف‬

head ‫ﺳر‬

head node ‫ﮔره ﺳر‬

heap ‫ھرم‬

heap sort ‫ﻣرﺗب ﺳﺎز ھرﻣﻲ‬

Herter-Heighway Dragon ‫ ھﺎﯾوي‬- ‫اژدھﺎي ھرﺗر‬

heuristic ‫ﻣﻛﺎﺷﻔﮫ اي‬

hidden ‫ ﭘﻧﮭﺎن‬, ‫ﻣﺧﻔﻲ‬

hidden Markov model ‫ﻣدل ﻣﺎرﻛوف ﻣﺧﻔﻲ‬

histogram sort ‫ﻣرﺗب ﺳﺎز ﻧﻣودار ﺳﺗوﻧﻲ‬

homeomorphic ‫ھﻣﺳﺎن رﯾﺧت‬

homomorphic ‫ھﻣرﯾﺧت‬

horizontal ‫اﻓﻘﻲ‬

horizontal visibility map ‫ﻧﻘﺷﮫ دﯾد اﻓﻘﻲ‬

Horner's rule ‫ﻗﺎﻧون ھرﻧر‬

huffman code ‫ﻛد ھﺎﻓﻣن‬

hybrid algorithm ‫اﻟﮕورﯾﺗم آﻣﯾﺧﺗﮫ‬

hyperedge ‫اﺑر ﯾﺎل‬

hypergraph ‫اﺑر ﮔراف‬

hypothesis ‫ ﻓرﺿﯾﮫ‬، ‫ﻓرض‬

I ‫ ﻧﮭﻣﯾن ﺣرف از اﻟﻔﺑﺎي اﻧﮕﻠﯾﺳﻲ‬، ‫ﻣن‬

ideal ‫اﯾده آل‬

ideal merge ‫ادﻏﺎم اﯾده آل‬

implication ‫اﺳﺗﻠزام‬

implies ‫ﻧﺗﯾﺟﮫ ﻣﻲ دھد‬

in-branching ‫اﻧﺷﻌﺎب ورودي‬

in-degree ‫درﺟﮫ ورودي‬

in-order ‫ﻣﯾﺎن ﺗرﺗﯾب‬

in-order traversal ‫ﭘﯾﻣﺎﯾش ﻣﯾﺎن ﺗرﺗﯾب‬

in-place ‫ ﺑﺎ ﺣﻔظ ﺗرﺗﯾب‬, ‫درﺟﺎ‬

in-place merging ‫ادﻏﺎم درﺟﺎ‬

in-place sort ‫ﻣرﺗب ﺳﺎز درﺟﺎ‬

incident ‫ روﯾداد‬، ‫ ﺗﻼﻗﻲ‬، ‫ﺗﺻﺎدم‬

incident matrix ‫ﻣﺎﺗرﯾس ﺗﻼﻗﻲ‬

inclusion-exclusion privciple ‫اﺻل رد و ﺷﻣول‬

inclusive or ‫ﯾﺎي ﻣﻧطﻘﻲ‬

incompressible ‫ﻓﺷرده ﻧﺷدﻧﻲ‬

incompressible string ‫رﺷﺗﮫ ﻓﺷرده ﻧﺷدﻧﻲ‬

indegree ‫درﺟﮫ ورودي‬

independent ‫ﻣﺳﺗﻘل‬

independent set ‫ﻣﺟﻣوﻋﮫ ﻣﺳﺗﻘل‬

induction ‫اﺳﺗﻘرا‬

induction base ‫ﭘﺎﯾﮫ اﺳﺗﻘرا‬

induction hypothesis ‫ﻓرض اﺳﺗﻘرا‬

induction step ‫ﺣﻛم اﺳﺗﻘرا‬

infix ‫ﻣﯾﺎﻧوﻧدي‬

information ‫اطﻼﻋﺎت‬

information theoretic ‫ﻧظرﯾﮫ اطﻼﻋﺎﺗﻲ‬

information theoretic bound ‫ﻛران ﻧظرﯾﮫ اطﻼﻋﺎﺗﻲ‬

inheritance ‫ ﺗوارث‬، ‫وراﺛت‬

initialize ‫ ﻣﻘدار دھﻲ اوﻟﯾﮫ‬، ‫ﻣﻘدار دھﻲ‬

inline function ‫ﺗﺎﺑﻊ درون ﺧطﻲ‬

inorder ‫ﻣﯾﺎن ﺗرﺗﯾب‬

inorder traversal ‫ﭘﯾﻣﺎﯾش ﻣﯾﺎن ﺗرﺗﯾب‬

insertion sort ‫ﻣرﺗب ﺳﺎز درﺟﻲ‬

instantaneous ‫ ﻓوري‬, ‫آﻧﻲ‬

instantaneous description ‫ﺗوﺻﯾف آﻧﻲ‬

integer ‫ ﻋدد ﺻﺣﯾﺢ‬, ‫ﺻﺣﯾﺢ‬

integer multi-commodity flow ‫ﺷﺎره ﭼﻧد ﻛﺎﻻﯾﻲ ﺻﺣﯾﺢ‬

integer polyhedron ‫ﭼﻧد وﺟﮭﻲ ﺻﺣﯾﺢ‬

interactive ‫ﻣﺣﺎوره اي‬

interactive proof ‫اﺛﺑﺎت ﻣﺣﺎوره اي‬

interactive proof system ‫ﺳﯾﺳﺗم اﺛﺑﺎت ﻣﺣﺎوره اي‬

interface ‫ راﺑط‬، ‫واﺳط‬

interior-based ‫ﻣﺑﺗﻧﻲ ﺑر درون‬

interior-based representation ‫ﻧﻣﺎﯾش ﻣﺑﺗﻧﻲ ﺑر درون‬

intermediate ‫ ﻣﯾﺎﻧﻲ‬، ‫واﺳطﮫ‬

intermediate tree ‫درﺧت ﻣﯾﺎﻧﻲ‬

intermediate vertex‫راس ﻣﯾﺎﻧﻲ‬

internal node ‫ﮔره داﺧﻠﻲ‬

internal path ‫ﻣﺳﯾر داﺧﻠﻲ‬

internal path length ‫طول ﻣﺳﯾر ﻣﯾﺎﻧﻲ‬

internal sort ‫ﻣرﺗب ﺳﺎز داﺧﻠﻲ‬

interpolation ‫درون ﯾﺎﺑﻲ‬

interpolation search ‫ﺟﺳﺗﺟوي درون ﯾﺎﺑﻲ‬

interpolation sort ‫ﻣرﺗب ﺳﺎز درون ﯾﺎﺑﻲ‬

intersection ‫اﺷﺗراك‬

interval tree ‫درﺧت ﺑﺎزه‬

intractable ‫رام ﻧﺷدﻧﻲ‬

intro ‫ ﺧود آزﻣﺎ‬, introspection

intro sort ‫ﻣرﺗب ﺳﺎز ﺧود آزﻣﺎ‬

introspection ‫ ﺧود آزﻣﺎ‬, intro

introspection sort ‫ﻣرﺗب ﺳﺎز ﺧود آزﻣﺎ‬

introspective sort ‫ﻣرﺗب ﺳﺎز ﺧود آزﻣﺎ‬

intuitively ‫ ﺑﺻورت ﺷﮭودي‬، ‫ﺑﺻورت ﺗﺟرﺑﻲ‬

invoke ‫اﺣﺿﺎر ﻛردن‬

invoking ‫اﺣﺿﺎر‬
‫‪irreflexive‬‬ ‫ﻧﺎﺑﺎزﺗﺎب‬

‫‪isomorphic‬‬ ‫ﯾﻛرﯾﺧت‬

‫‪iteration‬‬ ‫ﺗﻛرار‬

‫‪iteration limit‬‬ ‫ﺣد ﺗﻛرار‬

‫‪iterator‬‬ ‫ﺗﻛرار ﻛﻧﻧده‬

‫‪J‬‬ ‫دھﻣﯾن ﺣرف از اﻟﻔﺑﺎي اﻧﮕﻠﯾﺳﻲ‬

‫‪j sort‬‬ ‫‪ j‬ﻣرﺗب ﺳﺎز‬

‫اﻟﮕورﯾﺗم ﺟﺎﻧﺳون ‪Johnson algorithm‬‬

‫‪Johnson's algorithm‬‬ ‫اﻟﮕورﯾﺗم ﺟﺎﻧﺳون‬

‫‪join‬‬ ‫ﺗرﻛﯾب ‪ ،‬اﺗﺻﺎل‬

‫‪K‬‬ ‫ﯾﺎزدھﻣﯾن ﺣرف از اﻟﻔﺑﺎي اﻧﮕﻠﯾﺳﻲ ‪ ،‬ﻋﻼﻣت اﺧﺗﺻﺎري ﻛﯾﻠو = ‪ 2‬ﺑﮫ ﺗوان ‪3‬‬

‫‪k-coloring‬‬ ‫رﻧﮓ آﻣﯾزي ‪k‬‬

‫‪k-dimensional‬‬ ‫ﺑﻌدي ‪k‬‬

‫‪k-way merge‬‬ ‫راھﻲ ‪ k‬ادﻏﺎم‬

‫راھﻲ ‪ k‬ﻣرﺗب ﺳﺎز ادﻏﺎﻣﻲ ‪k-way merge sort‬‬

‫‪Karnaugh map‬‬ ‫ﻧﻘﺷﮫ ﻛﺎرﻧو‬

‫‪Karp reduction‬‬ ‫ﻛﺎھش ﻛﺎرپ‬

‫‪key‬‬ ‫ﻛﻠﯾد‬

‫‪Koenigsberg bridges‬‬ ‫ﭘﻠﮭﺎي ﻛوﻧﯾﮕﺳﺑرگ‬

‫‪Koenigsberg bridges problem‬‬ ‫ﻣﺳﺋﻠﮫ ﭘﻠﮭﺎي ﻛوﻧﯾﮕﺳﺑرگ‬

‫ﭘﯾﭼﯾدﮔﻲ ﻛﺎﻣوﮔروف ‪Kolmogorov complexity‬‬

‫‪Kraft's inequality‬‬ ‫ﻧﺎﻣﺳﺎوي ﻛراﻓت‬

‫‪Kripke structure‬‬ ‫ﺳﺎﺧﺗﺎر ﻛرﯾﭘك‬

‫‪Kruskal‬‬ ‫ﻛروﺳﻛﺎل‬

‫اﻟﮕورﯾﺗم ﻛروﺳﻛﺎل ‪Kruskal's algorithm‬‬

‫‪Kth order Fibonacci numbers‬‬ ‫ام ‪ K‬اﻋداد ﻓﯾﺑوﻧﺎﭼﻲ ﻣرﺗﺑﮫ‬

‫اﻣﯾن ﻛوﺗﺎھﺗرﯾن ﻣﺳﯾر ‪Kth shortest path k‬‬

‫‪KV diagram‬‬ ‫‪ KV‬ﻧﻣودار‬

‫‪L‬‬ ‫دوازدھﻣﯾن ﺣرف از اﻟﻔﺑﺎي اﻧﮕﻠﯾﺳﻲ‬

‫‪l-reduction‬‬ ‫‪ l‬ﻛﺎھش‬

‫‪labeled graph‬‬ ‫ﮔراف ﺑر ﭼﺳب دار‬

‫‪language‬‬ ‫زﺑﺎن‬

‫‪last-in,first-out‬‬ ‫‪ , LIFO‬آﺧرﯾن ورودي‪-‬اوﻟﯾن ﺧروﺟﻲ‬

‫‪latency time‬‬ ‫زﻣﺎن ﺗﺎﺧﯾر ‪ ،‬ﻣدت ﺗﺎﺧﯾر‬

‫‪latest time‬‬ ‫دﯾرﺗرﯾن زﻣﺎن‬

‫‪lattice‬‬ ‫ﺷﺑﻛﮫ‬

‫‪layered digraph‬‬ ‫ﮔراف ﺟﮭت دار ﻻﯾﮫ ﺷده‬

‫‪layered graph‬‬ ‫ﮔراف ﻻﯾﮫ ﺷده‬

‫‪leaf‬‬ ‫ﺑرگ‬

‫‪leaf node‬‬ ‫ﮔره ﺑرﮔﻲ‬

‫اﺗوﻣﺎﺗون ﯾﺎدﮔﯾر ‪learning automata‬‬

‫‪ , LCM‬ﻛوﭼﻛﺗرﯾن ﻣﺿرب ﻣﺷﺗرك ‪ ,‬ك‪.‬م‪.‬م ‪least common multiple‬‬

‫‪least significant digit‬‬ ‫ﻛم ارزش ﺗرﯾن رﻗم ﻣﻌﻧﺎ دار ‪ ،‬رﻗم ﻣﻌﻧﻲ دار ﺑﺎ ﻛﻣﺗرﯾن ارزش‬

‫‪left child‬‬ ‫ﻓرزﻧد ﭼپ‬

‫‪leftist tree‬‬ ‫درﺧت ﭼپ ﮔرا ‪ ،‬درﺧت ﻣﺗﻣﺎﯾل ﺑﮫ ﭼپ‬

‫‪leftmost node‬‬ ‫ﺳﻣت ﭼپ ﺗرﯾن ﮔره‬

‫‪leftmost path‬‬ ‫ﺳﻣت ﭼپ ﺗرﯾن ﻣﺳﯾر‬

‫‪level‬‬ ‫ﺳطﺢ‬

‫‪life time‬‬ ‫زﻣﺎن زﻧدﮔﻲ‬

‫‪linear‬‬ ‫ﺧطﻲ‬

‫‪linear hashing‬‬ ‫درھم ﺳﺎزي ﺧطﻲ‬

‫ﻣرﺗب ﺳﺎز درﺟﻲ ﺧطﻲ ‪linear insertion sort‬‬

‫‪linear list‬‬ ‫ﻟﯾﺳت ﺧطﻲ‬

‫‪linear order‬‬ ‫ﺗرﺗﯾب ﺧطﻲ‬

‫ﻣرﺗب ﺳﺎز وارﺳﻲ ﺧطﻲ ‪linear probing sort‬‬

‫‪linear product‬‬ ‫ﺿرب ﺧطﻲ‬

link ‫ﭘﯾوﻧد‬

linked chain ‫زﻧﺟﯾره ﭘﯾوﻧدي‬

linked list ‫ﻟﯾﺳت ﭘﯾوﻧدي‬

linked queue ‫ﺻف ﭘﯾوﻧدي‬

linked stack ‫ﭘﺷﺗﮫ ﭘﯾوﻧدي‬

linker ‫ﭘﯾوﻧد دھﻧده‬

list ‫ﻟﯾﺳت‬

little o notation ‫ ﻧﻣﺎد‬o ‫ﻛوﭼك‬

LM distance ‫ ﻓﺎﺻﻠﮫ‬LM

logarithmic ‫ﻟﮕﺎرﯾﺗﻣﻲ‬

loser tree ‫درﺧت ﺑﺎزﻧده‬

Lotka's law ‫ﻗﺎﻧون ﻻﺗﻛﺎ‬

low ‫ ارزان‬, ‫ ﺧﻔﯾف‬, ‫ ﭘﺳت‬, ‫ﭘﺎﯾﯾن‬

lower bound ‫ﻛران ﭘﺎﯾﯾن‬

lower triangular matrix ‫ﻣﺎﺗرﯾس ﭘﺎﯾﯾن ﻣﺛﻠﺛﻲ‬

M 6 ‫ ﺑﮫ ﺗوان‬2 = (‫ ﻋﻼﻣت اﺧﺗﺻﺎري ﻣﮕﺎ )ﻣﯾﻠﯾون‬، ‫ﺳﯾزدھﻣﯾن ﺣرف از اﻟﻔﺑﺎي اﻧﮕﻠﯾﺳﻲ‬

main diagonal ‫ﻗطر اﺻﻠﻲ‬

major diagonal ‫ﻗطر اﺻﻠﻲ‬

Manhatton distance ‫ﻓﺎﺻﻠﮫ ﻣﻧﮭﺗﻧﻲ‬

many-one reduction ‫ﻛﺎھش ﭼﻧد ﺑﮫ ﯾك‬

mapping ‫ﻧﮕﺎﺷت‬

Markov chain ‫زﻧﺟﯾره ﻣﺎرﻛوف‬

master method ‫ﻗﺿﯾﮫ اﺻﻠﻲ‬

matched edge ‫ﯾﺎل ﺗطﺎﺑق ﯾﺎﻓﺗﮫ‬

matched vertex ‫راس ﺗطﺎﺑق ﯾﺎﻓﺗﮫ‬

matching ‫ﺗطﺎﺑق‬

mathematical ‫رﯾﺎﺿﻲ‬

mathematical induction ‫اﺳﺗﻘرا رﯾﺎﺿﻲ‬

matrix ‫ﻣﺎﺗرﯾس‬

max ‫ ﺣداﻛﺛر‬, ‫ﺑﯾﺷﯾﻧﮫ‬

maximal ‫ ﺑﯾﺷﯾﻧﮫ ﻧﺳﺑﻲ‬, ‫ﻣﺎﻛزﯾﻣﺎل‬

maximal independent set ‫ﻣﺟﻣوﻋﮫ ﻣﺳﺗﻘل ﺑﯾﺷﯾﻧﮫ‬

maximally connected component ‫ﻣوﻟﻔﮫ ﻣﺎﻛزﯾﻣﺎل ھﻣﺑﻧد‬

maximum bipartite matching ‫ﺗطﺎﺑق دوﺑﺧﺷﻲ ﺑﯾﺷﯾﻧﮫ‬

maximum flow problem ‫ﻣﺳﺋﻠﮫ ﺷﺎره ﺑﯾﺷﯾﻧﮫ‬

Mealy machine ‫ﻣﺎﺷﯾن ﻣﯾﻠﻲ‬

mean ‫ﻣﯾﺎﻧﮕﯾن‬

median ‫ﻣﯾﺎﻧﮫ‬

memoization ‫ﺑﮫ ﺧﺎطر ﺳﭘﺎري‬

merge ‫ادﻏﺎم‬

merge sort ‫ﻣرﺗب ﺳﺎز ادﻏﺎﻣﻲ‬

meromorphic function ‫ﺗﺎﺑﻊ ﻣروﻣورﻓﯾك‬

min ‫ﻛﻣﯾﻧﮫ‬

minimal ‫ ﻛﻣﯾﻧﮫ ﻧﺳﺑﻲ‬, ‫ﻣﯾﻧﯾﻣﺎل‬

minimal antichain decomposition ‫ﺗﺟزﯾﮫ ﭘﺎد زﻧﺟﯾري ﻣﯾﻧﯾﻣﺎل‬

minimum bounding box ‫ﻛوﭼﻛﺗرﯾن ﻣﺳﺗطﯾل در ﺑر ﮔﯾرﻧده‬

minimum code spanning tree ‫درﺧت ﻓراﮔﯾر ﺑﺎ ﻛﻣﺗرﯾن ﻛد‬

minimum cost spanning tree ‫درﺧت ﻓراﮔﯾر ﺑﺎ ﻛﻣﺗرﯾن ھزﯾﻧﮫ‬

minimum cut ‫ﺑرش ﻛﻣﯾﻧﮫ‬

minimum spanning tree ‫درﺧت ﻓراﮔﯾر ﻛﻣﯾﻧﮫ‬

minimum vertex cut ‫ﺑرش راﺳﻲ ﻛﻣﯾﻧﮫ‬

mode ‫ﻣد‬

model ‫ﻣدل‬

model checking ‫ﺑررﺳﻲ ﻣدل‬

model of computation ‫ﻣدل ﻣﺣﺎﺳﺑﮫ‬

moderate ‫ ﻣﻌﺗدل‬, ‫ﻣﻼﯾم‬

moderately exponential ‫ﻧﻣﺎﯾﻲ ﻣﻼﯾم‬

monotonical ‫ﯾﻛﻧواﺧت‬

monotonically decreasing ‫ﻧزوﻟﻲ ﯾﻛﻧواﺧت‬

monotonically increasing ‫ﺻﻌودي ﯾﻛﻧواﺧت‬

Moore machine ‫ﻣﺎﺷﯾن ﻣور‬

most significant digit ‫ ﺑﺎ ارزش ﺗرﯾن رﻗم ﻣﻌﻧﺎ دار‬، ‫ﻣﻌﻧﻲ دار ﺗرﯾن رﻗم‬

move ‫ اﻧﺗﻘﺎل‬, ‫ﺣرﻛت‬

multi ‫ ﻣﺗﻌدد‬, ‫ ﭼﻧدﮔﺎﻧﮫ‬, ‫ﭼﻧد‬

multi commodity flow ‫ﺷﺎره ﭼﻧد ﻛﺎﻻﯾﻲ‬

multi set ‫ﻣﺟﻣوﻋﮫ ﭼﻧدﮔﺎﻧﮫ‬

multi way decision ‫ﺗﺻﻣﯾم ﭼﻧد راھﮫ‬

multi way merge ‫ادﻏﺎم ﭼﻧد راھﻲ‬

multigraph ‫ﮔراف ﭼﻧدﮔﺎﻧﮫ‬

multiple ‫ ﻣﺗﻌدد‬، ‫ﭼﻧدﮔﺎﻧﮫ‬

multiple queue ‫ﺻف ﭼﻧدﮔﺎﻧﮫ‬

multiple stack ‫ﭘﺷﺗﮫ ﭼﻧدﮔﺎﻧﮫ‬

N ‫ﭼﮭﺎردھﻣﯾن ﺣرف از اﻟﻔﺑﺎي اﻧﮕﻠﯾﺳﻲ‬

n-ary function ‫ ﺗﺎﺑﻊ‬n ‫ﺗﺎﯾﻲ‬

NC many-one reducibility ‫ ﻛﺎھش ﭼﻧد ﺑﮫ ﯾك‬NC

NDFA ‫ اﺗوﻣﺎﺗون ﻣﺗﻧﺎھﻲ ﻏﯾر ﻗطﻌﻲ‬,

nearest neighbor ‫ﻧزدﯾﻛﺗرﯾن ھﻣﺳﺎﯾﮫ‬

nearest neighbor search‫ﺟﺳﺗﺟوي ﻧزدﯾﻛﺗرﯾن ھﻣﺳﺎﯾﮫ‬

negation ‫ ﻧﻘﯾض‬, ‫ﻧﻔﻲ‬

negative ‫ﻣﻧﻔﻲ‬

nested ‫ﺗو در ﺗو‬

network ‫ﺷﺑﻛﮫ‬

network flow ‫ﺷﺎره ﺷﺑﻛﮫ‬

network flow problem ‫ﻣﺳﺋﻠﮫ ﺷﺎره ﺷﺑﻛﮫ‬

next ‫ﺑﻌدي‬

next state ‫ﺣﺎﻟت ﺑﻌدي‬

NIST ‫ﻣوﺳﺳﮫ ﻣﻠﻲ اﺳﺗﺎﻧدارد و ﻓﻧﺎوري اﻣرﯾﻛﺎ‬

node ‫ﮔره‬

nonbalance ‫ﻧﺎﻣﺗوازن‬

nonbalanced merge ‫ادﻏﺎم ﻧﺎﻣﺗوازن‬

nonbalanced merge sort‫ﻣرﺗب ﺳﺎز ادﻏﺎﻣﻲ ﻧﺎﻣﺗوازن‬

nondeterministic ‫ﻏﯾر ﻗطﻌﻲ‬

nondeterministic algorithm ‫اﻟﮕورﯾﺗم ﻏﯾر ﻗطﻌﻲ‬

nondeterministic finite automaton ‫ اﺗوﻣﺎﺗون ﻣﺗﻧﺎھﻲ ﻏﯾر ﻗطﻌﻲ‬, NDFA

nondeterministic finite state machine ‫ﻣﺎﺷﯾن ﺣﺎﻟت ﻣﺗﻧﺎھﻲ ﻏﯾر ﻗطﻌﻲ‬

nondeterministic finite tree automaton ‫اﺗوﻣﺎﺗون درﺧﺗﻲ ﻣﺗﻧﺎھﻲ ﻏﯾر ﻗطﻌﻲ‬

nondeterministic polynomial time ‫زﻣﺎن ﭼﻧد ﺟﻣﻠﮫ اي ﻏﯾر ﻗطﻌﻲ‬

nondeterministic tree automaton ‫اﺗوﻣﺎﺗون درﺧﺗﻲ ﻏﯾر ﻗطﻌﻲ‬

nondeterministic Turing machine ‫ﻣﺎﺷﯾن ﺗورﯾﻧﮓ ﻏﯾر ﻗطﻌﻲ‬

noniterative ‫ﻏﯾر ﺗﻛراري‬

noniterative merge ‫ادﻏﺎم ﻏﯾر ﺗﻛراري‬

not ‫ ﻋﻣﻠﮕر ﻧﻘﯾض‬, ‫ﭼﻧﯾن ﻧﯾﺳت ﻛﮫ‬

notation ‫ﻧﻣﺎد‬

NP-complete language ‫ زﺑﺎن‬NP ‫ﺗﻣﺎم‬

nullary function ‫ﺗﺎﺑﻊ ﺻﻔر ﺗﺎﯾﻲ‬

O ‫ﭘﺎﻧزدھﻣﯾن ﺣرف از اﻟﻔﺑﺎي اﻧﮕﻠﯾﺳﻲ‬

O notation ‫ ﻧﻣﺎد‬O ‫ ﺗﺎﺑﻊ رﺷد ﺑراي ﻛران ﺑﺎﻻ‬، ‫ﺑزرگ‬

objective function ‫ﺗﺎﺑﻊ ھدف‬

off-line algorithm ‫اﻟﮕورﯾﺗم ﺑرون ﺧط‬

omega ‫ ﺗﺎﺑﻊ رﺷد ﺑراي ﻛران ﭘﺎﯾﯾن‬، ‫اُﻣﮕﺎ‬

omicron ‫اُﻣﯾﻛرون‬

on-line algorithm ‫اﻟﮕورﯾﺗم ﺑر ﺧط‬

one dimensional ‫ﯾك ﺑﻌدي‬

online algorithm ‫اﻟﮕورﯾﺗم ﺑر ﺧط‬

optimal ‫ﺑﮭﯾﻧﮫ‬

optimal cost ‫ھزﯾﻧﮫ ﺑﮭﯾﻧﮫ‬

optimal merge ‫ادﻏﺎم ﺑﮭﯾﻧﮫ‬

optimal polygon triangulation ‫ﻣﺛﻠث ﺑﻧدي ﺑﮭﯾﻧﮫ ﭼﻧد ﺿﻠﻌﻲ‬

optimal polygon triangulation problem ‫ﻣﺳﺋﻠﮫ ﻣﺛﻠث ﺑﻧدي ﺑﮭﯾﻧﮫ ﭼﻧد ﺿﻠﻌﻲ‬

optimal polyphase merge ‫ادﻏﺎم ﭼﻧد ﻣرﺣﻠﮫ اي ﺑﮭﯾﻧﮫ‬

optimal polyphase merge sort ‫ﻣرﺗب ﺳﺎز ادﻏﺎﻣﻲ ﭼﻧد ﻣرﺣﻠﮫ اي ﺑﮭﯾﻧﮫ‬

optimal solution ‫ﺟواب ﺑﮭﯾﻧﮫ‬

optimal tree ‫درﺧت ﺑﮭﯾﻧﮫ‬

optimal triangulation ‫ﻣﺛﻠث ﺑﻧدي ﺑﮭﯾﻧﮫ‬

optimal triangulation problem ‫ﻣﺳﺋﻠﮫ ﻣﺛﻠث ﺑﻧدي ﺑﮭﯾﻧﮫ‬

optimal value ‫ﻣﻘدار ﺑﮭﯾﻧﮫ‬

optimization problem ‫ﻣﺳﺋﻠﮫ ﺑﮭﯾﻧﮫ ﺳﺎزي‬

or ‫ ﻋﻣﻠﮕر ﻓﺻﻠﻲ‬, ‫ﯾﺎ‬

oracle ‫ ﻧﺎم ﯾك ﺷرﻛت ﻧرم اﻓزاري‬, ‫ وﺣﻲ‬, ‫ﭘﯾﺷﮕوﯾﻲ‬

oracle set ‫ﻣﺟﻣوﻋﮫ ﭘﯾﺷﮕو‬

oracle tape ‫ﻧوار ﭘﯾﺷﮕو‬

oracle Turing machine ‫ﻣﺎﺷﯾن ﺗورﯾﻧﮓ ﭘﯾﺷﮕو‬

order ‫ﺗرﺗﯾب‬

ordered binary decision diagram ‫ﻧﻣودار ﺗﺻﻣﯾم دودوﯾﻲ ﻣرﺗب‬

ordered linked list ‫ﻟﯾﺳت ﭘﯾوﻧدي ﻣرﺗب‬

oriented acyclic graph ‫ﮔراف ﺑﻲ دور ﺟﮭت دار‬

oriented graph ‫ﮔراف ﺟﮭت دار‬

orthogonal ‫ﻣﺗﻌﺎﻣد‬

orthogonal drawing ‫ﺗرﺳﯾم ﻣﺗﻌﺎﻣد‬

orthogonal list ‫ﻟﯾﺳت ﻣﺗﻌﺎﻣد‬

orthogonal list representation ‫ﻧﻣﺎﯾش ﻟﯾﺳت ﻣﺗﻌﺎﻣد‬

orthogonally convex rectilinear polygon ‫ﻋﻣودي ﻣﺗﻌﺎﻣداً ﻣﺣدب‬-‫ﺟﻧد ﺿﻠﻌﻲ اﻓﻘﻲ‬

oscillating merge sort ‫ﻣرﺗب ﺳﺎز ادﻏﺎﻣﻲ ﻧوﺳﺎﻧﻲ‬

out branching ‫اﻧﺷﻌﺎب ﺧروﺟﻲ‬

out degree ‫درﺟﮫ ﺧروﺟﻲ‬

overflow ‫ﺳررﯾز‬

overflow node ‫ﮔره ﺳررﯾز‬

overflow page ‫ﺻﻔﺣﮫ ﺳررﯾز‬

overhead ‫ﺳرﺑﺎر‬

P ‫ﺷﺎﻧزدھﻣﯾن ﺣرف از اﻟﻔﺑﺎي اﻧﮕﻠﯾﺳﻲ‬

p-way merge sort ‫ ﻣرﺗب ﺳﺎز ادﻏﺎﻣﻲ‬P ‫راھﻲ‬

padding argument ‫اﺳﺗدﻻل ﻻﯾﮫ ﮔذار‬

parametric searching ‫ﺟﺳﺗﺟوي ﭘﺎراﻣﺗري‬

parent ‫ واﻟد‬، ‫ﭘدر‬

partial ‫ﺟزﺋﻲ‬

partial function ‫ﺗﺎﺑﻊ ﺟزﺋﻲ‬

partial match ‫ﺗطﺎﺑق ﺟزﺋﻲ‬

partial order ‫ﺗرﺗﯾب ﺟزﺋﻲ‬

partial recursive function ‫ﺗﺎﺑﻊ ﺑﺎزﮔﺷﺗﻲ ﺟزﺋﻲ‬

partially decidable problem ‫ﻣﺳﺋﻠﮫ ﺟزﺋﺎ ً ﺗﺻﻣﯾم ﭘذﯾر‬

partially dynamic graph ‫ﮔراف ﺟزﺋﻲ ﭘوﯾﺎ‬

partially dynamic graph problem ‫ﻣﺳﺋﻠﮫ ﮔراف ﺟزﺋﻲ ﭘوﯾﺎ‬

partially ordered set ‫ﻣﺟﻣوﻋﮫ ﺟزﺋﻲ ﻣرﺗب‬

partially presistent data structure ‫داده ﺳﺎﺧﺗﺎر ﺟزﺋﻲ ﻣﺎﻧدﮔﺎر‬

path ‫ﻣﺳﯾر‬

path length ‫طول ﻣﺳﯾر‬

perfect matching ‫ﺗطﺎﺑق ﻛﺎﻣل‬

performance guarantee ‫ﺿﻣﺎﻧت ﻛﺎراﯾﻲ‬

performance ratio ‫ﻧﺳﺑت ﻛﺎراﯾﻲ‬

perimeter ‫ﻣﺣﯾط‬

permutation ‫ﺟﺎﯾﮕﺷت‬

permutation generator ‫ﻣوﻟد ﺟﺎﯾﮕﺷت‬

persistent data structure ‫داده ﺳﺎﺧﺗﺎر ﻣﺎﻧدﮔﺎر‬

phase ‫ ﻓﺎز‬، ‫ﻣرﺣﻠﮫ‬

pigeonhole principle ‫اﺻل ﻻﻧﮫ ﻛﺑوﺗري‬

pivot ‫ﻣﺣور‬

planar graph ‫ﮔراف ﻣﺳطﺢ‬

planar straight-line graph ‫ﮔراف ﻣﺳطﺢ ﺑﺎ ﺧطوط ﻣﺳﺗﻘﯾم‬

planarity ‫ﻣﺳطﺢ ﺑودن‬

planarization ‫ﻣﺳطﺢ ﺳﺎزي‬

point ‫ﻧﻘطﮫ‬

pointer ‫اﺷﺎره ﮔر‬

pointer machine ‫ﻣﺎﺷﯾن اﺷﺎره ﮔر‬

poissonization ‫ﭘوآﺳﻧﻲ ﻛردن‬

polygon ‫ﭼﻧد ﺿﻠﻌﻲ‬

polyhedron ‫ﭼﻧد وﺟﮭﻲ‬

polylogarithmic ‫ﭼﻧد ﻟﮕﺎرﯾﺗﻣﻲ‬

polynomial ‫ﭼﻧد ﺟﻣﻠﮫ اي‬

polynomial approximation scheme ‫ﺷﻣﺎي ﺗﻘرﯾب ﭼﻧد ﺟﻣﻠﮫ اي‬

polynomial hierarchy ‫ﺳﻠﺳﻠﮫ ﻣراﺗب ﭼﻧد ﺟﻣﻠﮫ اي‬

polynomial time ‫زﻣﺎن ﭼﻧد ﺟﻣﻠﮫ اي‬

polynomial-time algorithm ‫اﻟﮕورﯾﺗم زﻣﺎن ﭼﻧد ﺟﻣﻠﮫ اي‬

polynomial-time approximation scheme ‫ﺷﻣﺎي ﺗﻘرﯾب زﻣﺎن ﭼﻧد ﺟﻣﻠﮫ اي‬

polynomial-time Church-Turing thesis ‫ ﺗورﯾﻧﮓ زﻣﺎن ﭼﻧد ﺟﻣﻠﮫ اي‬- ‫ﺗز ﭼرچ‬

polynomial-time reduction ‫ﻛﺎھش زﻣﺎن ﭼﻧد ﺟﻣﻠﮫ اي‬

polyphase merge ‫ادﻏﺎم ﭼﻧد ﺟﻣﻠﮫ اي‬

polyphase merge sort ‫ﻣرﺗب ﺳﺎز ادﻏﺎﻣﻲ ﭼﻧد ﺟﻣﻠﮫ اي‬

pop ‫ ﺑﺎزﯾﺎﺑﻲ داده از ﺑﺎﻻي ﭘﺷﺗﮫ‬، ‫ﺑرداﺷﺗن داده از ﺑﺎﻻي ﭘﺷﺗﮫ‬

poset ‫ﻣﺟﻣوﻋﮫ ﺟزﺋﻲ ﻣرﺗب‬

Post's correspondence ‫ﺗﻧﺎظر ﭘﺳت‬

Post's correspondence problem ‫ﻣﺳﺋﻠﮫ ﺗﻧﺎظر ﭘﺳت‬

postfix ‫ﭘﺳوﻧدي‬

postfix notation ‫ﻧﻣﺎد ﭘﺳوﻧدي‬

postman's sort ‫ﻣرﺗب ﺳﺎز ﭘﺳﺗﭼﻲ‬

potential ‫ ﺗوان ﺑﺎﻟﻘوه‬, ‫ﭘﺗﺎﻧﺳﯾل‬

potential function ‫ﺗﺎﺑﻊ ﭘﺗﺎﻧﺳﯾل‬

prefix ‫ﭘﯾﺷوﻧدي‬

Prim's algorithm ‫اﻟﮕورﯾﺗم ﭘرﯾم‬

primitive ‫ اوﻟﯾﮫ‬, ‫اﺻﻠﻲ‬

primitive recursive ‫ﺑﺎزﮔﺷﺗﻲ اﺻﻠﻲ‬

principle ‫ ﻗﺎﻋده ﻛﻠﻲ‬، ‫اﺻل‬

priority ‫اوﻟوﯾت‬

priority queue ‫ﺻف اوﻟوﯾت‬

prisoner's dilemma ‫ﻣﻌﻣﺎي اﺳﯾران‬

probabilistic algorithm ‫اﻟﮕورﯾﺗم اﺣﺗﻣﺎﻟﻲ‬

probabilistic Turing machine ‫ﻣﺎﺷﯾن ﺗورﯾﻧﮓ اﺣﺗﻣﺎﻟﻲ‬

probabilistically checkable proof ‫اﺛﺑﺎت ﺑررﺳﻲ ﭘذﯾري اﺣﺗﻣﺎﻟﻲ‬

probability ‫اﺣﺗﻣﺎل‬

probable ‫اﺣﺗﻣﺎﻟﻲ‬

procedure ‫روﯾﮫ‬

process algebra ‫ﺟﺑر ﭘردازه ھﺎ‬

proper ‫ﺳره‬

proper coloring ‫رﻧﮓ آﻣﯾزي ﻣﺟﺎز‬

proper subset ‫زﯾر ﻣﺟﻣوﻋﮫ ﺳره‬

‫ھرس و ﺟﺳﺗﺟو ‪prune and search‬‬

‫‪pseudo‬‬ ‫ﺷﺑﮫ‬

‫‪pseudo code‬‬ ‫ﺷﺑﮫ ﻛد‬

‫‪pseudo random number generator‬‬ ‫ﻣوﻟد اﻋداد ﺷﺑﮫ ﺗﺻﺎدﻓﻲ‬

‫اﻋداد ﺷﺑﮫ ﺗﺻﺎدﻓﻲ ‪pseudorandom number‬‬

‫‪pth order Fibonacci numbers‬‬ ‫ام ‪ P‬اﻋداد ﻓﯾﺑوﻧﺎﭼﻲ ﻣرﺗﺑﮫ‬

‫‪pure‬‬ ‫ﻣﺣض‬

‫‪purely function language‬‬ ‫زﺑﺎن ﻛﺎﻣﻼً ﺗﺎﺑﻌﻲ‬

‫‪push‬‬ ‫ﻗرار دادن داده در ﺑﺎﻻي ﭘﺷﺗﮫ ‪ ،‬ذﺧﯾره داده در ﺑﺎﻻي ﭘﺷﺗﮫ‬

‫‪pushdown automaton‬‬ ‫اﺗوﻣﺎﺗون ﭘﺷﺗﮫ اي‬

‫‪pushdown transducer‬‬ ‫ﻣﺑدل ﭘﺷﺗﮫ اي‬

‫‪Q‬‬ ‫ھﻔدھﻣﯾن ﺣرف از اﻟﻔﺑﺎي اﻧﮕﻠﯾﺳﻲ‬

‫‪q sort‬‬ ‫‪ q‬ﻣرﺗب ﺳﺎز‬

‫‪qm sort‬‬ ‫‪ qm‬ﻣرﺗب ﺳﺎز‬

‫‪quadtree‬‬ ‫درﺧت ﭼﮭﺎر ﺗﺎﯾﻲ‬

‫‪quadtree complexity‬‬ ‫ﭘﯾﭼﯾدﮔﻲ درﺧت ﭼﮭﺎر ﺗﺎﯾﻲ‬

‫‪quadtree complexity theorem‬‬ ‫ﻗﺿﯾﮫ ﭘﯾﭼﯾدﮔﻲ درﺧت ﭼﮭﺎر ﺗﺎﯾﻲ‬

‫‪quantum computation‬‬ ‫ﻣﺣﺎﺳﺑﮫ ﻛواﻧﺗوﻣﻲ‬

‫‪queue‬‬ ‫ﺻف‬

‫‪quick sort‬‬ ‫ﻣرﺗب ﺳﺎز ﺳرﯾﻊ‬

‫‪quicksort‬‬ ‫ﻣرﺗب ﺳﺎز ﺳرﯾﻊ‬

‫‪R‬‬ ‫ھﺟدھﻣﯾن ﺣرف از اﻟﻔﺑﺎي اﻧﮕﻠﯾﺳﻲ‬

‫‪r.e.language‬‬ ‫زﺑﺎن ﺑﺎزﮔﺷﺗﻲ ﺷﻣﺎرش ﭘذﯾر‬

‫‪radix sort‬‬ ‫ﻣرﺗب ﺳﺎز ﻣﺑﻧﺎﯾﻲ‬

‫‪ragge‬‬ ‫ﻧﺎھﻣوار‬

‫‪ragged matrix‬‬ ‫ﻣﺎﺗرﯾس ﻧﺎھﻣوار‬

‫‪random‬‬ ‫ﺗﺻﺎدﻓﻲ‬

‫‪random access‬‬ ‫دﺳﺗرﺳﻲ ﺗﺻﺎدﻓﻲ‬

random access machine ‫ﻣﺎﺷﯾن ﺑﺎ دﺳﺗرﺳﻲ ﺗﺻﺎدﻓﻲ‬

random numbers ‫اﻋداد ﺗﺻﺎدﻓﻲ‬

random numbers generator ‫ﻣوﻟد اﻋداد ﺗﺻﺎدﻓﻲ‬

randomization ‫ﺗﺻﺎدﻓﻲ ﺳﺎزي‬

randomized algorithm ‫اﻟﮕورﯾﺗم ﺗﺻﺎدﻓﻲ‬

randomized complexity ‫ﭘﯾﭼﯾدﮔﻲ ﺗﺻﺎدﻓﻲ‬

randomized rounding ‫ﮔرد ﻛردن ﺗﺻﺎدﻓﻲ‬

range ‫ ﺑﺎزه‬, ‫ ﻣﺣدوده‬, ‫ رﻧﺞ‬, ‫ﺑرد‬

range sort ‫ﻣرﺗب ﺳﺎز ﺑﺎزه اي‬

rank ‫ﻣرﺗﺑﮫ‬

reachable ‫ دﺳﺗرﺳﻲ‬, ‫ﻗﺎﺑل دﺳﺗﯾﺎﺑﻲ‬

reachable graph ‫ﮔراف دﺳﺗرﺳﻲ‬

rear ‫اﻧﺗﮭﺎ‬

rebalance ‫ﺗﺟدﯾد ﺗوازن‬

recognizer ‫ ﺷﻧﺎﺳﻧده‬, ‫ﺗﺷﺧﯾص دھﻧده‬

rectangular matrix ‫ﻣﺎﺗرﯾس ﻣﺳﺗطﯾل ﺷﻛل‬

rectilinear ‫ ﻋﻣودي‬- ‫اﻓﻘﻲ‬

rectilinear distance ‫ ﻋﻣودي‬- ‫ﻓﺎﺻﻠﮫ اﻓﻘﻲ‬

rectilinear Steiner tree ‫ ﻋﻣودي‬- ‫درﺧت اﺷﺗﺎﯾﻧر اﻓﻘﻲ‬

recurrence ‫ﺑﺎزﮔﺷﺗﻲ‬

recurrence equations ‫ﻣﻌﺎدﻻت ﺑﺎزﮔﺷﺗﻲ‬

recurrence relation ‫راﺑطﮫ ﺑﺎزﮔﺷﺗﻲ‬

recurrences ‫ﺑﺎزﮔﺷﺗﻲ ھﺎ‬

recursion ‫ﺑﺎزﮔﺷت‬

recursion termination ‫ﺧﺎﺗﻣﮫ ﺑﺎزﮔﺷت‬

recursion tree ‫درﺧت ﺑﺎزﮔﺷت‬

recursive ‫ﺑﺎزﮔﺷﺗﻲ‬

recursive algorithm ‫اﻟﮕورﯾﺗم ﺑﺎزﮔﺷﺗﻲ‬

recursive data structure ‫داده ﺳﺎﺧﺗﺎر ﺑﺎزﮔﺷﺗﻲ‬

recursive function ‫ﺗﺎﺑﻊ ﺑﺎزﮔﺷﺗﻲ‬

recursive language ‫زﺑﺎن ﺑﺎزﮔﺷﺗﻲ‬

recursively enumerable language ‫زﺑﺎن ﺑﺎزﮔﺷﺗﻲ ﺷﻣﺎرش ﭘذﯾر‬

red-black tree ‫ ﺳﯾﺎه‬- ‫درﺧت ﻗرﻣز‬

reduced basis ‫ﭘﺎﯾﮫ ﺳﺎده ﺷده‬

reduced digraph ‫ﮔراف ﺟﮭت دار ﺳﺎده ﺷده‬

reduction ‫ ﺳﺎده ﺷده‬, ‫ﻛﺎھش‬

reflexive ‫ﺑﺎزﺗﺎب‬

regular ‫ﻣﻧظم‬

regular decomposition ‫ﺗﺟزﯾﮫ ﻣﻧظم‬

regular expression ‫ﻋﺑﺎرت ﻣﻧظم‬

relation ‫راﺑطﮫ‬

relational structure ‫ﺳﺎﺧﺗﺎر راﺑطﮫ اي‬

relative performance guarantee ‫ﺿﻣﺎﻧت ﻛﺎراﯾﻲ ﻧﺳﺑﻲ‬

relaxation ‫ﺗرﻣﯾم‬

rescalable ‫ﺑﺎز ﻣﻘﯾﺎس ﭘذﯾر‬

reside ‫ ذﺧﯾره ﺷدن‬، ‫ﻣﻘﯾم ﺑودن‬

resident queue ‫ﺻف ﻣﺎﻧدﮔﺎر‬

restrict ‫ﻣﺣدود ﻛردن‬

restricted universe sort ‫ﻣرﺗب ﺳﺎز ﺟﮭﺎن ﻣﺣدود‬

reusable ‫ﻗﺎﺑل اﺳﺗﻔﺎده ﻣﺟدد‬

reverse ‫ واروﻧﮫ‬، ‫ﻣﻌﻛوس‬

reverse adjacency list ‫ﻟﯾﺳت ﻣﺟﺎورﺗﻲ ﻣﻌﻛوس‬

rho-approximation algorithm ‫ اﻟﮕورﯾﺗم‬rho ‫ﺗﻘرﯾﺑﻲ‬

Rice's method ‫روش راﯾس‬

right child ‫ﻓرزﻧد راﺳت‬

rightmost node ‫راﺳت ﺗرﯾن ﮔره‬

rightmost path ‫ﺳﻣت راﺳت ﺗرﯾن ﻣﺳﯾر‬

root ‫رﯾﺷﮫ‬

rough graph ‫ﮔراف ﺗﻘرﯾﺑﻲ‬

routing ‫ﻣﺳﯾر ﯾﺎﺑﻲ‬

routing problem ‫ﻣﺳﺋﻠﮫ ﻣﺳﯾر ﯾﺎﺑﻲ‬

run time ‫زﻣﺎن اﺟرا‬

run time error ‫ﺧطﺎي زﻣﺎن اﺟرا‬

S ‫ﻧوزدھﻣﯾن ﺣرف از اﻟﻔﺑﺎي اﻧﮕﻠﯾﺳﻲ‬

s-t cut ‫ ﺑرش‬s-t

saddle point ‫ﻧﻘطﮫ زﯾﻧﻲ‬

satisfiability ‫ﺻدق ﭘذﯾري‬

satisfiability algorithm ‫اﻟﮕورﯾﺗم ﺻدق ﭘذﯾري‬

satisfiability problem ‫ﻣﺳﺋﻠﮫ ﺻدق ﭘذﯾري‬

saturated edge ‫ﯾﺎل اﺷﺑﺎع ﺷده‬

scheme ‫ طرح‬، ‫روش‬

scope ‫ ﻣﺣدوده‬، ‫ داﻣﻧﮫ‬، ‫ﺣوزه‬

seek time ‫زﻣﺎن ﺟﺳﺗﺟو‬

selection sort ‫ﻣرﺗب ﺳﺎز اﻧﺗﺧﺎﺑﻲ‬

selection sort method ‫روش ﻣرﺗب ﺳﺎز اﻧﺗﺧﺎﺑﻲ‬

self loop ‫طوﻗﮫ‬

sentinel ‫ ﻛﺷﯾك‬، ‫ﻧﮕﮭﺑﺎن‬

separation theorem ‫ﻗﺿﯾﮫ ﺟدا ﺳﺎزي‬

sequential ‫ﺗرﺗﯾﺑﻲ‬

sequential list ‫ﻟﯾﺳت ﺗرﺗﯾﺑﻲ‬

set ‫ﻣﺟﻣوﻋﮫ‬

set complement ‫ﻣﻛﻣل ﻣﺟﻣوﻋﮫ‬

set difference ‫ﺗﻔﺎﺿل ﻣﺟﻣوﻋﮫ‬

set intersection ‫اﺷﺗراك ﻣﺟﻣوﻋﮫ‬

set union ‫اﺟﺗﻣﺎع ﻣﺟﻣوﻋﮫ‬

share ‫اﺷﺗراك‬

shared memory ‫ﺣﺎﻓظﮫ اﺷﺗراﻛﻲ‬

shell sort ‫ﻣرﺗب ﺳﺎز ﺻدﻓﻲ‬

Shor's algorithm ‫اﻟﮕورﯾﺗم ﺷور‬

shortest path ‫ﻛوﺗﺎھﺗرﯾن ﻣﺳﯾر‬

shortest spanning tree ‫ﻛوﺗﺎھﺗرﯾن درﺧت ﻓراﮔﯾر‬

shrink ‫ﻛوﭼك ﺷدن‬

sibling ‫ ﺑرادر‬، ‫ھﻣزاد‬

Sierpinski triangle ‫ﻣﺛﻠث ﺳرﭘﯾﻧﺳﻛﻲ‬

signature ‫ ﻧﺷﺎن‬, ‫اﻣﺿﺎ‬

simple ‫ﺳﺎده‬

simple merge ‫ادﻏﺎم ﺳﺎده‬

simple path ‫ﻣﺳﯾر ﺳﺎده‬

simulation ‫ﺷﺑﯾﮫ ﺳﺎزي‬

simulation theorem ‫ﻗﺿﯾﮫ ﺷﺑﯾﮫ ﺳﺎزي‬

simulator ‫ﺷﺑﯾﮫ ﺳﺎز‬

single destination shortest path problem ‫ﻣﺳﺋﻠﮫ ﻛوﺗﺎھﺗرﯾن ﻣﺳﯾر ﺑﮫ ﯾك ﻣﻘﺻد‬

single pair shortest path problem ‫ﻣﺳﺋﻠﮫ ﻛوﺗﺎھﺗرﯾن ﻣﺳﯾر ﺑﯾن ﯾك زوج راس‬

single source shortest path problem ‫ﻣﺳﺋﻠﮫ ﻛوﺗﺎھﺗرﯾن ﻣﺳﯾر از ﯾك ﻣﺑدا‬

singleton set ‫ﻣﺟﻣوﻋﮫ ﯾك ﻋﺿوي‬

singly linked list ‫ﻟﯾﺳت ﭘﯾوﻧدي ﯾك طرﻓﮫ‬

singularity analysis ‫ﺗﺣﻠﯾل ﻧﻘطﮫ ﻣﻧﻔرد‬

sink ‫ﭼﺎھك‬

sink sort ‫ﻣرﺗب ﺳﺎز ﻓرو ﺑرﻧده‬

sinking sort ‫ﻣرﺗب ﺳﺎز ﻓرو ﺑرﻧده‬

skew ‫ ﻣورب‬، ‫ارﯾب‬

skew symmetry ‫ﺗﻘﺎرن ﭼپ‬

skewed binary tree ‫درﺧت دودوﯾﻲ ﻣورب‬

skewed heap ‫ھرم ﻣورب‬

skewed tree ‫درﺧت ﻣورب‬

slope selection ‫اﻧﺗﺧﺎب ﺷﯾب‬

slot ‫ﺷﻛﺎف‬

solvable ‫ﺣل ﭘذﯾر‬

sort ‫ﻣرﺗب ﻛردن‬

sorted linked list ‫ﻟﯾﺳت ﭘﯾوﻧدي ﻣرﺗب‬

sorted sequential list ‫ﻟﯾﺳت ﺗرﺗﯾﺑﻲ ﻣرﺗب‬

sorting algorithm ‫اﻟﮕورﯾﺗم ﻣرﺗب ﺳﺎزي‬

source ‫ ﻣﺑدا‬, ‫ﻣﻧﺑﻊ‬

space complexity ‫ﭘﯾﭼﯾدﮔﻲ ﺣﺎﻓظﮫ‬

space constructible function ‫ﺗﺎﺑﻊ ﻓﺿﺎي ﺳﺎﺧﺗﻧﻲ‬

spanning forest ‫ﺟﻧﮕل ﭘوﺷﺎ‬

spanning tree ‫درﺧت ﭘوﺷﺎ‬

sparse graph ‫ﮔراف ﺧﻠوت‬

sparse matrix ‫ﻣﺎﺗرﯾس ﺧﻠوت‬

sparse polynomial ‫ﭼﻧد ﺟﻣﻠﮫ اي ﺧﻠوت‬

sparsification ‫ﺧﻠوت ﺳﺎزي‬

split ‫ ﺗﻔﻛﯾك‬، ‫ﺗﺟزﯾﮫ‬

splitting algorithm ‫اﻟﮕورﯾﺗم ﺗﺟزﯾﮫ‬

square matrix ‫ﻣﺎﺗرﯾس ﻣرﺑﻌﻲ‬

square root ‫رﯾﺷﮫ دوم‬

stable ‫ﭘﺎﯾدار‬

stack ‫ﭘﺷﺗﮫ‬

stack tree ‫درﺧت ﭘﺷﺗﮫ اي‬

star-shaped ‫ﺳﺗﺎره اي ﺷﻛل‬

star-shaped polygon ‫ﭼﻧد ﺿﻠﻌﻲ ﺳﺗﺎره اي ﺷﻛل‬

start state ‫ﺣﺎﻟت ﺷروع‬

state ‫ﺣﺎﻟت‬

state machine ‫ﻣﺎﺷﯾن ﺣﺎﻟت‬

state transition ‫ﮔذر ﺣﺎﻟت‬

statement ‫ دﺳﺗور‬، ‫ﮔزاره‬

Steiner minimum tree ‫درﺧت ﻛﻣﯾﻧﮫ اﺷﺗﺎﯾﻧر‬

Steiner point ‫ﻧﻘطﮫ اﺷﺗﺎﯾﻧر‬

Steiner ratio ‫ﻧﺳﺑت اﺷﺗﺎﯾﻧر‬

Steiner tree ‫درﺧت اﺷﺗﺎﯾﻧر‬

Steiner vertex ‫راس اﺷﺗﺎﯾﻧر‬

Stirling's approximation ‫ﺗﻘرﯾب اﺳﺗرﻟﯾﻧﮓ‬

Stirling's formula ‫ﻓرﻣول اﺳﺗرﻟﯾﻧﮓ‬

stooge sort ‫ﻣرﺗب ﺳﺎز ﺳﺎده ﻟوﺣﺎﻧﮫ‬

storage ‫ﺣﺎﻓظﮫ‬

storage management ‫ﻣدﯾرﯾت ﺣﺎﻓظﮫ‬

storage management algorithm ‫اﻟﮕورﯾﺗم ﻣدﯾرﯾت ﺣﺎﻓظﮫ‬

straight line drawing ‫ﺗرﺳﯾم ﻣﺳﺗﻘﯾم اﻟﺧط‬

Strassen algorithm ‫اﻟﮕورﯾﺗم اﺳﺗراﺳن‬

strictly ً‫اﻛﯾدا‬

strictly decreasing ‫اﻛﯾداً ﻧزوﻟﻲ‬

strictly increasing ‫اﻛﯾداً ﺻﻌودي‬

strictly lower triangular matrix ‫ﻣﺎﺗرﯾس اﻛﯾداً ﭘﺎﯾﯾن ﻣﺛﻠﺛﻲ‬

strictly upper triangular matrix ‫ﻣﺎﺗرﯾس اﻛﯾداً ﺑﺎﻻ ﻣﺛﻠﺛﻲ‬

string ‫رﺷﺗﮫ‬

strongly connected graph ‫ﮔراف ﻗوﯾﺎ ً ھﻣﺑﻧد‬

subadditive Ergodic theorem ‫ﻗﺿﯾﮫ ارﮔودﯾك زﯾر ﺟﻣﻌﻲ‬

subgraph ‫زﯾر ﮔراف‬

subgraph isomorphism ‫ﯾﻛرﯾﺧﺗﻲ زﯾر ﮔراف ھﺎ‬

‫‪subpath‬‬ ‫زﯾر ﻣﺳﯾر‬

‫‪subset‬‬ ‫زﯾر ﻣﺟﻣوﻋﮫ‬

‫‪subtype‬‬ ‫زﯾر ﻧوع‬

‫‪successive‬‬ ‫ﻣﺗواﻟﻲ ‪ ،‬ﺑﻌدي‬

‫‪suffix‬‬ ‫ﭘﺳوﻧدي‬

‫‪suffix automaton‬‬ ‫اﺗوﻣﺎﺗون ﭘﺳوﻧدي‬

‫‪superset‬‬ ‫زﺑر ﻣﺟﻣوﻋﮫ ‪ ,‬اﺑر ﻣﺟﻣوﻋﮫ‬

‫‪supersink‬‬ ‫اﺑر ﭼﺎھك‬

‫‪supersource‬‬ ‫اﺑر ﻣﻧﺑﻊ‬

‫ﺻف ﻣﻌوق ‪suspended queue‬‬

‫‪symmetric‬‬ ‫ﻣﺗﻘﺎرن‬

‫ﺗوزﯾﻊ دو ﺟﻣﻠﮫ اي ﻣﺗﻘﺎرن ‪symmetric binomial distribution‬‬

‫‪symmetric set difference‬‬ ‫ﺗﻔﺎﺿل ﻣﺗﻘﺎرن ﻣﺟﻣوﻋﮫ‬

‫ﻟﯾﺳت ﭘﯾوﻧدي ﻣﺗﻘﺎرن ‪symmetrically linked list‬‬

‫‪synonyms‬‬ ‫ﻣﺗرادف‬

‫‪subtree‬‬ ‫زﯾر درﺧت‬

‫‪T‬‬ ‫ﺑﯾﺳﺗﻣﯾن ﺣرف از اﻟﻔﺑﺎي اﻧﮕﻠﯾﺳﻲ ‪ ،‬ﻋﻼﻣت اﺧﺗﺻﺎري ﺗرا )ﺗرﯾﻠﯾون( = ‪ 2‬ﺑﮫ ﺗوان ‪12‬‬

‫‪tail‬‬ ‫دم‬

‫‪tail recursion‬‬ ‫آﺧرﯾن ﺑﺎزﮔﺷت‬

‫‪task‬‬ ‫وظﯾﻔﮫ ‪ ،‬ﻛﺎر‬

‫‪temporal logic‬‬ ‫ﻣﻧطق زﻣﺎﻧﻲ‬

‫‪terminal‬‬ ‫ﭘﺎﯾﺎﻧﮫ‬

‫‪text‬‬ ‫ﻣﺗن‬

‫‪theoretical‬‬ ‫ﺗﺟرﺑﻲ ‪ ،‬ﻧظري‬

‫‪theta‬‬ ‫ﺗﺗﺎ ‪ ،‬ﺗﺎﺑﻊ رﺷد‬

‫‪thread‬‬ ‫ﻧﺦ ‪ ،‬رﯾﺳﻣﺎن‬

‫‪threaded binary tree‬‬ ‫درﺣت دودوﯾﻲ ﻧﺦ ﻛﺷﻲ ﺷده‬

‫ﺳﮫ ﺑﻌدي ‪three dimensional‬‬

three-way merge sort ‫ﻣرﺗب ﺳﺎز ادﻏﺎﻣﻲ ﺳﮫ راھﻲ‬

time complexity ‫ﭘﯾﭼﯾدﮔﻲ زﻣﺎﻧﻲ‬

time efficiency ‫ﻛﺎراﯾﻲ زﻣﺎن‬

time/space complexity ‫ﺣﺎﻓظﮫ‬/‫ﭘﯾﭼﯾدﮔﻲ زﻣﺎن‬

token ‫ ﺑﺳﺗﮫ‬، ‫ ﻧﻣﺎد‬، ‫ﻧﺷﺎﻧﮫ‬

top sort ‫ ﻣرﺗب ﺳﺎز ﺗوﭘوﻟوژﯾﻛﻲ‬, topological sort

top-down radix sort‫ﻣرﺗب ﺳﺎز ﻣﺑﻧﺎﯾﻲ ﺑﺎﻻ ﺑﮫ ﭘﺎﯾﯾن‬

top-down tree automaton ‫اﺗوﻣﺎﺗون درﺧﺗﻲ ﺑﺎﻻ ﺑﮫ ﭘﺎﯾﯾن‬

topmost node ‫ﺑﺎﻻﺗرﯾن ﮔره‬

topological order ‫ﺗرﺗﯾب ﺗوﭘوﻟوژﯾﻛﻲ‬

topological sort ‫ ﻣرﺗب ﺳﺎز ﺗوﭘوﻟوژﯾﻛﻲ‬, top sort

total ‫ﻛﺎﻣل‬

total function ‫ﺗﺎﺑﻊ ﻛﺎﻣل‬

total order ‫ﺗرﺗﯾب ﻛﺎﻣل‬

totally decidable problem ‫ﻣﺳﺋﻠﮫ ﻛﺎﻣﻼً ﺗﺻﻣﯾم ﭘذﯾر‬

totally undecidable problem ‫ﻣﺳﺋﻠﮫ ﻛﺎﻣﻼً ﺗﺻﻣﯾم ﻧﺎﭘذﯾر‬

tour ‫ﺗور‬

tractable ‫ﻣﮭﺎر ﺷدﻧﻲ‬

transducer ‫ﻣﺑدل‬

transition ‫ﮔذر‬

transition function ‫ﺗﺎﺑﻊ ﮔذر‬

transitive ‫ ﺗﻌدي‬، ‫ ﺗراﮔذري‬, ‫ﺗرﯾﺎ‬

transitive closure ‫ﺑﺳﺗﺎر ﻣﺗﻌددي‬

transitive reduction ‫ﺳﺎده ﺳﺎزي ﺗرﯾﺎ‬

transpose ‫ﺗراﻧﮭﺎده‬

traveling salesman ‫ﻓروﺷﻧده دوره ﮔرد‬

traveling salesman problem ‫ﻣﺳﺋﻠﮫ ﻓروﺷﻧده دوره ﮔرد‬

travelling salesman ‫ﻓروﺷﻧده دوره ﮔرد‬

tree ‫درﺧت‬

tree automaton ‫اﺗوﻣﺎﺗون درﺧﺗﻲ‬

tree edge ‫ﯾﺎل درﺧﺗﻲ‬

tree network ‫ﺷﺑﻛﮫ درﺧﺗﻲ‬

tree sort ‫ﻣرﺗب ﺳﺎز درﺧﺗﻲ‬

triangle inequality ‫ﻧﺎ ﻣﺳﺎوي ﻣﺛﻠﺛﻲ‬

triconnected graph ‫ﮔراف ﺳﮫ ھﻣﺑﻧد‬

trie ‫ ﯾك ﻧوع ﺳﺎﺧﺗﺎر ﺷﺎﺧﺻﻲ‬, ‫ﺗراي‬

trinary function ‫ﺗﺎﺑﻊ ﺳﮫ ﺗﺎﯾﻲ‬

trivial cycle ‫دور ﺑدﯾﮭﻲ‬

Turing machine ‫ﻣﺎﺷﯾن ﺗورﯾﻧﮓ‬

Turing reduction ‫ﻛﺎھش ﺗورﯾﻧﮓ‬

Turing transducer ‫ﻣﺑدل ﺗورﯾﻧﮓ‬

two dimensional ‫دو ﺑﻌدي‬

two way linked list ‫ﻟﯾﺳت ﭘﯾوﻧدي دو طرﻓﮫ‬

two way list ‫ﻟﯾﺳت دو طرﻓﮫ‬

two way merge sort ‫ﻣرﺗب ﺳﺎز ادﻏﺎﻣﻲ دو راھﮫ‬

U ‫ﺑﯾﺳت و ﯾﻛﻣﯾن ﺣرف از اﻟﻔﺑﺎي اﻧﮕﻠﯾﺳﻲ‬

unary function ‫ﺗﺎﺑﻊ ﯾﻛﺗﺎﯾﻲ‬

unbalance ‫ﻧﺎﻣﺗوازن‬

unbalanced tree ‫درﺧت ﻧﺎﻣﺗوازن‬

uncomputable ‫ﻣﺣﺎﺳﺑﮫ ﻧﺎﭘذﯾر‬

uncomputable function ‫ﺗﺎﺑﻊ ﻣﺣﺎﺳﺑﮫ ﻧﺎﭘذﯾر‬

uncomputable problem ‫ﻣﺳﺋﻠﮫ ﻣﺣﺎﺳﺑﮫ ﻧﺎﭘذﯾر‬

undecidable ‫ﺗﺻﻣﯾم ﻧﺎﭘذﯾر‬

undecidable language ‫زﺑﺎن ﺗﺻﻣﯾم ﻧﺎﭘذﯾر‬

undecidable problem ‫ﻣﺳﺋﻠﮫ ﺗﺻﻣﯾم ﻧﺎﭘذﯾر‬

undirected graph ‫ﮔراف ﻏﯾر ﺟﮭت دار‬

uniform ‫ﯾﻛﻧواﺧت‬

uniform circuit complexity ‫ﭘﯾﭼﯾدﮔﻲ ﻣدار ﯾﻛﻧواﺧت‬

uniform circuit family ‫ﺧﺎﻧواده ﻣدارھﺎي ﯾﻛﻧواﺧت‬

uniform hash function ‫ﺗﺎﺑﻊ درھم ﺳﺎزي ﯾﻛﻧواﺧت‬

uniform matrix ‫ﻣﺎﺗرﯾس ﯾﻛﻧواﺧت‬

union ‫اﺟﺗﻣﺎع‬

union of automata ‫اﺟﺗﻣﺎع اﺗوﻣﺎﺗﺎ‬

universal ‫ ھﻣﮕﺎﻧﻲ‬, ‫ﺟﺎﻣﻊ‬

universal state ‫ﺣﺎﻟت ﺟﺎﻣﻊ‬

universal Turing machine ‫ﻣﺎﺷﯾن ﺗورﯾﻧﮓ ﺟﺎﻣﻊ‬

universe ‫ ﻣﺟﻣوﻋﮫ ﻣرﺟﻊ‬, ‫ﺟﮭﺎن‬

unordered linear list ‫ﻟﯾﺳت ﺧطﻲ ﻧﺎﻣرﺗب‬

unsolvable ‫ﺣل ﻧﺷدﻧﻲ‬

unsolvable problem ‫ﻣﺳﺋﻠﮫ ﺣل ﻧﺷدﻧﻲ‬

unsort ‫ﻧﺎﻣرﺗب‬

unsorted ‫ﻣرﺗب ﻧﺷده‬

unsorted list ‫ﻟﯾﺳت ﻧﺎﻣرﺗب‬

unstack ‫ﺧﺎرج ﻛردن از ﭘﺷﺗﮫ‬

upper triangular ‫ﺑﺎﻻ ﻣﺛﻠﺛﻲ‬

upper triangular matrix ‫ﻣﺎﺗرﯾس ﺑﺎﻻ ﻣﺛﻠﺛﻲ‬

V ‫ﺑﯾﺳت و دوﻣﯾن ﺣرف از اﻟﻔﺑﺎي اﻧﮕﻠﯾﺳﻲ‬

vacant ‫ﺧﺎﻟﻲ‬

value returning function ‫ﺗﺎﺑﻊ ﺑﺎ ﻣﻘدار ﺑﺎزﮔﺷﺗﻲ‬

variant record ‫ رﻛورد ﺑﺎ طول ﻣﺗﻐﯾر‬، ‫رﻛورد ﻣﺗﻐﯾر‬

variety ‫ﻧوع‬

Varshal algorithm ‫اﻟﮕورﯾﺗم وارﺷﺎل‬

vehicle routing ‫ﻣﺳﯾر ﯾﺎﺑﻲ وﺳﯾﻠﮫ‬

vehicle routing problem ‫ﻣﺳﺋﻠﮫ ﻣﺳﯾر ﯾﺎﺑﻲ وﺳﯾﻠﮫ‬

Veitch diagram ‫ﻧﻣودار وﯾﺗﭻ‬

Venn diagram ‫ﻧﻣودار ون‬

vertex ‫راس‬

vertex coloring ‫رﻧﮓ آﻣﯾزي راﺳﻲ‬

vertex connectivity ‫ھﻣﺑﻧدي راﺳﻲ‬

vertex cover ‫ﭘوﺷش راﺳﻲ‬

vertex set ‫ﻣﺟﻣوﻋﮫ رﺋوس‬

vertical visibility map ‫ﻧﻘﺷﮫ دﯾد ﻋﻣودي‬

vertice ‫راس‬

vertices ‫رﺋوس‬

violate ‫ﻧﻘض ﻛردن‬

virtual ‫ﻣﺟﺎزي‬

virtual function ‫ﺗﺎﺑﻊ ﻣﺟﺎزي‬

visibility map ‫ﻧﻘﺷﮫ دﯾد‬

visible ‫ﻗﺎﺑل دﯾد‬

visit ‫ﻣﻼﻗﺎت‬

Viterbi algorithm ‫اﻟﮕورﯾﺗم وﯾﺗرﺑﻲ‬

W ‫ﺑﯾﺳت و ﺳوﻣﯾن ﺣرف از اﻟﻔﺑﺎي اﻧﮕﻠﯾﺳﻲ‬

walk ‫ﮔﺷت‬

weak-heap sort ‫ﻣرﺗب ﺳﺎز ھرﻣﻲ ﺿﻌﯾف‬

weight rule ‫ﻗﺎﻧون وزن‬

weighted directed graph ‫ﮔراف ﺟﮭت دار وزن دار‬

weighted edge ‫ﯾﺎل وزن دار‬

weighted external path length ‫طول ﻣﺳﯾر ﺧﺎرﺟﻲ وزن دار‬

weighted graph ‫ﮔراف وزن دار‬

white space ‫ﻓﺿﺎي ﺳﻔﯾد‬

winner tree ‫درﺧت ﺑرﻧده‬

worst case ‫ﺑدﺗرﯾن ﺣﺎﻟت‬

‫‪worst case cost‬‬ ‫ھزﯾﻧﮫ ﺑدﺗرﯾن ﺣﺎﻟت‬

‫‪worst-case data‬‬ ‫داده ھﺎ در ﺑدﺗرﯾن ﺣﺎﻟت‬

‫زﻣﺎن ﺟﺳﺗﺟو در ﺑدﺗرﯾن ﺣﺎﻟت ‪worst-case search time‬‬

‫‪write out‬‬ ‫ذﺧﯾره ﻛردن‬

‫‪X‬‬ ‫ﺑﯾﺳت و ﭼﮭﺎرﻣﯾن ﺣرف از اﻟﻔﺑﺎي اﻧﮕﻠﯾﺳﻲ‬

‫‪xor‬‬ ‫ﯾﺎي اﻧﺣﺻﺎري‬

‫‪Y‬‬ ‫ﺑﯾﺳت و ﭘﻧﭼﻣﯾن ﺣرف از اﻟﻔﺑﺎي اﻧﮕﻠﯾﺳﻲ‬

‫‪Z‬‬ ‫ﺑﯾﺳت و ﺷﺷﻣﯾن و آﺧرﯾن ﺣرف از اﻟﻔﺑﺎي اﻧﮕﻠﯾﺳﻲ‬

‫‪zero‬‬ ‫ﺻﻔر‬

‫‪zero count‬‬ ‫ﺷﻣﺎر ﺻﻔر‬

‫‪zero matrix‬‬ ‫ﻣﺎﺗرﯾس ﺻﻔر‬