FE-Logo
  • Introduction to Data Structures
    • Introduction to Data Structures
    • Types of data structures
    • Primitive and Non-primitive Data Structures
    • Binary and Decimal Integers
    • Algorithm
    • Time and Space Complexity
    • Logical Information
    • Storage of Information
    • Hardware and Software
    • Concept of DataTypes
    • Abstract data type
    • Pointers
    • Structures in C
    • Union
    • Algorithm
    • Arithmetic operators

  • C Language
    • Data Types
    • Data Types in C
    • Integer data types
    • Overflow in char and unsigned char data types
    • The Char Type
    • Floating-point numbers
    • Type conversion
    • Forced conversion
    • Type casting
    • Assignment operator
    • Relational operators
    • Logical Operators
    • Ternary operators
    • Increment Operator
    • Comma operator
    • Bitwise operators
    • Operator precedence
    • Control Structures
    • if statement
    • if-else if
    • The switch statement
    • The while loop
    • The do-while loop
    • The for loop
    • The break statement
    • The continue statement
    • The printf Function
    • Placeholders
    • Address
    • Pointers
    • The scanf function
    • The scanf placeholder
    • Preprocessor
    • Macros
    • Macro and Function
    • Arrays in c
    • Address of each element in an array
    • Access an array element by using a pointer
    • Two dimensional arrays
    • Three-dimensional arrays
    • Function
    • Concept of Stack
    • Parameter Passing
    • Call by reference
    • Global variables
    • Resolving variable References
    • Calling Function
    • Storage of variables
    • Register Variables
    • Scope of variables
    • Dynamic memory allocation
    • Recursion
    • Stack overheads in recursion
    • Recursive function
    • Strings
    • String definition
    • String as parameters
    • Structures
    • Memory allocation to structure
    • Programming with structures
    • Structure pointer
    • Union
    • Files
    • Direct access file

  • Data Structures
    • Arrays
    • Application of arrays
    • Merging of two sorted lists
    • Transpose of a matrix
    • Saddle point of a matrix
    • Implementation of Heap
    • Bubble sorting
    • Quick sort
    • Merge Sort
    • Heapsort
    • Searching Techniques
    • Binary search
    • Hashing
    • Hash function
    • Stack
    • Implementation of a Stack Using Linked Representation
    • Applications of the stack
    • Queue
    • Implementation of Queues
    • Circular queue
    • Implementation of a queue using the linked representation
    • Application of the queue
    • Linked Lists
    • Inserting a node in linked list
    • Sorting a linked list
    • Deleting a specified node in a singly linked list
    • Insert a new node after the specified node in a linked list
    • Counting the number of nodes of a singly linked list
    • Merging of two sorted lists
    • Erasing a linked list
    • Polynomial representation
    • Representation of sparse matrix
    • Splitting a circular list with 2n nodes into two equal circular lists
    • Merging of two circular lists
    • Reverse the direction of links in the circular list
    • Doubly linked list
    • Insert a node in a doubly linked list
    • Delete a node from a doubly linked list
    • Application of dobly linked list to memory management
    • Trees
    • Binary Tree
    • Representation of a Binary Tree
    • Binary Tree Traversal
    • Binary search tree
    • Program: Creating a Binary Search Tree
    • Program for inorder traversal of binary tree
    • Constructing Binary Tree Using the Preorder and Inorder Traversals
    • Count the number of nodes in binary tree
    • Swapping the left and right subtrees of a binary tree
    • Searching in binary search tree
    • Delete a node from binary search tree
    • Graphs
    • Array Representation of graph
    • Computing the indegree and outdegree of a node of a graph
    • Depth-first traversal
    • Breadth-first traversal
    • Connected component of a graph
    • Strongly Connected Component
    • Depth first spanning tree and Breadth-first spanning tree
    • Minimum-Cost Spanning Tree
    • Program of minimum spanning tree
    • Directed acyclic graph
    • Topological sort
    • Program for topological sort

Branch : Electrical and Electronics Engineering | Subject : Data Structures Using C
Data Structures
  • Arrays

    Read topic
  • Application of arrays

    Read topic
  • Merging of two sorted lists

    Read topic
  • Transpose of a matrix

    Read topic
  • Saddle point of a matrix

    Read topic
  • Implementation of Heap

    Read topic
  • Bubble sorting

    Read topic
  • Quick sort

    Read topic
  • Merge Sort

    Read topic
  • Heapsort

    Read topic
  • Searching Techniques

    Read topic
  • Binary search

    Read topic
  • Hashing

    Read topic
  • Hash function

    Read topic
  • Stack

    Read topic
  • Implementation of a Stack Using Linked Representation

    Read topic
  • Applications of the stack

    Read topic
  • Queue

    Read topic
  • Implementation of Queues

    Read topic
  • Circular queue

    Read topic
  • Implementation of a queue using the linked representation

    Read topic
  • Application of the queue

    Read topic
  • Linked Lists

    Read topic
  • Inserting a node in linked list

    Read topic
  • Sorting a linked list

    Read topic
  • Deleting a specified node in a singly linked list

    Read topic
  • Insert a new node after the specified node in a linked list

    Read topic
  • Counting the number of nodes of a singly linked list

    Read topic
  • Merging of two sorted lists

    Read topic
  • Erasing a linked list

    Read topic
  • Polynomial representation

    Read topic
  • Representation of sparse matrix

    Read topic
  • Splitting a circular list with 2n nodes into two equal circular lists

    Read topic
  • Merging of two circular lists

    Read topic
  • Reverse the direction of links in the circular list

    Read topic
  • Doubly linked list

    Read topic
  • Insert a node in a doubly linked list

    Read topic
  • Delete a node from a doubly linked list

    Read topic
  • Application of dobly linked list to memory management

    Read topic
  • Trees

    Read topic
  • Binary Tree

    Read topic
  • Representation of a Binary Tree

    Read topic
  • Binary Tree Traversal

    Read topic
  • Binary search tree

    Read topic
  • Program: Creating a Binary Search Tree

    Read topic
  • Program for inorder traversal of binary tree

    Read topic
  • Constructing Binary Tree Using the Preorder and Inorder Traversals

    Read topic
  • Count the number of nodes in binary tree

    Read topic
  • Swapping the left and right subtrees of a binary tree

    Read topic
  • Searching in binary search tree

    Read topic
  • Delete a node from binary search tree

    Read topic
  • Graphs

    Read topic
  • Array Representation of graph

    Read topic
  • Computing the indegree and outdegree of a node of a graph

    Read topic
  • Depth-first traversal

    Read topic
  • Breadth-first traversal

    Read topic
  • Connected component of a graph

    Read topic
  • Strongly Connected Component

    Read topic
  • Depth first spanning tree and Breadth-first spanning tree

    Read topic
  • Minimum-Cost Spanning Tree

    Read topic
  • Program of minimum spanning tree

    Read topic
  • Directed acyclic graph

    Read topic
  • Topological sort

    Read topic
  • Program for topological sort

    Read topic