{"id":242,"date":"2012-03-01T19:28:31","date_gmt":"2012-03-01T12:28:31","guid":{"rendered":"https:\/\/dosen.unila.ac.id\/rasp\/?p=242"},"modified":"2012-03-01T19:35:41","modified_gmt":"2012-03-01T12:35:41","slug":"struktur-data-4","status":"publish","type":"post","link":"https:\/\/dosen.unila.ac.id\/rasp\/2012\/03\/01\/struktur-data-4\/","title":{"rendered":"Struktur Data 4"},"content":{"rendered":"<pre>Teaching data structures\r\n\u2022 adjacency matrix, adjacency list\r\n\u2022 Degree of all vertices, connected component, checking connectivity\r\n\u2022 Breadth-first search\r\n\u2022 Shortest path\r\n\u2022 Topological sort\r\n\u2022 All shortest paths from a vertex\r\n\u2022 Spanning trees: Kruskal, Prim\r\n\u2022 Cycle detection: union-find\r\n\u2022 Numerical algorithms: GCD, exponentiation, integer multiplication\r\n\u2022 Strings\r\n\u2022 Text search (brute force, Rabin-Karp, Knuth-Morris-Pratt, others)\r\n\u2022 Edit distance\r\n\u2022 Pattern matching by regular expressions, advanced regular expressions\r\n\u2022 Categories of algorithms: divide and conquer, greedy, dynamic programming,\r\nsearch\r\n\u2022 Tractability: constant, logarithmic, linear, quadratic\r\n\u2022 Decision problems: P, NP<\/pre>\n<pre>Sumber: Finkel, Raphael, 2009. How to Teach Data Structures.<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Teaching data structures \u2022 adjacency matrix, adjacency list \u2022 Degree of all vertices, connected component, checking connectivity \u2022 Breadth-first search \u2022 Shortest path \u2022 Topological sort \u2022 All shortest paths from a vertex \u2022 Spanning trees: Kruskal, Prim \u2022 Cycle detection: union-find \u2022 Numerical algorithms: GCD, exponentiation, integer multiplication \u2022 Strings \u2022 Text search (brute &hellip; <a href=\"https:\/\/dosen.unila.ac.id\/rasp\/2012\/03\/01\/struktur-data-4\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;Struktur Data 4&#8221;<\/span><\/a><\/p>\n","protected":false},"author":14,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[39],"tags":[],"class_list":["post-242","post","type-post","status-publish","format-standard","hentry","category-data-structure"],"_links":{"self":[{"href":"https:\/\/dosen.unila.ac.id\/rasp\/wp-json\/wp\/v2\/posts\/242"}],"collection":[{"href":"https:\/\/dosen.unila.ac.id\/rasp\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/dosen.unila.ac.id\/rasp\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/dosen.unila.ac.id\/rasp\/wp-json\/wp\/v2\/users\/14"}],"replies":[{"embeddable":true,"href":"https:\/\/dosen.unila.ac.id\/rasp\/wp-json\/wp\/v2\/comments?post=242"}],"version-history":[{"count":0,"href":"https:\/\/dosen.unila.ac.id\/rasp\/wp-json\/wp\/v2\/posts\/242\/revisions"}],"wp:attachment":[{"href":"https:\/\/dosen.unila.ac.id\/rasp\/wp-json\/wp\/v2\/media?parent=242"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/dosen.unila.ac.id\/rasp\/wp-json\/wp\/v2\/categories?post=242"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/dosen.unila.ac.id\/rasp\/wp-json\/wp\/v2\/tags?post=242"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}