Register

IIT-Madras MS

715 views
0 votes
0 votes

According to https://research.iitm.ac.in/, Admission for M.S Online application portal for Academic year 2017 - 2018 will be open tentatively from 19.04.2017. But the portal has not opened since 19th April.

Would anyone be aware whether new registrations are allowed/not?

I need to register as I missed to apply by 2nd April. I had called IIT-Madras.They told to wait till 21st April, but there is no registrations link on the website. 

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
Anonymous Drg asked Apr 19, 2017
2,031 views
IIT Madras MS Interview Call Letter
Did anyone received Call Letter for Written Test for IIT Madras MS ( for AIR > 800 - General Category) Program in Computer Science ?
Did anyone received Call Letter for Written Test for IIT Madras MS ( for AIR 800 - General Category) Program in Computer Science ?
User Avatar
0 votes
0 votes
1 answer
2
SPluto asked May 2, 2019
604 views
IIT Madras MS written test 2019 - TOC - 1
Let L1 and L2 be 2 languages which are not regular. Which of these is true? The union of L1 and L2 is not regular. The intersection of L1 and L2 is not regular. Both I and II are true I is true, II is false I is false, II is true Both I and II are false
Let L1 and L2 be 2 languages which are not regular. Which of these is true?The union of L1 and L2 is not regular.The intersection of L1 and L2 is not regular.Both I and I...
User Avatar
0 votes
0 votes
0 answers
3
SPluto asked May 2, 2019
529 views
IIT Madras MS written test 2019 - Algorithms - 1
Let SP be the problem of finding the shortest path between 2 nodes, and LP be the problem of finding the longest path between 2 nodes, in an unweighted, undirected graph. Which of the following is true? SP is NP-hard, LP is not LP is NP-hard, SP is not Both are NP-hard Neither SP nor LP is NP-hard
Let SP be the problem of finding the shortest path between 2 nodes, and LP be the problem of finding the longest path between 2 nodes, in an unweighted, undirected graph....
User Avatar
Link Copied!