Data Structure using ‘C’ | Computer Notes PDF Download

DETAILED CONTENTS (Data Structure using ‘C’ )

1. Fundamental Notations

1.1 Problem solving concept top down and bottom up design, structured programming

1.2 Concept of data types, variables and constants

1.3 Concept of pointer variables and constants

2. Arrays

2.1 Concept of Arrays

2.2 Storage representation of multi-dimensional arrays.

2.3 Operations on arrays with Algorithms (searching, traversing, inserting, deleting)

3. Linked Lists

3.1 Introduction to linked list

3.2 Representation of linked lists in Memory

3.3 Operations on linked list (Insertion, deletion and traversals)

3.4 Application of linked lists

3.5 Doubly linked lists

3.6 Operations on doubly linked lists (Insertion, deletion and traversals)

4. Stacks, Queues and Recursion

4.1 Introduction to stacks

4.2 Representation of stacks

4.3 Implementation of stacks

4.4 Applications of stacks

4.5 Introduction to queues

4.6 Implementation of queues

4.7 Circular Queues

4.8 De-queues

4.9 Application of Queues

4.10 Recursion

5. Trees

5.1 Concept of Trees

5.2 Representation of Binary tree in memory

5.3 Traversing Binary Trees (Pre order, Post order and In order)

5.4 Searching, inserting and deleting binary search trees

5.5 Introduction to Heap

6. Sorting and Searching

6.1 Introduction to sorting and searching

6.2 Search algorithm (Linear and Binary)

6.3 Sorting algorithms (Bubble Sort, Insertion Sort, Quick Sort, Selection Sort, Merge Sort, Heap Sort