CSE JRF ALGORITHM

• A TECHNIQUE FOR DIRECT SEARCH IS HASHING.

• THE COMPLEXITY OF LINEAR SEARCH ALGORITHM IS  O(n).

• THE OPERATION OF PROCESSING EACH ELEMENT IN THE LIST IS KNOWN AS TRAVERSAL.

• TWO MAIN MEASURES FOR THE EFFICIENCY OF AN ALGORITHM ARE    TIME AND SPACE.

• THE DATA STRUCTURE REQUIRED FOR BREADTH FIRST TRAVERSAL ON A GRAPHS IS QUEUE.

• IF (rear = = maxsize - 1) rear = 0; else rear = rear + 1; IS REQUIRED IN       CIRCULAR QUEUE.