2nd Sem, MCA

MCA201: Data Structures Syllabus for MCA 2nd Sem 2016 Pattern Mumbai University

Data Structures detailed Syllabus Scheme for Master of Computer Applications (MCA), 2016 regulation has been taken from the University of Mumbai official website and presented for the MCA 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 all other Mumbai University MCA 2nd Sem Syllabus 2016 Pattern, do visit MCA 2nd Sem 2016 Pattern Scheme. The detailed Syllabus Scheme for data structures is as follows.

MCA201: Data Structures Syllabus for MCA 2nd Sem 2016 Pattern Mumbai University

Data Structures

Prerequisites:

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 pdf platform to make students’s lives easier.
Get it on Google Play.

Course Educational Objectives (CEO):

  1. CEO 1: To teach efficient storage mechanisms of data for an easy access.
  2. CEO 2: To design and implement various basic and advanced data structures.
  3. CEO 3: To introduce various techniques for representation of the data in the real world.

Course Outcomes:

At the end of the course, the students will be able to :

  1. Analyze and compute efficiency of various algorithms.
  2. Effectively choose the data structure that efficiently model the information in a problem
  3. Describe how Linear data structures are represented in memory and used by algorithms and their applications
  4. Identify the benefits of Non-linear Data Structures and their applications

1. Introduction to Data Structures & Algorithms

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 pdf platform to make students’s lives easier.
Get it on Google Play.

2. Sorting and searching algorithms

Bubble sort, Insertion sort, Radix Sort, Quick sort, Merge sort, Heap sort, Selection sort, shell Sort, Linear Search, Sequential search, Binary search 6

3. Hashing

Different Hashing Techniques, Address calculation Techniques, Common hashing functions, Collision resolution techniques: Linear probe, Quadratic probe, Key offset. Rehashing, Double hashing, Link list addressing. 8

4. Linear Data Structures

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 pdf platform to make students’s lives easier.
Get it on Google Play.

5. Non-linear Data Structures

Tree Definition and concepts, General Tree- Definition, Insertion and Deletion into general tree, Binary Tree- Definition, Insertion and Deletion into binary tree, Traversal of a binary tree, Reconstruction of a binary tree from traversal, Conversion of general tree into binary tree, Huffman tree, Expression tree, Binary threaded three Binary Search Tree- Definition, Operation, Implementation AVL tree- Definition, AVL tree rotation with examples, Heaps-Definition, Operations (insertion, delete, build) M way Tree- Introduction, B tree-definition and examples and B* 14

6. Graphs

Definition, Types, Operations, Representation, Networks, Traversals of graph, Minimum spanning tree, Kruskals Algorithm, Prims Algorithm, Warshalls Algorithm,Shortest path algorithm-dijsktras algorithm 6

Reference 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 pdf platform to make students’s lives easier.
Get it on Google Play.

Assessment:

Internal: Assessment consists of two tests (T1 and T2) .The final marks should be the average of the two tests. End Semester Theory Examination: Guidelines for setting up the question paper.

  1. Question paper will comprise of total six questions.
  2. Question Number One should be compulsory.
  3. All question carry equal marks.
  4. Students can attempt any three from the remaining.
  5. Questions will be mixed in nature (for example supposed Q.2 has part a from module 3 then part b will be from any module other than module 3).

In question paper weightage of each module will be proportional to number of respective lecture hours as mention in the syllabus.

For detail syllabus of all other subjects of Master of Computer Applications (MCA), 2016 regulation do visit MCA 2nd Sem Subjects syllabus for 2016 regulation.

Leave a Reply

Your email address will not be published. Required fields are marked *

*

This site uses Akismet to reduce spam. Learn how your comment data is processed.