Implementation of common sorting algorithms – insertion sort, selection sort, quick sort, merge sort, bucket sort, radix sort. Greedy – task scheduling, fractional knapsack and other applications. Divide and Conquer – Closest Pair, Integer multiplication, other applications. Dynamic Programming – matrix chain multiplication, 0-1 knapsack, longest common subsequence, maximum contiguous subarray, edit distance. Graphs- minimum spanning tree algorithms, shortest path algorithms. String matching – KMP, Boyer Moore.
Programs
View all programsFrom the news
- Amrita Vishwa Vidyapeetham Hosts International Conference on Emerging Cryptography and Network Security Threats
- WE Project Store – March 2026 Monthly Report
Others
- Surfactant assisted tuning of electrical conductivity, electromagnetic interference shielding effectiveness, wetting properties of poly(lactic acid)-expanded graphite-magnetite nanocube hybrid bio-nanocomposites
- Unravelling the role of poly(methyl methacrylate) (PMMA) molecular weight in poly(vinylidene fluoride) (PVDF)/PMMA/expanded graphite (ExGr) blend nanocomposites: Insights into morphology, thermal behavior, electrical conductivity, and wetting property