Discrete mathematics : (Record no. 4941)

MARC details
000 -LEADER
fixed length control field 02323nam a22002537a 4500
003 - CONTROL NUMBER IDENTIFIER
control field NUCLARK
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20250523165859.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 250523b ph ||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9798546314675
040 ## - CATALOGING SOURCE
Original cataloging agency NUCLARK
Transcribing agency NUCLARK
050 ## - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA 39.2 .S73 2021
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Stanoyevitch, Alexander
Relator term author
245 ## - TITLE STATEMENT
Title Discrete mathematics :
Remainder of title a first course /
Statement of responsibility, etc. Alexander Stanoyevitch
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. Los Angeles California :
Name of publisher, distributor, etc. Contemporary Scientific Press,
Date of publication, distribution, etc. c2021.
300 ## - PHYSICAL DESCRIPTION
Extent xviii, 570 pages
Other physical details illustrations ;
Dimensions 25 cm.
365 ## - TRADE PRICE
Price amount $29.95
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc. note Includes index.
505 ## - FORMATTED CONTENTS NOTE
Formatted contents note Preface -- Chapter 1: Chapter 1: Logical Operators -- Chapter 2: Logical Quantifiers -- Chapter 3: Sets -- Chapter 4: Relations and Functions -- Chapter 5: Equivalence Relations and Partial Orderings -- Chapter 6: Mathematical Induction -- Chapter 7: Recursion -- Chapter 8: Some Number Theory -- Chapter 9: Representations of Integers in Different Bases -- Chapter 10: Modular Arithmetic and Congruences -- Chapter 11: Fundamental Principles of Counting -- Chapter 12: Permutations and Combinations -- Chapter 13: Searching and Sorting Algorithms -- Chapter 14: Growth Rates of Functions and Complexity of Algorithms -- Chapter 15: Graph Concepts and Properties -- Chapter 16: Paths, Connectedness, and Distances in Graphs -- Chapter 17: Trees -- Chapter 18: Graph Traversal Problems -- Appendix A: Pseudo Code Dictionary -- Appendix B: Randomness and Probability -- Appendix C: Answers and Solutions to Most Odd-Numbered Exercise -- References -- Index of Algorithms.
520 ## - SUMMARY, ETC.
Summary, etc. ' This textbook has been created to provide an introduction to the important concepts in discrete mathematics that are needed for students who are studying either mathematics or computer science. Material from the authors larger book on the subject has been carefully selected, thoroughly revised, and put together in a way that is intended to make it readable and enticing to students. Many more worked-examples have been added throughout each chapter. Feedback from students and others who have used the earlier book has been used to provide more careful explanations in areas that students usually find difficult. ''
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element COMPUTER SCIENCE -- MATHEMATICS.
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Library of Congress Classification
Koha item type Books
Suppress in OPAC No
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Collection Home library Current library Shelving location Date acquired Source of acquisition Cost, normal purchase price Total Checkouts Full call number Barcode Date last seen Copy number Price effective from Koha item type
    Library of Congress Classification     Non-fiction NU Clark NU Clark Circulation 12/14/2024 Purchased - Amazon 29.95   GC QA 39.2 .S73 2021 c.1 NUCLA000005390 05/23/2025 c.1 05/23/2025 Books
    Library of Congress Classification     Non-fiction NU Clark NU Clark Circulation 12/14/2024 Purchased - Amazon 29.95   GC QA 39.2 .S73 2021 c.2 NUCLA000005391 05/23/2025 c.2 05/23/2025 Books

© 2024 NU LRC CLARK. All rights reserved. Privacy Policy I Powered by: KOHA