Last Updated on March 20, 2024 by GeeksGod

Course : Data Structures in Depth

A data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data. Different types of data structures are suited to different kinds of applications, and some are highly specialized to specific task. Data structures provide a means to manage large amounts of data efficiently. Efficient data structures are key to designing efficient algorithms.  Data structures can be used to organize the storage and retrieval of information stored in both main memory and secondary memory.

Data structures serve as the basis for ADT. The ADT  (Abstract Data Types) defines the logical form of the data type. Data structures are based on the ability of a computer to fetch and store data at any place in its memory, specified by a pointer. 

The array and record data structures are based on computing the addresses of data items with arithmetic operations. The linked data structures are based on storing addresses of data items within the structure itself. The implementation of a data structure usually requires writing a set of procedures that create and manipulate instances of that structure.

A linked list is a linear collection of data elements whose order is not given by their physical placement in memory. Each element points to the next. It is a data structure consisting of a collection of nodes which together represent a sequence. Each node contains: data, and a  link to the next node in the sequence. This structure allows for efficient insertion or removal of elements from any position in the sequence during iteration.

Following topics are covered as part of hands-on / Live coding videos :

Linked Lists (LL) Implementation / Coding:

Concept of linkCreating a Linked List (LL)Appending a node to LLDisplay of LLLength of LL (count)Reversing of LLSorting Adding node at Start of LLInserting node in between of LLDeleting a nodeCreating a Double LLAppending a node to Double LLDisplay of Double LLLength of Double LL (count)Reversing of Double LLInserting a node in between a Double LLRotate Double LLCount Pairs with criteria for a Double LLQuestions Circular LL overview (access pointers)Creating a Circular LLAdding node at Start Circular LL (approach 1)Traversal / Display Circular LL (approach 1)Inserting node in between a Circular LL (approach 1)Deleting a node Adding node at End Circular LL (approach 2)Traversal / Display Circular LL (approach 2)Circular LL – Queue (Adding Node)Circular LL – Queue (Removing Node)Questions

Stacks (Implementation / Coding):

Stack overviewStack with ArrayExpressionsEvaluation of Postfix expression Infix to Post fixEvaluation of Prefix overview. infix to prefix overviewApplication: Finding next big elementStack using Linked ListReversing Stack with Linked ListQuestions

Queues (Implementation / Coding) :

Queue OverviewQueue using ArrayPriority Queue with ArrayQueue using Linked ListPriority Queue using Double Linked ListQuestions

Recursion

Recursion Overview, Phases, TypesRecursive FunctionsLinked List operations using RecursionQuestions

Trees

Binary TreesTree TraversalsInorderpreorderpostorderBinary Search Trees (BST)BST – InsertionBST – Insertion & TraversalsTraversals ExplainedBST – SearchSearch operationsBST DeletionDeletion casesBinary Tree to BST conversionIdentify a Tree to be BSTIdentify zero, one child nodes of BSTQuestions

Sorting

Selection SortSelection Sort AnalysisBubble SortBubble Sort AnalysisInsertion SortInsertion Sort AnalysisQuick SortQuick Sort AnalysisQuick Sort, Merge Sort DiscussionQuestions

Threaded Binary Trees

Need for Threaded Binary Tree (TBT) Threaded Binary Tree OverviewOne way Structure, TraversalTwo way Structure, TraversalInsert functionality Traversal functionalityDelete functionality

AVL Trees

Need for AVL TreesAVL Tree OverviewTree Rotations (Left, Right)Insert cases, Application of Insert casesInsert Functionality code, DemoFunctions Code – LeftRight rotations, RightLeft rotations, Delete Functionality, Rotations needed for Delete

Graphs

GraphsGraph TypesAdjacency Matrix, Adjacency ListTraversalsBFS (Breadth First Search)BFS AlgorithmDFS (Depth First Search)DFS AlgorithmSpanning treeDijkstra Shortest path AlgorithmMinimum Spanning treePrim’s algorithmKruskal   algorithm

Hashing, Collision Resolution

HashingHash FunctionsCollision ResolutionOpen Addressing (Closed Hashing)ProbingLinear, Quadratic, Double hashingLoad factor of Hash TableDeletionSeparate Chaining (Open Hashing)Cuckoo Hashing