25. Double Linked List Insertion at End and Insertion at any position by Swarup Sarkar

Data Structures with C Videos and Materials Download PDF Material: https://bit.ly/3R33Bf3 Contact for More Info: Email: durgasoftonline@gmail.com Phone: 99 27 37 27 37,7207212427/28 Course Index: =============== 1. Getting Started Introduction Programming Languages Data type, variables, expression Operators o Arithmetic operators o Relational operators o Logical operators o Assignment operators o Increment & decrement operators o Conditional operator o Comma operator Type Casting Precedence and Associativity Control Statement o if-else o switch-case-default o for loop o while loop o do-while loop Defining a function Calling a function Return statement Function Declaration/Function Prototype Category of functions Programming Examples Using Functions MCQ 2. Arrays Introduction One Dimensional Array o Definition o Declaration o Initialization o Processing with array o Memory representation of array Basic Operations of 1-D array o Traversing o Insertion o Deletion o Searching o Sorting o Merging Two-Dimensional array o Address Calculation in 2-D array o Row major order o Column major order Matrix Addition Sparse Matrix Polynomial Representation MCQ 3. Pointer and Structures Introduction Pointer Variable declaration The & and * operator and sizeof operator Pointers and Functions Call by Value and Call by Address Pointers and array Dynamic Memory Allocation What is structure Initialization of structure Typedef Pointer tstructure Self-referential structure MCQ 4. Introduction tData Structure What is Data, Information, Program, Software What is Data Structure Types of Data Structure o Linear Data Structure o Non-Linear Data Structure Data Structure Operations Need of Data Structure Application of Data Structure What is Algorithm Characteristics of Algorithm Difference between Program and Algorithm Algorithm Analysis o Best Case Time Complexity o Worst-Case Time Complexity o Average-Case Time Complexity MCQs 5. Linked List Definition Advantages and Disadvantages Types of Linked List Single Linked List o Traversing a single linked list o Insertion at beginning o Insertion at end o Insertion at specific position o Delete from begin o Delete from end o Delete from any specific position o Reverse single linked list o Count the nof nodes o Searching in a single linked list o Merging of twlinked list o Sorting in a single linked list o Polynomial Addition Double linked list o Traversing a double linked list o Insertion at beginning o Insertion at end o Insertion at specific position o Delete from begin o Delete from end o Delete from any specific position Circular linked list o Traversing a Circular linked list o Insertion at beginning o Insertion at end o Insertion at specific position o Delete from begin o Delete from end o Delete from any specific position MCQs 6. Stack Stack Introduction Array Implementation of Stack o Push Operation o Pop Operation Linked List Implementation o Push Operation of Stack o Pop Operation of Stack Application of Stack o Reversal of string o Checking validity of an expression containing Nested parenthesis o Decimal tBinary Conversion Polish Notation Converting Infix expression intPostfix expression Evaluation of Postfix expression ADT(Abstract data type) Stack ADT MCQs 7. Queue Queue Introduction Array Implementation of Queue o Add Operation in Queue o Delete Operation in Queue Linked List Implementation o Add Operation in Queue o Delete Operation in Queue Circular Queue o Add Operation in Queue o Delete Operation in Queue Priority Queue o Add Operation in Queue o Delete Operation in Queue Dequeue o Add Operation in Queue o Delete Operation in Queue Queue ADT MCQs 8. Recursion Definition Iteration vs Recursion Types of Recursion Programming Examples Using Recursion o Factorial of a number o Fibonacci Sequence o GCD of twnumbers Tower of Hanoi Problem Ackerman Function Tail Recursion MCQ 9. Trees Definition Application of Trees Basic Terminologies Binary Tree o Properties of Binary Tree o Strictly Binary Tree o Complete Binary Tree o Almost Complete Binary Tree Memory Representation of Binary Tree o Array representation of Binary Tree o Linked representation of Binary Tree Binary Tree Traversal o Preorder Traversal o Inorder Traversal o Postorder Traversal Non recursive traversal Level order traversal Construction of Binary Tree Expression Tree o Construction of tree from Postfix expression Binary Search Tree o Searching a node in BST o Insertion of a node in BST o Deletion of a node in BST Threaded Binary Tree o Finding inorder successor of a node o Finding inorder predecessor of anode AVL Tree(Balanced Tree) MCQs . . . . 12. Searching, Hashing Linear Search Analysis Binary Search o Analysis Hashing Choosing a hash function o Truncating Method o Mid square Method o Folding Method o Modular Method Collision Resolution (Open Hashing) o Separate Chaining Closed Hashing (Open Addressing) o Linear Probing o Quadratic Probing o Double Hashing Rehashing MCQs