Discrete Mathematics for Computer Science : An Example-Based Introduction /

Discrete Mathematics for Computer Science: An Example-Based Introduction is intended for a first or second-year discrete mathematics course for computer science majors. It covers many important mathematical topics essential for future computer science majors, such as algorithms, number representatio...

Full description

Saved in:
Bibliographic Details
Main Author: Fortney, Jon Pierre (Author)
Format: Book Chapter
Language:English
Published: Boca Raton : CRC Press, 2021
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
Call Number :QA 76.9.M35

MARC

LEADER 00000naa a2200000 c 4500
001 106035
003 MY-KlNDU
005 20250522152836.0
006 a|||| |||| 001 0
007 ta
008 250521s20212021flua 001 0 eng d
020 |a 9780367549893 (pbk) 
020 |a 9780367549886 (hbk) 
040 |a MY-KlNDU  |b eng  |c MY-KlNDU  |e rda 
050 0 0 |a QA 76.9.M35 
090 |a QA 76.9.M35  |b F67 2021 
100 1 |a Fortney, Jon Pierre,  |e author 
245 1 0 |a Discrete Mathematics for Computer Science :   |b An Example-Based Introduction /  |c Jon Pierre Fortney 
264 1 |a Boca Raton :  |b CRC Press,  |c 2021 
264 4 |c ©2021 
300 |a xii, 257 pages :  |b illustrations ;  |c 23 cm 
336 |a text  |2 rdacontent 
337 |a unmediated  |2 rdamedia 
338 |a volume  |2 rdacarrier 
500 |a Includes index 
520 |a Discrete Mathematics for Computer Science: An Example-Based Introduction is intended for a first or second-year discrete mathematics course for computer science majors. It covers many important mathematical topics essential for future computer science majors, such as algorithms, number representations, logic, set theory, Boolean algebra, functions, combinatorics, algorithmic complexity, graphs, and trees. Features designed to be especially useful for courses at the community college level Ideal as a first or second-year textbook for computer science majors, or as a general introduction to discrete mathematics Written to be accessible to those with a limited mathematics background and to aid with the transition to abstract thinking Filled with over 200 worked examples, boxed for easy reference, and over 200 practice problems with answers. Contains approximately 40 simple algorithms to aid students in becoming proficient with algorithm control structures and pseudocode. An appendix on basic circuit design provides a real-world motivational example for computer science majors by drawing on multiple topics covered in the book to design a circuit that adds two eight-digit binary numbers. 
590 |a RM262.99 
650 0 |a Computer science  |x Mathematics 
942 |2 lcc  |c 1 
999 |c 106035  |d 106035