Proceedings of the Fourth SIGCSE Technical Symposium on Computer Science Education - SIGCSE '74 1974
DOI: 10.1145/800183.810461
|View full text |Cite
|
Sign up to set email alerts
|

A first course in discrete structures with applications to computer science

Abstract: This paper describes an introductory course in discrete structures for the undergraduate computer science student that has evolved at the University of Saskatchewan, Saskatoon. The philosophy of suth a course and certain problems encountered in preparing and teaching it are discussed.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
47
0

Year Published

1992
1992
2013
2013

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 48 publications
(47 citation statements)
references
References 5 publications
0
47
0
Order By: Relevance
“…, d if and only if it contains x, i for all i. This lattice is sometimes called the direct product of the dimensional lattices [27].…”
Section: Msdbmentioning
confidence: 99%
“…, d if and only if it contains x, i for all i. This lattice is sometimes called the direct product of the dimensional lattices [27].…”
Section: Msdbmentioning
confidence: 99%
“…Furthermore, observe that the shape tuple of a MATLAB expression can be any element in some equivalence class under ℘. Each equivalence class in the set of equivalence classes under ℘-called the quotient set of S by ℘ (see [14])-corresponds to a canonical shape tuple and vice versa.…”
Section: Shape Algebra Basicsmentioning
confidence: 99%
“…Moreover, the dual of a read-k-CNF is a read-k-DNF, and vice-versa. By the duality law (e.g., Tremblay & Manohar, 1961), any identity or theorem about formulas remains true when the formulas are replaced by their duals.…”
Section: Dualitymentioning
confidence: 99%