https://cestlaz.github.io/cestlaz-old-hugo.github.io/tags/educaction/C'est la Z (educaction)Hugo -- gohugo.ioen-usSat, 26 Jan 2019 16:06:08 -0400https://cestlaz.github.io/cestlaz-old-hugo.github.io/post/sequencing-topics/Sat, 26 Jan 2019 16:06:08 -0400https://cestlaz.github.io/cestlaz-old-hugo.github.io/post/sequencing-topics/<p> Monday&#39;s the start of the Spring semester. Other than the 8:00am start I&#39;m looking forward to it. My 8:00am class is the honors/lab component that goes with CS1. I taught it last semester and during each of the past two years at Hunter. My second class is the follow up - more OOP / C++, data structures and some algorithms.</p> <p> The material is old hat. I&#39;ve taught it in Java more times than I can count and also in C++ albeit many years ago. What&#39;s new is that I&#39;m teaching my Hunter kids and I&#39;m doing it in a college framework - two days a week, 1:15 a session. I&#39;m not thinking too much about how I&#39;ll teach each class - I usually figure that out in the moment - not actually in the class but week to week based on the flow of the class. </p> <p> Right now, I have to make final decisions on sequencing, at least for the start of the class. We got ahead of the game by covering most of the C++ topics - inheritance, templates, overloading etc. at the end of last semester so that leaves all the data structures, algorithms, dynamic structures, and memory management, recursion, and sorting and searching. If I have time I&#39;d also love to get into some graph stuff. </p> <p> Here&#39;s the plan, at lest for now.</p> <p> We&#39;ll start with recursion. They had the basics last term but now we&#39;ll talk about search - I usually focus this around a maze solver. After this we&#39;ll place recursion on hold - at least in terms of class time and move to linked lists and dynamic memory. We&#39;ll follow this with sorting. The idea is that students have trouble getting comfortable with both recursion and also with dynamic structures first time through. Rather than ploughing through from recursion to the recursive sorts I&#39;m hoping that putting the dynamic lists in between will give recursion some time to marinate in the background. Likewise I&#39;m hoping that the dynamic memory stuff can marinate through the sorting unit for when we revisit it with stacks, queues, and trees after sorting.</p> <p> I don&#39;t know if this is the optimal way of sequencing the topics but I think it will work pretty well.</p> <p> We&#39;ll see as the semester progresses. If things are going swimmingly I can always call an audible.</p>