Taught by Yashavant Kanetkar
Yashavant is a pioneer in IT Education in India. A true entrepreneur, he has single-handedly set benchmarks for IT education and has played a major role in taking IT learning to every nook and corner of this country. He has authored several bestsellers over last 15 years and helped shape careers of millions of programmers throughout Asia. Most recently, he has created several interactive training titles for KSET’s flagship “Quest” Content Delivery Platform which have become a stellar success. In recognition of his immense contribution to IT education in India, he has been most recently awarded the “Distinguished Alumnus Award” by IIT Kanpur and “Best .NET Technical Contributor” and “Most Valuable Professional” awards by Microsoft. His current passion is Internet Technologies, Device Drivers and Embedded Systems. Yashavant holds a B.E. from VJTI Mumbai and an M. Tech. from IIT Kanpur.
Course Contents
| Analysis of Algorithms | Sorting |
|---|---|
| Algorithms Asymptotic Analysis Time Complexity Linear Search Binary Search Analysis of Search Algorithms | Selection Sort Bubble Sort Radix Sort Insertion Sort Merge Sort and its Analysis Quick Sort and its Analysis |
| Polynomials | Sparse Matrices |
|---|---|
| Structures Array of Structures Passing Structure Elements Passing Structures Polynomial Addition Polynomial Multiplication | Two Dimensional Arrays Saddle Point Upper & Lower Triangular Matrices Sparse Matrices Transpose of a Sparse Matrix Storage of Arrays |
| Linked Lists | Stacks and Queues |
|---|---|
| Dynamic Memory Allocation Linked List Operations Polynomial Addition Using Linked List Circular Linked List Doubly Linked List Sparse Matrix as a Linked List Generalized Linked List | Implementation of a Stack Infix to Postfix Conversion Infix to Prefix Conversion Prefix to Postfix Conversion Evaluation of Postfix Expression Deque, Priority Queue Circular Queue |
| Trees | Graphs |
|---|---|
| Tree Traversals Construction of Binary Trees Array and Liked Representation Binary Search Tree Operations on Binary Trees Threaded Binary Tree Binary Heap Heap Sort AVL Tree | Adjacency Matrix Representation Adjacency List Representation Adjacency Multi-list Representation Orthogonal Representation of a Graph DFS and BFS Traversal Spanning Tree Kruskal’s Algorithm Dijkstra’s Algorithm Topological Order |
4 Easy Ways to Register
You can personally pay the fees at:
Kanetkar’s ICIT Pvt. Ltd.
44-A, Hill Road, Gokulpeth, Nagpur-440010, Maharashtra, India
Tel: +91 712 2531046
If you reside outside Nagpur then you can deposit the cheque into any HDFC bank in your city with following details:
Payable to: Kanetkar’s ICIT Pvt. Ltd.
Account Number: 01022 26000 0026
Bank Name: HDFC Bank, Dharampeth Extension, Nagpur, India
If you reside outside Nagpur then you can prepare a Demand Draft in the name of Kanetkar’s ICIT Pvt. Ltd. and send it to the following address:
Kanetkar’s ICIT Pvt. Ltd.
44-A, Hill Road, Gokulpeth, Nagpur-440010, Maharashtra, India
Tel: (0712) 2531046
If you reside outside Nagpur then you can deposit money by NetBanking using the following details:
Account Name: Kanetkar’s ICIT Pvt. Ltd.
Account Number: 01022 26000 0026
RTGS/NEFT/IFSC Code: HDFC0000102
Bank Name: HDFC Bank, Dharampeth Extension, Nagpur, India