Skip to main content

BITS Work Integrated Learning Program - M.Tech Data Science & Engineering

     BITS Pilani offers work integrated learning program (WILP) on M.Tech Data Science and Engineering which is UGC approved.

The course is a four semester programme designed to help work professionals to build their skills required for data science engineering which enable them to become a Data Scientist. 

It is a 100% online course and lectures would be delivered by BITS Pilani faculty on weekends.

Those who are working in software industry as Software Engineer, Programmer, Data Analyst, Business Analyst can apply for the course.

Minimum eligibility criteria to apply for the course.

Those who are employed holding B.E/B.Tech/MCA/M.Sc or Equivalent with 60% marks and minimum one year relevant work experience. The candidates should have basic programming and engineering mathematics knowledge.

The following subjects shall be covered in the course.

Semester Subjects

  • Data Mining
  • Mathematical Fundamentals for Data Science
  • Data Structure and Algorithms Design
  • Computer Organisation and Systems Software
  • Introduction to Statistical Methods
  • Introduction to Data Science

Elective Subjects

  • Deep Learning
  • Natural Language Processing (NLP)
  • Artificial & Computational Intelligence
  • Real time Analytics
  • Data Visualisation & Interpretation
  • Algorithms & Mining Graphs
  • Optimization Methods for Analytics
  • Big Data Systems
  • Information Retrieval
  • Probabilistic Graphical Models
  • Data Warehousing
  • Systems for Data Analytics
  • Ethics for Data Science
  • Machine Learning
  • Distributed Data System
  • Stream Processing & Analytics
How to Apply


As the course is designed for working professionals, the employer consent form shall be submitted along with the application form. The candidates also must choose a mentor who would monitor and advice on the progress to complete the course successfully. The mentor can be immediate manager or a senior person who holds Bachelor degree with minimum of five years of relevant work experience of Master degree or equivalent.

Points to be noted for those who are willing to apply
  • The student strength for the course will be more. 
  • The students will be split into sections. 
  • The classes for sections will be conducted either on Saturday or Sunday. 
  • The each class will be for 2 hours and total 8 hours for four subjects from 9 AM to 7 PM on the assigned day.
  • There will be few webinars in week days evening also.
  • Approximately 16 units to be completed in each semester. Each unit corresponds to about 32 hours of study, which means at least 4 to 5 hours to be spent every day.
  • The evaluation process comprise of Assignments, Quizzes, Mid Semester and Comprehensive Exams.
  • As the course is for Master degree, self learning is expected from students.

Labels:

Popular posts from this blog

Gaussian Elimination - Row reduction Algorithm

 Gaussian elimination is a method for solving matrix equations of the form, Ax=b.  This method is also known as the row reduction algorithm. Back  Substitution Solving the last equation for the variable and then work backward into the first equation to solve it.  The fundamental idea is to add multiples of one equation to the others in order to eliminate a variable and to continue this process until only one variable is left. Pivot row The row that is used to perform elimination of a variable from other rows is called the pivot row. Example: Solving a linear equation The augmented matrix for the above equation shall be The equation shall be solved using back substitution. The eliminating the first variable (x1) in the first row (Pivot row) by carrying out the row operation. As the second row become zero, the row will be shifted to bottom by carrying out partial pivoting. Now, the second variable (x2)  shall be eliminated by carrying out the row operation again. ...
Read more

Decision Tree - Gini Index

The Gini index is used in CART. The Gini index measures the impurity of the data set, where p i - probability that data in the data set, D belong to class, C i  and pi = |C i,D |/|D| There are 2 v - 2 possible ways to form two partitions of the data set, D based on a binary split on a attribute. Each of the possible binary splits of the attribute is considered. The subset that gives the minimum Gini index is selected as the splitting subset for discrete valued attribute. The degree of Gini index varies between 0 and 1. The value 0 denotes that all elements belong to a certain class or if there exists only one class, and the value 1 denotes that the elements are randomly distributed across various classes. A Gini Index of 0.5 denotes equally distributed elements into some classes. The Gini index is biased toward multivalued attributes and has difficulty when the number of classes is large.
Read more

Clustering Analysis

Clustering is the process of grouping a set of data objects into multiple groups so that objects within a group have high similarity, but are very dissimilar to objects in other groups. The clustering would help to discover previously unknown groups within the data. The cluster analysis can be used to gain insight into the distribution of data, to observe the characteristics of each cluster, and to focus on a particular set of clusters for further analysis. The main focus has been given to distance-based cluster analysis . The Cluster analysis tools based on k-means, k-medoids, and several other methods also have been built into many statistical analysis software packages. The clustering is a form of learning by observation, rather than learning by examples. Requirement of Clustering Scalability Ability to deal various types of attributes Discovery of clusters with arbitrary shape Requirement for domain knowledge Ability to deal with noisy data Incremental clustering and insensitivity ...
Read more