Data Structure Lab CSL 201 Manual KTU - Dr Binu V P-9847390760

 Dr Binu V P - About Me

Data Structures CST 201 KTU Theory Notes ( Learn Theory Before You Attempt Lab Exercise)

SCHEME AND SYLLABUS

1.Polynomial Addition using Arrays

2.Sparse Matrix Representation and sum

3.Stack using Array

4.Queue using Array

5.Circular Queue using Arrays

6.Double Ended Queue 

7.Priority Queue 

8.Infix to postfix

9.Infix to prefix conversion

10.Prefix to infix conversion

11.Evaluation of postfix expression

12.Singly Linked List

13.Doubly Linked List 

14.Stack using Linked List

15.Queue using Linked List

16.Polynomial Addition using Linked list

17.Polynomial Multiplication using Linked List

18.Binary Tree using arrays and traversals

19.Binary Tree using Linked List and Traversal

20.Binary Search Tree Implementation and Traversal

21.Sorting Algorithms

     Bubble sort

     Exchange sort

     Selection Sort

     Insertion Sort

     Quick Sort

     Merge Sort

     Heap Sort

22.Searching Algorithm

    Linear Search

    Binary Search

23.Graph-Adjacency Matrix

24.Graph-Adjacency List

25.Graph Incidence Matrix, In degree, Out degree

26.Graph-BFS

27.Graph-DFS

28.Hash Table with chaining

29.Hash Table with linear probing

30.Simulation of a basic memory allocator and garbage collector using doubly linked list


Practice Questions

Lab Assignments

Comments

  1. DIGITAL MARKETING2 December 2024 at 21:40

    Your content is absolutely outstanding! You have a unique way of breaking down complex topics and making them relatable. It’s always a joy to read your posts—keep inspiring us with your knowledge!

    ReplyDelete

Post a Comment

Popular posts from this blog

Singly Linked List Implementation

Singly Linked List /**************************************************************************/ #include<stdio.h> #include<stdlib.h> struct Node {  int data;  struct Node *next; }*head=NULL,*tail=NULL,*temp=NULL,*trav=NULL,*prev=NULL; void create() {  temp=(struct Node*)malloc(sizeof(struct Node));  printf("Enter data:");  scanf("%d",&temp->data);  temp->next=NULL;  if(head==NULL)  {   head=temp;   tail=temp;  }  else  {   tail->next=temp;   tail=temp;  } } void display() {  temp=head;  while(temp!=NULL)  {   printf(" %d---->",temp->data);   temp=temp->next;  }  printf(" NULL"); }  void insert_begin()  {      temp=(struct Node*)malloc(sizeof(struct Node));      printf("Enter data:");      scanf("%d",&temp->data);      temp->next=NULL;      if(head...
Read more

Binary search Tree Implementation and Traversal

Binary Search Tree and Operations /******* BST Tree and Operations **********/ #include <stdio.h> #include <stdlib.h>struct Node { int key; struct Node* left; struct Node* right; }; struct Node *root=NULL,*temp=NULL; struct Node* createNode(int key) {      struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));      newNode->key = key;      newNode->left = newNode->right = NULL;      return newNode; } struct Node* insert(struct Node* node, int key) { // Base case: if the tree is empty, create a new node if (node == NULL) {      return createNode(key);      } // Compare the key with the current node's key if (key < node->key) { // Recursively insert into the left subtree      node->left = insert(node->left, key);      } else if (key > node->key) { // Recursively insert into the right subtree    node->...
Read more