1 / 53

HUMAN COMPUTER INTERACTION

HUMAN COMPUTER INTERACTION Lab. Of Distributed Multimedia Information Systems and Applications | TUC/MUSIC Department of Electronic and Computer Engineering Technical University of Crete. Rontidis Pavlos prontidis@yahoo.gr Souris Anastasios tassos_souris@yahoo.gr. mDS. s.

astrid
Download Presentation

HUMAN COMPUTER INTERACTION

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. HUMAN COMPUTER INTERACTION Lab. Of Distributed Multimedia Information Systems and Applications | TUC/MUSIC Department of Electronic and Computer Engineering Technical University of Crete RontidisPavlos prontidis@yahoo.gr Souris Anastasios tassos_souris@yahoo.gr

  2. mDS

  3. s http://en.wikipedia.org/wiki/Binary_search_tree • Description: Node-based binary tree with the properties: • A left sub-tree of a node contains only nodes with keys less than … http://en.wikipedia.org/wiki/AVL_tree Description: AVL tree is a self-balancing binary search tree, and it was the first such data structure to be invented. http://en.wikipedia.org/wiki/Red_Black_tree Description:A red-black tree is a type of self-balancing binary search tree, a data structure used in computing science, typically used to implement associative arrays.

  4. menu mDS

  5. The purpose of this test is to test basic knowledge on BSTs. Time Limit: 3 min Completed in: 2min Date finished: 2/22/2011 The purpose of this test is to test two operation on BSTs, Insertion and deletion. Time Limit: 6 min Not taken The purpose of this test is to test BST traversals. Insertion and deletion. Time Limit: 10 min Not taken

  6. Tap start to start the timer. Tap start to complete or exit the Quiz. Tap start to start the timer. Tap start to complete or exit the Quiz. Start Finish

  7. 00:01 Multiple choice Description… Answer 1…. Answer 2… Answer 3… Start Finish

  8. The purpose of this test is to test basic knowledge on BSTs. Time Limit: 3 min Completed in: 2min Date finished: 2/22/2011 The purpose of this test is to test two operation on BSTs, Insertion and deletion. Time Limit: 6 min Failed: 10min Not Completed The purpose of this test is to test BST traversals. Insertion and deletion. Time Limit: 10 min Not taken

  9. mDS Prototype:Animations List 10 iPhone demo 3 15 change options 8 2 17 Search for key = 6 6 16 Search for key = 9 iPad demo Node creation & insertion In-order Traversal

  10. Change options 10 3 15 8 2 17 6 16 options help return animation practice

  11. Option screen mDS

  12. Option screen mDS

  13. mDS Prototype:Animations List 10 iPhone demo 3 15 change options 8 2 17 Search for key = 6 6 16 Search for key = 9 iPad demo Node creation & insertion In-order Traversal

  14. Search 6 10 3 15 8 2 17 6 16 options help return animation practice

  15. You tapped inside an empty node. Enter node’s key:

  16. You tapped inside an empty node. 6 Enter node’s key:

  17. 10 < 3 15 8 2 17 6 16 6 < 10 is True cancel

  18. 10 3 15 > 8 2 17 6 16 6 > 3 is True cancel

  19. 10 3 15 8 2 17 > 6 16 6 < 8 is True cancel

  20. 10 3 15 8 2 17 6 16 6 = 6 is True cancel

  21. 10 3 15 8 2 17 6 16 Node found ! cancel

  22. mDS Prototype:Animations List 10 iPhone demo 3 15 change options 8 2 17 Search for key = 6 6 16 Search for key = 9 iPad demo Node creation & insertion In-order Traversal

  23. Search 9 10 3 15 8 2 17 6 16 options help return animation practice

  24. You tapped inside an empty node. Enter node’s key:

  25. You tapped inside an empty node. 9 Enter node’s key:

  26. 10 < 3 15 8 2 17 6 16 9 < 10 is True cancel

  27. 10 3 15 > 8 2 17 6 16 9 > 3 is True cancel

  28. 10 3 15 8 2 17 6 16 9 > 8 is True cancel

  29. 10 3 15 8 2 17 6 16 NULL Leaf reached. Node not found. cancel

  30. mDS Prototype:Animations List 10 iPhone demo 3 15 change options 8 2 17 Search for key = 6 6 16 Search for key = 9 iPad demo Node creation & insertion In-order Traversal

  31. Insert 9 10 3 15 8 2 17 6 16

  32. 10 3 15 8 2 17 6 16 Node created !

  33. You tapped inside an empty node. Enter node’s key:

  34. You tapped inside an empty node. 9 Enter node’s key:

  35. 10 < 3 15 8 2 17 6 16 Next step: current current.left current.key root.key 9 < current.key cancel

  36. 10 3 15 > 8 2 17 6 16 Next step: current current.right current.key 3 9 > current.key cancel

  37. 10 3 15 8 2 17 6 16 NULL found position for key = 9 Pointer to NULL: Allocate space for new node. current.key 8 9 > current.key cancel

  38. 10 3 15 2 8 17 16 6 9 Node inserted. Algorithm finished. Result: Insertion completed. cancel

  39. mDS Prototype:Animations List 10 iPhone demo 3 15 change options 8 2 17 Search for key = 6 6 16 Search for key = 9 iPad demo Node creation & insertion In-order Traversal

  40. In-order traversal 10 3 15 8 2 17 6 16

  41. 10 3 15 8 2 17 6 16 Gesture initiated an in-order traversal. cancel

  42. 10 3 15 8 2 17 6 16 Recursion to left sub-tree. Printed: 2 cancel

  43. 10 3 15 8 2 17 6 16 Printed: 2, 3 cancel

  44. 10 3 15 8 2 17 6 16 Printed: 2, 3, 6 cancel

  45. 10 3 15 8 2 17 6 16 Printed: 2, 3, 6, 8 cancel

  46. 10 3 15 8 2 17 6 16 Visited root. Printed: 2, 3, 6, 8, 10 cancel

  47. 10 3 15 8 2 17 6 16 Recursion to right sub-tree. Printed: 2, 3, 6, 8, 10, 15 cancel

  48. 10 3 15 8 2 17 6 16 Printed: 2, 3, 6, 8, 10, 15, 16 cancel

More Related