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 IT SEM 3 – DATA STRUCTURE AND ANALYSIS

Course Content

Expand All

Module 1 – Introduction to Stacks, Queues & Linked Lists 21 Topics

Expand

Lesson Content

0% Complete 0/21 Steps

1.1.a INTRODUCTION TO DATA STRUCTURES – Linear and Non-Linear Data Structure

1.1.b INTRODUCTION TO DATA STRUCTURES – Static and Dynamic Data Structure

1.1.c INTRODUCTION TO DATA STRUCTURES – Concept of Stack

1.1.d INTRODUCTION TO DATA STRUCTURES – Concept of Queue

1.1.e INTRODUCTION TO DATA STRUCTURES – Array implementation of Stack

1.1.f INTRODUCTION TO DATA STRUCTURES – Array implementation of Queue

1.1.g INTRODUCTION TO DATA STRUCTURES – Circular Queue

1.1.h INTRODUCTION TO DATA STRUCTURES – Double Ended Queue

1.1.i INTRODUCTION TO DATA STRUCTURES – Priority Queue

1.2.a CONCEPT OF LINKED LIST – Singly Linked List

1.2.b CONCEPT OF LINKED LIST – Doubly Linked List

1.2.c CONCEPT OF LINKED LIST – Circular Linked List

1.2.d CONCEPT OF LINKED LIST – Insertion, Deletion, Update and Copying operations with Singly Linked List

1.2.e.1 CONCEPT OF LINKED LIST – Insertion operations on Doubly Linked List

1.2.e.2 CONCEPT OF LINKED LIST – Deletion Operation on Doubly Linked List

1.2.g CONCEPT OF LINKED LIST – Reversing a Singly Linked List

1.3.a SELF LEARNING TOPICS – Linked List implementation on Stack

1.3.b SELF LEARNING TOPICS – Linked List implementation on Queue

1.3.c SELF LEARNING TOPICS – Linked List implementation on Circular Queue

1.3.d SELF LEARNING TOPICS – Linked List implementation on Double Ended Queue

1 of 2

Module 2 – Trees 22 Topics

Expand

Lesson Content

0% Complete 0/22 Steps

2.1.a INTRODUCTION TO TREES – Terminologies

2.1.b INTRODUCTION TO TREES – Searching

1.2.c INTRODUCTION TO TREES – Non Recursive Preorder, in-order and post-order Traversal

2.2.a BINARY SEARCH TREE – Traversal

2.2.b BINARY SEARCH TREE – Types of Binary Trees

2.2.c BINARY SEARCH TREE – Insertion and Deletion

2.3.a THREADED BINARY TREE – Finding In-Order Successor of a node

2.3.b THREADED BINARY TREE – Finding In-Order Predecessor of a node

2.3.c THREADED BINARY TREE – Insertion and Deletion

2.4.a AVL TREE – Searching and Traversing

2.4.b AVL TREE – Tree Rotation – Right, Left

2.4.c AVL TREE – Insertion

2.4.d AVL TREE – Deletion

2.5.a B TREE – Searching from leaf node and non-leaf node

2.5.b B TREE – Insertion from leaf node and non-leaf node

2.5.c B TREE -Deletion from leaf node and non-leaf node

2.5.d B TREE – B+ Tree

2.5.e B TREE – Digital Search Tree

2.5.f B TREE – Game Tree

2.5.g B TREE – Decision Tree

1 of 2

Module 3 – Graphs 11 Topics

Expand

Lesson Content

0% Complete 0/11 Steps

3.1.a INTRODUCTION TO GRAPHS – Directed and Undirected Graph

3.1.b INTRODUCTION TO GRAPHS – Graph Terminology

3.1.c INTRODUCTION TO GRAPHS – Connectivity in Undirected and Directed Graph

3.1.d INTRODUCTION TO GRAPHS – Spanning Tree

3.2.a REPRESENTATION OF GRAPH – Adjacency Matrix

3.2.b REPRESENTATION OF GRAPH – Adjacency List

3.2.c REPRESENTATION OF GRAPH – Transitive Closure of a Directed graph and Path Matrix

3.3.a TRAVERSALS – Breadth First Search

3.3.b TRAVERSALS – Depth First Search

3.4.a SELF LEARNING TOPICS – Implementation of BFS

