{"id":17319,"date":"2020-09-09T10:44:33","date_gmt":"2020-09-09T10:44:33","guid":{"rendered":"https:\/\/www.inspirenignite.com\/mh\/eel507-design-and-analysis-of-algorithms-syllabus-for-ee-5th-sem-2018-19-dbatu-elective-v\/"},"modified":"2020-09-09T10:44:33","modified_gmt":"2020-09-09T10:44:33","slug":"eel507-design-and-analysis-of-algorithms-syllabus-for-ee-5th-sem-2018-19-dbatu-elective-v","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/mh\/eel507-design-and-analysis-of-algorithms-syllabus-for-ee-5th-sem-2018-19-dbatu-elective-v\/","title":{"rendered":"EEL507: Design and Analysis of Algorithms Syllabus for EE 5th Sem 2018-19 DBATU (Elective-V)"},"content":{"rendered":"

Design and Analysis of Algorithms detailed syllabus scheme for Electrical Engineering (EE), 2018-19 onwards has been taken from the DBATU<\/a> official website and presented for the Bachelor of Technology students. For Subject Code, Course Title, Lecutres, Tutorials, Practice, Credits, and other information, do visit full semester subjects post given below. <\/p>\n

For 5th Sem Scheme of Electrical Engineering (EE), 2018-19 Onwards, do visit EE 5th Sem Scheme, 2018-19 Onwards<\/a>. For the Elective-V scheme of 5th Sem 2018-19 onwards, refer to EE 5th Sem Elective-V Scheme 2018-19 Onwards<\/a>. The detail syllabus for design and analysis of algorithms is as follows.<\/p>\n

Design and Analysis of Algorithms Syllabus for Electrical Engineering (EE) 3rd Year 5th Sem 2018-19 DBATU<\/h2>\n

Design and Analysis of Algorithms<\/title><\/p>\n<h4>Pre-requisite:<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete syllabus, results, class timetable, and many other features kindly download the <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">iStudy App<\/a><br \/><b> It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.<\/b><br \/><a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&pcampaignid=pcampaignidMKT-Other-global-all-co-prtnr-py-PartBadge-Mar2515-1\" target=\"_blank\" rel=\"noopener\"><img decoding=\"async\" src=\"https:\/\/play.google.com\/intl\/en_us\/badges\/static\/images\/badges\/en_badge_web_generic.png\" alt=\"Get it on Google Play\" style=\"height:65px\"><\/a>. <\/p>\n<h4>Course Outcomes:<\/h4>\n<ul>\n<li>To know fundamental characteristic of an algorithm<\/li>\n<li>To understand strategy of algorithm formation, To develop different algorithm.<\/li>\n<\/ul>\n<h4>Unit 1<\/h4>\n<p> Introduction- Fundamental characteristics of an algorithm. Basic algorithm analysis -Asymptotic analysis of complexity bounds – best, average and worst-case behaviour, standard notations for expressing algorithmic complexity. Empirical measurements of performance, time and space trade-offs in algorithms. Using recurrence relations to analyze recursive algorithms – illustrations using recursive algorithms.<\/p>\n<h4>Unit 2<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete syllabus, results, class timetable, and many other features kindly download the <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">iStudy App<\/a><br \/><b> It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.<\/b><br \/><a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&pcampaignid=pcampaignidMKT-Other-global-all-co-prtnr-py-PartBadge-Mar2515-1\" target=\"_blank\" rel=\"noopener\"><img decoding=\"async\" src=\"https:\/\/play.google.com\/intl\/en_us\/badges\/static\/images\/badges\/en_badge_web_generic.png\" alt=\"Get it on Google Play\" style=\"height:65px\"><\/a>. <\/p>\n<h4>Unit 3<\/h4>\n<p> Graph and Tree Algorithms: Depth- and Breadth- First traversals. Shortest path algorithms, Transitive closure, Minimum Spanning Tree, Topological sort, Network Flow problems<\/p>\n<h4>Unit 4<\/h4>\n<p> Tractable and Intractable Problems: Computability.The Halting problem. Computability classes – P, NP, NP-complete and NP-hard. Cook”s theorem. Standard NP-complete problems Reduction techniques.<\/p>\n<h4>Unit 5<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete syllabus, results, class timetable, and many other features kindly download the <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">iStudy App<\/a><br \/><b> It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.<\/b><br \/><a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&pcampaignid=pcampaignidMKT-Other-global-all-co-prtnr-py-PartBadge-Mar2515-1\" target=\"_blank\" rel=\"noopener\"><img decoding=\"async\" src=\"https:\/\/play.google.com\/intl\/en_us\/badges\/static\/images\/badges\/en_badge_web_generic.png\" alt=\"Get it on Google Play\" style=\"height:65px\"><\/a>. <\/p>\n<h4>Unit 6<\/h4>\n<h4>Reference Book:<\/h4>\n<p> :<\/p>\n<ol>\n<li>Algorithm Design – Jon Kleinberg and Eva Tardos<\/li>\n<li>Introduction to Algorithms – T.H. Corman et. al.<\/li>\n<li>Fundamentals of Algorithms – E. Horowitz et al.<\/li>\n<li>Combinatorial Optimization: Algorithms and Complexity – C.H. Papadimitriou et al<\/li>\n<\/ol>\n<p align=\"justify\">For detail syllabus of all subjects of Electrical Engineering (EE) 5th Sem 2018-19 onwards, visit <a href=\"..\/category\/dbatu\/5th-sem-dbatu\">EE 5th Sem Subjects <\/a>of 2018-19 Onwards.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Design and Analysis of Algorithms detailed syllabus scheme for Electrical Engineering (EE), 2018-19 onwards has been taken from the DBATU official website and presented for the Bachelor of Technology students. […]<\/p>\n","protected":false},"author":2351,"featured_media":0,"comment_status":"open","ping_status":"open","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,"footnotes":""},"categories":[106],"tags":[],"class_list":["post-17319","post","type-post","status-publish","format-standard","hentry","category-ee-dbatu"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/posts\/17319","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/users\/2351"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/comments?post=17319"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/posts\/17319\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/media?parent=17319"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/categories?post=17319"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/tags?post=17319"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}