Permalink
Cannot retrieve contributors at this time
Name already in use
A tag already exists with the provided branch name. Many Git commands accept both tag and branch names, so creating this branch may cause unexpected behavior. Are you sure you want to create this branch?
tps/literatureClickersTheory.bib
Go to fileThis commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
114 lines (99 sloc)
4.9 KB
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
@book{1999Krantz, | |
title={How to Teach Mathematics}, | |
author={Steven G. Krantz}, | |
publisher={American Mathematical Society}, | |
edition=2, | |
year=1999, | |
annote={R. L. Moore would hand out a single sheet with definitions, axioms and theorems, and challenge the students to prove the theorems on the board. Then,``Moore would rip the person apart. And that set the tone for the class.'' ``Moore did not allow his students to read books or papers.'' ``They were not allowed to read, and they were not allowed to collaborate outside of class. Moore was merciless in weeding out those students who did not cooperate or did not fit.'' }} | |
@inproceedings{Sigman:2007:ESF:1227310.1227463, | |
author = {Sigman, Scott}, | |
title = {Engaging students in formal language theory and theory of computation}, | |
booktitle = {Proceedings of the 38th SIGCSE technical symposium on Computer science education}, | |
series = {SIGCSE '07}, | |
year = {2007}, | |
isbn = {1-59593-361-1}, | |
location = {Covington, Kentucky, USA}, | |
pages = {450--453}, | |
numpages = {4}, | |
url = {http://doi.acm.org/10.1145/1227310.1227463}, | |
doi = {10.1145/1227310.1227463}, | |
acmid = {1227463}, | |
publisher = {ACM}, | |
address = {New York, NY, USA}, | |
keywords = {Moore method, discovery learning, formal language theory, inquiry learning, problem based learning, theory of computation}, | |
annote={``Engaging and maintaining student engagement with the content of a | |
course in formal language theory and the theory of computation is | |
notoriously difficult. ``; | |
``student’s perception of the | |
relevance of the required mathematical material to computer science | |
as they have studied the discipline''; | |
``Students fail to appreciate the | |
relevance of the material due to its theoretical nature''; | |
`` the approach has been and remains | |
controversial, it nevertheless has proven effective in addressing the | |
problem of student engagement.''; | |
8. REFERENCES | |
[1] Armoni, M., Rodgers, S., Vardi, M., and Verma, R. Automata | |
theory-its relevance to computer science students and course | |
content. ACM SIGCSE Bulletin, 38, 1 (March 2006), 197-198. | |
[2] Brookes, W. 2004. Computing theory with relevance. In | |
Proceedings of the Sixth Conference on Australasian | |
Computing Education - Volume 30 (Dunedin, New Zealand). | |
R. Lister and A. Young, Eds. ACM International Conference | |
Proceeding Series, vol. 57. Australian Computer Society, | |
Darlinghurst, Australia, 9-13. | |
[3] Chesñevar, C., Cobo, M. and Yurcik, W. Using theoretical | |
computer simulators for formal languages and automata | |
theory. Inroads – ACM SIGCSE Bulletin, 35, 2 (June 2003), | |
33-37. | |
[4] Cogliati, J., Goosey, F., Grinder, M., Pascoe, B., Ross, R., and | |
Willams, C. Realizing the promise of visualization in the | |
theory of computing. ACM Journal of Educational Resources | |
in Computing, 5, 2 (June 2005), Article No. 5. | |
[5] Gramond, E. and Rodgers, S. Using JFLAP to interact with | |
theorems in automata theory. ACM SIGCSE Bulletin, 31, 1 | |
(March 1999), 336-340. | |
[6] Grinder, M., Kim, S., Lutey, T., Ross, R., Walsh, K. Loving to | |
learn theory: active learning modules for the theory of | |
computing. ACM SIGCSE Bulletin, 34, 1, (Feb. 2002) , 371- | |
375. | |
[7] Hawkins, H. and Healy, C. Introducing practical applications | |
into a computational theory class. Journal of Computing | |
Sciences in Colleges, 20, 2 (Dec. 2004), 219 – 225. | |
[8] The Joint Taskforce on Computing Curricula. Computing | |
curricula 2001. IEEE Computer Society \& ACM., December | |
15, 2001. | |
[9] Jones, F. The Moore Method. American Mathematical | |
Monthly, 84 (Apr. 1977), 273-277. | |
[10] The Liberal Arts Computer Science Consortium. A 2004 model | |
for a liberal arts degree in computer science. February 2004. | |
[11] Parker, G. Getting more from Moore. Primus, 2 (Sept. 1992), | |
235-246. | |
[12] Verma, R. M. A visual and interactive automata theory course | |
emphasizing breadth of automata. In Proceedings of the 10th | |
Annual SIGCSE Conference on innovation and Technology in | |
Computer Science Education (Caparica, Portugal, June 27 - 29, | |
2005). ITiCSE '05. ACM Press, New York, NY, 325-329. | |
} | |
} | |
@book{rogers1995becoming, | |
title={On becoming a person: A therapist's view of psychotherapy}, | |
author={Rogers, C.}, | |
year={1995}, | |
publisher={Mariner Books} | |
} | |
@article{porter2013halving, | |
title={Halving Fail Rates using Peer Instruction: A Study of Four Computer Science Courses}, | |
author={Porter, L. and Bailey-Lee, C. and Simon, B.}, | |
year={2013} | |
} | |
@inproceedings{koile2007supporting, | |
title={Supporting feedback and assessment of digital ink answers to in-class exercises}, | |
author={Koile, K. and Chevalier, K. and Rbeiz, M. and Rogal, A. and Singer, D. and Sorensen, J. and Smith, A. and Tay, K.S. and Wu, K.}, | |
booktitle={PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE}, | |
volume={22}, | |
number={2}, | |
pages={1787}, | |
year={2007}, | |
organization={Menlo Park, CA; Cambridge, MA; London; AAAI Press; MIT Press; 1999} | |
} |