000			03048nam a22002534504500
008			040629/20002000////////r///////////eng//
020			_a0130831433
040			_aSV-SoUDB _bspa
041			_aeng
082	0		_a511 _bK81 _c2000
100	1	0	_aKolman, Bernard, _d1932- _eAutor
245	1	0	_aDiscrete mathematical structures. / _cBernard Kolman; Robert C. and Sharon Cuffer Ross
250			_a4th ed.
260			_aNEW JERSEY, ESTADOS UNIDOS : _bPRENTICE HALL, _c2000
300			_axiv , 505 p. ; _c24 cm.
520	0		_aDiscrete mathematics is a difficult course to teach and to study at the freshman and sophomore level for several reasons. It is a hybrid course. Its content is mathematics, but many of its applications and more than half its students are from computer science. Thus careful motivation of topics and previews of applications are im- portant and necessary strategies. Moreover, the number of substantive and diverse topics covered in the course is high, so that student must absorb them rather quickiy. At the same time, the student may aiso be expected to develop proof-writing skills. APPROACH First, we have limited both the áreas covered and the depth of coverage to what we deemed prudent in afirst course taught at the freshman and sophomore level. We have identified a set of topics that we feel are of genuine use in computer science and elsewhere and that can be presented in a logically coherent fashion. We have presented an introduction to these topics along with an indication of how they can be pursued in greater depth. Por example, we cover the simpler finite-state machines, not Turing machines. We have limited the coverage of abstract algebra to a discussion of semigroups and groups and have given application of these to the important topics of finite-state machines and error-detecting and error-correcting codes. Error-correcting codes, in turn, have been primarily restricted to simple linear codes. Second, the material has been organized and interrelated to minimize the mass of definitions and the abstraction of some of the theory. Relations and digraphs are treated as two aspects of the same fundamental mathematical idea, with a directed graph being a pictorial representation of a relation. This fundamental idea is then used as the basis of virtually all the concepts introduced in the book, including functions, partial orders, graphs, and algebraic structures. Whenever possible, each new idea introduced in the text uses previously encountered material and, in turn, is developed in such a way that it simplifies the more complex ideas that follow. Thus partial orders, lattices, and Boolean algebras develop from general relations. This material in turn leads naturally to other algebraic structures.
650	0	4	_aCOMPUTER SCIENCE - MATHEMATICS
650	0	4	_aCOMPUTACION
650	0	4	_aMATEMATICA PARA COMPUTACION
650	0	4	_aCIENCIAS BASICAS
700	1	0	_aBusby, Robert C _e
700	1	0	_aRoss, Sharon Cutler _d1943- _e
942			_2ddc _b29/06/2004 _cLIB _eJorge Bonilla
999			_c20759 _d20759