{"id":1293,"date":"2020-03-10T13:20:53","date_gmt":"2020-03-10T06:20:53","guid":{"rendered":"http:\/\/moenawar.web.id\/?p=1293"},"modified":"2020-03-10T18:13:34","modified_gmt":"2020-03-10T11:13:34","slug":"design-and-analysis-of-algorithm","status":"publish","type":"post","link":"http:\/\/moenawar.web.id\/?p=1293","title":{"rendered":"Design and Analysis of Algorithm"},"content":{"rendered":"

An\u00a0Algorithm\u00a0is a sequence of steps to solve a problem.\u00a0Design and Analysis of Algorithm<\/strong>\u00a0is very important for\u00a0designing algorithm<\/strong>\u00a0to solve different types of problems in the branch of computer science and information technology. <\/p>\n

Why is\u00a0design and analysis of algorithm<\/strong>\u00a0important to\u00a0study<\/strong>?\u00a0Designing algorithm<\/strong>\u00a0is necessary before writing the program code as it (algorithm<\/strong>) explains the logic even before the code is developed. … So\u00a0we design algorithms<\/strong>\u00a0and analyse them for Time complexity, Space complexity, efficiency etc. <\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
No<\/th>\nTopic<\/th>\nLink<\/th>\n<\/tr>\n<\/thead>\n
1. <\/td>\nIntroduction<\/td>\nDAA 00<\/a><\/p>\n

<\/iframe>DAA 01<\/a><\/td>\n<\/tr>\n

2.<\/td>\n Analysis Technique<\/td>\nDAA 02<\/a><\/td>\n<\/tr>\n
3. <\/td>\nBrute Force<\/td>\n<\/td>\n<\/tr>\n
4.<\/td>\n Transform and Conquer<\/td>\n<\/td>\n<\/tr>\n
5. <\/td>\nDivide and Conquer<\/td>\n<\/td>\n<\/tr>\n
6. <\/td>\nGreedy<\/td>\n<\/td>\n<\/tr>\n
7. <\/td>\nDynamic Programming<\/td>\n<\/td>\n<\/tr>\n
8. <\/td>\nDynamic Programming (cont’d)<\/td>\n<\/td>\n<\/tr>\n
9. <\/td>\nBack Tracking<\/td>\n<\/td>\n<\/tr>\n
10. <\/td>\nGraph<\/td>\n<\/td>\n<\/tr>\n
11. <\/td>\nBranch and Bound<\/td>\n<\/td>\n<\/tr>\n
12. <\/td>\nShortest Path<\/td>\n<\/td>\n<\/tr>\n
13. <\/td>\nSpanning Trees<\/td>\n<\/td>\n<\/tr>\n
14.<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
15. <\/td>\n<\/td>\n<\/td>\n<\/tr>\n
16. <\/td>\nReferensi dan RPS<\/td>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

<\/p>\n","protected":false},"excerpt":{"rendered":"

An\u00a0Algorithm\u00a0is a sequence of steps to solve a problem.\u00a0Design and Analysis of Algorithm\u00a0is very important for\u00a0designing algorithm\u00a0to solve different types of problems in the branch of computer science and information…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_bbp_topic_count":0,"_bbp_reply_count":0,"_bbp_total_topic_count":0,"_bbp_total_reply_count":0,"_bbp_voice_count":0,"_bbp_anonymous_reply_count":0,"_bbp_topic_count_hidden":0,"_bbp_reply_count_hidden":0,"_bbp_forum_subforum_count":0},"categories":[17],"tags":[56,55],"views":423,"_links":{"self":[{"href":"http:\/\/moenawar.web.id\/index.php?rest_route=\/wp\/v2\/posts\/1293"}],"collection":[{"href":"http:\/\/moenawar.web.id\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/moenawar.web.id\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/moenawar.web.id\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/moenawar.web.id\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=1293"}],"version-history":[{"count":4,"href":"http:\/\/moenawar.web.id\/index.php?rest_route=\/wp\/v2\/posts\/1293\/revisions"}],"predecessor-version":[{"id":1314,"href":"http:\/\/moenawar.web.id\/index.php?rest_route=\/wp\/v2\/posts\/1293\/revisions\/1314"}],"wp:attachment":[{"href":"http:\/\/moenawar.web.id\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1293"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/moenawar.web.id\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1293"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/moenawar.web.id\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1293"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}