Mumbai University IT Syllabus

Hello sir I recently took admission in B.Sc (IT) at Mumbai University and looking for syllabus of B.Sc (IT) subject but can’t find proper syllabus. Can you please help me in providing the complete syllabus of B.Sc (IT) of Mumbai University?

Hii sir, I Wants to get The Syllabus of the Subject Data Structure of B.tech IT II Year of the Mumbai University ?

[pawan]

The University of Mumbai, informally known as, is one of the earliest state universities in India and the oldest in Maharashtra.

The Syllabus of the Subject Data Structure of B.tech IT II Year of the Mumbai University the Syllabus is given below

Data Structure And Analysis


Introduction - Introduction to advanced data structures: - Introduction/Fundamentals of the analysis of algorithms o Recurrences: The substitution method Recursive tree method Masters method o Probabilistic analysis o Amortized analysis o Randomized algorithms o Mathematical aspects and analysis of algorithm

Advanced Data Structures Introduction- AVL tree- Huffman algorithm- B/B+ tree- 2-3 tree operations- Red-Black Trees- tries- Heap operations- Implementation of priority- queue using heap Topological sort- Analysis of All problems 11 CO1 CO2 CO3 III Divide and Conquer Introduction- Binary search- Finding the minimum and- maximum Merge sort- Quick sort- Strassens matrix multiplication- Analysis of All problems 7 CO2 CO3 IV Introduction-Greedy algorithms Knapsack problem- Job sequencing with deadlines- Minimum cost spanning trees-

Kruskals algorithm o Prims algorithm Optimal storage on tapes- Optimal merge pattern- Subset cover problem- Container loading problem- Analysis of All problems CO5 V Dynamic algorithms And NP-Hard and NPComplete Introduction Dynamic algorithms All pair shortest path- 0/1 knapsack- Travelling salesman problem- Coin Changing Problem- Matrix Chain Multiplication- Flow shop scheduling- Optimal binary search tree- (OBST) Analysis of All problems- Introduction to NP-Hard And- NP-Complete Problems 8 CO2 CO3 CO4 VI String Matching introduction- The nave string matching- algorithm Rabin Karp algorithm- Knuth-Morris-Pratt algorithm- (KMP) Longest common- subsequence(LCS) Analysis of All problems- Genetic algorithms-

The Syllabus of the Subject Data Structure of B.tech IT II Year of the Mumbai University







Contact Details

University of Mumbai
Address: Kolivery Village, University of Mumbai,Vidya Nagari, Kalina, Santacruz East, Mumbai, Maharashtra 400098
Phone: 022 2654 3000