|
|
Авторизация |
|
|
Поиск по указателям |
|
|
|
|
|
|
|
|
|
|
Gossett E. — Discrete Math with Proof |
|
|
Предметный указатель |
Terminal symbol 542
Terminal vertex 641
Ternary sphere 483
Ternary tree 670
The 36 officers problem 427
Theorem 38 92
Theoretical probability 261 see calculating"
Third normal form 754
Tietaevaeinen, Aimo 479
Tom Wilson 38
Tour 590 see
Tournament graph 653
Tower of Hanoi 333 373 376
Trail 600
Transition function 531 535
Transitive 736
Transitive closure 738
Transmitter 522
TRANSPOSE A22
Traversal 676
TREE 668
Tree, ancestor 669
Tree, balanced 670
Tree, binary 670
Tree, binary search 679
Tree, center 676
Tree, child 669
Tree, complete 670
Tree, depth 669
Tree, descendant 669
Tree, eccentricity 676
Tree, external node 673 675
Tree, full m-ary 670
Tree, height 670
Tree, interior node 670
Tree, leaf 670
Tree, leaf node 670
Tree, left child 671
Tree, level 669
Tree, m-ary 670
Tree, maximal complete 670
Tree, maximal spanning tree 716
Tree, node 668
Tree, ordered 671
Tree, parent 669
Tree, parse tree 687
Tree, right child 671
Tree, root 669
Tree, root node 669
Tree, rooted 669
Tree, sibling 669
Tree, spanning 705
Tree, subtree 669
Tree, ternary 670
Tree, traversal 676
Tree, traversal, in-order 677
Tree, traversal, level-order 686
Tree, traversal, post-order 677
Tree, traversal, pre-order 677
Triangle inequality 174
Trisect 199
Trisectors 199
Trivial solution 339
TRUE 33
Truth table 33—34 A12
Truth table, standard ordering 36
Tuberculosis 294
Tuple 20 746
Turing machine 199 571 573
Turing, Alan 573 576
Tutte graph 615
Tutte, William 615
Twin primes 143
| Two-column format/proof 49 118
Twos complement 540
Unattached 5
Unbounded knapsack problem 457
Uncertainty 256
Undefined term 91
Underlying graph 641
Underlying simple graph 593
union 15 19 see union"
Universal quantifier 62 108
Universal set 15 see universal
Universe of discourse 62
Unrestricted grammar 571
Urn 409
Utility 457
Utility graph 625
Valid 70 see valid"
validating parser 701
Value of an outcome 285
van Lint, J.H. 479
Vandermonde’s Matrix Theorem 342
Vandermonde’s theorem 235
Venn diagram 15 241 see Venn
Vertex 591 592
Vertex, indegree 642
Vertex, initial 641
Vertex, outdegree 642
Vertex, terminal 641
Vespacian 384
viable 5
Vocabulary 541
Void suit 246
Volume 457
Vowels 261
Walk 600
Walk, closed 600
Walk, endpoints 600
Walk, length 600
Walther graph 639
Wantzel, Pierre Laurent 199
Weak induction 118
Weakly connected 643
Weaver, Warren 528
Weighted graph 645
Well defined 742
Well-formed 696
Well-ordering principle 98 131 A1
Wheel graph 596
while 159 see
Whitehead 103
whitespace 553 695
wlog 104
Word 541
XML 693
XML, attribute 694 698
XML, character data 694
XML, DOM 702
XML, element 694
XML, parser 701
XML, processing instructions 694
XML, tag 694
XML, tag, closing tag 694
XML, tag, end tag 694
XML, tag, opening tag 694
XML, tag, start tag 694
XML, validating parser 701
XML, well-formed 696
Zahlen A2
Zebra 238
Zero divisor 57
Zero matrix A23
Zero product principle A2
Ziggy 38
|
|
|
Реклама |
|
|
|