{"id":20526,"date":"2016-03-07T03:01:52","date_gmt":"2016-03-06T17:01:52","guid":{"rendered":"http:\/\/www.rjmprogramming.com.au\/ITblog\/?p=20526"},"modified":"2016-03-06T19:02:25","modified_gmt":"2016-03-06T09:02:25","slug":"javascript-associative-array-quiz-tutorial","status":"publish","type":"post","link":"https:\/\/www.rjmprogramming.com.au\/ITblog\/javascript-associative-array-quiz-tutorial\/","title":{"rendered":"Javascript Associative Array Quiz Tutorial"},"content":{"rendered":"
\"Javascript<\/a>

Javascript Associative Array Quiz Tutorial<\/p><\/div>\n

We consolidate yesterday’s Javascript Associative Array Primer Tutorial<\/a> with today’s HTML and Javascript web application where we use Javascript objects<\/a> as a way to have associative array<\/i><\/a> thoughts permeate your client side web application logic.<\/p>\n

Today we …<\/p>\n

    \n
  1. add a “Previous” way to navigate along the Associative Array data structure … in addition to yesterday’s “Next” way (that linked lists<\/i> are very fond of)<\/li>\n
  2. add background imagery for a tree<\/li>\n
  3. change border arrangements for “root” and “canopy” of tree<\/li>\n
  4. allow display modes [Tree Creeper], Tree, Creeper, Weeping Tree … with different looks via CSS styling via HTML class definitions established via URL mechanisms teamed with a document.write<\/i> “delayed write out of HTML” Javascript technique<\/li>\n
  5. allow the concept of a Tree name<\/i> via user specific arrangements involving a colon (:) when defining the (tree) root value<\/li>\n
  6. establish a quiz functionality to the web application … optional, of course<\/li>\n<\/ol>\n

    Step 4 above needed us to explore CSS rotation<\/i><\/a> techniques on the (new) HTML div element (now) encasing the HTML table we talked about with yesterday’s tutorial.<\/p>\n

    Today’s HTML and Javascript programming source code you could call tree_chalkboard.html<\/a> has this live run<\/a> link, and this link<\/a> shows the changes made since yesterday. Again, we’d like to thank this link<\/a> for its great advice regarding Javascript objects and their associative array “look” possibilities.<\/p>\n

    \n

    Previous relevant Javascript Associative Array Primer Tutorial<\/a> is shown below.<\/p>\n

    \"Javascript<\/a>

    Javascript Associative Array Primer Tutorial<\/p><\/div>\n

    Today’s HTML and Javascript web application uses Javascript objects<\/a> as a way to have associative array<\/i><\/a> thoughts permeate your client side web application logic.<\/p>\n

    The idea of an associative array<\/i> has a lot of appeal, in the same way we humans, hopefully, prefer to call each other by our name<\/i> rather than our number<\/i>. Don’t feel sorry for the trouble you’re causing the computer thinking in terms of arrays with names rather than numbers … they’ll get over it<\/font> … but there is a small consideration with massive amounts of data that the computer will do that massive amount of calculation faster using a numerical index on a huge array, rather than an associative indexing system.<\/p>\n

    Today we have the user create up to 5 tree hierarchies, initialised via<\/p>\n

    var Questions = [new Object(), new Object(), new Object(), new Object(), new Object()];<\/code><\/p>\n

    this approach that ends up a lot like a linked list<\/a>. We provide you with a guaranteed reference to the root element of Tree x<\/i> as Questions[x].Text<\/i> and the value contained in Questions[x].Text fed through a homespun Javascript function enumis() gets you going so that …<\/p>\n

    var nextis = eval(\"Questions[x].\" + enumis(Questions[x].Text) + \"Next\")<\/code><\/p>\n

    … would get you to the next place on the tree … and can you guess you could then go …<\/p>\n

    nextis = eval(\"Questions[x].\" + enumis(nextis) + \"Next\")<\/code><\/p>\n

    … to keep going up the tree, perhaps all the way to our green bordered “canopy”. As you can see, to be a friend of Javascript eval()<\/a> is a very wise move for a huge number and variety of client web application issues and solutions.<\/p>\n

    HTML display wise what we do is to start with an HTML table<\/i> and tbody<\/i> and 5 tr<\/i> row elements, initially with just 1 td<\/i> cell (per row) containing the HTML input<\/i> type=text where the user enters their data. At the HTML body<\/i> onload event we snapshot this scenario exactly like that, and add into the end of the 1 td<\/i> cell an HTML div<\/i> element given an ID (for Javascript DOM purposes). As we build any one tree to be “taller” (in our case, we have right to left “climbers”) that aforesaid mentioned HTML div<\/i> has its innerHTML<\/i> property populated with the next HTML input<\/i> type=text (derivable from that snapshotted first HTML input<\/i> type=text element of the row) and HTML div<\/i> element “child” set (of new HTML elements). So you end up with the 1 cell per row, and things are helped to stay “connected” by the CSS float<\/a>:left<\/i> property applied to the HTML div<\/i> elements.<\/p>\n

    Today’s HTML and Javascript programming source code you could call tree_chalkboard.html<\/a> has this live run<\/a> link. We’d like to thank this link<\/a> for its great advice regarding Javascript objects and their associative array “look” possibilities.<\/p>\n

    If this was interesting you may be interested in this<\/a> too.<\/p>\n