3.4.b SELF LEARNING TOPICS – Implementation of DFS

Module 4 – Recursion and Storage Management 16 Topics

Expand

Lesson Content

0% Complete 0/16 Steps

4.1.a RECURSION – Writing a Recursive Function

4.1.b RECURSION – Flow of Control in Recursive Functions

4.1.c RECURSION – Winding and Unwinding Phase

4.1.d RECURSION – Recursive Data Structures

4.1.e RECURSION – Implementation of Recursion

4.1.f RECURSION – Tail Recursion

4.1.g RECURSION – Indirect and Direct Recursion

4.2.a STORAGE MANAGEMENT – Sequential Fit Method (First, Best and Worst)

4.2.b STORAGE MANAGEMENT – Fragmentation

4.2.c STORAGE MANAGEMENT – Freeing Memory

4.2.d STORAGE MANAGEMENT – Boundary Tag Method

4.2.e STORAGE MANAGEMENT – Binary Buddy System

4.2.f STORAGE MANAGEMENT – Fibonacci Buddy System

4.2.g STORAGE MANAGEMENT – Compaction

4.2.h STORAGE MANAGEMENT – Garbage Collection

4.3.a SELF LEARNING TOPICS – Implementation of Recursion Function

Module 5 – Searching & Sorting 19 Topics

Expand

Lesson Content

0% Complete 0/19 Steps

5.1.a SEARCHING – Sequential Search

5.1.b SEARCHING – Binary Search

5.2.a HASHING – Hash Functions: Truncation

5.2.b HASHING – Mid-Square Method

5.2.c HASHING – Folding Method

5.2.d HASHING – Division Method

5.3.a COLLISION RESOLUTION – Linear Probing

5.3.b COLLISION RESOLUTION – Quadratic Probing

5.3.c COLLISION RESOLUTION – Double Hashing

5.3.d COLLISION RESOLUTION – Separate Chaining Bucket Hashing

5.3.e COLLISION RESOLUTION – Analysis of all Searching Technique

5.7.a Definition of normal forms – 1NF, 2NF, 3NF & The Boyce E-Codd Normal Form (BCNF)

5.4.a SORTING – Insertion Sort

5.4.b SORTING – Merge Sort

5.4.c SORTING – Selection Sort

5.4.d SORTING – Quick Sort

5.4.e SORTING – Radix Sort

5.4.f SORTING – Analysis of Sorting Techniques

5.5.a SELF LEARNING TOPICS -Implementation of different Sorting and Searching Techniques

Module 6 – Applications Of Data Structures 18 Topics

Expand

Lesson Content

0% Complete 0/18 Steps

6.2.e APPLICATIONS OF STACK – Introduction to Infix, Prefix and Postfix Expressions

6.2.f APPLICATIONS OF STACK – Evaluation of Infix, Prefix and Postfix Expressions

6.2.g APPLICATIONS OF STACK – Conversion of Infix to Prefix Expressions

6.2.h APPLICATIONS OF STACK – Conversion of Infix to Postfix Expression

6.3.a APPLICATIONS OF QUEUES – Scheduling

6.3.b APPLICATIONS OF QUEUES – Round Robin Scheduling

6.4.a APPLICATIONS OF TREES – Huffman Tree

6.4.b APPLICATIONS OF TREES – Heap Sort

6.5.a APPLICATIONS OF GRAPHS – Dijkstra’s Algorithm

6.5.b APPLICATIONS OF GRAPHS – Minimum Spanning Tree (Prim’s Algorithm)

6.5.c APPLICATIONS OF GRAPHS – Minimum Spanning Tree (Kruskal’s Algorithm)

6.6.a SELF LEARNING TOPICS – Implementation of Applications for Stack, Queue, Linked List, Trees and Graphs

6.1.a APPLICATIONS OF LINKED LIST – Addition of 2 Polynomials

6.1.b APPLICATIONS OF LINKED LIST – Multiplication of 2 Polynomials

6.2.a APPLICATIONS OF STACK – Reversal of a String

6.2.b APPLICATIONS OF STACK – Checking validity of an expression containing nested parenthesis

6.2.c APPLICATIONS OF STACK – Function Call

6.2.d APPLICATIONS OF STACK – Polish Notation

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.