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

Quiz Scores

Comments

Post a Comment

Popular posts from this blog

Lab Assignments

Image
Course code: CSL 201 Course Name: Data Structures Lab Faculty In Charge: Dr Binu V P L-T-P-Credits 0-0-3-2 Pre-requisite: CST 201 Data Structures, EST 102 C programming skills. Operating System to Use in Lab : Linux Compiler/Software to Use in Lab : gcc Programming Language to Use in Lab : Ansi C Preamble: The aim of the Course is to give hands-on experience for Learners on creating and using different Data Structures. Data Structures are used to process data and arrange data in different formats for many applications. The most commonly performed operations on data structures are traversing, searching, inserting, deleting and few special operations like merging and sorting. /**********************************************************************************/ Lab Cycle-1 Learning Outcome: Learn to use arrays and develop application programs. (Show the output after completing all the programs. Evaluation is done based on this) Write C programs to do the following: 1) Write a functi
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;          printf("Enter the degree of first polynomial");      scanf("%d",&degree1);     create(poly1,degree1);     printf("Enter the degree of second polynomial");      scanf("%d",&degree2);     create(poly2,degree2);     if(degree1>degree
Read more