Geometry.Net - the online learning center
Home  - Pure_And_Applied_Math - Discrete Math Bookstore
Page 5     81-100 of 116    Back | 1  | 2  | 3  | 4  | 5  | 6  | Next 20

         Discrete Math:     more books (100)
  1. Discrete Math for Computer Science (Instructor's Manual)
  2. Finite/Discrete Math by Gordon, 1997-08
  3. 2/e Set S/m Discrete Maths Comp Proj by Rosen, 1988-01-01
  4. Decision and Discrete Mathematics: Maths for Decision-Making in by Ian Hardwick, 1996
  5. Cme,Dis Math W/BCA Tut/Info 3e by EPP,
  6. Student's Solutions Guide to accompany Discrete Mathematics and Its Applications by Kenneth H. Rosen, 2006-07-27
  7. Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Proceedings in Applied Mathematics) by Siam, 1995-07-14
  8. DISCRETE MATHEMATICS by Kemeny; Kurtz Math Series, 1988
  9. Discrete Mathematics: A Computational Approach Using Basic (Computers and Math Series) by Marvin Marcus, 1983-08
  10. Exploring Discrete Mathematics With Maple by John S. Devitt, Troy Vasiga, et all 1996-08-01
  11. Cme,Discrete TRANS to Adv Math by RICHMOND,
  12. 3D Math Primer for Graphics and Game Development (Wordware Game Math Library) by Fletcher Dunn, 2002-06-25
  13. Advanced Math: Solution Key by Richard G. Brown, 1993-09-30
  14. Math Toolkit for Real-Time Programming by Jack Crenshaw, 2000-09

COSC/MATH 2300 discrete mathEMATICS. Spring 2004. MWF 110200, Engineering Hall, Room 3114. Course URL http//
X-URL: >
Spring 2004
MWF 1:10-2:00, Engineering Hall, Room 3114
Course URL:
Instructor: Prof. D. Spears Phone/Office: 766-5485 / 4087 ENG Office Hours: M 4-5pm; W 5-6pm; R 1-4pm Email: dspears arobase Grader: Paul Hansen Text: Discrete Mathematics and Its Applications, 5th Edition Author: Kenneth Rosen Publisher: McGraw-Hill ISBN: Optional addition: Student Solution Guide
Course Description:
Discrete structures are widely used in computer science, both in the design and analysis of computer programs. This course teaches about the major types of discrete structures, along with important methods of mathematical reasoning about these structures. The material covered includes formal logic, set theory, functions, introductory number theory and graph theory, proofs, proof by induction, combinatorics and, if time permits, probability. The course provides an introduction to the abstract and rigorous thinking that is required in other mathematics and computer science courses.
COSC 1030 (Computer Science I) and either MATH 2200 (Calculus I) or 2350 (Business Calculus)
Tentative Lecture Schedule (open to change check here regularly for updates):
Students are expected to know the following material by having had the course prerequisites. This material will NOT be taught in class:

82. Discrete Math 234144
The spring 2002 course homepage is located here You will be automatically moved there in 3 seconds. The winter 2001/2 course homepage is located here.
The spring 2002 course homepage is located here
You will be automatically moved there in 3 seconds. The winter 2001/2 course homepage is located here

