[Year 12 SofDev] Reading the study design

[Mark]

Thanks, Duane. The interpretation seems to be heading in that direction,
even though research is revealing that the concepts are not *perfectly*
synonymous. In researching their differences, I found that associative
arrays (a.k.a. a map or dictionary) is an abstract data type (ADT) whereas
a hashing table is a concrete data structure. When I got this far
<http://cs.stackexchange.com/questions/6678/relation-and-difference-between-associative-array-and-hashing-table>
I
started backing away v-e-r-y slowly...


"A dictionary supports Find(x) queries. For an a key x, return the element
in the dictionary with key x, if such an element exists. A dynamic
dictionary also supports Insert(x) and Delete(x). Common implementations of
a dictionary include different kinds of balanced binary search trees (e.g.
red black tree) and various kinds of hash tables.


In addition to Find an ADT may require support of successor(x) queries.
That is, maintain a set of keys S, and given key x, find the smallest key
t∈S such that s<t. Concrete data structures which support the Successor ADT
include various binary search trees, and more complicated structures such
as an X-fast trie or van Emde Boas tree (if the keys are integers)."


Now I just have to squeeze that into a friendly slideshow...

Cheers
Mark

On 15 December 2015 at 11:05, Collinson, Duane A <
collinson.duane.a at edumail.vic.gov.au> wrote:

> Hi Mark
>
>
>
> I interpreted this as dictionaries and hash tables are synonyms for
> associative arrays.
>
>
>
> Could see another way of teaching this KK.
>
>
>
> Cheers
>
>
>
> *Duane Collinson*
>
>
>
> *Horsham College*
>
> *310 Baillie Street*
>
> *Horsham, Victoria 3400*
>
>
>
> *(03) 5381 7100*
>
>
>
>
> ------------------------------
> *From:* sofdev-bounces at edulists.com.au [sofdev-bounces at edulists.com.au]
> on behalf of Mark [mark at vceit.com]
> *Sent:* Tuesday, 15 December 2015 10:50 AM
> *To:* Year 12 Software Development Teachers' Mailing List
> *Subject:* [Year 12 SofDev] Reading the study design
>
> Maybe someone can help with this, or it might require Paula.
>
> In SD U4O1 KK2 it refers to "uses of data structures to organise and
> manipulate data, including associative arrays (or dictionaries or hash
> tables)"
>
> I'm not sure how to interpret the 'or's after 'including'. Does it mean"
> - dictionaries and hash tables are synonyms for associative arrays?
> - we may choose between dictionaries and hash tables and associative
> arrays?
>
> Neither of those makes much sense.
> What does it mean in terms of teaching KK?
>
> Regards
> Mark
>
>
> --
>
> Mark Kelly
>
> mark at vceit.com
> http://vceit.com
>
> *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 Training.
>
> _______________________________________________
> http://www.edulists.com.au - FAQ, Subscribe, Unsubscribe
> IT Software Development Mailing List kindly supported by
> http://www.vcaa.vic.edu.au - Victorian Curriculum and Assessment
> Authority and
> http://www.vcaa.vic.edu.au/vce/studies/infotech/softwaredevel3-4.html
> http://www.vitta.org.au  - VITTA Victorian Information Technology
> Teachers Association Inc
> http://www.swinburne.edu.au/ict/schools - Swinburne University
>



-- 

Mark Kelly

mark at vceit.com
http://vceit.com
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.edulists.com.au/pipermail/sofdev/attachments/20151215/ae26205e/attachment-0001.html