In-house Content
| Course | UG |
|---|---|
| Faculty Name | Dr. H. S. Guruprasad |
| Subject Name | Data Structures |
| Subject Code | 19IS3PCDSC |
| S.No | File Name | File |
|---|---|---|
| 1 | Linked List - Introduction to Pointers | Link |
| 2 | Linked List - Introduction to Structures | Link |
| 3 | Linked List - Concept of Linked List | Link |
| 4 | Linked List - Static Memory Allocation and Dynamic Memory Allocation | Link |
| 5 | Linked List - First Singly Linked List Program | Link |
| 6 | Linked List - Creation of a Singly Linked List by inserting elements at the beginning | Link |
| 7 | Linked List - Traversing a Singly Linked List | Link |
| 8 | Linked List - Creation of a Singly Linked List by inserting elements at the End | Link |
| 9 | Linked List - Insertion at the beginning of a Singly Linked List | Link |
| 10 | Linked List - Insertion of an element at the end of a given Singly Linked List | Link |
| 11 | Linked List - Displaying the elements of a given Singly Linked List | Link |
| 12 | Linked List - Searching an element in a Singly Linked List | Link |
| 13 | Linked List - Insertion after a given element in a Singly Linked List | Link |
| 14 | Linked List - Insertion before a given element in a Singly Linked List | Link |
| 15 | Linked List - Deletion at the beginning of a Singly Linked List | Link |
| 16 | Linked List - Reversing a Singly Linked List | Link |
| 17 | Stack - Stack Implementation using Array | Link |
| 18 | Stack - Evaluation of a Postfix Expression | Link |
| 19 | Stack - Conversion of Infix Expression to Postfix Expression | Link |
| 20 | Stack - Introduction to Recursion | Link |
| 21 | Stack - Factorial using Recursion | Link |
| 22 | Stack - Fibonacci Number using Recursion | Link |
| 23 | Stack - GCD of Two Numbers using Recursion | Link |
| 24 | Stack - Tower of Hanoi using Recursion | Link |
| 25 | Stack - Sum of Natural Numbers using Recursion | Link |
| 26 | Queue - Linear Queue implementation using Arrays | Link |
| 27 | Trees - Introduction to Trees | Link |
| 28 | Trees - Memory Representation of Binary Tree | Link |
| 29 | Trees - Preorder Traversal of a Binary Tree | Link |
| 30 | Trees - Inorder Traversal of a Binary Tree | Link |
| 31 | Trees - Post order Traversal of a Binary Tree | Link |
| 32 | Trees - Recursive Preorder Traversal | Link |
| 33 | Trees - Recursive Inorder Traversal | Link |
| 34 | Trees - Recursive Postorder Traversal | Link |
| 35 | Trees - Iterative Preorder Traversal | Link |
| 36 | Trees - Iterative Inorder Traversal | Link |
| 37 | Trees - Iterative Postorder Traversal | Link |
| 38 | Trees - Insertion and Creation in a Binary Search Tree | Link |
Back to List