SYLLABUS
DATA STRUCTURES
Unit I: Introduction to Data Structures: Introduction to
Data structures, Data Structure Operations, Algorithmic
Notation, Complexity of algorithms. String processing:
storing strings, character data type, string operations, word
processing, and pattern matching algorithms.
m
Unit II: Array& Record Structure: Linear arrays: Memory
co
Representation of arrays, traversing linear arrays, insertion
& deletion operations, Bubble sort, Linear search and
n.
Binary search algorithms. Multi dimensional arrays,
Pointer arrays. Record structures.
io
Unit III: Linked lists: Linked lists: Memory
at
Representation of Linked List, traversing a linked list,
searching a linked list. Memory allocation & garbage
lic
collection. Insertion & deletion operations on linked lists.
ub
Header linked lists, Two- way linked lists.
Unit IV: Stack & Queue: Stacks: Sequential Memory
ap
Representation of Stack, Arithmetic expressions: Polish
notation. Quick sort, Recursion, Tower of Hanoi. Queues:
ty
Sequential Memory Representation of Queue, DeQueue,
Priority queues.
di
Unit V: Trees: Introduction to Trees, Binary trees, Memory
.a
Representation of Binary Tree, Traversing binary trees,
Header nodes, Binary Search Tree, Heap and heap sort,
w
Path length & Huffman’s algorithm.
w
Unit VI: Graphs & Sorting Algorithms: Introduction to
w
Graphs, Memory representation of graphs, Warshalls’
algorithm, operations on Graphs, Breadth First Search,
Depth First Search. Sorting: Insertion Sort, Selection Sort,
Radix sort, Merge Sort.
