Skip to main content

ISRO at Ahmedabad

Space Applications Centre (ISRO)
Ahmedabad
General Guidelines to Apply Online


  1. Follow instructions carefully while filling applications.
  2. Enter correct data in the relevant columns as required.
  3. If the consolidated Mark sheet / Certificate specify CGPA / OGPA / CPA, convert the same in terms of equivalent percentage.
  4. The application form is divided in 4 parts:

    a. Personal Details

    b. Education

    c. Experience

    d. Other Information
  5. Field marked with * is a mandatory field and requires to be filled.

  6. In the 4th Part Other Information , you are required to fill the characters shown in the image as a security for application. In case the image displayed is not clear, remove the temporary internet files of the browser and click the Regenerate Image button. A new image will be generated and you can proceed further by entering the characters of the image.

    NOTE : Application can be submitted only once. Hence clicking the SUBMIT button is a critical step, as no corrections will be possible subsequently. So you should ensure once again that the information is correct before submitting

  7. Upon registration / submitting application, applicants will be provided with a 14 digit Online Registration Number, which should be carefully preserved for future reference as this will be used for all future correspondence.

  8. After registration, take two print-outs of the Application summary. For printing ensure that the computer is connected to a printer with A4 size paper and header and footer are removed from page setup. In case printer is not available, you can save the form and print it at your convenience. Please note that site will not be open for printing after 17:30 hours of 20th Aug, 2018. Retain one print out of application summary and other copy is to be brought along with passport size photograph and documents supporting the data furnished in application at the time of Written Test/Skill Test/ Personal Interview..

  9. Candidates are required to send all the relevant documents in support of their proof of date of birth and all educational qualification (from SSC onwards) including all semesters mark sheets for B.E./B.Tech and M.Design (Product Design), Degree certificate on the Email Address: recruitment@sac.isro.gov.in in a single pdf file (size less than 20 mb) on/before the last date of online application. Candidates are required to mention only their 14 digit registration number in the subject line of the email. The subject line should not contain any text. Only 14 digit registration no. should be entered as subject line. For example, if the registration number is 02180101000001, the subject line should be : 02180101000001. The email should not contain any text part. Only documents related to date of birth and educational qualifications including marks/grade sheet of all semesters/years for B.E./B.Tech and M.Design (Product Design), sent as a single attachment of the email (size less than 20 mb), will be considered for screening

  10. As and when required, Caste/Tribe Certificate, OBC Certificate, Persons with Disabilities (PWD) Certificate should be submitted in the prescribed format as given below:




  11. Important Dates :
    Web-site Link Open For On-Line Registration of Applications30th Jul, 2018 (From 0900 hrs.)
    Closing date for on-line registration20th Aug, 2018 (Till 1730 hrs.)
 CLICK HERE FOR OFFICIAL WEBSITE

Comments

Popular posts from this blog

DESIGN AND ANALYSIS OF ALGORITHMS – QUESTION BANK (CSE)

  ISL ENGINEERING COLLEGE DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING DESIGN AND ANALYSIS OF ALGORITHMS QUESTION BANK                                         BE III Year II Semester (A & B Sections) –PC 603 CS     Academic Year: 2020-21 SHORT ANSWER QUESTIONS   UNIT-I 1.       Why is an algorithm analysis required? 2.       State about UNION & FIND operations. 3.       List out the UNION algorithm using weighting rule. 4.       Given f(n)=10n 2 +4n+3, then prove that f(n)=O(n 2 ). 5.       List and define operations performed on sets? 6.       What do you mean by performance analysis of an algorithm? Explain. 7.       Explain the significance of input size of a problem. 8.       State the weighting, collapsing rules in sets. 9.       Explain set representation and write algorithm for FIND. 10.   Solve T(n)=3T(n/3)+√n. 11.   Define the terms direct recursive and indirect rec

Web Application Development (WAD)

Web Application Development (WAD) WEB APPLICATION AND DEVELOPMENT ( WAD) Notes Unit Wise Unit I INTRODUCTION   HTML   CSS   WEB APPLICATION FUNDAMENTALS   Unit II XML   Unit III JQuery   JSON Java Script Unit IV AngularJS   Unit V MEAN Stack   SMACK Stack LAB PROGRAMS:  Click Here Important Question for MID I :  Click here WAD Previous Question : Click Here TEXT BOOK:  Click Hear Course Code Course Title Core/Elective PC 601 IT WEB APPLICATION DEVELOPMENT Core Prerequisite Contact hours per week CIE SEE Credits L T D P - 3 1 - - 30 70 3 Course Objective:     Ø    To develop dynamic web applications using the concepts of HTML 5.0 and   CSS     Ø    To understand the document structure and schemas and represent data in  that format     Ø    To develop applications using Query and represent objects in JSON   notation    

DESIGN AND ANALYSIS OF ALGORITHMS – QUESTION BANK (IT)

  ISL ENGINEERING COLLEGE DEPARTMENT OF INFORMATION TECHNOLOGY DESIGN AND ANALYSIS OF ALGORITHMS QUESTION BANK BE III Year II Semester – PC 602 IT Academic Year: 2020-21 SHORT ANSWER QUESTIONS   UNIT-I 1.       Explain linear probing in Hashing with an example. 2.       Define Heap. 3.       List out the collision resolution techniques in hashing. 4.       Why is an algorithm analysis required? 5.       State about UNION & FIND operations. 6.       List out the UNION algorithm using weighting rule. 7.       Given f(n)=10n 2 +4n+3, then prove that f(n)=O(n 2 ). 8.       List and define operations performed on sets? 9.       What do you mean by performance analysis of an algorithm? Explain. 10.   Explain the significance of input size of a problem. 11.   State the weighting, collapsing rules in sets. 12.   Explain set representation and write algorithm for FIND. 17