Teaching undergraduate algorithms with case studies and quizzes in interactive tutorials

Huang, W; Luo, J; Huang, ML

Teaching undergraduate algorithms with case studies and quizzes in interactive tutorials

Huang, W

Luo, J Huang, ML

Permalink

Publication Type:: Conference Proceeding
Citation:: Proceedings of 2015 IEEE International Conference on Teaching, Assessment and Learning for Engineering, TALE 2015, 2016, pp. 272 - 276
Issue Date:: 2016-01-18

Closed Access

	Filename	Description	Size
	07386057.pdf	Published version	302.32 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Huang, W https://orcid.org/0000-0002-5190-7839	en_US
dc.contributor.author	Luo, J	en_US
dc.contributor.author	Huang, ML https://orcid.org/0000-0002-6896-6480	en_US
dc.date.issued	2016-01-18	en_US
dc.identifier.citation	Proceedings of 2015 IEEE International Conference on Teaching, Assessment and Learning for Engineering, TALE 2015, 2016, pp. 272 - 276	en_US
dc.identifier.isbn	9781467392266	en_US
dc.identifier.uri	http://hdl.handle.net/10453/41576
dc.description.abstract	© 2015 IEEE. The subject of algorithms is a core component of Computer Science for undergraduate students. Many of innovative teaching methods have been proposed in the literature and practiced in classrooms aiming to help students learn the subject effectively. This paper reports on our experience in teaching advanced data structures and classic computer science algorithms for year 2 students. For three consecutive years, we practiced a different teaching approach each year. The details of each approach are provided and discussed. By comparing students' learning performance, we found that teaching undergraduate algorithms with case studies and quizzes in interactive tutorials is relatively more beneficial for effective teaching and learning. We conclude the paper with a short summary and future work.	en_US
dc.relation.ispartof	Proceedings of 2015 IEEE International Conference on Teaching, Assessment and Learning for Engineering, TALE 2015	en_US
dc.relation.isbasedon	10.1109/TALE.2015.7386057	en_US
dc.title	Teaching undergraduate algorithms with case studies and quizzes in interactive tutorials	en_US
dc.type	Conference Proceeding
utslib.for	080605 Decision Support and Group Support Systems	en_US
utslib.for	080499 Data Format not elsewhere classified	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	/University of Technology Sydney/Faculty of Transdisciplinary Innovation
pubs.organisational-group	/University of Technology Sydney/Strength - INEXT - Innovation in IT Services and Applications
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US

Abstract:

© 2015 IEEE. The subject of algorithms is a core component of Computer Science for undergraduate students. Many of innovative teaching methods have been proposed in the literature and practiced in classrooms aiming to help students learn the subject effectively. This paper reports on our experience in teaching advanced data structures and classic computer science algorithms for year 2 students. For three consecutive years, we practiced a different teaching approach each year. The details of each approach are provided and discussed. By comparing students' learning performance, we found that teaching undergraduate algorithms with case studies and quizzes in interactive tutorials is relatively more beneficial for effective teaching and learning. We conclude the paper with a short summary and future work.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/41576