Datastructure
Category : Uncategorized
Datastructure
Course Overview
| Program Code | 10247 |
| Eligibility | min 60% in class X & XII with min 70% in PCM for Non-Sponsored & 65% for Sponsored Category |
| Duration | 6 Months |
Course Structure
Data Structures
- Introduction
- Structured Representation
- Statements and Control Structures
- Abstract Data Types
- Static Data Types
- Dynamic Data Types
- Arrays
- Pointers
- Linked List
- Advanced Data Structures
- Data Structure Representation
Stacks
- Defining stack
- Application of stack
- Operations of stack
- Stack implemented as an array
- Stack implemented with pointers
- Using Stacks to solve problems
Queues
- Defining Queue
- Application of Queue
- Operation of Queue
- Circular Queue
- Priority Queue
- Double Ended Queue
- Queue implemented with Pointers
- Differences between Stacks and Queues
Linked List
- Introduction
- Advantages of Linked List over an Array
- Application of Linked List
- Types of Linked Lists
- Singly Linked Lists
- Operation of Singly Linked Lists
- Doubly Linked Lists
- Operations on Doubly Linked Lists
- Circular Linked Lists
- Circular Double Linked Lists
- Uses of Linked Lists
Trees
- Introduction
- Binary Trees
- Implementation of Binary Trees
- Insertion into a Binary Tree
- Binary Tree Deletion
- Traversing a Binary Tree
- Binary Height Balanced Trees
Graphs
- Introduction
- Types of Graphs
- Various Representation of Graphs
- Application of Graphs
- Graph Traversals
Sorting Techniques
- Introduction
- Bubble Sort
- Selection Sort
- Quick Sort
- Merge Sort
- Iterative Merge Sort
- Introduction to Heap
- Heap Operations
- Heap Sort
Searching Techniques
- Introduction
- Linear Search
- Binary Search
