CHI TIẾT NGHIÊN CỨU …

Tiêu đề

Engaging students in formal language theory and theory of computation

Tác giả

Sigman S.

Năm xuất bản

2007

Source title

SIGCSE 2007: 38th SIGCSE Technical Symposium on Computer Science Education

Số trích dẫn

DOI

10.1145/1227310.1227463

Liên kết

https://www.scopus.com/inward/record.uri?eid=2-s2.0-34748883631&doi=10.1145%2f1227310.1227463&partnerID=40&md5=4027eec6a730303418f98937e7f9284a

Tóm tắt

Engaging and maintaining student engagement with the content of a course in formal language theory and the theory of computation is notoriously difficult. A major factor is student's perception of the relevance of the required mathematical material to computer science as they have studied the discipline. Usually, the mathematical material discourages students and for many it forms an insurmountable barrier. This paper describes the construction of a course using the discovery learning technique known as the Moore Method that directly addresses student engagement with this material. The results of the delivery of this course were that students remained engaged with the course throughout the semester and enthusiastically received the pedagogical approach employed. While the course described was delivered to a small class in a liberal arts college, it may be adapted to larger class sizes and taught in any computer science program. Copyright 2007 ACM.

Từ khóa

Discovery learning; Formal language theory; Inquiry learning; Moore method; Problem based learning; Theory of computation

Tài liệu tham khảo

Armoni M., Rodgers S., Vardi M., Verma R., Automata theory-its relevance to computer science students and course content, ACM SIGCSE Bulletin, 38, 1, pp. 197-198, (2006); Chesnevar C., Cobo M., Yurcik W., Using theoretical computer simulators for formal languages and automata theory, Inroads - ACM SIGCSE Bulletin, 35, 2, pp. 33-37, (2003); Cogliati J., Goosey F., Grinder M., Pascoe B., Ross R., Willams C., Realizing the promise of visualization in the theory of computing, ACM Journal of Educational Resources in Computing, 5, 5, (2005); Gramond E., Rodgers S., Using JFLAP to interact with theorems in automata theory, ACM SIGCSE Bulletin, 31, 1, pp. 336-340, (1999); Grinder M., Kim S., Lutey T., Ross R., Walsh K., Loving to learn theory: Active learning modules for the theory of computing, ACMSIGCSE Bulletin, 34, 1, pp. 371-375, (2002); Hawkins H., Healy C., Introducing practical applications into a computational theory class, Journal of Computing Sciences in Colleges, 20, 2, pp. 219-225, (2004); A 2004 model for a liberal arts degree in computer science, (2004); Parker G., Getting more from Moore, Primus, 2, pp. 235-246, (1992); Verma R.M., A visual and interactive automata theory course emphasizing breadth of automata, Proceedings of the 10th Annual SIGCSE Conference on innovation and Technology in Computer Science Education, pp. 325-329, (2005)