Comment Computer science or computer application? (Score 1) 315
First let me make it clear that I don't equate computer science with programming. Most programming is not very elegant and typically it has to be done by a deadline. To me computer science is more about algorithms. A programmer will work on writing a thousand lines of code, whereas a computer scientist will focus on 30 lines within the same time frame. Whereas the programmer writes things to work, the computer scientist makes things work a lot more efficiently. Programmers are engineers that take the tools that the computer scientists develop and apply them.
So if you're taking about computer science, in my mind, you're talking about algorithm development. That being the case, I generally start my classes off by doing binary sort and search routines. If you have 3 20 minute sessions, I would use the first to have the kids figure out how to figure out if a number is in the list. Most people come up with a bubble sort routine. Second, show how binary search is much more efficient and have the kids start thinking about how to sort a list effectively. And for the last session show them merge sort and show how it works. As an application it helps to instruct my students about why algorithms and by extention computer science is important and it gives them an activity to participate in which tends to make learning more interesting and practical. You won't cover a big expanse of material, but it generally gives a good feel for a) how useful computer science is b) that figuring out algorithms are tricky and c) that it takes a lot of work. I'm not sure if you could cram everything into 60 minutes, in general it takes me about 5 hours with college students, but perhaps that will give you something to work from. The important thing for me is getting them to the merge sort algorithm, but without a reason for why you would want to sort information that could be difficult. You might just show them binary search by bringing a telephone book in and asking them if fred jones is listed and explain why searching sequentially is a bad idea. Then launch straight into figuring out how merge sort works.