Scheme and Syllabus Data Structure Lab CSL 201

 

Scheme and Syllabus

Comments

Post a Comment

Popular posts from this blog

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 ...
Read more

Sparse Matrix -Representation,Addition ,Transpose

Sparse Matrix /*******************************************************************************/  #include<stdio.h> void read_sparsemat(int mat_normal[100][100],int r,int c) {     int i=0,j=0;     for(i=0;i<r;i++)     {         for(j=0;j<c;j++)         {             scanf("%d",&mat_normal[i][j]);         }     } } void print_sparsemat(int mat_normal[100][100],int r,int c) {     int i=0,j=0;     for(i=0;i<r;i++)     {         printf("\n");         for(j=0;j<c;j++)         {             printf("%d  ",mat_normal[i][j]);         }     } } void print_tuple(int mat_tup[100][3],int tr) {     int i,j;   printf("\nrows--- columns--- values");     for(i=0;i<tr;i++...
Read more

Polynomial Addition using Arrays

Learn Theory -  Polynomials /****************************************************************/ #include<stdio.h> void create(int poly[],int degree) {     int i=0;          printf("Enter the coeffecients for:\n");     for(i=degree;i>=0;i--)     {         printf("Exp_%d: ",i);         scanf("%d",&poly[i]);     } } void display(int poly[],int degree) {     int i;     for(i=degree;i>=0;i--)     {                  if(i!=degree && poly[i]>0)         {              printf("+");          }         printf("%dx^%d",poly[i],i);     } } void main() {     int poly1[100]={0},degree1,poly2[100]={0},degree2,degreeresult,polyresult[100],i=0;          pr...
Read more