83. Spring 2003 -- UCSC CMPE 016H -- Honors Applied Discrete Math
Honors Applied discrete math. Computer Engineering 16H. Spring 2003. Instructor Kevin correspond.). What is Applied discrete math? Discrete
Honors Applied Discrete Math
Computer Engineering 16H
Spring 2003
Kevin Karplus
There are no TAs for CMPE 16H, but you may use the office hours and discussion sections of the CMPE 16 TAs if you need extra help.
Lecture times:
MWF 12:30-1:40 Natural Sciences Annex 103 Note: for the first day of class (Wed. April 2), please go to the CMPE 16 class at the same time in Baskin Engineering 152.
Office Hours:
Wed. 10:00-11:30 a.m.
Kenneth H. Rosen Discrete Math and Its Applications 5th edition, McGraw Hill, 2003. (I'm sorry, but because homework problem and example numbers will differ, it will not be feasible to use older editions, even though the content is not substantially different. There was substantial rearrangement and new material for the fifth edition, so section numbers no longer correspond.)
What is Applied Discrete Math?
"Discrete math" refers to many different branches of mathematics (logic, naive set theory, number theory, group theory, graph theory, combinatorics, ...). Excluded are the fields that rely on "continuity" and "limits" (such as calculus, real numbers, complex numbers, ...). Because "discrete math" covers so much of mathematics, we can only cover a small fraction of it in this course. For this course, we have selected a number of topics that are particularly useful to computer scientists and computer engineers. The key topics are listed in the

84. CMPE 16---Applied Discrete Math
CMPE 16Applied discrete math. Kevin Karplus. A required course for computer engineering majors and computer and information sciences majors.
CMPE 16-Applied Discrete Math
Kevin Karplus A required course for computer engineering majors and computer and information sciences majors.
Spring 2003 16H Syllabus
Winter 98 Syllabus
Fall 97 Syllabus
Fall 96 Syllabus ...
Winter 96 Syllabus (old)
There are some musings about my teaching style for this course that may be of interest to students in the class. Kevin Karplus
Computer Engineering
University of California, Santa Cruz
Santa Cruz, CA 95064

85. Ottawa-Carleton Discrete Math Day 2004
OttawaCarleton discrete math Day 2004. Saturday April 24, 2004. The Ottawa-Carleton discrete math Day is held annually in the Spring.
Ottawa-Carleton Discrete Math Day 2004
Saturday April 24, 2004
School of Mathematics and Statistics
Carleton University
Past years homepages: DMD 2003 , and DMD 2002 The Ottawa-Carleton Discrete Math Day is held annually in the Spring. It location alternates between Carleton University and University of Ottawa. It is a continuation of the Carleton Discrete Math Day held since 1978 at Carleton University. The meeting format consists of 4 lectures by leading researchers covering a broad range of topics in Discrete Mathematics and presented during one day. In addition to these talks, there is a related Colloquium talk on the Friday before the Discrete Math Day. The objective of the meeting is to gather researchers, postdocs and graduate students in various fields of Discrete Mathematics during one weekend in order to stimulate research collaboration in this vibrant and inter-disciplinary area. Discrete Mathematics is a broad area involving the study of the properties, algorithms and applications of mathematical structures built on discrete objects. This year's speakers for the Discrete Mathematics Day conduct research in the areas of algorithms, combinatorial optimization, combinatorial enumeration and graph theory.

86. Discrete Math
discrete math. discrete math will be offered in alternating semesters with Statistics and Probability. When it comes to learning, we click!
Rockingham County Public Schools Visitors Employees Parents K-5 Students ... Home Discrete Math SOLs Resources by SOL Overview D.O.E. Resources ... Curriculum Home Overview Text: Excursions in Modern Mathematics , Prentice Hall
Grade Levels
Algebra I (or Algebra I, Parts 1 and 2), Geometry, and Algebra II in lieu of Analysis/Calculus but may wish to take it in addition to these courses. Discrete Math will be offered in alternating semesters with Statistics and Probability. When it comes to learning, we click!

87. Advanced Discrete Mathematics
Introduction Research Areas Project. Professor Ph.D. Candidates MS Candidates Research Affiliates Alumni Staff. discrete math Async.
Introduction Research Areas Project Professor ... Research
Advanced Discrete Mathematics Classification Required Course Number DIC 1508 Credit Instructor Prof. Dong-Ik Lee Course Description Discussions of database structures and algorithms, to study the concepts of graph theory, automata theory and complexity, and computational theory Text Book Reference Books Prerequisite Link Concurrent System Research Lab Information and Communications
Kwangju Institute of Science and Technology

88. Discrete Math
Faculty Alex Rolon Courses discrete math, Syllabus; Solutions to Hand in Homework.
Faculty Alex Rolon Courses

89. Discrete Math/Theory Of Computing Seminar
Focus of seminar This seminar is intended to include topics in discrete mathematics (combinatorics and graph theory) and the theory of computation.
Time: Fridays, 11:00am-11:50am
Place: Carver
Send email to to volunteer to give a talk.
Click here
to see details on the mission and focus of the seminar. (The seminar will be on Fridays at 2:10pm for fall semester, 2004.) Spring 2004 Schedule (updated 3/26/04) Date Speaker Title (click on title to see abstract) Apr. Stephen Willson Building supertrees using distances, part II Roger Maddux Some problems about coloring the edges of a complete graph Douglas Ray A greedy algorithm for enhancing cage search Alex Burstein Restricted Dumont Permutations No Seminar Last day of classes.
Email to volunteer to give a talk for Fall 2004. Guests welcome. We have a link to the algebraic combinatorics "white paper" from FPSAC '03: ps-format dvi-format text-format Focus of seminar This seminar is intended to include topics in discrete mathematics (combinatorics and graph theory) and the theory of computation. In particular, we will see extremal graph theory, probabilistic methods, algebraic methods, enumerative combinatorics, association schemes, design theory, algorithms, optimization, complexity theory and other related topics. Students are encouraged to attend and give talks. We are interested in disseminating techniques across these interrelated disciplines. New research is always welcome, but talks on well-established techniques are encouraged. Apr. 2: Stephen J. Willson, Building supertrees using distances, part II

90. Big Sky Discrete Mathematics Home Page
2004 Big Sky Conference on discrete mathematics. 2004 Announcement and Registration Information Conference Announcement (in pdf
Big Sky Conference on Discrete Mathematics
2004 Announcement and Registration Information
Conference Announcement:
(in pdf format)
The tenth annual Big Sky Conference on Discrete Mathematics will be held at the University of Montana-Missoula, 9-11 September 2004 . The invited speakers include Prof. Brian Alspach (Univeristy of Regina).
  • The registration and abstract deadline is August 24, 2004. The student support deadline is August 13, 2004. (Please note this earlier deadline. This page will be updated periodically. The conference schedule will be posted here approximately 10 days before the conference begins.

We'd like to thank our SPONSORS:
and The Institute of Combinatorics and its Applications

91. APC515 Data Structures And Discrete Math
APC515 Data Structures and discrete math. 3 credits. Scheduling There is currently no scheduling information for Data Structures and discrete math.
Department of
Computer Science
and Engineering Education Admission Research Student Life ... Etc. Education Advising and Orientation Master of Science... CSE EE Software Engineering Should I write a master's thesis M.S. thesis option... CSE EE Ph.D.... CSE EE Course Index
Course Renumbering effective Fall 03... CSE EE Class Schedule OGI Class Schedule 2003-2004 academic year Distance Learning Academic Calendar ... Online registration
APC515 Data Structures and Discrete Math
3 credits Description This course covers fundamental topics in data struc tures and discrete mathematics. The topics are presented in an integrated manner that provides the discrete math foundations for data structures and computing applications of discrete mathematics concepts. Topics include stacks, queues, linked lists, trees, algorithms for searching and sorting, finite state automata, and concepts of computability and decidability. Topics from discrete math include sets and various types of relations (functions, graphs, trees, lattices), recursion and inductive proofs, boolean logic, relational algebra, predicate calculus, series and limits, and asymptotic behavior of searching and sorting algorithms. Programming exercises are assigned throughout the course. Prerequisites Or equivalent knowledge of C or C++.

92. Discrete Math
Home Advisory Starter Problems Adv Algebra/Trig Algebra II 9H Statistics, Current Assignment. Current Cycle Problem. Previous Assignments. Homepage.htm
Current Assignment Current Cycle Problem Previous Assignments

93. Elementary Discrete Math Problems
Elementary discrete math Problems. Introduction. Currently the discrete math solutions are just a minute fraction of the problems that i have solved.
Elementary Discrete Math Problems
During Fall 2001 I was a TA for an undergraduate class on the Analysis of Programs. The main focus though of that class was Discrete Mathematical Techniques. I spent quite some time writing up solutions to some problems from the text book of that course, viz. Discrete Mathematics and its Applications . These pages on discrete mathematics were born out of that work. Currently the discrete math solutions are just a minute fraction of the problems that i have solved. Right now only the structure of book has finally stabilized and now I can add many more problems. Keep coming back to see new versions!
Resources Available here
Suvrit Sra Last modified: Thu Oct 23 16:58:15 CDT 2003

94. Theoretical Computer Science And Discrete Mathematics Home Page
world. In the same year the weekly seminar (now known as Theoretical Computer Science and discrete math Seminar) was established.
School of Mathematics
Theoretical Computer Science and Discrete Mathematics
Abacus "Analytical engine"
by Charles Babbage
Turing machine Our sponsors: National Science Foundation
State of New Jersey

If you would like to learn about this program and our activities, follow one of these links or read the background information below. Background Information
Welcome to the home page of the special program in Theoretical Computer Science and Discrete Mathematics ( TCS/DM This field is one of the most vibrant and active areas of scientific study today. Starting half a century ago, even before computers existed, theoretical computer science set out to define mathematically the concept of "computation", and to study its power and limits. The theoretical discoveries of Alan Turing, John von Neumann (Institute faculty member 1933-57) and their contemporaries led to the practical construction of the first stored program computer at the IAS, followed by the computer "revolution" we are witnessing today. The practical use of computers, and simultaneously the unexpected mathematical depth of the abstract notion of "computation" has significantly altered and expanded theoretical computer science. In the last quarter century it has turned into a rich and beautiful field, making connections to other areas and attracting talented young scientists. More technical (but still popular) description of various related aspects can be found in these brief essays:

95. Discrete Math Cis 175
. This course covers sets, counting, recursion, complexity, graph theory, boolean algebra, finite automata, and language theory.......
This course covers sets, counting, recursion, complexity, graph theory, boolean algebra, finite automata, and language theory.
  • Syllabus Lecture 5.1-6.1
  • Lecture 6.2-6.4
  • Lecture 6.5-6.7 ...
  • Project 1 ESIE
  • 96. Discrete Math Group Page
    Department of Computer Science Florida State University. The discrete math group deals mostly with number theory and modern algebra problems.
    Group: DM
    Discrete Mathematics
    Department of Computer Science
    Florida State University
    The discrete math group deals mostly with number theory and modern algebra problems. The group's current focus is developing software that generates primitive polynomials over GF(2) of a Mersenne Prime degree. After this software has been fully optimized, we will use it to help us implement the Mersenne Twister psuedorandom number generator. GROUP MEETINGS
    Time: Wednesdays 8:00 AM
    Place: 486 Dirac Science Library MEMBERS
    Dr. Chi-Ok Hwang

    Chi-Ok's home page
    Shyam Lakshmin
    Jason Parker


    PRNG Group

    Testing Group
    QRNG Group Discrete Group MCPDE Group QMC Group Finance Group PRINCIPLE INVESTIGATOR Prof. Michael Mascagni WEBMASTER Ethan Kromhout Project 6 Software Determining ith Primitive Polynomial Primitive polynomials are essential and basic in pseudo-random and quasi-random number generation. In this project of software developement determining i-th primitive polynomial, given a primitive polynomial of degree d, we find all the other primitive polynomials of degree d. Project 8 Finding Primitive Roots One problem necessary to our group's research is finding primitive roots of a prime p. We are mostly concerned with p being a Mersenne Prime, where p=2^k-1. A number a is a primitive root of an integer n if a is relatively prime to n and a is of order phi(n) modulo n. In the case where n is prime, phi(n) = n-1. For a to have order n-1, n-1 must be the smallest exponent j for which 2^j = 1 mod n. This happens if a^((n-1)/d)!=1 for every prime divisor d of n-1. The main obstacle in this process is finding all prime factor of n-1. If one only checks prime divisors below a certain bound, he has only some probablity of a being a primitive root of n-1. If one has found a primitive root a, a^i is also a primitive root for all i such that gcd(i,n-1)=1.

    97. Chantilly High School
    Part 2 Algebra 2 Algebra 2 Honors Personal and Financial Mathematics Trigonometry Math Analysis Prob and Stat AP Statistics discrete math Precalculus Honors AP
    4201 Stringfellow Road, Chantilly, VA 20151 (703)222-8100 About CHS Academics Activities Administration ... Student Services Mathematics
    Main Mathematics

    Joan Black,

    Department Chair

    Henry Bruno

    Barbara Burleson
    Jean St. Clair

    Algebra 1, Part 1

    Algebra 1, Part 2
    Geometry Geometry Honors ... Matrix Algebra Discrete Mathematics Semester Course (315432) Grades 11 - 12 Credit: one half Prerequisite: Algebra 2 or Algebra 2 Honors
    Course content includes management science, the mathematics of apportionment, martix operations and applications, recursion, and discrete application in the natural and social world. Last Updated: 6/04/2004 Maintained by Web Page Class at Chantilly High School Contact: Mrs Audrey Kirtland

    98. COMS W3203-2 Discrete Math
    COMS W32032 discrete math. Tentative schedule (subject to change). Course Outline for COMS W3203-2 discrete math. Original Date. Class No. Semester Date.
    COMS W3203-2: Discrete Math Registration Information
    Online Course Preview
    Foundations: logic, sets, sequences, strings, proofs, mathematical induction, recursion. Number theory: Euclidean algorithm, modular arithmetic, Chinese remainder theorem, RSA encryption. Combinatorics: permutations and combinations, elementary finite probability, recurrence relations, inclusion-exclusion principle. Graph theory: isomorphism, planarity, circuits, trees, directed graphs. PROFESSOR GRUNSCHLAG: Assistant Professor, Computer Science Department
    • research interests include both theoretical and applied aspects of Computer Science; the theoretical research concerns connections between classes of groups and corresponding complexity classes of formal languages. The techniques employed are of a geometric nature. His main applied research area is that of Image Compression. For more information about Professor Grunschlag, please visit:
    APPLICABLE DEGREE PROGRAMS This course is a co-requesite for Data Structures (CS 3137 or 3139) and together, these two courses are pre-requisite for most of the junior and senior level course offered by the CS department.

    99. COMS W3203-2 Discrete Math
    COMS W32032 discrete math.
    COMS W3203-2: Discrete Math Registration Information
    Online Course Preview
    • Understanding of the theory behind useful techniques in Computer Science.
    • Computer Science Masters breadth requirement
    ADDITIONAL COURSE FEES Please visit the course homepage at for additional information. For more information, comments, or suggestions, please email us at
    Last Update: 23-Aug-02

    100. First Bay Area Discrete Math Day
    The Bay Area discrete math Day, FALL 2000. This meeting intends to increase the communication between researchers and graduate students
    The Bay Area Discrete Math Day, FALL 2000
    This meeting intends to increase the communication between researchers and graduate students of discrete mathematics around the San Francisco bay area. The term ``discrete mathematics'' certainly includes the following topics: Algebraic and Enumerative Combinatorics, Discrete Geometry, Graph Theory, Coding and Design Theory, Combinatorial Aspects of Algebra and Geometry, Combinatorial Optimization, Probabilistic Combinatorics, Combinatorics in Mathematical Physics, etc. The goal is to have two annual meetings where some specialists will present some recent advances in the field and where we could have a good opportunity to talk about discrete mathematics. The first meeting will take place at UC Davis Friday, October 20, 2000 and it is planned to be adjacent to the 2000 Fall AMS Western Section Meeting to take place in San Francisco, CA, October 21-22, 2000. A special issue of Discrete and Computational Geometry is planned for these two events. Here is the list of invited talks and the schedule for the conference. All talks will take place in KERR HALL 693 (check out this map of campus which shows VP25 the visitor parking closest to Kerr hall Here you can find driving directions to UC Davis campus.:

    Page 5     81-100 of 116    Back | 1  | 2  | 3  | 4  | 5  | 6  | Next 20

    free hit counter