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

About Me   Dr Binu V P

Scheme and Assessments

Experiment List and References

Learn the theory well before you try the programs Data Structures and Algorithms PCCST303

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

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

Infix to Postfix Conversion and Evaluation

  What is an Infix Expression? An infix expression is the way we normally write mathematical expressions: The operator is between the operands . Examples of Infix expressions: A + B 5 * 3 5 + 3 * 2 (A + B) * (C - D) (7 + 3) * (5 - 2) ✅ This is natural for humans because we understand precedence (multiplication first, then addition) and use parentheses. What is a Postfix Expression? (also called Reverse Polish Notation ) A postfix expression places the operator after its operands . No parentheses are needed. No precedence rules needed — order of operations is built-in. Examples of Postfix expressions: A B + → (means A + B ) 5 3 * → (means 5 * 3 ) A B + C D - * → (means (A + B) * (C - D) ) 7 3 + 5 2 - * → (means (7 + 3) * (5 - 2) ) ✅ Computers prefer postfix because it’s very easy to evaluate using a stack . Quick Comparison: Feature Infix Postfix Operator position      Between operands      After ope...
Read more