DATA STRUCTURES

INTEGER

FLOAT

CHAR

POINTER

OPERATING SYSTEM

COMPILER DESIGN

DBMS

EXPERT SYSTEMS

STATISTICAL NUMERICAL ANALYSIS

NETWORK ANALYSIS

PERSISTENT DATA STRUCTURES

SUCCINCT DATA STRUCTURES

COMPRESSED DATA STRUCTURES

FIBONACCI SERIES

FACTORIAL

STACK

ARRAY

LINKED LIST

OPERATIONS

PUSH

POP

APPLICATIONS

EVALUATING ARITHMETIC EXPRESSION

INFIX NOTATION

POSTFIX NOTATION

PREFIX NOTATION

TOWERS OF HANOI

FUNCTION CALLS

BALANCING THE SYMBOLS

8 QUEEN PROBLEM

LIST

SORTING

INTERNAL SORTING

BUBBLE SORT,INSERTION SORT,SHELL SORT,
QUICK SORT,HEAP SORT

EXTERNAL SORTING

MERGE SORT,MULTIWAY MERGE,POLYPHASE MERGE

LINKED LIST

TYPES

SINGLY LINKED LIST

DOUBLY LINKED LIST

CIRCULAR LINKED LIST

IMPLEMENTATION

ARRAY

LINKED LIST

APPLICATIONS

POLYNOMIAL ADT

RADIX SORT

MULTILIST

QUEUE

TYPES

CIRCULAR QUEUE

PRIORITY QUEUE

BASIC OPERATIONS

INSERT

DELETE MIN

IMPLEMENTATION

LINKED LIST

BINARY SEARCH TREE

BINARY HEAP

IMPLENTATION

LINKED LIST

ARRAY

OPERATIONS

ENQUEUE

DEQUEUE

APPLICATIONS

BATCH PROCESSING

SORT THE ELEMENTS

SIMULATION

ARRAYS

MODULE DIVISION

MID SQUARE METHOD

PSEUDO RANDOM METHOD

FOLDING METHOD

SEPARATE CHAINING

OPEN ADDRESSING

LINEAR PROBING

QUADRATIC PROBING

DOUBLE HASHING

MULTIPLE HASHING

TREES

TYPES

TYPES

FULL BINARY TREE

COMPLETE TREE

REPRESENTATION

LINEAR

LINKED

BINARY SEARCH TREE

OPERATIONS

DELETE

Subtopic

FIND MIN

FIND MAX

AVL TREE

ROTATION

SINGLE ROTATION

DOUBLE ROTATION

SPLAY TREE

RED BLACK TREE TREE

2-3 TREE

2-3-4 TREE

TRAVERSAL

Day, Date,Hour

GRAPHS

TERMINILOGIES

TRAVERSAL

REPRESENTATION

ADJACENCY MATRIX

ADJACENCY LIST

SHORTEST PATH ALGORITHM

SINGLE SOURCE SHORTEST PATH

UNWEIGHTED SHORTEST PATH

WEIGHTED SHORTEST PATH

DIJIKSTRA'S ALGORITHM

ALL PAIRS

MINIMUM SPANNING TREE

COMPUTING ALGORITHMS

PRIM'S ALGORITHM

KRUSKAL'S ALGORITHM

A COOLECTION OF FACTS,CONCEPTS,FIGURES OR INSTRUCTIONS IN A FORMALIZED MANNER

A WAY OF ORGANIZING,STORING and RETRIEVING DATA