Teaching binary tree algorithms through visual programming

Shows how visual programming can be used to teach the subject of binary tree algorithms. In our approach, the student implements a binary tree algorithm by manipulating abstract tree fragments (not necessarily just single nodes) in a visual way. This paper contributes to visual programming research...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings 1996 IEEE Symposium on Visual Languages s. 38 - 45
Hlavní autor: Michail, A.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 1996
Témata:
ISBN:9780818675089, 081867508X
ISSN:1049-2615
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Shows how visual programming can be used to teach the subject of binary tree algorithms. In our approach, the student implements a binary tree algorithm by manipulating abstract tree fragments (not necessarily just single nodes) in a visual way. This paper contributes to visual programming research by combining elements of animation, programming and proof to produce an educational visual programming tool. In addition, we describe our experiences with Opsis, a system we built to demonstrate the ideas in this paper (Opsis is a Java applet and can be accessed at http://www.cs.washington.edu/homes/amir/Opsis.html). Finally, we make the claim that visual programming is an ideal way to teach data structure algorithms.
AbstractList Shows how visual programming can be used to teach the subject of binary tree algorithms. In our approach, the student implements a binary tree algorithm by manipulating abstract tree fragments (not necessarily just single nodes) in a visual way. This paper contributes to visual programming research by combining elements of animation, programming and proof to produce an educational visual programming tool. In addition, we describe our experiences with Opsis, a system we built to demonstrate the ideas in this paper (Opsis is a Java applet and can be accessed at http://www.cs.washington.edu/homes/amir/Opsis.html). Finally, we make the claim that visual programming is an ideal way to teach data structure algorithms.
Author Michail, A.
Author_xml – sequence: 1
  givenname: A.
  surname: Michail
  fullname: Michail, A.
  organization: Dept. of Comput. Sci. & Eng., Washington Univ., Seattle, WA, USA
BookMark eNotj81Kw0AYRQesYK3ZunA1L5A43_x_7qRoFQJuqtsy00ySkfyUSSr49gbq3dzVuZx7S1bDOARC7oEVAAwfv8oCEHWhpOJaXZEMjWUWrDaKWVyRNTCJOdegbkg2Td9siVIWFa7J0z64YxuHhvo4uPRL5xQCdV0zpji3_UTnNo3npqU_cTq7jp7S2CTX9wtxR65r100h--8N-Xx92W_f8vJj9759LvMIhs85HFXAWliJ3FeGVRa4hJprg9IIaVxlnQcmdAjaG8uNZ9ZyJnyFFWc-oNiQh8tuDCEcTin2i-fhclb8AZvxSM8
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/VL.1996.545265
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Applied Sciences
Education
Computer Science
EndPage 45
ExternalDocumentID 545265
GroupedDBID 29I
6IE
6IK
6IL
AAJGR
AAWTH
ABDPE
ADZIZ
AI.
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IPLJI
OCL
RIE
RIL
RNS
VH1
ID FETCH-LOGICAL-i172t-1c5e9f38492bd70d81241f267947347ad8ab1036ee6b7827b088203bd9d20be93
IEDL.DBID RIE
ISBN 9780818675089
081867508X
ISICitedReferencesCount 5
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=545265&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1049-2615
IngestDate Tue Aug 26 17:34:25 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i172t-1c5e9f38492bd70d81241f267947347ad8ab1036ee6b7827b088203bd9d20be93
PageCount 8
ParticipantIDs ieee_primary_545265
PublicationCentury 1900
PublicationDate 19960000
PublicationDateYYYYMMDD 1996-01-01
PublicationDate_xml – year: 1996
  text: 19960000
PublicationDecade 1990
PublicationTitle Proceedings 1996 IEEE Symposium on Visual Languages
PublicationTitleAbbrev VL
PublicationYear 1996
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000558959
ssj0055156
Score 1.2570992
Snippet Shows how visual programming can be used to teach the subject of binary tree algorithms. In our approach, the student implements a binary tree algorithm by...
SourceID ieee
SourceType Publisher
StartPage 38
SubjectTerms Animation
Binary trees
Computer science
Data structures
Education
Home computing
HTML
Java
Programming profession
World Wide Web
Title Teaching binary tree algorithms through visual programming
URI https://ieeexplore.ieee.org/document/545265
WOSCitedRecordID wos545265&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwMhECbaePBUrTW-w8ErLbsLC3g1Nh6apodqemt4rW7Sh-lu-_sFlq0x8eKNnYQsgcB8DDPfB8BjJglPM4qRO-okIookiOcaI0O0VMoLOxSBXX_MJhM-n4tp5NkOtTDW2pB8Zge-Gd7yzUbvfKhsGPSw6TE4Zow1pVqHcAqmlAealOYQdjggCLe6y4ZA7pJAA_WjJ29zgKQl3mm_RSRzTLAYvo99_V4-aH71S3IleJxR919jPQP9n8o9OD34pHNwZNc90I1QE8aNXDlTq-bQ2npevznmelyAp1lMsoQq1OtC_3YN5fJjsy3rz1UFo7wP3JfVTi5hzPJauR598DZ6mT2_oqiygEoHXmqUaGpFkXEiUmUYNt7jJ0Wau43KMsKk4VIlzs9ZmysHJ5jyoBxnygiTYmVFdgk6683aXgGYFhZTbJVmMicOaPCC5cYBBKUNF27tr0HPT9TiqyHSWDRzdPOn9RacNgnSPtpxBzr1dmfvwYne12W1fQiL_w3lAqgu
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8MgFCY6TfQ0nTP-loNXNtpCC16NZsa67DDNbgsUqk32w6zd_n6B0hkTL97KSxoaKLyPx3vfB8BdJAgLI4qR2eoEIpIEiMUZRopkQkor7JA7dv00GQ7ZZMJHnmfb1cJorV3yme7ZR3eXr5bZ2obK-k4Pm-6CPUpIGNTFWtuACqaUOaKUehs2SMBJt5rjBkfmmEAd-aOlbzOQpKHeadrc0zkGmPffU1vBF_fqzn6Jrjif89T-19cege5P7R4cbb3SMdjRiw5oe7AJ_VIujanRc2hsHavg7LM9TsD92KdZQukqdqG9vYZi9rFcFdXnvIRe4AduinItZtDnec3NG13w9vQ4fhggr7OACgNfKhRkVPM8YoSHUiVYWZ8f5GFslmoSkUQoJmRgPJ3WsTSAIpEWluNIKq5CLDWPTkFrsVzoMwDDXGOKtcwSERMDNViexMpABJkpxs3sn4OOHajpV02lMa3H6OJP6y04GIxf02n6PHy5BId1urSNfVyBVrVa62uwn22qolzduB_hG9j-q3U
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+1996+IEEE+Symposium+on+Visual+Languages&rft.atitle=Teaching+binary+tree+algorithms+through+visual+programming&rft.au=Michail%2C+A.&rft.date=1996-01-01&rft.pub=IEEE&rft.isbn=9780818675089&rft.issn=1049-2615&rft.spage=38&rft.epage=45&rft_id=info:doi/10.1109%2FVL.1996.545265&rft.externalDocID=545265
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1049-2615&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1049-2615&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1049-2615&client=summon