Advanced Data Structures & Analysis of Algorithms detailed syllabus scheme for Information Technology (IT), 2018 regulation has been taken from the MU official website and presented for the Bachelor of Engineering students. For Course Code, Course Title, Test 1, Test 2, Avg, End Sem Exam, Team Work, Practical, Oral, Total, and other information, do visit full semester subjects post given below.
For 5th Sem Scheme of Information Technology (IT), 2018 Pattern, do visit IT 5th Sem Scheme, 2018 Pattern. For the Department Level Optional Course-1 scheme of 5th Sem 2018 regulation, refer to IT 5th Sem Department Level Optional Course-1 Scheme 2018 Pattern. The detail syllabus for advanced data structures & analysis of algorithms is as follows.
Advanced Data Structures & Analysis of Algorithms Syllabus for Information Technology TE 5th Sem 2018 Pattern Mumbai University
Course Objectives:
For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.
.
Course Outcomes:
- Students will be able to choose appropriate advanced data structure for given problem.
- Students will be able to calculate complexity.
- Students will be able to select appropriate design techniques to solve real world problems.
- Students will able to apply the dynamic programming technique to solve the problems.
- Students will be able to apply the greedy programming technique to solve the problems.
- Students will be able to select a proper pattern matching algorithm for given problem.
Prerequisites:
Knowledge Any Programming Language, Data structures and Analysis
Module I
For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier..
Module II
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
Module 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
Module IV
For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier..
Module V
Dynamic algorithms And NP-Hard and NP- Complete 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
Module VI
String Matching
- introduction
- The naive string matching algorithm
- Rabin Karp algorithm
- Knuth-Morris-Pratt algorithm (KMP)
- Longest common subsequence(LCS)
- Analysis of All problems
- Genetic algorithms 6 CO2 CO3 CO6
Text Books:
For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier..
Reference Books:
- Data Structures and Algorithms in C++, Goodritch, Tamassia, Mount, WILEY.
- Data Structures using C, Reema Thareja, OXFORD.
- Data Structures and Algorithm Analysis in C, Mark A. Weiss, Pearson.
Assessment:
Internal Assessment for 20 marks: Consisting of Two Compulsory Class Tests Approximately 40% to 50% of syllabus content must be covered in First test and remaining 40% to 50% of syllabus contents must be covered in second test. End Semester Theory Examination: Some guidelines for setting the question papers are as:
- Weightage of each module in end semester examination is expected to be/will be proportional to number of respective lecture hours mentioned in the syllabus.
- Question paper will comprise of total six questions, each carrying 20 marks.
- Q.1 will be compulsory and should cover maximum contents of the syllabus.
- Remaining question will be mixed in nature (for example if Q.2 has part
- from module 3 then part
- will be from any other module. (Randomly selected from all the modules)
- Total four questions need to be solved.
For detail Syllabus of all subjects of Information Technology (IT) 5th Sem 2018 regulation, visit IT 5th Sem Subjects of 2018 Pattern.