Data Structure

Data Structure course is offered by Euphoria Gen X for all skill level. Get the ultimate career guidance from Euphoria GenX. As a reliable career guidance provider, we drive students to meet their career goals smoothly.

Here you will get much-needed practical hands-on experience that will boost your career in the best way.

Content:

Module 1: Introduction to Data Structures and Algorithms

• Data Structures and Algorithms
• Measuring Running time of Algorithms
• Asymptotic Analysis
• Big O Notation
• Finding Big O
• Tight and Loose Upper Bounds
• Big O analysis of Algorithms
• Finding Time Complexity
• Big O analysis of Algorithms: Examples
• Worst case, Best case and Average Case Analysis
• Common Complexities
• Abstract Data Types

Module 2: Linked List

• Introduction to Linked List in C
• Traversing and Searching a Single Linked List
• Finding Pointers in a Single Linked List
• Insertion in a Single Linked List
• Deletion in a Single Linked List
• Reversing a Single Linked List
• Doubly linked list
• Insertion in a doubly linked List
• Deletion from doubly linked list
• Reversing a doubly linked list
• Circular linked list
• Insertion in a circular Linked List
• Deletion in a circular linked list
• Concatenation
• Linked List with Header Node
• Sorted linked list
• Merging of sorted Linked lists
• Sorting a Linked list using Bubble Sort
• Sorting a Linked list using Merge Sort
• Finding and Removing a cycle in a Linked list

Module 3: Stack and Queue

• Stack
• Array Implementation of Stack
• Linked List Implementation of Stack
• Queue
• Array Implementation of Queue
• Linked List implementation of Queue
• Queue through Circular Linked List
• Circular Queue
• Deque
• Priority Queue
• Checking validity of an expression containing nested parentheses
• Function calls
• Evaluating Arithmetic Expressions
• Polish Notations
• Converting infix expression to postfix expression
• Evaluation of postfix expression

Module 4: Recursion

• Introduction
• Flow of control in Recursive functions
• Winding and unwinding phase
• Euclids Algorithm
• Tail recursion
• Recursion vs. Iteration

Module 5: Binary Tree

• Introduction to Trees
• Binary Tree
• Strictly Binary Tree and Extended Binary Tree
• Full binary tree and Complete Binary Tree
• Array Representation of Binary trees
• Linked Representation of Binary Trees
• Traversal in Binary Tree
• Preorder Traversal
• Inorder Traversal
• Level order traversal
• Finding height of a Binary tree

Module 6: Binary Search Tree

• Traversal in Binary Search Tree
• Searching in a Binary Search Tree
• Nodes with Minimum and Maximum key
• Insertion in a Binary Search Tree
• Deletion in a Binary Search Tree

Module 7: Heap

• Heap Representation
• Insertion in Heap
• Deletion
• Building a heap
• Heap Applications

Module 8: Sorting

• Introduction to Sorting Algorithms
• Sort Stability
• Selection Sort
• Bubble Sort
• Insertion Sort
• Shell Sort
• Merging two Sorted Arrays
• Recursive Merge Sort
• Iterative Merge Sort
• Quick Sort
• Binary tree sort
• Heap Sort
• Radix Sort

Module 9: Searching

• Linear Search
• Variations of Linear Search
• Binary Search

Module 10: Hashing

• Direct Addressing
• Hashing
• Collisions
• Hash Functions
• Open Addressing : Linear Probing
• Open Addressing : Quadratic Probing
• Open Addressing : Double Hashing
• Deletion in Open Addressed Tables
• Separate Chaining

Module 11: Tree

• Tree concept & types
• Tree traversal (Inorder, Preorder and Postorder)
• Binary Search Tree (BST) implementation

Module 12: Graph

• Introduction, DFS and BFS
• Graph Cycle
• Topological Sorting
• Minimum Spanning Tree
• Back Tracking
• Shortest Paths

Module 13: Assignments