Exercise -lesson
• Form teams of no more than 6 students.
• Choose a data-structures topic.
• Discuss how to structure a lesson on that topic.
Subject matter
• Generally important ideas (“screwdrivers”) versus specialty topics
(“voltmeters”).
• Common themes that one finds throughout the study of data structures.
• pointers: cells in memory that refer to other cells
• recursion
• fencepost errors
• dummy value
• experimentation and invention
• What is a data structure? Howdoes it relate tomore general software
tools?
• How does one discuss efficiency of data structures?
• Linked lists (the first structure built with pointers)
• Queues, stacks, deques: built out of either linked lists or arrays
• Quick example of using an array for a queue
• Searching though numeric data: linked lists, unsorted array, sorted
array (binary search, interpolation search), binary tree
• Recursion theorem (without proof)
• Finding the jth largest element in a set (recursive partitioning)
• Sorting numeric data: insertion sort, selection sort, quicksort, bin
sort, radix sort
• short discussion: Never use bubble sort, although bumble sort
is far worse!
• Priority queues: heaps and heap sort
• Balanced binary trees: red-black trees, 2-3 trees, B treee
• Hashing, including the ”hash” data structure of Perl or PHP
• Quick example of hashing “we came we saw we conquered”
• Cryptographic hashing (digests)
• Quad trees, k-d trees
• Graphs
Sumber: Finkel, Raphael, 2009. How to Teach Data Structures.
Author: rasp
Saya adalah pejuang, pekerja informatics ipos, mujahid fi sabil lillaah, hamba Allah SWT.
View all posts by rasp
