Fundamentals of Discrete Math for Computer Science (Record no. 16138)

MARC details
000 -LEADER
fixed length control field 03783nam a22004935i 4500
001 - CONTROL NUMBER
control field 978-1-4471-4069-6
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20170628033634.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 121026s2013 xxk| s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781447140696
-- 978-1-4471-4069-6
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-1-4471-4069-6
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9.M35 
072 #7 - SUBJECT CATEGORY CODE
Subject category code PBD
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code UYAM
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM018000
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code MAT008000
Source bisacsh
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 004.0151
Edition number 23
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Jenkyns, Tom.
Relator term author.
245 10 - TITLE STATEMENT
Title Fundamentals of Discrete Math for Computer Science
Medium [electronic resource] :
Remainder of title A Problem-Solving Primer /
Statement of responsibility, etc by Tom Jenkyns, Ben Stephenson.
264 #1 -
-- London :
-- Springer London :
-- Imprint: Springer,
-- 2013.
300 ## - PHYSICAL DESCRIPTION
Extent XII, 416 p. 143 illus.
Other physical details online resource.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
490 1# - SERIES STATEMENT
Series statement Undergraduate Topics in Computer Science,
International Standard Serial Number 1863-7310
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Algorithms, Numbers and Machines -- Sets, Sequences and Counting -- Boolean Expressions, Logic and Proof -- Searching and Sorting -- Graphs and Trees -- Relations: Especially on (Integer) Sequences -- Sequences and Series -- Generating Sequences and Subsets -- Discrete Probability and Average Case Complexity -- Turing Machines.
520 ## - SUMMARY, ETC.
Summary, etc An understanding of discrete mathematics is essential for students of computer science wishing to improve their programming competence. Fundamentals of Discrete Math for Computer Science provides an engaging and motivational introduction to traditional topics in discrete mathematics, in a manner specifically designed to appeal to computer science students. The text empowers students to think critically, to be effective problem solvers, to integrate theory and practice, and to recognize the importance of abstraction. Clearly structured and interactive in nature, the book presents detailed walkthroughs of several algorithms, stimulating a conversation with the reader through informal commentary and provocative questions. Topics and features: Highly accessible and easy to read, introducing concepts in discrete mathematics without requiring a university-level background in mathematics Ideally structured for classroom-use and self-study, with modular chapters following ACM curriculum recommendations Describes mathematical processes in an algorithmic manner, often including a walk-through demonstrating how the algorithm performs the desired task as expected Contains examples and exercises throughout the text, and highlights the most important concepts in each section Selects examples that demonstrate a practical use for the concept in question This easy-to-understand and fun-to-read textbook is ideal for an introductory discrete mathematics course for computer science students at the beginning of their studies. The book assumes no prior mathematical knowledge, and discusses concepts in programming as needed, allowing it to be used in a mathematics course taken concurrently with a student’s first programming course.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer software.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computational complexity.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Discrete Mathematics in Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithm Analysis and Problem Complexity.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Stephenson, Ben.
Relator term author.
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9781447140689
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Undergraduate Topics in Computer Science,
-- 1863-7310
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="http://dx.doi.org/10.1007/978-1-4471-4069-6">http://dx.doi.org/10.1007/978-1-4471-4069-6</a>
912 ## -
-- ZDB-2-SCS
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Home library Current library Date acquired Source of acquisition Total Checkouts Barcode Date last seen Price effective from Koha item type
    Dewey Decimal Classification     Central Library Central Library 28/06/2017 Springer EBook   E-39317 28/06/2017 28/06/2017 E-Book

Maintained by VTU Library