To emphasize the concepts of Data Structures with real-world examples.
To gain in depth understanding of pointers.
To understand the concept of Structure, Structure members, Structure variables, Accessing a Structure and Self-referential structures.
To be able to get insights of various memory allocation schemes and to understand the advantages of allocating memory during execution time.
To implement the concept of stack and queue using Arrays.
To implement the concept of queue using Arrays
To implement the concept of stack and queue using Arrays.
To understand the algorithm for the conversion of infix to postfix notation and implementation.
To highlight various operations that can be performed on Single Linked Lists and to implement Creation of Single Linked List.
To implement all the three scenarios of Inserting in the Begin, End and In-between the existing single linked list.
To implement all the three scenarios of Deleting the nodes from existing single linked list (Begin / End / In-between).
To implement the creation and insertion scenarios of Circular Linked List along with displaying the nodes of the CLL .
To implement deleting the nodes from the existing circular linked list and to introduce the concepts of Double Linked List with implementation of creating the DLL.
To implement Double Linked Lists Inserting and Deleting (Begin / End / In-between) nodes
To Create a CDLL and implementing all the scenarios of Inserting and Deleting nodes from the existing CDLL.
To understand the concepts of Trees, Binary Trees. How to represent binary trees in sequential fashion and to focus on representation of binary tree using linked list.
To gain in depth knowledge about implementation of tree traversals using recursion.
To implement the creation of Binary Search Trees and to understand the concepts of inserting and deleting the nodes in BST.
To get familiar with the concepts of Graphs, Applications, representation of Graphs.