Data Structures Lab PCCSL307 KTU 2024 Scheme - Dr Binu V P

About Me   Learn the theory Data Structures and Algorithms PCCST303

Scheme and Assessments

Experiment List and References

Lab Assignments

Format of the Lab Record

Lab Cycle ( Mandatory Programs)

1.Polynomial Addition Using Arrays

2.Sparse Matrix- Transpose and Addition

3.Stack 
  Implement  stack using array
  Infix to Postfix Conversion and Evaluation

    

8.Graphs


9. Sorting
    
    Quick Sort
    Merge Sort
    Heap Sort
    Radix Sort
   

Comments

Post a Comment

Popular posts from this blog

Lab Assignments

Image
Lab Cycle-1  Week-1 July 2025 Learning Outcome: Learn to use arrays and develop application programs.Analyse the performance. (Show the output after completing all the programs. Evaluation is done based on this) Write C programs to do the following: 1) Write a function rotate(int a[],int n,char d,int cr) to rotate given array elements. The function will take the array, number of elements in the array, direction of rotation(l-left r-right) and count of rotation( how many times to rotate) Eg: input array a[]=2 3 4 5 6 7 rotate(a,6,l,2) output:4 5 6 7 2 3 rotate(a,6,r,2) output:6 7 2 3 4 5 2) Find the mean, median and mode of list of elements. Use array to implement the same.(assume Unimode ). Write separate functions. l=[1,2,3,5,4,5,6,3,1,1] Mean-3.1 Median-3.0 Mode-1 3) Find the frequency of occurrence of each character in the string ( histogram) Eg: input: This is a test string Output:t-3, h-1,i-3,s-4,’ ‘-4…….etc 4)Consider two sets S1={1,2,3,4}, and S2={3,4,5}. Find the intersect...
Read more

Singly Linked List - Operations

Image
  📚 What is a Singly Linked List? A Singly Linked List is a collection of nodes . Each node has two parts: Data : holds the value. Next Pointer : points to the next node in the list. The last node points to NULL , indicating the end of the list . ✅ Singly linked list allows dynamic memory allocation (no fixed size like arrays) and easy insertion and deletion at any position. Basic Structure struct Node { int data; struct Node * next ; }; head points to the first node of the linked list. If head is NULL , the list is empty. 📚 Singly Linked List - Detailed Algorithms Each node contains: data (value) next (pointer to the next node) Initially: head = NULL (list is empty) 1. Creation (Insert at End) Algorithm : Step 1 : Create a new node (newNode) with given data Step 2 : Set newNode->next = NULL Step 3 : If head == NULL (list empty) Set head = newNode Else Initialize temp = ...
Read more