{"id":1348,"date":"2016-06-15T20:07:06","date_gmt":"2016-06-15T20:07:06","guid":{"rendered":"http:\/\/www.inspirenignite.com\/jntuh\/?p=1348"},"modified":"2021-10-27T20:20:44","modified_gmt":"2021-10-27T20:20:44","slug":"jntuh-b-tech-2nd-year-2-sem-computer-science-and-engineering-r13-2-2-design-and-analysis-of-algorithms-r13-syllabus","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/jntuh\/jntuh-b-tech-2nd-year-2-sem-computer-science-and-engineering-r13-2-2-design-and-analysis-of-algorithms-r13-syllabus\/","title":{"rendered":"JNTUH B.Tech 2nd Year 2 sem Computer Science and Engineering R13 (2-2) Design and Analysis of Algorithms R13 syllabus."},"content":{"rendered":"<p>JNTUH B.Tech 2nd year (2-2) Design and Analysis of Algorithms gives you detail information of Design and Analysis of Algorithms R13 syllabus It will be help full to understand you complete curriculum of the year.<\/p>\n<p><strong>Objectives<\/strong><\/p>\n<ul>\n<li>To analyze performance of algorithms.<\/li>\n<li>To choose the appropriate data structure and algorithm design method for a specified application.<\/li>\n<li>To understand how the choice of data structures and algorithm design methods impacts the performance of programs.<\/li>\n<li>To solve problems using algorithm design methods such as the greedy method, divide and conquer, dynamic programming, backtracking and branch and bound.<\/li>\n<li>Prerequisites (Subjects) Data structures, Mathematical foundations of computer science.<\/li>\n<\/ul>\n<p><strong>UNIT I<\/strong><\/p>\n<p><strong>Introduction<\/strong>: Algorithm, Psuedo code for expressing algorithms, Performance Analysis-Space complexity, Time complexity, Asymptotic Notation- Big oh notation, Omega notation, Theta notation and Little oh notation, Probabilistic analysis, Amortized analysis.<\/p>\n<p><strong>Divide and conquer<\/strong>: General method , applications-Binary search, Quick sort, Merge sort, Strassen\u2019s matrix multiplication.<\/p>\n<p><strong>UNIT II<\/strong><\/p>\n<p><strong>Searching and Traversal Techniques<\/strong>: Efficient non &#8211; recursive binary tree traversal algorithm, Disjoint set operations, union and find algorithms, Spanning trees, Graph traversals &#8211; Breadth first search and Depth first search, AND \/ OR graphs, game trees, Connected Components, Bi &#8211; connected components. Disjoint Sets- disjoint set operations, union and find algorithms, spanning trees, connected components and biconnected components.<\/p>\n<p><strong>UNIT III<\/strong><\/p>\n<p><strong>Greedy method:<\/strong> General method, applications &#8211; Job sequencing with dead lines, 0\/1 knapsack problem, Minimum cost spanning trees, Single source shortest path problem.<\/p>\n<p><strong>Dynamic Programming<\/strong>: General method, applications-Matrix chain multiplication, Optimal binary search trees, 0\/1 knapsack problem, All pairs shortest path problem,Travelling sales person problem, Reliability design.<\/p>\n<p style=\"text-align: center\"><strong><a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\"><span style=\"color: #ff0000\">Download iStudy Android App for complete JNTUH syllabus, results, timetables and all other updates. There are no ads and no pdfs and will make your life way easier<\/span>.<\/a><\/strong><\/p>\n<p><strong>TEXT BOOKS<\/strong><\/p>\n<ul>\n<li>Fundamentals of Computer Algorithms, Ellis Horowitz,Satraj Sahni and Rajasekharam,Galgotia publications pvt. Ltd.<\/li>\n<li>Foundations of Algorithm, 4th edition, R. Neapolitan and K. Naimipour, Jones and Bartlett Learning.<\/li>\n<li>Design and Analysis of Algorithms, P. H. Dave, H. B. Dave, Pearson Education, 2008.<\/li>\n<\/ul>\n<p><strong>REFERENCES<\/strong><\/p>\n<ul>\n<li>Computer Algorithms, Introduction to Design and Analysis, 3rd Edition, Sara Baase, Allen, Van, Gelder, Pearson Education.<\/li>\n<li>Algorithm Design: Foundations, Analysis and Internet examples, M. T. Goodrich and R. Tomassia, John Wiley and sons.<\/li>\n<li>Fundamentals of Sequential and Parallel Algorithm, K. A. Berman and J. L. Paul, Cengage Learning.<\/li>\n<li>Introducation to the Design and Analysis of Algorithms, A. Levitin, Pearson Education.<\/li>\n<li>Introducation to Algorithms, 3rd Edition, T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, PHI Pvt. Ltd.<\/li>\n<li>Design and Analysis of algorithm, Aho, Ullman and Hopcroft, Pearson Education, 2004.<\/li>\n<\/ul>\n<p><strong>Outcomes<\/strong><\/p>\n<ul>\n<li>\u200bBe able to analyze algorithms and improve the efficiency of algorithms.<\/li>\n<li>Apply different designing methods for development of algorithms to realistic problems, such as divide and conquer,<\/li>\n<li>greedy and etc. Ability to understand and estimate the performance of algorithm.<\/li>\n<\/ul>\n<p><strong>For more information about all JNTU updates please stay connected to us on FB and don\u2019t hesitate to ask any questions in the comment.<\/strong><\/p>\n","protected":false},"excerpt":{"rendered":"<p>JNTUH B.Tech 2nd year (2-2) Design and Analysis of Algorithms gives you detail information of Design and Analysis of Algorithms R13 syllabus It will be help full to understand you [&hellip;]<\/p>\n","protected":false},"author":2259,"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":[153,121,2,62],"tags":[],"class_list":["post-1348","post","type-post","status-publish","format-standard","hentry","category-2nd-sem-2","category-2nd-year","category-cse","category-syllabus"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/1348","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\/2259"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/comments?post=1348"}],"version-history":[{"count":3,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/1348\/revisions"}],"predecessor-version":[{"id":17227,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/1348\/revisions\/17227"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/media?parent=1348"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/categories?post=1348"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/tags?post=1348"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}