SECTION–A
Basic Data Structures:
Introduction to elementary Data Organization and its operations,
complexity of Algorithms – Big O-Notation, and Time space trade off
Arrays and its applications,
Searching Techniques:
Linear and Binary Search
Stack and its applications – postfix notation, expression evaluation, recursion
SECTION–B
Linked Lists:
Implementation of linked list,
singly and doubly linked list,
linked list operations with algorithms
Queues:
Description of queue structure,
implementation of queue using arrays and linked lists,
description of priorities queue,
Applications of queues.
SECTION–C
Trees:
Description of tree structure and its terminology,
binary search tree,
AVL Trees,
Threaded Binary Trees,
B–Trees,
B+ trees.
Graphs:
Description of graph structure,
implementing graphs in memory using adjacency matrix or adjacency lists,
various graphs traversing algorithms,
finding shortest path between two nodes.
SECTION–D
Sorting Technique:
Bubble Sort,
selection sort,
insertion sort,
quick sort,
merge sort,
heap sort
File Organization:
Concept of field,
record, file,
blocking and compaction.
File Organization Techniques:
Sequential indexed,
indexed sequential,
Direct, Hashing,
Concept of master and transaction files.