3rd SEM DATA STRUCTURES LABORATORY (SOURCE CODES)

1. ARRAY OPERATION USING SIMPLE ARRAY

2. STRING OPERATION USING NAÏVE IMPLEMENTATION

3. ARRAY IMPLEMENTATION OF STACK

4. CONVERSION OF INFIX TO POSTFIX EXPRESSION

5. APPLICATION OF STACK: EVALUATION OF SUFFIX EXPRESSION

6. ARRAY IMPLEMENTATION QUEUE

7. OPERATION OF SINGLY LINKED LIST(SLL)

8. OPERATION DOUBLY LINKED LIST(DLL)

9. OPERATION ON SINGLY CIRCULAR LINKED LIST(SCLL) WITH HEADER NODES: REPRESENT AND EVALUATE A POLYNOMIAL

10. OPERATION ON SINGLY CIRCULAR LINKED LIST(SCLL) WITH HEADER NODES: SUM OF TWO POLYNOMIAL

11. OPERATION ON BINARY SEARCH TREES(BST) OF INTEGERS

12. IMPLEMENTATION OF HASH TABLE

13. OPERATION ON GRAPHS