Skip to content

Home
Engineering (BE)
Mar’24 month certification
FAQ – Mar’24 Month Certification Drive
Registration Certification link
My Account
Log In
Contact

Home
Engineering (BE)
Mar’24 month certification
FAQ – Mar’24 Month Certification Drive
Registration Certification link
My Account
Log In
Contact

SE CSE SEM3 – DATA STRUCTURE

Course Content

Expand All

Module 1 – Introduction To Data Structures 4 Topics

Expand

Lesson Content

0% Complete 0/4 Steps

1.1 Introduction to Data Structures

1.2 Concept of ADT

1.3 Types of Data Structures Linear and Nonlinear

1.4 Operations on Data Structures

Module 2 – Stack & Queues 15 Topics

Expand

Lesson Content

0% Complete 0/15 Steps

2.1.a STACKS – Introduction to Stacks and Queues

2.1.b STACKS – ADT of Stack

2.1.c STACKS – Operations on Stack

2.1.d STACKS – Array Implementation of Stack

2.1.e STACKS – Applications of Stack-Well form-ness of Parenthesis

2.1.f STACKS – Infix to Postfix Conversion

2.1.g STACKS – Postfix Evaluation

2.1.h STACKS – Recursion

2.2.a QUEUES – ADT of Queue

2.2.b QUEUES – Operations on Queue

2.2.c QUEUES – Array Implementation of Queue

2.2.d Types of Queue-Circular Queue

2.2.e QUEUES – Priority Queue

2.2.f QUEUES – Introduction of Double Ended Queue

2.2.g QUEUES – Applications of Queue

Module 3 – Linked List 11 Topics

Expand

Lesson Content

0% Complete 0/11 Steps

3.1 Introduction

3.2 Representation of Linked List

3.3 Linked List v/s Array

3.4 Types of Linked List – Singly Linked List

3.5 Circular Linked List

3.6 Doubly Linked List

3.7 Operations on Singly Linked List

3.8 Operations on Doubly Linked List

3.9 Stack and Queue using Singly Linked List

3.10 Singly Linked List Application-Polynomial Representation

3.11 Singly Linked List Application-Polynomial Addition.

Module 4 – Trees 13 Topics

Expand

Lesson Content

0% Complete 0/13 Steps

4.1 Introduction, Tree Terminologies

4.2 Binary Tree

4.3 Binary Tree Representation

4.4 Types of Binary Tree

4.5 Binary Tree Traversals

4.6 Binary Search Tree

4.7 Operations on Binary Search Tree

4.8.a Applications of Binary Tree – Expression Tree

4.8.b Applications of Binary Tree – Huffman Encoding

4.9 Search Trees-AVL , rotations in AVL Tree

4.10 Operations on AVL Tree

4.11.a Introduction of B Tree

Module 5 – Graphs 5 Topics

Expand

Lesson Content

0% Complete 0/5 Steps

5.1 Introduction

5.2 Graph Terminologies

5.3 Representation of Graph

5.4 Graph Traversals Depth First Search (DFS) and Breadth First Search (BFS)

5.5 Graph ApplicationTopological Sorting

Module 6 – Searching Techniques 5 Topics

Expand

Lesson Content

0% Complete 0/5 Steps

6.1 Linear Search

6.2 Binary Search

6.3 Hashing-Concept

6.4 Hash Functions

6.5 Collision resolution Techniques

Get Certified in Technology Skills for Better Job Opportunities for Mumbai University Students

Copyright © 2024 MuCertification.com

Powered by MUQuestionPapers.com

Login

Accessing this course requires a login. Please enter your credentials below!

Username or Email Address

Password

Remember Me

Continue with Facebook

Continue with Google

Lost Your Password?

Register

Don't have an account? Register one!

Register an Account

Username

Email

Password

Confirm Password

Continue with Facebook

Continue with Google

Subscribe to our Free Newsletter

Registration confirmation will be emailed to you.