KTU S3 LABS

DATA STRUCTURES IN C

1.Expression Coversion

1.1 Infix To Postfix
1.2 Infix to Prefix
1.3 Postfix Evaluation

2.Sorting and Hashing

2.1 Chaining
2.2 Linear Probing
2.3 Sorting
    2.3.1 Heap Sort
    2.3.2 Merge Sort
    2.3.3 Bubble Sort
    2.3.4 Quick Sort
    2.3.5 Insertion Sort
    2.3.6 Selectionn Sort

3.Stack and Queue

3.1 Circular Queue
3.2 Priority Queue
3.3 Queue
3.4 Stack

3.Trees and Graph

4.1 BST
4.2 Binary Tree
4.3 DFS and BFS of GRAPH

OBJECT ORIENTED PROGRAMMING IN JAVA

1.OOP CONCEPTS

2.File Handling

3.Swing

4.Threads