{"id":10446,"date":"2020-02-21T16:23:23","date_gmt":"2020-02-21T16:23:23","guid":{"rendered":"https:\/\/www.inspirenignite.com\/vtu\/15cs56p-design-and-analysis-of-algorithms-lab-computers-5th-sem-syllabus-for-diploma-dte-karnataka-c15-scheme\/"},"modified":"2020-02-21T16:23:23","modified_gmt":"2020-02-21T16:23:23","slug":"15cs56p-design-and-analysis-of-algorithms-lab-computers-5th-sem-syllabus-for-diploma-dte-karnataka-c15-scheme","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/vtu\/15cs56p-design-and-analysis-of-algorithms-lab-computers-5th-sem-syllabus-for-diploma-dte-karnataka-c15-scheme\/","title":{"rendered":"15CS56P: Design and Analysis of Algorithms Lab Computers 5th Sem Syllabus for Diploma DTE Karnataka C15 Scheme"},"content":{"rendered":"

Design and Analysis of Algorithms Lab detail DTE Kar Diploma syllabus for Computer Science And Engineering (CS), C15 scheme is extracted from DTE Karnataka<\/a> official website and presented for diploma students. The course code (15CS56P), and for exam duration, Teaching Hr\/week, Practical Hr\/week, Total Marks, internal marks, theory marks, duration and credits do visit complete sem subjects post given below. The syllabus PDFs can be downloaded from official website.<\/p>\n

For all other computers 5th sem syllabus for diploma c15 scheme dte karnataka you can visit Computers 5th Sem Syllabus for Diploma C15 Scheme DTE Karnataka Subjects<\/a>. The detail syllabus for design and analysis of algorithms lab is as follows.<\/p>\n

Pre-requisites:<\/h4>\n

Knowledge of Data Structures.\n<\/p>\n

Course Objectives:<\/h4>\n
    \n
  1. Write sorting programs using Divide-and-Conquer techniques.<\/li>\n
  2. Implement to find the minimum cost spanning tree and shortest path using different Greedy techniques.<\/li>\n
  3. Construct DFS, BFS programs and topological ordering using Decrease-and-Conquer technique.<\/li>\n
  4. Implement knapsack, travelling salesperson<\/li>\n<\/ol>\n

    Course Outcomes:<\/h4>\n

    For complete syllabus and results, class timetable and more pls download iStudy Syllabus App<\/a>.<\/b> Its a light weight, easy to use, no images, no pdfs platform to make students life easier.<\/p>\n

    List of Graded Practical Exercises<\/h4>\n
      \n
    1. Sort a given set of elements using the Quick sort method and determine the time required to sort the elements. Repeat the experiment for different values of n<\/li>\n
    2. Sort a given set of elements using merge sort method and determine the time required to sort the elements. Repeat the experiment for different of values of n<\/li>\n
    3. Write a program to obtain the topological ordering of vertices in a given digraph.<\/li>\n
    4. Implement travelling salesman problem.<\/li>\n
    5. Implement the knapsack problem (0\/1).<\/li>\n
    6. Print all the nodes reachable from a given starting node in a digraph using BFS method.<\/li>\n
    7. Check whether a given graph is connected or not using DFS method.<\/li>\n
    8. Write a program to implement binary search using divide and conquer technique<\/li>\n
    9. Write a program to implement insertion sort using decrease and conquer technique<\/li>\n
    10. Find minimum cost spanning tree of a given undirected path using a Prim’s algorithm.<\/li>\n
    11. From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijkstra’s algorithm.<\/li>\n<\/ol>\n

      Note: Use any programming tools like C\/Java\/Python to execute the above exercises.<\/i>\n<\/p>\n

      Reference Books:<\/h4>\n
        \n
      1. Introduction to the Design and Analysis of Algorithms ,3rd edition, Anany Levitin, Pearson Publication, ISBN: 9789332583771<\/li>\n<\/ol>\n

        Suggested List of Student Activities:<\/h4>\n

        For complete syllabus and results, class timetable and more pls download iStudy Syllabus App<\/a>.<\/b> Its a light weight, easy to use, no images, no pdfs platform to make students life easier.<\/p>\n

        Course Delivery:<\/h4>\n

        The course will be delivered through Demonstration and Practices\n<\/p>\n

        Scheme of Valuation for End Examination<\/h4>\n
          \n
        1. Record\t05<\/li>\n
        2. Writing two programs\t20<\/li>\n
        3. Execution of any one program\t15<\/li>\n
        4. Viva Voce\t10<\/li>\n<\/ol>\n

          **Evaluation should be based on the screen output only. No hard copy required.<\/i>\n<\/p>\n

          **Change of question is allowed only once. Marks of 05 should be deducted in the given question.<\/i>\n<\/p>\n

          Resource requirements for Design and Analysis of Algorithms Lab (For an Intake of 60 Students [3 Batches])<\/h4>\n

          For complete syllabus and results, class timetable and more pls download iStudy Syllabus App<\/a>.<\/b> Its a light weight, easy to use, no images, no pdfs platform to make students life easier.<\/p>\n

          For detail syllabus of all other subjects of BE Computers, C15 scheme do visit Computers 5th Sem syllabus for C15 scheme<\/a>.<\/p>\n

          Dont forget to download iStudy Syllabus App<\/a> for latest syllabus and results, class timetable and more.<\/p>\n","protected":false},"excerpt":{"rendered":"

          Design and Analysis of Algorithms Lab detail DTE Kar Diploma syllabus for Computer Science And Engineering (CS), C15 scheme is extracted from DTE Karnataka official website and presented for diploma […]<\/p>\n","protected":false},"author":2298,"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":[18,62],"tags":[],"class_list":["post-10446","post","type-post","status-publish","format-standard","hentry","category-5th-sem","category-cs-diploma"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/vtu\/wp-json\/wp\/v2\/posts\/10446","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.inspirenignite.com\/vtu\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.inspirenignite.com\/vtu\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/vtu\/wp-json\/wp\/v2\/users\/2298"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/vtu\/wp-json\/wp\/v2\/comments?post=10446"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/vtu\/wp-json\/wp\/v2\/posts\/10446\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/vtu\/wp-json\/wp\/v2\/media?parent=10446"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/vtu\/wp-json\/wp\/v2\/categories?post=10446"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/vtu\/wp-json\/wp\/v2\/tags?post=10446"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}