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

Exercise 2 - Amdahl's Law

A programmer has parallelized 99% of a program, but there is no value in increasing the problem size, i.e., the program will always be run with the same problem size regardless of the number of processors or cores used. What is the expected speedup on 20 processors? Solution As per Amdahl's law, the speedup,  N - No of processors = 20 f - % of parallel operation = 99% = 1 / (1 - 0.99) + (0.99 / 20) = 1 / 0.01 + (0.99 / 20) = 16.807 The expected speedup on 20 processors is 16.807
Read more

The Computer Process

A process is the unit of work in a modern computing system. A system consists of a collection of processes, some executing user code, others executing operating system code. The status of the current activity of a process is represented by the value of the program counter and the contents of the processor’s registers. The process memory is typically divided into Text Section, Data Section, Heap Section and Stack Section. The Text section carries the executable code, the Data section holds global variables, the Heap section is dynamically allocated during program run time and the Stack section keeps temporary data storage for function return, local variables etc. The size of the text and data sections are fixed whereas the stack and heap sections can  shrink and grow dynamically during program execution. A program is a passive entity containing a list of instructions stored on disk whereas a process is an active entity with a program counter specifying the next instruction to execut...
Read more