Advertisement Remove all ads

Data Structures Semester 3 (SE Second Year) BE Computer Engineering University of Mumbai Topics and Syllabus

Advertisement Remove all ads

University of Mumbai Syllabus For Semester 3 (SE Second Year) Data Structures: Knowing the Syllabus is very important for the students of Semester 3 (SE Second Year). Shaalaa has also provided a list of topics that every student needs to understand.

The University of Mumbai Semester 3 (SE Second Year) Data Structures syllabus for the academic year 2021-2022 is based on the Board's guidelines. Students should read the Semester 3 (SE Second Year) Data Structures Syllabus to learn about the subject's subjects and subtopics.

Students will discover the unit names, chapters under each unit, and subtopics under each chapter in the University of Mumbai Semester 3 (SE Second Year) Data Structures Syllabus pdf 2021-2022. They will also receive a complete practical syllabus for Semester 3 (SE Second Year) Data Structures in addition to this.

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

University of Mumbai Semester 3 (SE Second Year) Data Structures Course Structure 2021-2022 With Marking Scheme

Advertisement Remove all ads
Advertisement Remove all ads
Advertisement Remove all ads

Syllabus

University of Mumbai Semester 3 (SE Second Year) Data Structures Syllabus for Introduction to Data Structure

  • Types of Data Structure, Arrays, Strings, Recursion, ADT (Abstract Data type), Concept of Files, Operations with files, types of files.

University of Mumbai Semester 3 (SE Second Year) Data Structures Syllabus for 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

University of Mumbai Semester 3 (SE Second Year) Data Structures Syllabus for 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)

University of Mumbai Semester 3 (SE Second Year) Data Structures Syllabus for 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
Share
Notifications

View all notifications


      Forgot password?
View in app×