Discrete Structures for Computer Science: Counting, Recursion, and Probability
简介：
这是一本针对计算机科学专业学生的本科课程的免费教科书，自2013年秋季学期以来，我一直在卡尔顿大学任教。该材料作为第二年课程COMP 2804 (离散结构II) 提供。假设学生已经参加了COMP 1805 (离散结构I)，其中涵盖了数学推理，基本证明技术，集合，函数，关系，基本图论，渐近符号和可数性。
在为期12周的学期中，每周有3个小时的课程，我涵盖了本书中的大部分材料，但第2章除外，该章已包含在内，以便学生可以从COMP 1805中复习材料。
英文简介：
This is a free textbook for an undergraduate course on Discrete Structures for Computer Science students, which I have been teaching at Carleton University since the fall term of 2013. The material is offered as the second-year course COMP 2804 (Discrete Structures II). Students are assumed to have taken COMP 1805 (Discrete Structures I), which covers mathematical reasoning, basic proof techniques, sets, functions, relations, basic graph theory, asymptotic notation, and countability.
During a 12-week term with three hours of classes per week, I cover most of the material in this book, except for Chapter 2, which has been included so that students can review the material from COMP 1805.
- 书名
- Discrete Structures for Computer Science: Counting, Recursion, and Probability
- 译名
- 计算机科学的离散结构：计数、递归和概率
- 语言
- 英语
- 年份
- 2019
- 页数
- 404页
- 大小
- 1.36 MB
- 标签
- 计算机科学
- 概率论
- 下载
Discrete Structures for Computer Science: Counting, Recursion, and Probability.pdf- 密码
- 65536
最后更新：2025-04-12 23:58:08
←Don't Just Roll the Dice - A Usefully Short Guide to Software Pricing (Version 2.0.0)