3 to 5 Days Training Course

Intended for PG Students / Research Scholars / Faculty Members / Software Professionals.

It will be a full course covering complete details of a subject. The contents and duration are flexible due to different kinds of requirements of different customers.

  1. Data Structures (For Undergraduate)
    This course is for undergraduate students taking them to the depth of data structures with examples and visual simulations. It puts them on a strong foundation. It covers all linear and non-linear data structures. It also gives them the orientation about the reasons of usage of a particular data structure depending upon the needs of the problem. Course can be formulated in the range of 15-30 hours depending upon the requirements.
  2. Algorithm Analysis and Design (For Undergraduate)
    It forms the basis of analysing and designing a problem from the Computer Science perspective. Students should know the tools/ techniques/ methods available for solving different category and classes of problems. It covers different algorithmic techniques including Divide and Conquer, Greedy Programming, Dynamic Programming. Course can be formulated in the range of 15-30 hours depending upon the requirements.
  3. Data Structures and Algorithm Analysis (For Undergraduat
    It is a combination of above two courses done at a slightly faster pace. If the students have done a programming course then they should feel comfortable in it. It covers all linear and non-linear data structures and then covers all the algorithmic techniques. Course can be formulated in the range of 25-40 hours depending upon the requirements. e)
  4. Advance Data Structures (For Postgraduate)
    It will start with a little revision of data structures depending upon whether PG students are from CS or non-CS background. It will cover advanced data structures like Binomial or Fibonacci heaps, Persistent data structures, Succinct data structures, Exponential Tree data structures. Specific topics of research on data structures may be included on demand. Course can be formulated in the range of 15-30 hours depending upon the requirements.
  5. Advanced Algorithms (For Postgraduate)
    It will start with a little revision of the basic algorithmic techniques. Course will cover Network flow, Discrete network location models and Approximation algorithms. Specific topics of research on data structures may be included on demand. Course can be formulated in the range of 15-30 hours depending upon the requirements.
  6. Advanced Data Structure and Algorithms (For Faculty, Research Scholars/ Programmers and Software Engineers)
    It will cover all advance topics on data structures and algorithms at a slightly faster pace. The participants must have done their graduation/post graduation in Computer Science or must have gone through the basic concepts of these courses. It will cover Augmenting data structures, Data structures for Massive data, Algorithms for Combinatorial problems, Parallel and distributed algorithms, Approximation algorithms etc. Specific topics may be included on demand. Course can be formulated in the range of 15-40 hours depending upon the requirements.
  7. Excel in placements It will make students ready for technical part of the placement process. It will cover essentials of Data Structures, Algorithms, Operating System and Database Management System.

Guidelines for conducting the workshop/training