{"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":"2017-05-24T12:23:32","modified_gmt":"2017-05-24T19:23:32","slug":"may-20","status":"publish","type":"page","link":"https:\/\/sites.evergreen.edu\/compcog17\/may-20\/","title":{"rendered":"May 24"},"content":{"rendered":"<h1>\u00a0Quiz and Competency<\/h1>\n<h1>Machine Language: \u00a0For Loop<br \/>\nfor(x=3; x&lt;7; x++)<\/h1>\n<p>0 LOAD R0 8<br \/>\n1 LOAD R1 9<br \/>\n2 LOAD R2 10<br \/>\n3 ADD R1 R1 R0<br \/>\n4 SUB R3 R2 R1<br \/>\n5 BZERO 7<br \/>\n6 BRANCH 3<br \/>\n7 HALT<br \/>\n8 1<br \/>\n9 3<br \/>\n10 7<\/p>\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\u00a0Wednesday<br \/>\n&#8212; See Me<\/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\/compcog-s17\/Handouts\/BSTmake.html\">Trees<\/a><br \/>\n&#8212;&#8212;- \u00a0<a href=\"https:\/\/myfiles.evergreen.edu\/academics\/programs\/compcog-s17\/Handouts\/BstRandom.html\">Make one<\/a>\u00a0 <a href=\"https:\/\/myfiles.evergreen.edu\/academics\/programs\/compcog-s17\/Handouts\/BSTRndNames.html\">Names<\/a><br \/>\n&#8212; \u00a0Other Trees<br \/>\n&#8212; \u00a0Hash tables:<\/h1>\n<h1>Seminar Overview<\/h1>\n<h1>Seminar<\/h1>\n<h1>Programs<br \/>\n&#8212; TTT, MM, Extensions<br \/>\n&#8212; Portfolio Programs<br \/>\n&#8212; 8 puzzle<br \/>\n&#8212; Binary Search<br \/>\n&#8212; Machine Divide<br \/>\n&#8212; <a href=\"https:\/\/myfiles.evergreen.edu\/academics\/programs\/compcog-s17\/Handouts\/bship.html\">Battleship<\/a><br \/>\n&#8212; <a href=\"https:\/\/myfiles.evergreen.edu\/academics\/programs\/compcog-s17\/Handouts\/CSBinarySearch.html\">Radix Sort<\/a><br \/>\n&#8212; <a href=\"https:\/\/myfiles.evergreen.edu\/academics\/programs\/compcog-s17\/Handouts\/MagicSquare1.html\">MagicSquare<br \/>\n<\/a>&#8212; \u00a0Others.. Recursion,..<\/h1>\n<p>&#8211;<\/p>\n<h1>Work Time<\/h1>\n<h1>Competencies<\/h1>\n<h1>To Do<\/h1>\n<h1><\/h1>\n","protected":false},"excerpt":{"rendered":"<p>\u00a0Quiz and Competency Machine Language: \u00a0For Loop for(x=3; x&lt;7; x++) 0 LOAD R0 8 1 LOAD R1 9 2 LOAD R2 10 3 ADD R1 R1 R0 4 SUB R3 R2 R1 5 BZERO 7 6 BRANCH 3 7 HALT 8 1 9 3 10 7 Making a Computer Fast: &#8212; Bus\/Word size &#8212; Clock [&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\/compcog17\/wp-json\/wp\/v2\/pages\/1459"}],"collection":[{"href":"https:\/\/sites.evergreen.edu\/compcog17\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/sites.evergreen.edu\/compcog17\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/sites.evergreen.edu\/compcog17\/wp-json\/wp\/v2\/users\/274"}],"replies":[{"embeddable":true,"href":"https:\/\/sites.evergreen.edu\/compcog17\/wp-json\/wp\/v2\/comments?post=1459"}],"version-history":[{"count":0,"href":"https:\/\/sites.evergreen.edu\/compcog17\/wp-json\/wp\/v2\/pages\/1459\/revisions"}],"wp:attachment":[{"href":"https:\/\/sites.evergreen.edu\/compcog17\/wp-json\/wp\/v2\/media?parent=1459"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}