{"id":24635,"date":"2020-07-20T07:39:51","date_gmt":"2020-07-20T07:39:51","guid":{"rendered":"https:\/\/www.inspirenignite.com\/jntuh\/advanced-data-structures-and-algorithms-syllabus-for-mca-2nd-year-1st-sem-r19-regulation-jntuh\/"},"modified":"2020-07-20T07:39:51","modified_gmt":"2020-07-20T07:39:51","slug":"advanced-data-structures-and-algorithms-syllabus-for-mca-2nd-year-1st-sem-r19-regulation-jntuh","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/jntuh\/advanced-data-structures-and-algorithms-syllabus-for-mca-2nd-year-1st-sem-r19-regulation-jntuh\/","title":{"rendered":"Advanced Data Structures and Algorithms Syllabus for MCA 2nd Year 1st Sem R19 Regulation JNTUH"},"content":{"rendered":"

Advanced Data Structures and Algorithms detailed Syllabus for Master of Computer Applications(MCA), R19 regulation has been taken from the JNTUH<\/a> official website and presented for the students affiliated to JNTUH course structure. For Course Code, Subject Names, 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

For all other MCA 2nd Year 1st Sem Syllabus for R19 Regulation JNTUH, do visit MCA 2nd Year 1st Sem Syllabus for R19 Regulation JNTUH <\/a>Subjects. The detailed Syllabus for advanced data structures and algorithms is as follows. <\/p>\n

Pre-requisite:<\/h4>\n

For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App<\/a>
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.<\/b>
\"Get<\/a>. <\/p>\n

Course Objectives:<\/h4>\n
    \n
  1. Introduces the notations for analysis of the performance of algorithms<\/li>\n
  2. Introduces a variety of data structures such as hash tables, disjoint sets and Priority Queue<\/li>\n
  3. Describes major algorithmic techniques (divide-and-conquer, backtracking, dynamic programming and greedy) and mention problems for which each technique is appropriate;<\/li>\n
  4. Introduces sorting, searching and pattern matching algorithms<\/li>\n<\/ol>\n

    Course Outcomes:<\/h4>\n
      \n
    1. Ability to analyze the performance of algorithms<\/li>\n
    2. Ability to select the data structures that efficiently model the information in a problem<\/li>\n
    3. Ability to choose appropriate data structures and algorithm design methods for a specified application<\/li>\n
    4. Ability to understand how the choice of data structures and the algorithm design methods impact the performance of programs<\/li>\n
    5. Design programs using a variety of data structures, including hash tables, disjoint sets, trees and graphs<\/li>\n
    6. Implement and know the application of algorithms for sorting and pattern matching<\/li>\n<\/ol>\n

      Unit I<\/h4>\n

      For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App<\/a>
      It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.<\/b>
      \"Get<\/a>. <\/p>\n

      Unit II<\/h4>\n

      Disjoint Sets: Disjoint set operations – union and find algorithms Greedy method: General method, applications-Job sequencing with deadlines, knapsack problem, Minimum cost spanning trees Priority Queues – Definition, Realizing a Priority Queue using Heaps, operations of priority queue<\/p>\n

      Unit III<\/h4>\n

      Dynamic Programming: General method, applications- Optimal binary search trees, 0\/1 knapsack problem, Travelling sales person problem, Reliability design. Backtracking: General method, applications-n-queens problem, sum of subsets problem.<\/p>\n

      Unit IV<\/h4>\n

      For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App<\/a>
      It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.<\/b>
      \"Get<\/a>. <\/p>\n

      Unit V<\/h4>\n

      Trees: Definition, Types of trees, Binary Trees, Binary Tree Traversal Methods, Binary search tree, AVL tree and B-Tree operations-insertion,deletion and searching Graphs: Definition, Representation of graphs, Graphs Traversal Methods.<\/p>\n

      Text Books:<\/h4>\n
        \n
      1. Fundamentals of Computer Algorithms, Ellis Horowitz, Satraj Sahni and Rajasekharam, Universities Press.<\/li>\n
      2. Fundamentals of Data Structures, Ellis Horowitz, Satraj Sahni and Rajasekharam, Universities Press.<\/li>\n<\/ol>\n

        Reference Books:<\/h4>\n

        For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App<\/a>
        It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.<\/b>
        \"Get<\/a>.<\/p>\n

        For detail Syllabus of all other subjects of Master of Computer Applications 2nd Year, visit MCA 2nd Year Syllabus<\/a> Subjects.<\/p>\n

        For all MCA results, visit JNTUH MCA all years, and semester results <\/a>from direct links.<\/p>\n","protected":false},"excerpt":{"rendered":"

        Advanced Data Structures and Algorithms detailed Syllabus for Master of Computer Applications(MCA), R19 regulation has been taken from the JNTUH official website and presented for the students affiliated to JNTUH […]<\/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":[121,130],"tags":[],"class_list":["post-24635","post","type-post","status-publish","format-standard","hentry","category-2nd-year","category-mca"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/24635","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=24635"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/24635\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/media?parent=24635"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/categories?post=24635"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/tags?post=24635"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}