I am teaching a one-semester discrete math course this coming semester and I am having trouble finding a textbook appropriate for the structure of the course I plan to teach. My school currently is using Mathematical Structures for Computers Science by Judith Gersting, but this book is too long for a one-semester course.
Most textbooks that I've seen begin with a section on formal logic then the rest of the textbook consists of applications of this formal logic to sequences, series, graphs, matrices, etc. I have some reservations about this approach; the biggest being that for me personally, I learn best by building intuition through examples then learning the (more dry) theory afterwards.
I am currently looking at Fundamentals of Discrete Math for Computer Science by Jenkyns and Stephenson. I really like their approach to the subject, but I also have some concerns about their exposition. Many of the motivating examples have bawdy humor and mildly inappropriate remarks that remind the reader that computer science, historically, is a 'Boys Club.' I am worried about these remarks putting off students who are underrepresented in the subject. One particular example is:
"Throughout this text, we have written about algorithms - methods for doing computations or processing data. \\not algorithms to tie your shores or find the G-spot" (page 405).
Similar examples are scattered throughout the book.
I have two questions:
Does anybody have any suggestions for books that are similar in organization to Jenkyns and Stephenson, but are more sensitive to issues of representation in STEM fields?
If not, what strategies could I use to teach around these problematic aspects of the book?