Result page:
1
2
3
4
5
6
7
8
9
10
>>
1
March 2009
ACM-SE 47: Proceedings of the 47th Annual Southeast Regional Conference
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 2, Downloads (12 Months): 39, Downloads (Overall): 258
Full text available:
PDF
We describe a mathematics course designed for Computer Science majors in which they investigate large scale examples based in discrete mathematics. This course was developed in response to the need to strengthen the theoretical content of the Computer Science curriculum. The design of this course supports better learning and using ...
Keywords:
discrete mathematics
Title:
A lab course for discrete mathematics
CCS:
Discrete mathematics
Keywords:
discrete mathematics
Abstract:
... majors in which they investigate large scale examples based in discrete mathematics. . This course was developed in response to the need ...
Primary CCS:
Discrete mathematics
References:
K. H. Rosen and G. L. Bradley. Discrete Mathematics and Its Applications (6th International Edition). McGraw-Hill, Inc, 2007.
Full Text:
A lab course for discrete mathematicsA Lab Course for Discrete Mathematics[ [Extended Abstract]Ben Setzer Kennesaw State University Kennesaw, GAbsetzer@kennesaw.eduABSTRACTWe describe a ... majors in which they investigate large scale exam-ples based in discrete mathematics. . This course was devel-oped in response to the need ...
ina standard discrete mathematics course. In such courses, ex-amples are most often carried out ...
2
October 2011
OOPSLA '11: Proceedings of the ACM international conference companion on Object oriented programming systems languages and applications companion
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 4, Downloads (12 Months): 29, Downloads (Overall): 148
Full text available:
PDF
Functional programming is losing its place in undergraduate computer science curricula, in part because of the attention given to many new ideas in the field. Nevertheless, undergraduates benefit from an early experience in a second programming paradigm, especially functional programming. The solution, advocated here, is to weave functional programming into ...
Keywords:
functional programming, discrete mathematics
CCS:
Discrete mathematics
Keywords:
discrete mathematics
Abstract:
... solution, advocated here, is to weave functional programming into the discrete mathematics course. Not only does this give a convenient, early occasion ... programming, but it also allows the functional programming topics and discrete mathematics topics to illuminate each other. Furthermore, it provides a service ...
References:
P. B. Henderson. Functional and declarative languages for learning discrete mathematics. In The Proceedings of the International Workshop on Functional and Declarative Programming in Education, 2002. Technical Report No 0210 of the University of Kiel.
J. O'Donnell, C. Hall, and R. Page. Discrete Mathematics Using a Computer. Springer, London, second edition, 2006.
R. L. Wainwright. Introducing functional programming in discrete mathematics. In SIGCSE '92: Proceedings of the twenty-third SIGCSE technical symposium on Computer science education, pages 147--152, New York, NY, USA, 1992. ACM. ISBN 0-89791-468-6. http://doi.acm.org/10.1145/134510.134540.
E. D. William E Fenton. Introduction to Discrete Mathematics with ISETL. Springer, London, 1996.
Full Text:
... The solution, advocated here, is to weave functionalprogramming into the discrete mathematics course. Not onlydoes this give a convenient, early occasion to ... programming, but it also allows the functional pro-gramming topics and discrete mathematics topics to illumi-nate each other. Furthermore, it provides a service ... and Information Science Education; G.2 [Dis-crete mathematics]: GeneralGeneral Terms LanguagesKeywords Discrete mathematics, , functional programming1. IntroductionThere is a wide variety of pedagogical ... Section 3 lays out the casefor putting functional programming and discrete mathemat- -ics in the same course, showing that not only do ... Section 5 addresses pragmatic aspects of imple-menting a course in discrete mathematics and functional pro-gramming, suggesting a course outline and reporting on ...
... an answer: Put it in the discretemathematics course. Call it, ?Discrete Mathematics andFunctional Programming,? DMFP. Students can take it sometime in their ... math course, which is also closely tied torecursion.Functional programming illuminates discrete mathemat- -ics. The inclusion of functional programming in a discretemath course ...
... and retain a more thorough skill base inthe paradigm.DMFP motivates discrete mathematics for computer sci-ence majors. Despite computer science and mathematicsbeing kindred ...
... material they see through-out the course of study.A course in discrete mathematics provides the rightframework for discussing these ideas, since they rely ... Precedents for this approachAlthough the case for teaching functional programmingand discrete mathematics together is here presented as aproposal?and it is not common ... Programming? in the introductorysequence [4].While many texts exist either on discrete mathematics orfunctional programming, not many are available for teach-ing the two ... integrates dis-crete mathematics and functional programming, using Stan-dard ML.5. Implementing Discrete Mathematics andFunctional ProgrammingIn this section we list some suggestions in implementing ...
... problemin light of the current curricular landscape.85Teaching a course in discrete mathematics and func-tional programming has the advantage of finding a placefor ... May 2002.http://www.paulgraham.com/icad.html.[8] P. B. Henderson. Functional and declarative languages forlearning discrete mathematics. . In The Proceedings of theInternational Workshop on Functional and ...
vols/cc2001.pdf.[15] R. L. Wainwright. Introducing functional programmingin discrete mathematics. . In SIGCSE ?92: Proceed-ings of the twenty-third SIGCSE technical ...
3
March 2004
ACM SIGCSE Bulletin: Volume 36 Issue 1, March 2004
Publisher: ACM
Bibliometrics:
Citation Count: 5
Downloads (6 Weeks): 1, Downloads (12 Months): 13, Downloads (Overall): 503
Full text available:
PDF
We have recently launched a reorganized discrete structures course being taught in the computer science department for computer science majors. The main idea of the reorganization is to make the course relevant and productive for the computer science students. During the Spring of 2003, students who were taking both discrete ...
Keywords:
discrete mathematics curriculum
Also published in:
March 2004
SIGCSE '04: Proceedings of the 35th SIGCSE technical symposium on Computer science education
CCS:
Discrete mathematics
Keywords:
discrete mathematics curriculum
References:
Marion, B. (2000). Discrete mathematics: Support of and preparation for the study of computer science, 7th annual CCSC midwestern conference on small colleges (pp. 190--199). Valparaiso, Indiana.
Sidbury, J. R. (1986). A statistical analysis of the effect of discrete mathematics on the performance of computer science majors in beginning computing classes. Paper presented at the 17th SIGCSE technical symposium on Computer Science Education, Cincinatti, Ohio.
Tomer, D. S., Baldwin, D., Smith, C. H., Henderson, P. B., & Vadisigi, V. (2000). CS1 and CS2: Foundations of computer sicence and discrete mathematics. Paper presented at the 31st SIGCSE technical symposium on Computer Science Education, Austin, Texas.
Full Text:
... Education ? Computer science education, Curriculum. G.2.0 [Mathematics of Computing]: Discrete Mathematics ? general. General Terms: Experimentation Keywords: Discrete Mathematics Curriculum 1. INTRODUCTION A discrete mathematics course has been required for all of our undergraduate majors ... not have a good understanding of the basic concepts of discrete mathematics that were needed for their courses. A committee was convened ... who lamented the idea of a Mathematics department teaching the discrete mathematics course. He indicated that when the mathematics department takes hold ... a minimum of two semesters of calculus, one semester of discrete mathematics, , and one semester of a probability or statistics class. ...
... computer science curriculum as a whole and advocated a strong discrete mathematics course that is integrated with the first two years of ... traditional calculus class first while others were placed in a discrete mathematics
... of taking the new CS Discrete Structures course or the Discrete Mathematics course in the Math Department. Therefore students were portioned into ...
... fact, there were even repeat students who had taken the discrete mathematics course previously from the mathematics department who commented that if ... Communications of the ACM, 46(9), 45-50. [6] Marion, B. (2000). Discrete mathematics: : Support of and preparation for the study of computer ... J. R. (1986). A statistical analysis of the effect of discrete mathematics on the performance of computer science majors in beginning computing ... V. (2000). CS1 and CS2: Foundations of computer sicence and discrete mathematics. . Paper presented at the 31st SIGCSE technical symposium on ...
4
March 2011
SIGCSE '11: Proceedings of the 42nd ACM technical symposium on Computer science education
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 1, Downloads (12 Months): 12, Downloads (Overall): 117
Full text available:
PDF
Many students find that proof by induction is one of the most difficult topics in discrete mathematics. Even students who are able to write inductive proofs in a Discrete Mathematics course often find it difficult to write inductive proofs in Data Structures, Algorithms, Theory of Computation, and other computer science ...
Keywords:
proof by induction, pedagogy, discrete mathematics
CCS:
Discrete mathematics
Keywords:
discrete mathematics
Abstract:
... by induction is one of the most difficult topics in discrete mathematics. . Even students who are able to write inductive proofs ... students who are able to write inductive proofs in a Discrete Mathematics course often find it difficult to write inductive proofs in ... science courses. Part of the reason for this is that discrete mathematics courses tend to emphasize weak induction over the natural numbers, ...
Primary CCS:
Discrete mathematics
References:
J. Anderson. Discrete Mathematics with Combinatorics. Pearson/Prentice Hall, Upper Saddle River, New Jersey, 2004.
K. Bogart. Discrete Mathematics. D. C. Heath, Lexington, Massachusetts, 1988.
J. Bradley. Introduction to Discrete Mathematics. Addison Wesley, Reading, Massachusetts, 1988.
J. A. Dossey, A. D. Otto, L. E. Spence, and C. V. Eynden. Discrete Mathematics. Addison Wesley, Boston, 2002.
L. J. Gerstein. Discrete Mathematics and Algebraic Structures. W. H. Freeman and Company, New York, 1987.
E. G. Goodaire and M. M. Parmenter. Discrete Mathematics with Graph Theory. Pearson/Prentice Hall, Upper Saddle River, NJ, 2006.
R. Haggarty. Discrete Mathematics for Computing. Addison-Wesley, Harlow, England, 2002.
D. Hunter. Essentials of Discrete Mathematics. Jones and Bartlettl, Sudbury, MA, 2009.
R. Johnsonbaugh. Discrete Mathematics. Pearson/Prentice Hall, Upper Saddle River, New Jersey, 2005.
B. Kolman, R. C. Busby, and S. C. Ross. Discrete Mathematical Structures. Pearson/Prentice-Hall, Upper Saddle River, NJ, 2009.
L. Lovasz, J. Pelikan, and K. Vesztergombi. Discrete Mathematics: Elementary and Beyond. Springer, New York, 2003.
J. Matousek and J. Nesetril. Invitation to Discrete Mathematics. Clarendon Press, Oxford, 1998.
J. L. Mott, A. Kandel, and T. P. Baker. Discrete Mathematics for Computer Scientists. Reston Publishing Company, Reston, Virginia, 1983.
R. C. Penner. Discrete Mathematics: Proof Techniques and Mathematical Structures. World Scientific, New Jersey, 1999.
K. H. Rosen. Discrete Mathematics and its Applications. McGraw-Hill, Boston, 1999.
K. A. Ross and C. R. B. Wright. Discrete Mathematics. Prentice Hall, Englewood Cliffs, New Jersey, 1985.
S. Sahni. Concepts in Discrete Mathematics. Camelot, Fridley, Minnesota, 1981.
A. B. Shiflet. Discrete Mathematics for Computer Science. West Publishing Companyl, St. Paul, 1987.
D. F. Stanat and D. F. McAllister. Discrete Mathematics in Computer Science. Prentice-Hall, Englewood Cliffs, New Jersey, 1977.
C. Stein, R. L. Drysdale, and K. Bogart. Discrete Mathematics for Computer Scientists. Addison Wesley, Boston, 2010.
5
March 2011
SIGCSE '11: Proceedings of the 42nd ACM technical symposium on Computer science education
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 3, Downloads (12 Months): 36, Downloads (Overall): 207
Full text available:
PDF
This survey paper reviews a large sample of publications on the teaching of discrete structures and discrete mathematics in computer science curricula. The approach is systematic, in that a structured search of electronic resources has been conducted, and the results are presented and quantitatively analyzed. A number of broad themes ...
Keywords:
computing curriculum, discrete mathematics, discrete structures
CCS:
Discrete mathematics
Keywords:
discrete mathematics
Abstract:
... sample of publications on the teaching of discrete structures and discrete mathematics in computer science curricula. The approach is systematic, in that ...
Primary CCS:
Discrete mathematics
References:
D. Baldwin, B. Marion, and H. Walker. Status report on the SIGCSE committee on the implementation of a discrete mathematics course. In 35th SIGCSE Tech. Symp. on CS Education, pages 98--99, Norfolk, VA, 2004.
D. Baldwin, C. H. Smith, P. B. Hendersen, and V. Vadisigi. CS1 and CS2 (panel session): foundations of computer science and discrete mathematics. In 31st SIGCSE Tech. Symp. on CS Education, pages 397--398, Austin, TX, 2000.
J. Berry. Improving discrete mathematics and algorithms curricula with LINK. In 2nd Conference on Integrating Technology into CS Education, pages 14--20, Uppsala, Sweden, June 1997.
S. Bridges. Graphics assignments in discrete mathematics. In 24th SIGCSE Tech. Symp. on CS Education, pages 83--86, Indianapolis, IN, 1993.
D. T. Brown. Discrete mathematics II. SIGCSE Bulletin, 25(4):13--17, 1993.
S. F. Buchele. Increased student participation in a discrete mathematics course. J. of Comp. Sci. in Colleges, 20(4):68--76, Apr. 2005.
J. Cigas and W. J. Hsin. Teaching proofs and algorithms in discrete mathematics with online visual logic puzzles. J. Educ. Resour. Comput., 5(2), June 2005.
A. E. Fleury. Evaluating discrete mathematics exercises. In 24th SIGCSE Tech. Symp. on CS Education, pages 73--77, Apr. 1993.
V. J. Harvey and S. H. Rodger. Editorial for the special issue on software support for teaching discrete mathematics. J. Educ. Resour. Comput., 5(2):1, 2005.
P. B. Henderson. Discrete mathematics as a precursor to programming. In 21st SIGCSE Tech. Symp. on CS Education, pages 17--21, Washington D.C., 1990.
J. Krone. Meeting the challenges of discrete mathematics for computer science: the power of symbols. J. of Comp. Sci. in Colleges, 23(1):31--37, Oct. 2007.
G. M. Levin. ISETL: a language for teaching discrete mathematics (abstract). In ACM Annual Conference on Cooperation, page 455, Washington, D.C., 1990.
Y. Li. A new approach to teaching logic in discrete mathematics. In 9th Intl. Conf. for Young Computer Scientists, pages 2432--2437, Nov. 2008.
B. Marion. Discrete mathematics: support of and preparation for the study of computer science. In Seventh annual CCSC Midwestern Conference on Small Colleges, pages 190--199, Dec. 2000.
B. Marion. Final oral report of the SIGCSE committee on the implementation of a discrete mathematics course. In 37th SIGCSE Tech. Symp. on CS Education, pages 268--269, Houston, TX, 2006.
W. Marion. Discrete mathematics for computer science majors - where are we? How do we proceed? In 20th SIGCSE Tech. Symp. on CS Education, pages 273--277, Feb. 1989.
J. W. McGuffee. The discrete mathematics enhancement project. J. of Comp. Sci. in Colleges, 17(5):162--166, 2002.
D. Nohl. Using an automated reasoning program as a CS application in discrete mathematics. J. of Comp. Sci. in Colleges, 22(4):7--13, 2007.
R. L. Page. Software is discrete mathematics. In 8th Intl. Conf. on Functional Programming, pages 79--86, Aug. 2003.
B. T. Pioro. Introductory computer programming: gender, major, discrete mathematics, and calculus. J. of Comp. Sci. in Colleges, 21(5):123--129, 2006.
D. A. Schoenefeld and R. L. Wainwright. Integration of discrete mathematics topics into the secondary mathematics curriculum using Mathematica: a summer institute for high school teachers. In 24th SIGCSE Tech. Symp. on CS Education, pages 78--82, Indianapolis, IN, 1993.
A. Settle and C. Settle. Graduate student satisfaction with an online discrete mathematics course. J. of Comp. Sci. in Colleges, 21(1):79--87, 2005.
B. Setzer. A lab course for discrete mathematics. In 47th Annual Southeast Regional Conf., Mar. 2009.
J. R. Sidbury. A statistical analysis of the effect of discrete mathematics on the performance of computer science majors in beginning computing classes. In 17th SIGCSE Tech. Symp. on CS Education, pages 134--137, Feb. 1986.
V. L. Almstrum, P. B. Henderson, V. Harvey, C. Heeren, W. Marion, C. Riedesel, L.-K. Soh, and A. E. Tew. Concept inventories in computer science for the topic discrete mathematics. In Working group reports on ITiCSE on innovation and technology in CS education, pages 132--145, Bologna, Italy, 2006.
K. Sutner. CDM: Teaching discrete mathematics to computer science majors. J. Educ. Resour. Comput., 5(2):4, 2005.
R. L. Wainwright. Introducing functional programming in discrete mathematics. In 23rd SIGCSE Tech. Symp. on CS Education, pages 147--152, Kansas City, MO, 1992.
J. S. Warford. An experience teaching formal methods in discrete mathematics. SIGCSE Bulletin, 27(3):60--64, 1995.
W. Xiuguo. Discrete mathematics teaching reformation: Adding experiments. In Intl. Workshop on Education Technology and Computer Science, volume 2, pages 566--569, 2009.
H. Zeng and K. Jiang. Teaching mathematical proofs to CS major students in the class of discrete mathematics. J. of Comp. Sci. in Colleges, 25(5):326--332, May 2010.
Full Text:
... September 2010.It quickly became apparent that both ?Discrete struc-tures? and ?Discrete mathematics? ? were good search termsfor the kind of papers we ... thatwhereas ?discrete structures? was the dominant term until1985, since then ?discrete mathematics? ? has become morecommon, with an increasing number of these ... here. For example, the search of theACM DL for the term?discrete mathematics? ?yielded 19,013papers, but only 200 were actually examined by title, ...
... on abstract. As can be seen fromthis tables, the terms ?discrete mathematics teaching? and?discrete mathematics education? provide the most precisesearch terms. Consistent with the results ... terms. Consistent with the results shown above inFigure 1, the term?discrete mathematics? ?provides the great-est recall value, yielding 81% of the final ...
... andA. E. Tew. Concept inventories in computer sciencefor the topic discrete mathematics. . In Working groupreports on ITiCSE on innovation and technology ... Vadisigi. CS1 and CS2 (panel session): foundationsof computer science and discrete mathematics. . In 31stSIGCSE Tech. Symp. on CS Education, pages397?398, Austin, ... on CS Education, pages397?398, Austin, TX, 2000.[5] J. Berry. Improving discrete mathematics andalgorithms curricula with LINK. In 2nd Conference onIntegrating Technology into ... on CSEducation, pages 83?86, Indianapolis, IN, 1993.[8] D. T. Brown. Discrete mathematics II. SIGCSEBulletin, 25(4):13?17, 1993.[9] S. F. Buchele. Increased student participation ... J. Cigas and W. J. Hsin. Teaching proofs andalgorithms in discrete mathematics
... logic, and computability. SIGCSEBulletin, 25(3):19?25, Sept. 1993.[16] P. B. Henderson. Discrete mathematics as a precursorto programming. In 21st SIGCSE Tech. Symp. on ... Conf. for Young ComputerScientists, pages 2432?2437, Nov. 2008.[25] B. Marion. Discrete mathematics: : support of andpreparation for the study of computer science. ... Symp. onCS Education, pages 268?269, Houston, TX, 2006.[27] W. Marion. Discrete mathematics for computerscience majors - where are we? How do we ... Nohl. Using an automated reasoning program as aCS application in discrete mathematics. . J. of Comp.Sci. in Colleges, 22(4):7?13, 2007.[34] R. L. ... Comp.Sci. in Colleges, 22(4):7?13, 2007.[34] R. L. Page. Software is discrete mathematics. . In 8thIntl. Conf. on Functional Programming, pages 79?86,Aug. 2003.[35] ... pages 79?86,Aug. 2003.[35] B. T. Pioro. Introductory computer programming:gender, major, discrete mathematics, , and calculus. J.of Comp. Sci. in Colleges, 21(5):123?129, 2006.[36] ... Feb. 1976.[37] D. A. Schoenefeld and R. L. Wainwright. Integrationof discrete mathematics topics into the secondarymathematics curriculum using Mathematica: asummer institute for ... A. Settle and C. Settle. Graduate student satisfactionwith an online discrete mathematics course. J. ofComp. Sci. in Colleges, 21(1):79?87, 2005.[39] B. Setzer. ... in Colleges, 21(1):79?87, 2005.[39] B. Setzer. A lab course for discrete mathematics. . In47th Annual Southeast Regional Conf., Mar. 2009.[40] J. R. ...
... Education, pages277?281, St. Louis, MO, 2005.[42] K. Sutner. CDM: Teaching discrete mathematics tocomputer science majors. J. Educ. Resour. Comput.,5(2):4, 2005.[43] J. P. ... 255?259, Norfolk, VA, 2004.[45] R. L. Wainwright. Introducing functionalprogramming in discrete mathematics. . In 23rdSIGCSE Tech. Symp. on CS Education, pages147?152, Kansas ... MO, 1992.[46] J. S. Warford. An experience teaching formal methodsin discrete mathematics. . SIGCSE Bulletin,27(3):60?64, 1995.[47] J. Waxman. Reflections on B3, discrete ... Symp. on CSEducation, pages 323?327, Houston, TX, 2006.[50] W. Xiuguo. Discrete mathematics teachingreformation: Adding experiments. In Intl. Workshopon Education Technology and Computer ...
6
April 2008
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB): Volume 5 Issue 2, April 2008
Publisher: IEEE Computer Society Press
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0, Downloads (12 Months): 2, Downloads (Overall): 173
Full text available:
PDF
We consider a combinatorial problem derived from haplotyping a population with respect to a genetic disease, either recessive or dominant. Given a set of individuals, partitioned into healthy and diseased, and the corresponding sets of genotypes, we want to infer ``bad'' and ``good'' haplotypes to account for these genotypes and ...
Keywords:
Combinatorics, Discrete Mathematics, Biology and genetics
CCS:
Discrete mathematics
Keywords:
Combinatorics, Discrete Mathematics, Biology and genetics
Full Text:
... in a broad range of scientific journals inthe areas of discrete mathematics, , combinatorics, and algorithms. Since2004, he has been a trainer ...
7
March 2014
SIGCSE '14: Proceedings of the 45th ACM technical symposium on Computer science education
Publisher: ACM
Induction is a notoriously difficult topic for beginning computer science students to understand. Even if they can produce an inductive proof of some mathematical fact, many students never see the relevance of inductive reasoning outside of the classroom for anything beyond the natural numbers. This is unfortunate because inductive reasoning ...
Keywords:
functional programming, induction, computer science education, discrete mathematics
CCS:
Discrete mathematics
Keywords:
discrete mathematics
8
March 2009
SIGCSE '09: Proceedings of the 40th ACM technical symposium on Computer science education
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 1, Downloads (12 Months): 9, Downloads (Overall): 109
Full text available:
PDF
Keywords:
algorithms, discrete mathematics, assignments, historical sources, projects, pedagogy
Also published in:
March 2009
ACM SIGCSE Bulletin - SIGCSE '09: Volume 41 Issue 1, March 2009
CCS:
Discrete mathematics
Keywords:
discrete mathematics
Full Text:
... at: http://www.cs.nmsu.edu/historical-projects/ . The projects are intended for courses in discrete mathematics, , algorithm design, automata, graph theory, and logic. Categories and ... K.3.2 [Computers and Education]: Computer and Information Science Education; G.2.0 [Discrete Mathematics] ]: General. General Terms Algorithms, Theory. Keywords Pedagogy, historical sources, ... General. General Terms Algorithms, Theory. Keywords Pedagogy, historical sources, algorithms, discrete mathematics, , projects, assignments. 1. OBJECTIVE 1.1 Overall Objective This session ... students often lack mathematical background and find courses such as discrete mathematics and algorithms very hard. Using original historical sources provides context ...
... Ages: A History of Truth? intended for introductory courses in discrete mathematics and computer science. The project provides historical and motivational material ... will be especially useful for instructors who teach courses in discrete mathematics, , algorithm design, automata, graph theory, and logic, because they ...
9
March 2010
SIGCSE '10: Proceedings of the 41st ACM technical symposium on Computer science education
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 1, Downloads (12 Months): 10, Downloads (Overall): 175
Full text available:
PDF
The "2007 SIGCSE Report On the Implementation of a Discrete Mathematics Course" recommends relocating some discrete structures topic areas to other courses, for the sake of coherency. Our implementation of the one semester course also relocates topics, but additionally features a focus on a significant computer science problem: regular language ...
Keywords:
course models, cc2001, computing curriculum, discrete mathematics, discrete structures
CCS:
Discrete mathematics
Keywords:
discrete mathematics
Abstract:
<p>The "2007 SIGCSE Report On the Implementation of a Discrete Mathematics Course" recommends relocating some discrete structures topic areas to other ...
References:
Baldwin, D., Marion, B., and Walker, H. 2004. Status report on the SIGCSE committee on the implementation of a discrete mathematics course. In Proceedings of the 35th SIGCSE Technical Symposium on Computer Science Education (Norfolk, Virginia, USA, March 03 - 07, 2004). SIGCSE '04. ACM, New York, NY, 98--99.
Marion, B. and Baldwin, D. April 2007. SIGCSE Committee Report On the Implementation of a Discrete Mathematics Course. http://www.sigcse.org/resources/discrete-mathematics/DiscreteMathReport.pdf
Full Text:
... ABSTRACT The "2007 SIGCSE Report On the Implementation of a Discrete Mathematics Course" recommends relocating some discrete structures topic areas to other ... Education ? Computer science education, Curriculum; G.2.0 [Mathematics of Computing]: Discrete Mathematics ?general. General Terms Algorithms, Languages, Theory Keywords CC2001, computing curriculum, ... Terms Algorithms, Languages, Theory Keywords CC2001, computing curriculum, course models, discrete mathematics, , discrete structures 1. INTRODUCTION Shortly after the dissemination of ... in the 2007 SIGCSE Report On the Implementation of a Discrete Mathematics Course[7]. Taking into account the core topic recommendations from CC2001, ... of the models relocated one or two entire topics from discrete mathematics to other courses in the curriculum. This paper describes a ... rest of the curriculum, provides coverage of the required CC2001 discrete mathematics topics * integrates mathematics with computer science applications * possesses ...
... that the mathematics underlying the two technologies subsumes the necessary discrete mathematics requirements of the CC2001 report. Given a finite alphabet A, ...
... DS CORE TOPICS The CC2001 report identifies six topics in discrete mathematics as the knowledge base for discrete structures: (DS1) functions, relations ... affords ample opportunity to study and use all of foundational discrete mathematics (DS) topics, excepting the topics we have assigned to other ...
... report on the SIGCSE committee on the implementation of a discrete mathematics course. In Proceedings of the 35th SIGCSE Technical Symposium on ... April 2007. SIGCSE Committee Report On the Implementation of a Discrete Mathematics Course. http://www.sigcse.org/resources/discrete-mathematics/DiscreteMathReport.pdf [8] Neff, N. 1993. A logic programming environment ...
10
June 2006
ACM SIGCSE Bulletin: Volume 38 Issue 4, December 2006
Publisher: ACM
Bibliometrics:
Citation Count: 19
Downloads (6 Weeks): 3, Downloads (12 Months): 40, Downloads (Overall): 809
Full text available:
PDF
This report describes concept inventories, specialized assessment instruments that enable educational researchers to investigate student (mis)understandings of concepts in a particular domain. While students experience a concept inventory as a set of multiple-choice items taken as a test, this belies its purpose, its careful development, and its validation. A concept ...
Keywords:
discrete mathematics, assessment, concept inventory, misconceptions, assessment tools, distractors
Also published in:
June 2006
ITiCSE-WGR '06: Working group reports on ITiCSE on Innovation and technology in computer science education
CCS:
Discrete mathematics
Keywords:
discrete mathematics
Abstract:
... inventories in the computing field. We use the domain of discrete mathematics
Title:
Concept inventories in computer science for the topic discrete mathematics
References:
Epp, S. (2004). Discrete Mathematics with Applications, 3rd Edition, Brooks/Cole Publishing.
Klappholz, A. D. and Almstrum, V. L. (2006). Collaborative Research: Discrete Mathematics in Computing Education. National Science Foundation. Available: www.nsf.gov/awardsearch/showAward.do? AwardNumber=0536270
Rosen, K. (2003). Common Mistakes in Discrete Math. In Discrete Mathematics and Its Applications Student Solutions Guide, McGraw Hill Publishing. Available: www.mhhe.com/math/advmath/rosen/r5/student/mistakes .html
Rosen, K. (2007). Discrete Mathematics and Its Applications, 6th Edition, McGraw Hill Publishing.
Full Text:
... - 132 -Concept Inventories in Computer Science for the Topic Discrete Mathematics Vicki L. Almstrum The University of Texas at Austin Department ... inventories in the computing field. We use the domain of discrete mathematics to illustrate a suggested plan of action. Categories and Subject ... and Subject Descriptors K.3.2 [Computer and Information Science Education]; G.2 [Discrete Mathematics] ]; F.4.1 [Mathematical Logic] General Terms Measurement, Experimentation, Human Factors ... General Terms Measurement, Experimentation, Human Factors Keywords Concept Inventory, Assessment, Discrete Mathematics, , Assessment Tools, Distractors, Misconceptions. 1. INTRODUCTION What is assessment? ...
... designing one or more CIs in the well-defined area of discrete mathematics. . The primary purpose of this effort would be to ... CIs in computing education research, with a concept inventory for discrete mathematics as the starting point. This report has been written with ... process for developing CIs. Section 6 discusses the choice of discrete mathematics as the domain of focus in these early explorations. Section ... a process for developing a CI in the domain of discrete mathematics, , and Section 9 discusses how computing educators might use ... Section 9 discusses how computing educators might use a completed discrete mathematics concept inventory. The report is supported by a pair of ... first appendix lists some fundamental concepts in the area of discrete mathematics and sample misconceptions. The second appendix illustrates criteria for meaningful ... The second appendix illustrates criteria for meaningful items for a discrete mathematics concept inventory by developing several candidate items. 2. MOTIVATION The ...
... main focus to develop a CI in the area of discrete mathematics [28]. The research team on this grant includes computing educators, ... computing educators, an educational psychologist, subject matter experts (including four discrete mathematics textbook authors), and an advisory board of educators. Foundational work ...
... ability to establish criterion-related validity [14]. 6. THE CASE FOR DISCRETE MATHEMATICS While the long-term vision is to have well designed, validated ... limited to a single CI for the subject domain of discrete mathematics. . This Working Group chose discrete mathematics, , rather than topics from a course such as CS1, ... course such as CS1, for several reasons. First, topics from discrete mathematics are emerging as a stable component of computing curricula. The ... Task Force Report Computing Curricula 2001 [27] includes topics from discrete mathematics among the core knowledge areas that every computer science student ... reason to believe that there is more consensus for typical discrete mathematics topics than for CS1-related or other course-related topics, thus offering ... topics, thus offering wider applicability for a CI in the discrete mathematics domain. Second, it may be possible to match the scope ... may be possible to match the scope of a typical discrete mathematics course with the scope of a single CI. A key ... the research team is the level of granularity at which discrete mathematics concepts should be covered on the CI. Third, the development ... the criteria of a concept inventory. Because the area of discrete mathematics has received significant attention from various groups within the computing ... reasoning in computing curricula. Another example is the authors of discrete mathematics textbooks for students in computing-related programs, particularly highly experienced authors ... misunderstandings and misconceptions. - 136 -Finally, many fundamental concepts from discrete mathematics are recognized as themes that permeate computing, sometimes embedded in ...
... concepts can be approached from multiple directions, for example, in discrete mathematics some problems can be modeled either from the point of ...
... While a key target audience for a topic such as discrete mathematics is students studying computing, a CI for discrete mathematics has a much broader potential audience. Subpopulations can be selected ... genetics, and economics for discrete modeling, embrace the material of discrete mathematics. . While core discrete mathematics concepts are fundamental for numerous disciplines, developing and validating multiple ... While years of teaching experience in a topic such as discrete mathematics may tempt researchers to make expert guesses about the thought ...
mismodelings when working with discrete mathematics concepts, the research team must identify a set of relevant ... relevant concepts and the associated misconceptions. Appendix A lists fundamental discrete mathematics concepts with associated difficulties as a sample starting point. The ... from subject matter experts, that is, educators who have taught discrete mathematics for a long time. Authors who have written discrete mathematics textbooks released in several significant editions are yet another good ... authors have put serious thought into the fundamental concepts of discrete mathematics and the misconceptions students have about those concepts. For instance, ...
... to give instructors insight into their students? understanding of fundamental discrete mathematics concepts. The experiences of physics educators who have employed the ... example, whether different approaches to teaching and - 140 -learning discrete mathematics are more or less effective for students with various characteristics. ... in a computing major, or even if particular topics from discrete mathematics are predictive. Such results can be used to make programmatic ...
... American Mathematical Monthly, 110(10), pp 886-99. [9] Epp, S. (2004). Discrete Mathematics with Applications, 3rd Edition, Brooks/Cole Publishing. [10] Ericsson, K.A. & ...
... NY. [28] Klappholz, A.D. and Almstrum, V.L. (2006). Collaborative Research: Discrete Mathematics in Computing Education. National Science Foundation. Available: www.nsf.gov/awardsearch/showAward.do?AwardNumber= 0536270 [29] ... [46] Rosen, K. (2003). Common Mistakes in Discrete Math. In Discrete Mathematics and Its Applications Student Solutions Guide, McGraw Hill Publishing. Available: ... McGraw Hill Publishing. Available: www.mhhe.com/math/advmath/rosen/r5/student/mistakes .html [47] Rosen, K. (2007). Discrete Mathematics and Its Applications, 6th Edition, McGraw Hill Publishing. [48] Soh, ...
... June 18?21, 2006, CD-ROM. - 143 -APPENDIX A Potential Fundamental Discrete Mathematics Concepts The Working Group developed this list of fundamental discrete mathematics concepts to provide sample areas where students commonly experience difficulties. ... completed Discrete Math Concept Inventory. The concepts are ordered alphabetically. Discrete Mathematics Concept Discussion of Typical Student Difficulties Argument by contradiction Difficulty ...
11
Jonas B. Weber, Ulf Lorenz
July 2017
GECCO '17: Proceedings of the Genetic and Evolutionary Computation Conference Companion
Publisher: ACM
Booster stations are fluid systems consisting of interconnected components such as pumps, pipes, valves and fittings. One of their main applications is to supply whole buildings or higher floors with drinking water if the supply pressure of the water company is not high enough to guarantee a continuous supply for ...
Keywords:
application of discrete mathematics, booster station, technical operations research, system synthesis, pressure booster system
CCS:
Discrete mathematics
Keywords:
application of discrete mathematics
Primary CCS:
Discrete mathematics
References:
P. F. Pelz, U. Lorenz, T. Ederer, S. Lang, and G. Ludwig. 2012. Designing Pump Systems by Discrete Mathematical Topology Optimization: The Artificial Fluid Systems Designer (AFSD). International Rotating Equipment Conference (2012).
Full Text:
... Ederer, S. Lang, and G. Ludwig. 2012. Designing PumpSystems by Discrete Mathematical Topology Optimization: e Arti cial FluidSystems Designer (AFSD). International Rotating Equipment ...
12
June 2007
ITiCSE '07: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 2, Downloads (12 Months): 4, Downloads (Overall): 169
Full text available:
PDF
In this poster, some tools for graph algorithms active learning are presented. These tools pursue a new goal on computer assisted educational resources, so as to acting as authentic virtual trainers extending teacher's hand through the Web. In other words, they are on line self assessment tools that help students ...
Keywords:
discrete mathematics learning, java applets, visualization, e-learning, education, interactive learning
Also published in:
June 2007
ACM SIGCSE Bulletin - Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (ITiCSE'07): Volume 39 Issue 3, September 2007
CCS:
Discrete mathematics
Keywords:
discrete mathematics learning
Full Text:
... and Information Science Education ? computer science education, self-assessment. G.2.2 [Discrete Mathematics] ]: Graph Theory ? graph algorithms, path and circuit problems, ... Terms Algorithms, Design. Keywords e&bLearning, education, interactive learning, Java applets, discrete mathematics learning, visualization. 1. WEB TOOLS FOR LEARNING GRAPHS Graphical and ... we have not yet found any other web application on Discrete Mathematics? ? topics, meeting these features. Nowadays, we are collecting data ...
13
July 2009
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB): Volume 6 Issue 3, July 2009
Publisher: IEEE Computer Society Press
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 1, Downloads (12 Months): 6, Downloads (Overall): 185
Full text available:
PDF
The Robinson-Foulds (RF) distance is by far the most widely used measure of dissimilarity between trees. Although the distribution of these distances has been investigated for 20 years, an algorithm that is explicitly polynomial time has yet to be described for computing the distribution for trees around a given tree. ...
Keywords:
Biology and genetics, discrete mathematics applications, trees, phylogenetics, Robinson-Foulds distance, Poisson approximation, normalization constant.
CCS:
Discrete mathematics
Keywords:
Biology and genetics, discrete mathematics applications, trees, phylogenetics, Robinson-Foulds distance, Poisson approximation, normalization constant.
Full Text:
... recently proposedmaximum likelihood approach to supertree construction.Index Terms?Biology and genetics, discrete mathematics applications, trees, phylogenetics, Robinson-Foulds distance, Poissonapproximation, normalization constant. 1 INTRODUCTIONTREEcomparisonmetrics are ...
14
March 2004
ACM SIGCSE Bulletin: Volume 36 Issue 1, March 2004
Publisher: ACM
Bibliometrics:
Citation Count: 9
Downloads (6 Weeks): 4, Downloads (12 Months): 14, Downloads (Overall): 264
Full text available:
PDF
There are a wide variety of ways to present information at the front of a classroom. These include chalk on a blackboard, markers on a whiteboard, pens on transparencies, and computer projection systems. While computer-based presentation systems provide many opportunities both in and out of the classroom, there may also ...
Keywords:
classroom presentations, discrete mathematics
Also published in:
March 2004
SIGCSE '04: Proceedings of the 35th SIGCSE technical symposium on Computer science education
Title:
Handwritten slides on a tabletPC in a discrete mathematics course
Keywords:
discrete mathematics
Abstract:
... in the context of its use while teaching an undergraduate discrete mathematics
Full Text:
... Template - WORD Handwritten Slides on a TabletPC in a Discrete Mathematics Course Evan Golub Department of Computer Science Human-Computer Interaction Lab ... in the context of its use while teaching an undergraduate discrete mathematics course. Categories and Subject Descriptors K.3 [Computers and Education]: Computer ... instruction (CAI). General Terms: Design, Human Factors. Keywords: Classroom presentations, discrete mathematics. . 1. INTRODUCTION Computers can be a powerful presentation resource ... author and how it was used successfully in a sophomore-level discrete mathematics course at the University of Maryland. This discussion will cover ...
... mine in moving to a new presentation system for my discrete mathematics course was prep time. I had taught the class several ...
15
January 1969
Communications of the ACM: Volume 12 Issue 1, Jan. 1969
Publisher: ACM
Bibliometrics:
Citation Count: 6
Downloads (6 Weeks): 2, Downloads (12 Months): 19, Downloads (Overall): 757
Full text available:
PDF
Computers are being applied to an increasingly diverse range of problems in group theory. The most important areas of application at present are coset enumeration, sub-group lattices, automorphism groups of finite groups, character tables, and commutator calculus. Group theory programs range from simple combinatorial or numerical programs to large symbol ...
Keywords:
commutator calculus, discrete mathematics, subgroup lattices, topology, Abelian groups, coset enumeration, group theory, nonnumerical programming, symbol manipulation, crystallography, automorphism groups, character tables, permutation groups, survey
CCS:
Discrete mathematics
Keywords:
discrete mathematics
Primary CCS:
Discrete mathematics
Full Text:
... acter tables, commutator calculus, topology, crystallography, permutation groups, Abelian groups, discrete mathematics, , nonnumerical programming, symbol manipulation, survey CR CATEGORIES: 1.3, 3.15, ...
16
December 1995
ACM Computing Surveys (CSUR): Volume 27 Issue 4, Dec. 1995
Publisher: ACM
Bibliometrics:
Citation Count: 15
Downloads (6 Weeks): 3, Downloads (12 Months): 37, Downloads (Overall): 1,425
Full text available:
PDF
Keywords:
NP-completeness, discrete mathematics, graph theory, matching, P-completeness, coloring, complexity theory, cubic graphs, planar graphs, regular graphs
CCS:
Discrete mathematics
Keywords:
discrete mathematics
Primary CCS:
Discrete mathematics
Full Text:
... extensive list of references is provided.Categories and Subject Descriptors: G.2.2 [Discrete Mathematics] ]: Graph TheoryGeneral Terms: TheoryAdditional Key Words and Phrases: Coloring, ...
17
October 2008
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB): Volume 5 Issue 4, October 2008
Publisher: IEEE Computer Society Press
Bibliometrics:
Citation Count: 9
Downloads (6 Weeks): 2, Downloads (12 Months): 3, Downloads (Overall): 259
Full text available:
PDF
The optimal transformation of one tree into another by means of elementary edit operations is an important algorithmic problem that has several interesting applications to computational biology. Here we introduce a constrained form of this problem in which a partial mapping of a set of nodes (the "seeds") in one ...
Keywords:
Graph algorithms, Graph Theory, Discrete Mathematics, Mathematics of Computing, Trees, Biology and genetics, Life and Medical Sciences, Computer Applications
CCS:
Discrete mathematics
Keywords:
Graph algorithms, Graph Theory, Discrete Mathematics, Mathematics of Computing, Trees, Biology and genetics, Life and Medical Sciences, Computer Applications
18
June 2007
ACM SIGCSE Bulletin: Volume 39 Issue 2, June 2007
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 2, Downloads (12 Months): 12, Downloads (Overall): 533
Full text available:
PDF
Teaching a class for the first time is always a challenge. Add to the new experience a team-teaching approach and a professor teaching outside of his comfort zone, and things get even more complicated. In this article we evaluate our team-teaching of Discrete Math to computer science majors at the ...
Keywords:
discrete mathematics, team-teaching, teaching
Keywords:
discrete mathematics
Abstract:
... he/she prepares to teach a new course, particularly one in discrete mathematics.
Full Text:
... by Kenneth H. Rosen ortaken from other texts such as Discrete Mathematics withApplications by Susanna S. Epp. The following samples arerepresentative of ...
19
July 2010
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB): Volume 7 Issue 3, July 2010
Publisher: IEEE Computer Society Press
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 1, Downloads (12 Months): 1, Downloads (Overall): 78
Full text available:
PDF
Haplotype data play a relevant role in several genetic studies, e.g., mapping of complex disease genes, drug design, and evolutionary studies on populations. However, the experimental determination of haplotypes is expensive and time-consuming. This motivates the increasing interest in techniques for inferring haplotype data from genotypes, which can instead be ...
Keywords:
Biology and genetics, heuristic methods, discrete mathematics.
Keywords:
Biology and genetics, heuristic methods, discrete mathematics.
20
March 2011
SIGCSE '11: Proceedings of the 42nd ACM technical symposium on Computer science education
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 4, Downloads (12 Months): 27, Downloads (Overall): 187
Full text available:
PDF
During the past 20 years, probability theory has become a critical element in the development of many areas in computer science. Commensurately, in this paper, we argue for expanding the coverage of probability in the computing curriculum. Specifically, we present details of a new course we have developed on Probability ...
Keywords:
computing curricula, probability theory, discrete mathematics
Keywords:
discrete mathematics
Full Text:
... Algorithms, Theory, Human Factors, Design. Keywords Probability Theory, Computing Curricula, Discrete Mathematics 1. INTRODUCTION During the past two decades, probability theory has ...
Result page:
1
2
3
4
5
6
7
8
9
10
>>