CBCGS [2017 - current]
CBGS [2013 - 2016]
Old [2000 - 2012]
University of Mumbai Semester 3 (SE Second Year) Data Structures Revised Syllabus
University of Mumbai Semester 3 (SE Second Year) Data Structures and their Unit wise marks distribution
Units and Topics
| # | Unit/Topic | Marks |
|---|---|---|
| 100 | Introduction to Data Structure | - |
| 200 | Linear Data Structure | - |
| 300 | Non-linear Data Structure | - |
| 400 | Sorting and Searching | - |
| Total | - |
Syllabus
100 Introduction to Data Structure
- Types of Data Structure, Arrays, Strings, Recursion, ADT (Abstract Data type), Concept of Files, Operations with files, types of files.
200 Linear Data Structure
201 Linked List
- Linked List as an ADT, Linked List Vs.
- Arrays, Memory Allocation & De-allocation for a Linked List, Linked List operations, Types of Linked List, Implementation of Linked List, Application of Linked Listpolynomial, sparse matrix.
202 STACK
- The Stack as an ADT, Stack operation, Array Representation of Stack, Link Representation of Stack, Application of stack – Recursion, Polish Notation
203 Queues
- The Queue as an ADT, Queue operation, Array Representation of Queue, Linked Representation of Queue, Circular Queue, Priority Queue, & Dequeue, Application of Queues – Johnsons Algorithm, Simulation
300 Non-linear Data Structure
301 Trees
- Basic trees concept, Binary tree representation,Binary tree operation, Binary tree traversal, Binary search tree implementation, Thread Binary tree, The Huffman Algorithm, Expression tree, Introduction to Multiway search tree and its creation(AVL, B-tree, B+ tree)
302 Graphs
- Basic concepts, Graph Representation, Graph traversal (DFS & BFS)
400 Sorting and Searching
- Sorting:- Sort Concept, Shell Sort, Radix sort, Insertion Sort, Quick Sort, Merge Sort,Heap Sort
- Searching:- List Search,Linear Index Search, Index Sequential Search Hashed List Search, Hashing Methods, Collision Resolution.
Advertisement Remove all ads
Advertisement Remove all ads
