[Year 12 SofDev] When is enough enough? Data structures depth of knowledge required.[y12]

[Adrian Janson]

Hi Andrew,

As one of the authors of one of the SD texts - I feel I must point out that
although the contents of the study design are fully represented in my text -
my text is not fully represented in the study design!  The only 'book' that
you should be truly using as a reference is the Study Design.  My text
contains a lot of material that is beyond the study - and teachers shouldn't
get the impression that any text is the equivalent to the Study Design.

On the topic of Data Structures - I do take your point that it is not well
defined in the Study Design, however, it is not difficult to know what is
'reasonable'.  For example, 1D and 2D arrays are a must and I feel that a
knowledge of the function of records, stacks and queues is also good.
Linked Lists and trees are really a bit beyond what students need to know -
and certainly teaching the algorithms for them is too much.  You are of
course entitled to teach data structures to any depth that you like - and it
all serves to enrich the topic as a whole!

Cheers,
Adrian
 
Adrian Janson, 
VITTA President
Director of ICT, 
Melbourne High School, 
Forrest Hill, South Yarra 3141 Australia.
Phone: 03 9826 0711 International: +61 3 9826 0711
Fax: 03 9826 8767 International: +61 3 9826 8767
E-mail: janson.adrian.a at edumail.vic.gov.au
Website: http://www.mhs.vic.edu.au
Blog: http://jansona.edublogs.org

-----Original Message-----
From: sofdev-bounces at edulists.com.au [mailto:sofdev-bounces at edulists.com.au]
On Behalf Of Dr Andrew Wenn
Sent: Thursday, 11 September 2008 2:41 PM
To: sofdev at edulists.com.au
Cc: Andrew Wenn
Subject: [Year 12 SofDev] When is enough enough? Data structures depth of
knowledge required.[y12]

Hi,

Could someone please advise on how much knowledge VCE students are required
to have of data structures?

Looking at the two main texts there is a fair difference for example in the
discussion of linked lists in terms of implementation and algorithms. I find
the Study Guide even more vague (now why does that suprise me????)

Obviously students should have an appreciation of structures such as the
array, queue, stack, linked list and trees and when and why they would be
used.

It would be easy to for me to teach six months of data structures and
implementation but what amounts to enough knowledge? Are students expected
to know insertion and deletion algorithms for linked lists or even how to
traverse a tree or a list? 

All answers to be supplied on the back of a table napkin pls :-)

Andrew Wenn
Gippsland Grammar

-- 
email: andrewwenn at mac.com

_______________________________________________
http://www.edulists.com.au
IT Software Development Mailing List kindly supported by
http://www.vcaa.vic.edu.au - Victorian Curriculum and Assessment Authority
and
http://www.vitta.org.au/vce/studies/infotech/softwaredevel3-4.html  - VITTA
Victorian Information Technology Teachers Association Inc



Important - This email and any attachments may be confidential. If received in error, please contact us and delete all copies. Before opening or using attachments check them for viruses and defects. Regardless of any loss, damage or consequence, whether caused by the negligence of the sender or not, resulting directly or indirectly from the use of any attached files our liability is limited to resupplying any affected attachments. Any representations or opinions expressed are those of the individual sender, and not necessarily those of the Department of Education and Early Childhood Development.