Job Description
Indraprastha Institute of Information Technology announced job notification for the positions of Junior Research Fellow in the department of and in section of , . This job position Junior Research Fellow located in New Delhi and in state delhi. This job position is categorized as '' jobs.
The educational qualifications for this job position Junior Research Fellow specified as Bachelors or Master’s degree in Computer Science and Engineering with good academic record.. Eligibility conditions for job position Junior Research Fellow mentioned as Must be qualified in NET or GATE in computer science discipline. and required experience levels for this job position Junior Research Fellow are as follows (a) Good experience in algorithm development for optimization problems on graphs. (b) Good experience in software development in JAVA or C/C++. (c) Good experience in working with spatial graph data (e.g., road networks). (d) Experience in developing algorithms for spatial network queries like: shortest paths, network voronoi diagrams and evacuation route planning..
The salary or payscale for Junior Research Fellow is .
The total number of vacancies or positions are 0. Out of which for General/Un-Reserved/OC (Other Castes) vacancies are 0. For OBC (Other Backward Classes) total positions reserved are 0. For SC (Scheduled Castes) category job positions reserved are 0 and for ST (Scheduled Tribes) category job positions reserved are 0. For all other categories of reservations total positions alloted are .
The minimum and maximum age limits to apply for job Junior Research Fellow is minimum age limit is 0 and maximum age limit is 0.
The more and other important information related to this job specified as the position of Junior Research Fellow (JRF) for a project funded by the DST-Science and Engineering research board (SERB) undertaken at the computer science department of this Institute. Candidates having good academic record and a keen interest in research are encouraged to apply. Duties of this post would include conducting novel and original research in the area of Graph Algorithms. This typically entails defining a novel problem, articulating its challenges, undertaking literature search, developing novel algorithms and, evaluating the proposed algorithms via theoretical and experimental analysis. Project Title: “Investigating Scalable Algorithms for Some Macro-Level Transportation Problems on Graph Based Representation of Road Networks”. Duration: 4 Months. To apply, send your detailed CV including information about academic qualification and relevant technical work done to gunturi@iiitd.ac.in with the subject “Application for JRF”.
Important dates to be remembered related to this notification are as follows.
Date of Issue of Notificaition : . Applications will be issued from date and last date to submit applications is . The admit cards will be issued from to . The Priliminary Examinations will start from and will lasts upto date of .
The Preliminary Examinations Results will be announced on date . The Main Examinations will start from date and will ends on . The answer keys for mains examinations will be announced on . The results for Main Examinations will be declared or announced on date . Job Interviews for this job positions Junior Research Fellow will be held from date and will ends on date . The final results or shortlisted persons for this job Junior Research Fellow will be announced on .
This notification issued by which is located in city and in state .
For More Details related to this Notificaition, for Complete Job Details and for complete Notificaition, Please visit the official website of organization .
Voila!!! Happy Jobing.. :)
Job Organization / Department
- indraprastha institute of information technology
Job Positions
- Junior Research Fellow
Job Educational Qualifications
- bachelors or master’s degree in computer science and engineering with good academic record.
Job Eligibility Details
- must be qualified in net or gate in computer science discipline.
Job Experience Requirements
- (a) good experience in algorithm development for optimization problems on graphs. (b) good experience in software development in java or c/c++. (c) good experience in working with spatial graph data (e.g., road networks). (d) experience in developing algorithms for spatial network queries like: shortest paths, network voronoi diagrams and evacuation route planning.
Job City, State
- New Delhi, delhi
Job Total Vacancies
- 0
Job Reservation Details
- General / Un-Reserved : 0
- OBC : 0
- SC : 0
- ST : 0
- Others :
Job Payscale / Salary
Job Age Details
- Minimum Age : 0
- Maximum Age : 0
Job More Information
- the position of junior research fellow (jrf) for a project funded by the dst-science and engineering research board (serb) undertaken at the computer science department of this institute.
- candidates having good academic record and a keen interest in research are encouraged to apply.
- duties of this post would include conducting novel and original research in the area of graph algorithms.
- this typically entails defining a novel problem, articulating its challenges, undertaking literature search, developing novel algorithms and, evaluating the proposed algorithms via theoretical and experimental analysis. project title: “investigating scalable algorithms for some macro-level transportation problems on graph based representation of road networks”. duration: 4 months. to apply, send your detailed cv including information about academic qualification and relevant technical work done to gunturi@iiitd.ac.in with the subject “application for jrf”.
Important Dates
Start Date | End Date | |
---|---|---|
Notification Issued | 20-Nov-2016 | |
Applications | 26-Dec-2016 |
Notification Issued By
- Organization :
- Organization City, State :
- Organization Website :
- Job Organization
- Job Ministry / Department
- Job Position
- Job Group
- Job City
- Job State
- Job Educational Qualification
- Job Eligibility
- Job Experience
- Job Payscale / Salary
- Job Total Vacancies
- Job Reservation Details
- Job Age Details
- Job More Info