Journal of Engineering Education Transformations

Journal of Engineering Education Transformations

Year: 2015, Volume: 29, Issue: 2, Pages: 83-88

Original Article

Structured Approach of Designing Data Structure and Algorithms Laboratory Experiments

Abstract

Data structures and algorithms play amajor role in optimizing any non trivial software application. Learning and applying concepts of this course demands a great amount of analytical and logical thinking skills. Teaching this subject at early stages of Information Technology related engineering courses poses a great challenge to the Course Instructors. In this paper, we presented the experience of using structured approach of designing and assessing Data Structures and Algorithms Laboratory experiments. All our laboratory experiments and assignments are well designed and structured to achieve the desired ABET a-k learning outcome elements set for the course.Our experimental case study examples, structured enquiry based experiments and student's feedback results prove the effectiveness of designing and adopting structured experiments in the laboratory course.

References

  • Bloom, B. S.; Engelhart, M. D.; Furst, E. J.;Hill, W. H.; Krathwohl, D. R. (1956). Taxonomy of educational objectives: The classification of educational goals. Handbook I: Cognitive domain.NewYork:DavidMcKayCompany.
  • Orlich, Donald; Harder, Robert; Callahan, Richard; Trevisan, Michael; Brown, Abbie (2004). Teaching strategies: a guide to effective instruction (7th ed.). Houghton Mifflin. ISBN 978-0-6182-9999-7.
  • Colin G. Johnson and Ursula Fuller. 2006. Is Bloom's taxonomy appropriate for computer science?. In Proceedings of the 6th Baltic Sea conference on Computing education research: Koli Calling 2006(Baltic Sea '06). ACM, New York,NY,USA, 120-123.
  • Spivey, G., "ATaxonomy for learning, teaching, and assessing Digital Logic Design", Frontiers In Education Conference - Global Engineering: Knowledge Without Borders, Oppurtunities without passports, 2007, FIE '07. 37th Annual, vol.., no., pp. F4G-9, F4G-14, 10-13Oct. 2007
  • Sujatha, C.; Jayalaxmi, G.N.; Suvarna, G.K., "An innovative approach carried out in data structures and algorithms lab," Engineering Education: Innovative Practices and Future Trends (AICERA), 2012 IEEE International Conference on , vol., no., pp.1,4, 19-21 July 2012
  • Sarwar, S.M.; Parks, E.E.; Sarwar, S.A., "Laboratory exercises for practical performance of algorithms and data structures," Education, IEEETransactions on , vol.39, no.4, pp.526,531, Nov 1996
  • Lingfen Wang; Xizuo Li; Wei Li; Haiyu Song, "ZPD-Based Multi-level Teaching Pattern in Software Engineering-- A Case Study ofData
  • Structure and Algorithm Course," Education Technology and Training, 2009. ETT '09. Second International Conference on , vol., no., pp.7,9, 13-14Dec. 2009
  • Cardim, G.P.; Marcal, I.; de Sousa, C.M.; de Campos, D.L.; Marin, C.H.V.; do Carmo, A.F.C.; Toledo, D.F.; Saito,A.; Correia, R.C.M.; Garcia, R.E., "Teaching and learning data structures supported by computers: An experiment using CADILAG tool," Information Systems and Technologies (CISTI), 2012 7th Iberian Conference on , vol., no., pp.1,5, 20-23 June 2012
  • Zulhisam, M.; Rias, R.M., "Modeling Binary TreeAlgorithm in 3-D Interactive Visualization: A Prototype," Intelligent Systems, Modelling and Simul at ion ( ISMS) , 2012 Thi rd International Conference on , vol., no., pp.525,528, 8-10 Feb. 2012
  • C.R.; Gurocak, H., "Assessmentmethods for the upcoming ABET accreditation criteria for computer science programs," Frontiers in Education Conference, 2008. FIE 2008. 38th Annual , vol., no., pp.S4G-6,S4G-11, 22-25Oct.2008
  • Wel lington, C., "Designing an ABET accreditable computer science bachelor's program within the constraints of a teaching university," Frontiers in Education, 2004. FIE 2004. 34th Annual, vol. , no. , pp.T3G/18,T3G/23Vol. 1, 20-23Oct. 2004
  • ABET.15thOctober2014. http://www.abet.org/etac-criteria-2014-2015/
  • Aaron M. Tenenbaum, Yedidyah Langsam, and Moshe J. Augenstein. 1990. Data Structures Using C. Prentice-Hall, Inc., Upper Saddle River,NJ,USA.
  • Ellis Horowitz, Sartaj Sahni, and Sanguthevar Rajasckaran. 1996. ComputerAlgorithms: C++.W.H. Freeman&Co;.,NewYork,NY,USA.
  • Bloom's taxonomy 25th October 2014 <> http://ww2.odu.edu/educ/roverbau/Bloom/bloo ms_taxonomy.htm
  • Bloom's taxonomy 25th October 2014 <> http://cft.vanderbil.edu/guides-subpages/blooms-taxonomy

DON'T MISS OUT!

Subscribe now for latest articles and news.