Mathematics for Algorithm and Systems Analysis

The second part of the two series of book, used to teach discrete mathematics that includes Boolean arithmetic, combinatorics, elementary logic, induction, graph theory and finite probability in the University of California, San Diego.

**Tag(s):**
Discrete Mathematics

**Publication date**: 01 Jul 2005

**ISBN-10**:
0486442500

**ISBN-13**:
n/a

**Paperback**:
248 pages

**Views**: 25,703

Mathematics for Algorithm and Systems Analysis

The second part of the two series of book, used to teach discrete mathematics that includes Boolean arithmetic, combinatorics, elementary logic, induction, graph theory and finite probability in the University of California, San Diego.

Book Excerpts:

Discrete mathematics is an essential tool in almost all subareas of computer science. Interesting and challenging problems in discrete mathematics arise in programming languages, computer architecture, networking, distributed systems, database systems, AI, theoretical computer science, and other areas.

This textbook is the second part of the two series of book, used to teach two-quarter course sequence in discrete mathematics that includes Boolean arithmetic, combinatorics, elementary logic, induction, graph theory and finite probability in the University of California, San Diego (USCD). These courses are core undergraduate requirements for majors in Computer Science, Computer Engineering, and Mathematics-Computer Science.

This text, Mathematics for Algorithm and System Analysis, was developed for the second quarter and the other text, A Short Course in Discrete Mathematics was developed for the first quarter. With appropriate students, this text could be used without the first.

This book consists of four units of study (Counting and Listing -- CL; Functions -- Fn; Decision Trees and Recursion -- DT; and Basic Concepts of Graph Theory -- GT), each divided into four sections. Each section contains a representative selection of problems. These vary from basic to more difficult, including proofs for study by mathematics students or honors students. The first three sections in units CL and Fn are primarily a review of material in A Short Course in Discrete Mathematics needed for this course.

The review questions. 'Multiple Choice Questions for Review' appear at the end of each unit. The explanatory material in this book is directed towards giving students the mathematical language and sophistication to recognize and articulate the ideas behind these questions and to answer questions that are similar in concept and difficulty. Many variations of these questions have been successfully worked on exams by most beginning students using this book at UCSD.

Intended Audience:

Students who master the ideas and mathematical language needed to understand these review questions gain the ability to formulate, in the neutral language of mathematics, problems that arise in various applications of computer science. This skill greatly facilitates their ability to discuss problems in discrete mathematics with other computer scientists and with mathematicians.

Discrete mathematics is an essential tool in almost all subareas of computer science. Interesting and challenging problems in discrete mathematics arise in programming languages, computer architecture, networking, distributed systems, database systems, AI, theoretical computer science, and other areas.

This textbook is the second part of the two series of book, used to teach two-quarter course sequence in discrete mathematics that includes Boolean arithmetic, combinatorics, elementary logic, induction, graph theory and finite probability in the University of California, San Diego (USCD). These courses are core undergraduate requirements for majors in Computer Science, Computer Engineering, and Mathematics-Computer Science.

This text, Mathematics for Algorithm and System Analysis, was developed for the second quarter and the other text, A Short Course in Discrete Mathematics was developed for the first quarter. With appropriate students, this text could be used without the first.

This book consists of four units of study (Counting and Listing -- CL; Functions -- Fn; Decision Trees and Recursion -- DT; and Basic Concepts of Graph Theory -- GT), each divided into four sections. Each section contains a representative selection of problems. These vary from basic to more difficult, including proofs for study by mathematics students or honors students. The first three sections in units CL and Fn are primarily a review of material in A Short Course in Discrete Mathematics needed for this course.

The review questions. 'Multiple Choice Questions for Review' appear at the end of each unit. The explanatory material in this book is directed towards giving students the mathematical language and sophistication to recognize and articulate the ideas behind these questions and to answer questions that are similar in concept and difficulty. Many variations of these questions have been successfully worked on exams by most beginning students using this book at UCSD.

Intended Audience:

Students who master the ideas and mathematical language needed to understand these review questions gain the ability to formulate, in the neutral language of mathematics, problems that arise in various applications of computer science. This skill greatly facilitates their ability to discuss problems in discrete mathematics with other computer scientists and with mathematicians.

Tweet

About The Author(s)

Edward A. Bender is a Professor Emeritus of Mathematics in the Department of Mathematics at the UC San Diego. He received his Ph.D. in Mathematics at California Institute of Technology in 1966.

S. Gill Williamson is Professor Emeritus in the Department of Computer Science and Engineering at the University of California San Diego. His main research area is Algorithmic Combinatorics.

Book Categories

Computer Science
Introduction to Computer Science
Introduction to Computer Programming
Algorithms and Data Structures
Artificial Intelligence
Computer Vision
Machine Learning
Neural Networks
Game Development and Multimedia
Data Communication and Networks
Coding Theory
Computer Security
Information Security
Cryptography
Information Theory
Computer Organization and Architecture
Operating Systems
Image Processing
Parallel Computing
Concurrent Programming
Relational Database
Document-oriented Database
Data Mining
Big Data
Data Science
Digital Libraries
Compiler Design and Construction
Functional Programming
Logic Programming
Object Oriented Programming
Formal Methods
Software Engineering
Agile Software Development
Information Systems
Geographic Information System (GIS)

Mathematics
Mathematics
Algebra
Abstract Algebra
Linear Algebra
Number Theory
Numerical Methods
Precalculus
Calculus
Differential Equations
Category Theory
Proofs
Discrete Mathematics
Theory of Computation
Graph Theory
Real Analysis
Complex Analysis
Probability
Statistics
Game Theory
Queueing Theory
Operations Research
Computer Aided Mathematics

Supporting Fields
Web Design and Development
Mobile App Design and Development
System Administration
Cloud Computing
Electric Circuits
Embedded System
Signal Processing
Integration and Automation
Network Science
Project Management

Operating System
Programming/Scripting
Ada
Assembly
C / C++
Common Lisp
Forth
Java
JavaScript
Lua
Rexx
Microsoft .NET
Perl
PHP
R
Python
Rebol
Ruby
Scheme
Tcl/Tk

Miscellaneous
Sponsors