DS INDEX
1.
WHAT IS DATA STRUCTURE
·
CLASSIFICATION OF DATA STRUCTURE
2.
OVERVIEW OF DATA STRUCTURES
·
ARRAY
·
STACK
·
QUEUE
·
TREE
·
GRAPH
3.
DYNAMIC MEMMORY ALLOCATION
·
MALLOC
·
CALLOC
·
REALLOC
·
FREE
4.
ARRAY
·
DEFINITION
·
1-D ARARAY
·
DEFINITION,SYNTAX
·
INSERTION AND DELETION
5.
STRING
·
BUILT-IN FUNCTIONS AND THERE USE
o
STRCPY
o
STRNCPY
o
STRLEN
o
STRCMP
o
STRCAT
6.
SEARCHING
·
BINARY SEARCH
·
LINEAR SEARCH
7.
SORTING
·
WORKING, ALGORITH , PSEUDO CODE FOR SORTING
TECHNIQUES
o
BUBBLE
o
INSERTION
o
SELECTION SORT
o
MERGE SORT
o
QUICK SORT
8.
Link list
·
Define,working
·
Single link list
·
Double link list
·
Advantages and disadvantages
·
Difference between array and link list
·
Operations of link list
9.
STACK
·
DEFINITION AND WORKING OF STACK
·
OPERATIONS ON STACK
o
PUSH
§
ALGORIYHM
§
PSEUDO CODE
o
POP
§
ALGORIYHM
§
PSEUDO CODE
·
APPLICATIONS OF STACK
·
EXPRESSION CONVERSION
·
USING STACK
10. QUEUE
·
DEFINITION AND WORKING
·
OPERATIONS ON STACK
o
INSERT
o
DELETE
·
ALGORITHM
·
PSEUDO CODE
·
CIRCULAR QUEUE
o
WORKING AND DEFINITION
o
ALGORITHM AND PSEUDO CODE
o
INSERTING AND DELTEING ELEMENTS IN QUEUE
·
DRAWBACKS OF SIMPLE QUEUE
·
DIFFERENCE BETWEEN CIRCULAR AND LINEAR QUEUE
11. DOUBLE
ENDED QUEUE
·
DEFINITION AND WORKING
·
ALGORITHM
·
PSEUDO CODE
12. PRIORITY
QUEUE
·
DEFINITION
·
TYPES OF PRIORITY QUEUE
·
APPLICATIONS
13. TREE
·
DEFINITION , WORKING AND EXAMPLE
·
TREE TERMINOLOGY
·
NEED FOR NON LINIEAR DATA STRUCTURE
·
BINARY TREE
o
FULL BINARY TREE / STRICT BINARY TREE
o
COMPLETE BINARY TREE
o
LEFT / RIGHT HEAVY TREE
o
EXTENDED BINARY TREE
o
REPRESENTATION OF BINARY TREE
o
HOW TO FND PARENT / CHILD IN A TREE
o
ADVANTAGE AND DISADVANTAGES OF SEQUENTIAL/LINEAR
REPRESENTATION
o
OPERATIONS ON BINARY TREE
§
TREE TRAVERSAL
§
INORDER
§
PREORDER
§
POSTORDER
o BINARY SEARCH TREE
