{"id":1088,"date":"2012-09-18T09:55:45","date_gmt":"2012-09-18T09:55:45","guid":{"rendered":"http:\/\/prog.pwnict.co.uk\/?page_id=1088"},"modified":"2013-06-15T06:21:22","modified_gmt":"2013-06-15T06:21:22","slug":"a2-programs","status":"publish","type":"page","link":"https:\/\/www.ihaz.codes\/UoB\/tasks\/a2-programs\/","title":{"rendered":"A2 programs"},"content":{"rendered":"<p>In this section you will find some programs which are set as part of the A2 course.<\/p>\n<p><code><div class=\"child_pages child_pages-thumbnail\">\n<div id=\"child_page-1090\" class=\"child_page\" style=\"width:50%;max-width:100%;\"><div class=\"child_page-container\"><div class=\"post_content\"><h4><a href=\"https:\/\/www.ihaz.codes\/UoB\/tasks\/a2-programs\/fcfs\/\">FCFS<\/a><\/h4><div class=\"post_excerpt\">Write an implementation of the scheduling algorithm first come first served. Use the round robin example code to help you. You need to log in or create an account[read more]<\/div><\/div><!-- .post_content  --><\/div><!-- .child_page-container --><\/div><!-- #child_page-1090\" -->\n\n<div id=\"child_page-1099\" class=\"child_page\" style=\"width:50%;max-width:100%;\"><div class=\"child_page-container\"><div class=\"post_content\"><h4><a href=\"https:\/\/www.ihaz.codes\/UoB\/tasks\/a2-programs\/quick-sort\/\">quick sort<\/a><\/h4><div class=\"post_excerpt\">Write a program which will generate an array of 100 numbers and then run quick sort on it. Quick sort must be implemented recursivly to get the points. You need[read more]<\/div><\/div><!-- .post_content  --><\/div><!-- .child_page-container --><\/div><!-- #child_page-1099\" -->\n\n<div id=\"child_page-225\" class=\"child_page\" style=\"width:50%;max-width:100%;\"><div class=\"child_page-container\"><div class=\"post_content\"><h4><a href=\"https:\/\/www.ihaz.codes\/UoB\/tasks\/a2-programs\/bubble-sort\/\">Bubble sort<\/a><\/h4><div class=\"post_excerpt\">The code below will generate a list of 2000 numbers randomly. Your task is to sort them into ascending order using bubble sort.<\/div><\/div><!-- .post_content  --><\/div><!-- .child_page-container --><\/div><!-- #child_page-225\" -->\n<\/div><\/code><\/p>\n","protected":false},"excerpt":{"rendered":"<p>In this section you will find some programs which are set as part of the A2 course.<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":562,"menu_order":0,"comment_status":"open","ping_status":"open","template":"","meta":{"footnotes":""},"categories":[],"class_list":["post-1088","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.ihaz.codes\/UoB\/wp-json\/wp\/v2\/pages\/1088","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.ihaz.codes\/UoB\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.ihaz.codes\/UoB\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.ihaz.codes\/UoB\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.ihaz.codes\/UoB\/wp-json\/wp\/v2\/comments?post=1088"}],"version-history":[{"count":0,"href":"https:\/\/www.ihaz.codes\/UoB\/wp-json\/wp\/v2\/pages\/1088\/revisions"}],"up":[{"embeddable":true,"href":"https:\/\/www.ihaz.codes\/UoB\/wp-json\/wp\/v2\/pages\/562"}],"wp:attachment":[{"href":"https:\/\/www.ihaz.codes\/UoB\/wp-json\/wp\/v2\/media?parent=1088"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.ihaz.codes\/UoB\/wp-json\/wp\/v2\/categories?post=1088"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}