.

0 (hodnocen0 x )

(2) Půjčeno:4x 

BK

New York : McGraw-Hill, c1992

iv, 404 s. ; 27 cm

ISBN 0-07-038031-7 (brož.)

Schaum’s solved problems series

Obsahuje rejstřík

000195728

SCHAUM’S-THE ORIGINAL SOLVED-PROBLEM STUDY GUIDE // Master discrete mathematics with // Schaum’s-the high-performance solvedproblem guide. It will help you cut study // time, hone problem-solving skills, and // achieve your personal best on exams! // Solved Problems Series // OVER 30 MILLION SOLD // Students love Schaum’s Solved Problem Guides because they produce // results. Each year, thousands of students improve their test scores and final // grades with these indispensable guides. // Other Titles in Schaum’s Solved // Get the edge on your classmates. Use Schaum’s! // If you don’t have a lot of time but want to excel in class, use this book // to: // • Brush up before tests // • Study quickly and more effectively // • Learn the best strategies for solving tough problems in step-by-step // detail // • 2000 solved problems with complete // solutions-the largest selection of // solved problems yet published in discrete mathematics // ♦ A superb index to help you quickly // locate the types of problems you // want to solve // • Problems like those you’ll find on // your exams // Review what you’ve learned in // class by solving thousands of // relevant problems that test your // skill. Compatible with any classroom text, Schaum’s Solved // Problem Guides let you practice // at your own pace and remind // you of all the important problemsolving techniques you need to // remember-fast! And Schaum’s

// are so complete, they’re perfect // for preparing for graduate or professional exams. // If you want top grades and a thorough understanding of discrete mathematics, this powerful study tool is the best tutor you can have! // Chapters include: Set Theory • Relations • Functions • Vectors and Matrices // • Graph Theory • Planar Graphs and Trees • Directed Graphs and Binary // Trees • Combinatorial Analysis • Algebraic Systems • Languages. // McGraw-Hill // A Division of The McGraw-Hill Companies // I // m // □ // rO i // m rA // o m // • о // г- cd // о гп // • о // □ • // �о о // �т о // z л // m i-ч // �о □: // 978007038031890000 // Problems Series // 3000 Solved Problems in // Biology // 3000 Solved Problems in // Calculus // 3000 Solved Problems in // Chemistry // 2500 Solved Problems in // College Algebra and // Trigonometry // 2500 Solved Problems in // Differential Equations // 3000 Solved Problems in // Electric Circuits // 2000 Solved Problems in // Electromagnetics // 2000 Solved Problems in // Electronics // 2500 Solved Problems in Fluid // Mechanics & Hydraulics // 1000 Solved Problems in Heat // Transfer // 3000 Solved Problems in Linear // Algebra // 2000 Solved Problems in // Mechanical Engineering/ // Thermodynamics // 2000 Solved Problems in // Numerical Analysis // 2000 Solved Problems in // Organic Chemistry

// 2000 Solved Problems in // Physical Chemistry // 2000 Solved Problems in // Physics // 3000 Solved Problems in // Precalculus // 800 Solved Problems in Vector // Mechanics for Engineers/ // Statics // 700 Solved Problems in Vector // Mechanics for Engineers/ // Dynamics // 780070 // 380318 // Chapter 1 // SET THEORY // 1 // Chapter 2 // Chapter 3 // Chapter 4 // Chapter 5 // Chapter 6 // Chapter 7 // Chapter 8 // 1.1 Sets, Elements, Equality of Sets 11.2 Subsets /1.3 Set Operations / 1.4 Venn // Diagrams and Set Operations, Fundamental Products / 1.5 Algebra of Sets, Duality / // 1.6 Finite Sets, Counting Principle /1.7 Classes of Sets, Power Sets /1.8 Mathematical // Induction /1.9 Arguments and Venn Diagrams /1.10 Symmetric Difference /1.11 Real // Number System R, Sets of Numbers // RELATIONS // I // 2.1 Product Sets / 2.2 Relations / 2.3 Representation of Relations / 2.4 Composition of // Relations / 2.5 Types of Relations / 2.6 Partitions / 2.7 Equivalence Relations / // Ternary and n-Ary Relations // 48 // FUNCTIONS 81 // 3.1 Functions, Mappings / 3.2 Real-Valued Functions / 3.3 Composition of Functions / // 3.4 One-To-One, Onto, and Invertible Functions /3.5 Mathematical Functions and // Computer Science /3.6 Recursively Defined Functions /3.7 Indexed Classes of Sets / // 3.8 Cardinality, Cardinal Numbers // VECTORS AND MATRICES // 115 // 4.1 Vectors in R" / 4.2 Matrices, Matrix Addition, and Scalar Multiplication / 4.3 Matrix // Multiplication /4.4 Transp // se of a

