Data Structure(Using
C)
|
|
|
Course Content
-
Introduction To Data structure
- Introduction and Defination
- Classification of DataStructure
- Memory Allocation in C
- Recursion
- Stacks
- Introduction
- Stack Implementation
- Operations on stack(push,pop)
- Stack Terminology
- Algorithms for push and pop(Using Array)
- Implementation of stack using pointer(Linked List)
- Queue
- Introduction
- Queue Implementation
- Operation on Queue
- Algorithms for Insertion and Deletion of Queue(Using Array)
- Limitation off simple queue
- A circular Queue
- Double ended Queue
- Priority Queues
- Linked
List
- Introduction
- Linked List And key Terms
- Representation of Linked List
- Types od Linked List(singly,circular,Doubly)
- Searching
And Sorting
- Introduction
- Linear Search
- Binary search
- Bubble sort,Insertion sort,selection sort,merge sort,Quick sort,radix sort,heap
sort
- Trees
- Introduction
- Basic terminology
- Binary tree
- Trauersal methods
- Binary search tree
- B tree, B+tree
- Graphs
- Introduction
- Basic Terminology
- Graph representation and implementation
- Shortest path problem
- Minimum spanning tree
- Hashing
- Introduction
- Hash function
- Overflow
- collision,open hashing & closed hashing
- Rehashing techniques
|
|
|
ITnium is a reputed training institute in Sangli and MIraj Kupwad region to provide the academic guidance for Data Structure(DS) using C and C++ programming. We build the confidence of programming among the students through Data Structure courses in our region.
|