Discrete Mathematics for Information Technology - First Canadian Edition (Record no. 91)

MARC details
000 -LEADER
fixed length control field 02293nam a2200301 i 4500
001 - CONTROL NUMBER
control field UUN-OA-2067
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20260922220304.0
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781997025078
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Simon Crothers
245 10 - TITLE STATEMENT
Title Discrete Mathematics for Information Technology - First Canadian Edition
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Name of producer, publisher, distributor, manufacturer Kwantlen Polytechnic University
Date of production, publication, distribution, manufacture, or copyright notice 2026
300 ## - PHYSICAL DESCRIPTION
Extent 1 online resource
336 ## - CONTENT TYPE
Content type term text
Content type code txt
Source rdacontent
337 ## - MEDIA TYPE
Media type term computer
Media type code c
Source rdamedia
338 ## - CARRIER TYPE
Carrier type term online resource
Carrier type code cr
Source rdacarrier
520 ## - SUMMARY, ETC.
Summary, etc. Discrete Mathematics for Information Technology is an applied, student-focused introduction to the mathematical foundations that underpin modern computing. Designed for learners in information technology and business contexts, this textbook bridges theory and practice by connecting core concepts, such as number systems, data representation, logic, proofs, relations, algorithms, Boolean algebra, and graph theory, to real-world applications in programming, networking, databases, and systems design. Each chapter is structured with clear explanations, worked examples, case studies, and programming-oriented exercises that reinforce both conceptual understanding and practical skills. Emphasis is placed on developing analytical thinking, problem-solving, and the ability to model and reason about digital systems with precision and confidence. As an open educational resource, the text is adaptable and accessible, supporting a wide range of teaching and learning environments. By integrating mathematical rigor with authentic IT scenarios, this book equips students with the essential tools needed to succeed in modern, data-driven and technology-focused careers.
540 ## - TERMS GOVERNING USE AND REPRODUCTION NOTE
Terms governing use and reproduction Attribution-NonCommercial-ShareAlike
650 #4 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer Science
650 #4 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Mathematics
650 #4 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element B. Sc. Artificial Intelligence
Source of heading or term local
650 #4 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element B. Sc. Computer Science
Source of heading or term local
650 #4 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element B. Sc. Cyber Security
Source of heading or term local
650 #4 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element B. Sc. Information System
Source of heading or term local
650 #4 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element B. Sc. Information Technology
Source of heading or term local
650 #4 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element B. Sc. Software Engineering
Source of heading or term local
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://kpu.pressbooks.pub/discretemath/">https://kpu.pressbooks.pub/discretemath/</a>
Link text Read online
856 42 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://open.umn.edu/opentextbooks/textbooks/discrete-mathematics-for-information-technology-first-canadian-edition">https://open.umn.edu/opentextbooks/textbooks/discrete-mathematics-for-information-technology-first-canadian-edition</a>
Link text Open Textbook Library record

No items available.