ITC303: Data Structures & Analysis Syllabus for IT 3rd Sem 2017 Pattern Mumbai University

Data Structures & Analysis detailed syllabus scheme for Information Technology (IT), 2017 regulation has been taken from the University of Mumbai 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 all other Mumbai University Information Technology 3rd Sem Syllabus 2017 Pattern, do visit IT 3rd Sem 2017 Pattern Scheme. The detailed syllabus scheme for data structures & analysis is as follows.

Data Structures & Analysis Syllabus for Information Technology SE 3rd Sem 2017 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 pdf platform to make students’s lives easier.
.

Course Outcomes:

Students will be able to:

1. Select appropriate data structures as applied to specified problem definition.
2. Implement operations like searching, insertion, and deletion, traversing mechanism etc. on various data structures.
3. Students will be able to implement Linear and Non-Linear data structures.
4. Implement appropriate sorting/searching technique for given problem.
5. Design advance data structure using Non-Linear data structure.
6. Determine and analyze the complexity of given Algorithms.

Prerequisites:

C Programming Language

Module I

Introduction to Data structures, Need of Data structures, Types of Introduction to Data structures and Analysis Data structures : Linear and non linear data structures Arrays, Stacks, Queue, Linked list and Tree, Graph, Recursion, ADT (Abstract Data type). Introduction to Analysis, Algorithms, characteristics of an algorithms, Time and Space complexities, Order of growth functions, Asymptotic notations CO2 CO3 CO6

Module II

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.
.

Module III

Queue Introduction to Queue, Queue as ADT, Operations on Queue, Linear representation of queue, Circular Queue, Priority Queue, De-queue, Application of Queues 06 CO1 CO2 CO3 CO6

Module IV

Linked list Introduction to Linked List, Basic concept of Linked List, Memory allocation & de allocation of Linked list, Singly Linked list, Doubly Linked list, Circular linked list, Operations on linked list, Linked representation of stack, Linked representation of Queue, Application of linked list. 08 CO1 CO2 CO3 CO6

Module V

Sorting and Searching Introduction to Sorting: Bubble Sort, Selection Sort, Insertion Sort, Quick Sort, Merge Sort, Heap Sort, Shell Sort, Radix sort. Analysis of Sorting Techniques. Comparison of sorting Techniques Introduction to Searching: Linear 12 CO4 CO5 CO6 search, Binary search, Hashing Techniques, Different Hash functions, Collision& Collision resolution techniques, Analysis of searching Techniques. Introduction to Trees, Definitions& Tree terminologies, Binary tree representation, Operations on binary tree, Traversal of binary trees, Binary search tree, Threaded Binary tree, Expression tree, Application of Trees CO1 CO2

Module VI

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.
.

Text Books:

1. Data structures using C by Tenenbaum, Langsam, Augenstein , Pearson.
2. Data Structures using C, ReemaThareja, Oxford.
3. C and Data structures, Prof. P.S.Deshpande, Prof. O.G.Kakde, Dreamtech Press.
4. Introduction to Data Structure and its Applications Jean-Paul Tremblay, P. G. Sorenson

Reference Books:

1. Data Structures Using C & C++, Rajesh K. Shukla, Wiley- India.
2. Data Structures and Algorithm Analysis in C ,Mark A.Weiss ,Pearson
3. ALGORITHMS Design and Analysis, Bhasin, OXFORD.
4. Computer Algorithms by Ellis Horowitz and Sartaj Sahni, Universities Press.

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
1. from module 3 then part
2. will be from any other module. (Randomly selected from all the modules)
• Total four questions need to be solved.

For detail syllabus of all other subjects of Information Technology (IT) 3rd Sem 2017 regulation, visit IT 3rd Sem Subjects syllabus for 2017 regulation.