Matrix / 4.5 Square Matrices / 4.6 Special Types of // Square Matrices /4.7 Determinants // GRAPH THEORY // 5.1 Graphs and Multigraphs I 5.2 Degree of a Vertex / 5.3 Paths, Connectivity / // 5.4 Subgraphs, Connected Components, Cut Points, Bridges I 5.5 Transversable // Multigraphs /5.6 Special Graphs /5.7 Matrices and Graphs, Linked Representation / // 5.8 Labeled Graphs / 5.9 Isomorphic and Homeomorphic Graphs // PLANAR GRAPHS AND TREES // 6.1 Planar Graphs / 6.2 Maps and Regions / 6.3 Euler’s Formula /6.4 Nonplanar // Graphs / 6.5 Colored Graphs / 6.6 Colors and Maps / 6.7 Trees // DIRECTED GRAPHS AND BINARY TREES // Connectivity /7.3 Digraphs, // Relations and Matrices / 7.4 Rooted Trees / 7.5 Binary Trees // COMBINATORIAL ANALYSIS // 189 // 218 // 8.1 Counting Principle, Factorial Notation / 8.2 Binomial Coefficients / 8.3 Permutations 1 // 8.4 Combinations /8.5 Ordered and Unordered Partitions /8.6 Tree Diagrams // Chapter 9 // ALGEBRAIC SYSTEMS // 9.1 Operations and Semigroups 1 9.2 Groups and Subgroups / 9.3 Normal Subgroups, // Factor Groups, Group Homomorphisms / 9.4 Rings and Ideals / 9.5 Integral Domains, // PID, UFD / 9.6 Fields / 9.7 Polynomials Over a Field // 276 // Chapter 10 // LANGUAGES, GRAMMARS, AUTOMATA // 300 // 10.1 Words / 10.2 Languages / 10.3 Regular Expressions, Regular Languages / // 10.4 Finite State Automata / 10.5 Grammars and Languages // Chapter 11 // ORDERED SETS AND LATTICES // 11.1 Ordered Sets / 11.2 Diagrams of Partially Ordered Sets

/ 11.3 Supremum and // Infimum /11.4 Similar Sets and Well-Ordered Sets /11.5 Lattices /11.6 Lattices as // Ordered Sets /11.7 Bounded Lattices /11.8 Distributive Lattices, Decompositions / // 11.9 Complemented Lattices // 314 // Chapter 12 // PROPOSITIONAL CALCULUS // 12.1 Statements, Basic Operations / 12.2 Truth Value of Compound Statements 1 // 12.3 Propositions and Truth Tables 1 12.4 Tautologies and Contradictions I 12.5 Logical // Equivalence / 12.6 Negation, DeMorgan’s Laws / 12.7 Algebra of Propositions / // 12.8 Conditional, p - q 1 12.9 Biconditional, p 112.10 Arguments / 12.11 Logical // Implication / 12.12 Quantifiers // 341 // Chapter 13 // BOOLEAN ALGEBRA, LOGIC GATES // 13.1 Basic Definitions and Theorems 113.2 Order and Boolean Algebras / 13.3 Boolean // Expressions; Sum-of-Products Form 1 13.4 Logic Gates / 13.5 Logic Circuits / // 13.6 Minimal Boolean Expressions, Prime Implicants / 13.7 Karnaugh Maps / // 13.8 Minimal AND-OR Circuits // 370 // INDEX // 401