{"id":29278,"date":"2021-08-29T14:32:08","date_gmt":"2021-08-29T14:32:08","guid":{"rendered":"https:\/\/www.inspirenignite.com\/jntuh\/cs721pe-advanced-algorithms-cse-syllabus-for-btech-4th-year-1st-sem-r18-regulation-jntuh-professional-elective-5\/"},"modified":"2021-08-29T14:32:08","modified_gmt":"2021-08-29T14:32:08","slug":"cs721pe-advanced-algorithms-cse-syllabus-for-btech-4th-year-1st-sem-r18-regulation-jntuh-professional-elective-5","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/jntuh\/cs721pe-advanced-algorithms-cse-syllabus-for-btech-4th-year-1st-sem-r18-regulation-jntuh-professional-elective-5\/","title":{"rendered":"CS721PE: Advanced Algorithms CSE Syllabus for B.Tech 4th Year 1st Sem R18 Regulation JNTUH (Professional Elective-5)"},"content":{"rendered":"<p align=\"justify\">Advanced Algorithms detailed syllabus for Computer Science Engineering (CSE), R18 regulation has been taken from the <a class=\"rank-math-link\" href=\"https:\/\/jntuh.ac.in\/syllabus\/\" style=\"color: inherit\" target=\"_blank\" rel=\"noopener\">JNTUHs<\/a> official website and presented for the students of B.Tech Computer Science Engineering branch affiliated to JNTUH course structure. For Course Code, Course Titles, Theory Lectures, Tutorial, Practical\/Drawing, Credits, and other information do visit full semester subjects post given below. The syllabus PDF files can also be downloaded from the universities official website.<\/p>\n<p align=\"justify\">For all the other CSE 4th Year 1st Sem Syllabus for B.Tech R18 Regulation JNTUH scheme, visit <a class=\"rank-math-link\" href=\"..\/cse-4th-year-1st-sem-syllabus-for-btech-r18-regulation-jntuh\">Computer Science Engineering 4th Year 1st Sem R18 Scheme<\/a>. <\/p>\n<p align=\"justify\">For all the (Professional Elective-5) subjects refer to <a class=\"rank-math-link\" href=\"..\/cse-4th-year-1st-sem-professional-elective-5-syllabus-for-btech-r18-regulation-jntuh\">Professional Elective-5 Scheme<\/a>. The detail syllabus for advanced algorithms is as follows.  <\/p>\n<h4>Pre-requisites:<\/h4>\n<ol>\n<li>A course on \u00ef\u00bf\u00bdComputer Programming and Data Structures\u00ef\u00bf\u00bd<\/li>\n<li>A course on \u00ef\u00bf\u00bdAdvanced Data Structures and Algorithms\u00ef\u00bf\u00bd<\/li>\n<\/ol>\n<h4>Course Objective:<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete syllabus, results, class timetable, and many other features kindly download the <a class=\"rank-math-link\" 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 pdfs platform to make students&#8217;s lives easier.<\/b><br \/><a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&amp;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 Outcome:<\/h4>\n<ul>\n<li>Ability to analyze the performance of algorithms<\/li>\n<li>Ability to choose appropriate data structures and algorithm design methods for a specified application<\/li>\n<li>Ability to understand how the choice of data structures and the algorithm design methods impact the performance of programs<\/li>\n<\/ul>\n<h4>Unit &#8211; I<\/h4>\n<p>  Introduction: Role of Algorithms in computing, Order Notation, Recurrences, Probabilistic Analysis and Randomized Algorithms. Sorting and Order Statistics: Heap sort, Quick sort and Sorting in Linear Time. Advanced Design and Analysis Techniques: Dynamic Programming- Matrix chain Multiplication, Longest common Subsequence and optimal binary Search trees.<\/p>\n<h4>Unit &#8211; II<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete syllabus, results, class timetable, and many other features kindly download the <a class=\"rank-math-link\" 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 pdfs platform to make students&#8217;s lives easier.<\/b><br \/><a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&amp;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 &#8211; III<\/h4>\n<p>  Sorting Networks: Comparison Networks, Zero-one principle, bitonic Sorting Networks, Merging Network, Sorting Network. Matrix Operations- Strassens Matrix Multiplication, Inverting matrices, Solving system of linear Equations<\/p>\n<h4>Unit &#8211; IV<\/h4>\n<p>  String Matching: Naive String Matching, Rabin-Karp algorithm, matching with finite Automata, Knuth-Morris &#8211; Pratt algorithm.<\/p>\n<h4>Unit &#8211; V<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete syllabus, results, class timetable, and many other features kindly download the <a class=\"rank-math-link\" 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 pdfs platform to make students&#8217;s lives easier.<\/b><br \/><a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&amp;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>Text Books:<\/h4>\n<ol>\n<li>Introduction to Algorithms, T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Third Edition, PHI.<\/li>\n<\/ol>\n<h4>Reference Books:<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete syllabus, results, class timetable, and many other features kindly download the <a class=\"rank-math-link\" 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 pdfs platform to make students&#8217;s lives easier.<\/b><br \/><a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&amp;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<p align=\"justify\">For detail syllabus of all other subjects of B.Tech Computer Science Engineering 4th Year 1st Sem , visit <a class=\"rank-math-link\" href=\"..\/category\/cse\">CSE 4th Year 1st Sem syllabus<\/a> subjects.<\/p>\n<p align=\"justify\">For B.Tech Computer Science Engineering (CSE) 4th  Year results, visit <a class=\"rank-math-link\" href=\"https:\/\/www.inspirenignite.com\/jntuh\/jntuh-b-tech-results\/\">JNTUH B.Tech Computer Science Engineering semester results<\/a> direct link.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Advanced Algorithms detailed syllabus for Computer Science Engineering (CSE), R18 regulation has been taken from the JNTUHs official website and presented for the students of B.Tech Computer Science Engineering branch [&hellip;]<\/p>\n","protected":false},"author":2344,"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":[2],"tags":[],"class_list":["post-29278","post","type-post","status-publish","format-standard","hentry","category-cse"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/29278","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/users\/2344"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/comments?post=29278"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/29278\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/media?parent=29278"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/categories?post=29278"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/tags?post=29278"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}