Overview
Syllabus
- INTRODUCTION TO DATA STRUCTURES
- ARRAYS ADVANTAGES & LIMITATIONS
- LINKED LIST - CREATION AND DISPLAY
- LINKED LIST - INSERTION AT BEGINNING , ENDING , SPECIFIC POSITION
- LINKED LIST - DELETION FROM BEGINNING , ENDING , SPECIFIC POSITION
- NUMBER OF NODES AND REVERSING OF LINKED LIST
- ADVANTAGES AND DISADVANTAGES OF SINGLE LINKED LIST
- CIRCULAR LINKED LIST - CREATE AND DISPLAY
- CIRCULAR LINKED LIST - INSERTION AT BEGINNING , ENDING , SPECIFIC POSITION
- CIRCULAR LINKED LIST - DELETION FROM BEGINNING , ENDING , SPECIFIC POSITION
- DOUBLE LINKED LIST - CREATE AND DISPLAY
- DOUBLE LINKED LIST - INSERTION AT BEGINNING , ENDING , SPECIFIC POSITION
- DOUBLE LINKED LIST - DELETION FROM BEGINNING , ENDING , SPECIFIC POSITION
- STACK IMPLEMENTATION USING ARRAYS
- QUEUE IMPLEMENTATION USING ARRAYS
- STACK IMPLEMENTATION USING LINKED LISTS
- QUEUE IMPLEMENTATION USING LINKED LISTS
- STACK APPLICATION - INFIX TO POSTFIX CONVERSION
- STACK APPLICATION - EXAMPLES OF INFIX TO POSTFIX CONVERSION
- EVALUATION OF POSTFIX EXPRESSION
- STACK APPLICATION - BALANCING SYMBOLS
- LINEAR SEARCH WITH EXAMPLE
- BINARY SEARCH WITH EXAMPLE
- BUBBLE SORT WITH EXAMPLE
- INSERTION SORT WITH EXAMPLE
- SELECTION SORT WITH EXAMPLE
- MERGE SORT WITH EXAMPLE
- HEAP SORT WITH EXAMPLE
- QUICK SORT WITH EXAMPLE
- RADIX SORT / BUCKET SORT WITH EXAMPLE
- SHELL SORT WITH EXAMPLE
Taught by
Sundeep Saradhi Kanthety