This course covers the concepts and implementations of Linear data structures such as Arrays, Stacks, Queues, and Linked List. Relevant examples with pictorial representations are given for better understanding. The differences between static and dynamic data structures have been dealt with in practical implementations. Applications of the stack such as Infix to Postfix Conversion, Postfix Evaluation, Decimal to Binary Conversion, and Palindrome checking have been elaborately discussed with suitable simple coding. Similarly, the applications of queues such as Stack implementation using Single queue and Double queues have been discussed in detail.   Introduction to Liked List and its types such as Singly Linked List, Circularly Linked List, Doubly Linked List, and Doubly Circular Linked List and its operations, Creation of node, Insertion of node at different positions of Linked List, Deletion of the node from different positions, Traversal of Linked List have been explained with simple understandable code. This course also covers the basics of object-oriented programming such as writing functions, passing parameters to the functions, and calling them. It also emphasizes writing default constructors and parameterized constructors.  This course includes almost 25  downloadable resource files, which includes concept wise java coding. The demo for each program has also been included in this course. All program files are made in txt format so that the user can easily use them without any difficulty.