Data structures using C
On this page
Highlights
What will you learn?
1. Creation of Stacks and Operations on Stacks, Conversion of
expressions from Infix, Postfix, and Prefix, Creation of Queues and
Operations on Queues, Circular Queue, Priority Queue, Double
Ended Queue, Singly Linked List, Circularly Singly Linked List,
Doubly Linked List, Circularly Doubly Linked List, Header Node,
Tree Traversal, Binary Search Tree, Threaded Binary Tree, Binary
Tree Sort, Heap Sort. Hashing techniques and AVL trees.
Details
What will you learn?
1. Creation of Stacks and Operations on Stacks, Conversion of
expressions from Infix, Postfix, and Prefix, Creation of Queues and
Operations on Queues, Circular Queue, Priority Queue, Double
Ended Queue, Singly Linked List, Circularly Singly Linked List,
Doubly Linked List, Circularly Doubly Linked List, Header Node,
Tree Traversal, Binary Search Tree, Threaded Binary Tree, Binary
Tree Sort, Heap Sort. Hashing techniques and AVL trees.
Batch Size
No Minimum
Course Material
Provided
Module Delivery
Fast Track — 4 Hrs / Day
Regular Track — 2 Hrs / Day
Duration
40 Hrs
Admissions
Eligibility
MTPs are open to engineering graduates/diploma holders, engineering students, and working professionals with an appropriate background.
Fees & Scholarships
4500
Contact
- Manager - Training
- Murali R
- email hidden; JavaScript is required
- Phone
- +91 80 4906 5555