{"product_id":"9789365211375-1","title":"Algorithms  for BE Anna University R25 CBCS (IV - CSE\/AI\u0026DS\/CSE(Cyber Security)\/CSE(AI\u0026ML) - CS25C12)","description":"\u003cp\u003eSyllabus Algorithms - (CS25C12) Foundations of Algorithm Analysis : Performance analysis-space complexity, time complexity, asymptotic notation - big (O) notation, omega notation, theta notation and    little (o) notation, recurrences, probabilistic analysis. (Chapter - 1) Activities : •\tAssignment o   Time and Space Complexity calculation for a given Logic o   Usage of loops and conditionals and mathematical principles. Divide \u0026amp; Conquer Methods : Merge sort, Long Integer Multiplication, Strassen’s matrix multiplication, Master method, Job Sequencing Problem with Deadlines. (Chapter - 2) Activities : •\tFlipped Class Room : Solving a puzzle. •\tReview of GATE Questions. Greedy Methods and Dynamic Programming : Activity Selection Problem, Huffman Codes and Knapsack fractional. Dynamic Programming Method : Knapsack 0 – 1, Matrix Chain Multiplication, Optimal Binary Search Tree and Longest Common Subsequence. (Chapter - 3) Activities : •\tProject based experiential learning : Creation of treasure hunt. •\tQuiz : State Transition and Recurrence Relations - Space Optimization Technique String Matching and Convex Hull Algorithms : Multithreaded algorithms, Polynomial Multiplication, Fast Fourier Transform, Extended Euclid Algorithm. Naïve’s algorithm, Rabin Karp algorithm - Graham’s Scan and Jarvi’s March method. (Chapter - 4) Activities : •\tAssignment : Rabin Karp algorithm •\tQuiz : Multithreaded and Euclid algorithms.   Solvability And Tractability : The classes P and NP, NP Hard and NP Complete Problems. vertex-cover, travelling-salesman, set-covering, subset-sum Problem - N Queen Problem, Graph Coloring, Hamiltonian Cycle Problem - Assignment Problem, Travelling Salesman and Knapsack Problem. (Chapter - 5) Activities : •\tAssignment : Approximation and randomized Algorithms •\tReview of GATE Questions. Network Flow Algorithms : Flow Networks, Maximum Flows : Ford-Fulkerson, Edmond-Karp, Push relabel Algorithm, Relabel-to-front algorithm, Minimum Cost flows, Cycle Cancelling Algorithm. (Chapter - 6) Activities : •\tFlipped Class Room : Relabel Algorithm •\tReview of GATE Questions.\u003c\/p\u003e","brand":"Technical Publications","offers":[{"title":"Default Title","offer_id":48739225108651,"sku":"13392812164","price":595.0,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0620\/3355\/9723\/files\/9789365211375_1_5ad00f9f-c13c-4327-8593-8824cebea6e4.jpg?v=1795000593","url":"https:\/\/technicalpublications.in\/products\/9789365211375-1","provider":"Technical Publications","version":"1.0","type":"link"}