CS1241: DATA STRUCTURES IN C

SYLLABUS

Module I: Sequential searching, binary searching, Hashing – linear hashing, hash functions, hash table searching, 

Sorting: bubble sort, selection sort, 

Stacks and Queues: FIFO and LIFO data structures – stacks using (i) pointers and (ii) arrays. Queues using (i) pointers and (ii) arrays, 

Operations on stack and queues; applications, polish notation.

Module II: Linked Lists: Concept of static versus dynamic data structures, implementation of linked lists using pointers, o

perations on linked lists: insertion, deletion and traversing. Doubly linked lists and circular linked lists, applications of linked lists.

Module III: Trees: Concept of linear versus non-linear data structures, 

various types of trees – binary, binary search trees. 

Creating a binary search tree, traversing a binary tree (in-order, pre-order and post-order), 

operations on a tree –insertion, deletion and processing, expression trees, implementation using pointers, applications.

Module IV: Graphs, graph traversal- depth-first and breadth-first traversal of graphs, applications.

BOOK:

A.K.Sharma, Data Structures Using C

Other offer  Rs:199    click here