000			02124 m a2200205 44500
001			sulb-eb0028818
003			BD-SySUS
005			20160428134632.0
008			s2008 xx |||||||||||| ||||und d
020			_a9780071337007
020			_a
037			_c4,020
040	1		_aXX-XxUND _cXX-XxUND _dBD-SySUS.
100	1		_4A01 _aLIU,
245	1		_aELEMENT OF DISCRETE MATHEMATICS (SIE) _h[electronic resource] /
300			_a584 p.
520			_aThis book, intended for a 3rd/4th Semester course on Discrete Mathematics, presents the subject in an algorithmic point of view without adhering to any particular language. The subject has been treated using concepts and solved examples juxtaposed against each other. Key features A Pseudocode approach to Algorithms Extensive coverage on Algorithm Analysis with one chapter dedicated to this topic Turing Machines, Computability and Formal Languages-topics core to the subject are dealt with comprehensively Online Learning Center, in the face of none provided by major competing titles Pedagogy: Solved Examples: 262 Problems: 694 Programming Exercises: 36 Figures: 230 New to the Edition : Complete and focused coverage of syllabus Better chapter organization: Chapters on Computability and Formal Languages and Finite State Machines clubbed into one. Numerous new topics like Rules of Inference, Warshall?s Algorithms, DFS, BFS, Semi-Groups and Monoids added New pedagogical feature in the form of Programming Exercises added under relevant chapters. Over 300 solved and unsolved problems added (189 additional problems and 139 solved problems) An exhaustive OLC in the making Enhanced stress on Propositional Calculus and Discrete Probability New pedagogical feature in the form of programming exercises in the revised edition Various Graph Algorithms such as Kruksal?s, Prim?s, and Djikstra?s Algorithms have been added Better organization by clubbing two chapters on Automata into one
856	4	0	_uhttp://mcgrawhilleducation.pdn.ipublishcentral.com/product/element-discrete-mathematics-sie _zLink to access the E-book
942			_ceBooks
999			_c52485 _d52485