CSC305: Data Structures Syllabus for CS 3rd Sem 2017 Pattern Mumbai University

Data Structures detailed syllabus scheme for Computer Engineering (CS), 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 Computer Engineering 3rd Sem Syllabus 2017 Pattern, do visit CS 3rd Sem 2017 Pattern Scheme. The detailed syllabus scheme for data structures is as follows.

Data Structures Syllabus for Computer Engineering 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:

1. Students will be able to implement various linear and nonlinear data structures.
2. Students will be able to handle operations like insertion, deletion, searching and traversing on various data structures.
3. Students will be able to select appropriate sorting technique for given problem.
4. Students will be able to select appropriate searching technique for given problem.
5. Students will be able to apply the learned concepts in various domains like DBMS and Compiler Construction.
6. Students will be able to choose appropriate data structure for specified problem domain.

Prerequisites:

C Programming

Module 1

Introduction to Data Structures 03 Introduction, Types of Data Structures – Linear and Nonlinear, Operations on Data Structures, Concept of ADT, Arrays.

Module 2

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 3

Linked List 10 Introduction, Representation of Linked List, Linked List v/s Array, Implementation of Linked List, Linked Implementation of Stack and Queue, Circular Linked List, Doubly Linked List, Application -Polynomial Representation and Addition.

Module 4

Trees 12 Introduction, Tree Terminologies, Binary Tree, Representation, Types of Binary Tree, Binary Tree Traversals, Binary Search Tree, Implementation of Binary Search Tree, Applications – Expression Tree, Huffman Encoding. Search Trees – AVL, B Tree, B+ Tree, Splay Tree and Trie.

Module 5

Graphs 06 Introduction, Graph Terminologies, Representation, Graph Traversals -Depth First Search (DFS) and Breadth First Search (BFS), Application -Topological Sorting

Module 6

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, Reema Thareja, Oxford
2. Data Structures using C and C++, Rajesh K Shukla, Wiley – India
3. Data Structures Using C, Aaron M Tenenbaum, Yedidyah Langsam, Moshe J Augenstein, Pearson
4. Data Structures: A Pseudocode Approach with C, Richard F. Gilberg & Behrouz A., Forouzan, Second Edition, CENGAGE Learning
5. Introduction to Data Structure and Its Applications, JeanPaul Tremblay, P. G. Sorenson

Reference Books:

1. C & Data Structures, Prof. P.S. Deshpande, Prof. O.G. Kakde, DreamTech press.
2. Data Structure Using C, Balagurusamy.
3. Data Structures Using C, ISRD Group, Second Edition, Tata McGraw-Hill.
4. Data Structures, Adapted by: GAV PAI, Schaums Outlines.

Internal Assessment Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when approx. 40% syllabus is completed and second class test when additional 40% syllabus is completed. Duration of each test shall be one hour. End Semester Theory Examination:

1. Question paper will comprise of 6 questions, each carrying 20 marks.
2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules

For detail syllabus of all other subjects of Computer Engineering (CS) 3rd Sem 2017 regulation, visit CS 3rd Sem Subjects syllabus for 2017 regulation.