#1
| |||
| |||
MCA 3rd Sem Syllabus BPUT |
#2
| |||
| |||
Re: MCA 3rd Sem Syllabus BPUT
Biju Patnaik University of Technology (BPUT) was created by an act of the Odisha state legislature in November 2002. It is the state technical university of Odisha. Please find the below attached file for the MCA 3rd Sem Syllabus BPUT: MCA 3rd Sem Syllabus BPUT Syllabus of MCC 301 Analysis And Design Of Algorithms of MCA 3rd semester Module-I (13 hours) Introduction to analysis and design of algorithm, Growth of functions, Asymptotic notations, Recurrences, Solution of recurrences by substitution, Recurrence tree and the master method. Divide and conquer algorithms (Worst case analysis of merge sort, quick sort and heap sort algorithms), Priority queue, Data structure for disjoint sets (Disjoint set operations, linked list representation, disjoint set forests) Module-II (13 hours) Dynamic programming approach: Matrix chain multiplication, longest common subsequence. Greedy method: Activity solution problem, Greedy verses dynamic programming, Huffman codes. Concept of backtracking, branch & bound design techniques. Graph algorithms: Minimal spanning tree (Kruskal and Prims algorithms), Single source shortest paths (Bellman-Ford and Dijkstras algorithm), Floyds algorithm. Module-III (10 hours) Flow Network, Ford-Fulkerson method, Fast Fourier Transform, Rabin-Karp string matching algorithm. NP-Completeness, Polynomial time solvability, Verification and Reducibility, NP complete problems (without proof), Approximation algorithm for the traveling salesman problem. Contact: Biju Patnaik University of Technology (BPUT) Chhend Colony, Rourkela, Odisha-769004, Phone : (0661) 2482556, Fax : (0661) 2482562, Email: students[at]bput[dot]ac[dot]in (for Students Enquiry), Email: bput@bput[dot]ac[dot]in (for Colleges Communication) |
|