{"id":1459,"date":"2015-05-13T12:13:15","date_gmt":"2015-05-13T19:13:15","guid":{"rendered":"http:\/\/sites.evergreen.edu\/compcog15\/?page_id=1459"},"modified":"2016-05-18T15:04:38","modified_gmt":"2016-05-18T22:04:38","slug":"may-20","status":"publish","type":"page","link":"https:\/\/sites.evergreen.edu\/candc16\/may-20\/","title":{"rendered":"May 18"},"content":{"rendered":"<h1>\u00a0Questions<\/h1>\n<h1>In the News<\/h1>\n<h1>Machine Language: \u00a0For Loop<\/h1>\n<h1>Competency\/Program Work Time<\/h1>\n<h1>Making a Computer Fast:<br \/>\n&#8212; Bus\/Word size<br \/>\n&#8212; Clock<br \/>\n&#8212; Architecture\/RISC..<br \/>\n&#8212; Parallel Computers<br \/>\n&#8212; Others<\/h1>\n<h1>Brain Presentations: \u00a0Next Monday<\/h1>\n<h1>Making Software Fast<br \/>\n&#8212; Data Structures:<br \/>\n&#8212;&#8212; \u00a0Linear vs Binary Search<br \/>\n&#8212;&#8212; \u00a0Big O<br \/>\n&#8212;&#8212; \u00a0Sorts<br \/>\n&#8212; Linked Lists and Pointers<br \/>\n&#8212; \u00a0Binary Search <a href=\"https:\/\/myfiles.evergreen.edu\/academics\/programs\/candc16\/Handouts\/BSTmake.html\">Trees<\/a><br \/>\n&#8212;&#8212;- \u00a0<a href=\"https:\/\/myfiles.evergreen.edu\/academics\/programs\/candc16\/Handouts\/BstRandom.html\">Make one<\/a>\u00a0 <a href=\"https:\/\/myfiles.evergreen.edu\/academics\/programs\/candc16\/Handouts\/BSTRndNames.html\">Names<\/a><br \/>\n&#8212; \u00a0Other Trees<br \/>\n&#8212; \u00a0Hash tables:<\/h1>\n<h1>Seminar<\/h1>\n<h1><a href=\"https:\/\/myfiles.evergreen.edu\/academics\/programs\/candc16\/Handouts\/8puzClassArrayInput.html\">Class Structures in Arrays<\/a><\/h1>\n<h1>To Do<\/h1>\n<h1>Work Time<\/h1>\n","protected":false},"excerpt":{"rendered":"<p>\u00a0Questions In the News Machine Language: \u00a0For Loop Competency\/Program Work Time Making a Computer Fast: &#8212; Bus\/Word size &#8212; Clock &#8212; Architecture\/RISC.. &#8212; Parallel Computers &#8212; Others Brain Presentations: \u00a0Next Monday Making Software Fast &#8212; Data Structures: &#8212;&#8212; \u00a0Linear vs Binary Search &#8212;&#8212; \u00a0Big O &#8212;&#8212; \u00a0Sorts &#8212; Linked Lists and Pointers &#8212; \u00a0Binary Search [&hellip;]<\/p>\n","protected":false},"author":274,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"open","template":"","meta":{"_mi_skip_tracking":false},"_links":{"self":[{"href":"https:\/\/sites.evergreen.edu\/candc16\/wp-json\/wp\/v2\/pages\/1459"}],"collection":[{"href":"https:\/\/sites.evergreen.edu\/candc16\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/sites.evergreen.edu\/candc16\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/sites.evergreen.edu\/candc16\/wp-json\/wp\/v2\/users\/274"}],"replies":[{"embeddable":true,"href":"https:\/\/sites.evergreen.edu\/candc16\/wp-json\/wp\/v2\/comments?post=1459"}],"version-history":[{"count":0,"href":"https:\/\/sites.evergreen.edu\/candc16\/wp-json\/wp\/v2\/pages\/1459\/revisions"}],"wp:attachment":[{"href":"https:\/\/sites.evergreen.edu\/candc16\/wp-json\/wp\/v2\/media?parent=1459"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}