ISRO Books - Scientist (Computer Science)Account Options Sign in. Top charts. New releases. Add to Wishlist. If you apply to be a scientist or an engineering job at other firms sometimes they will also test your knowledge and skill.
Interview Experience, ISRO Computer Science By Harshil Gupta (RANK 5, Aug 2018)
Best Books to prepare for ISRO Computer Science Scientist Job?
Education and Career Forum. Tech mechanical? How to prepare for scientist job in ISRO? What is the salary? How to join ISRO? What to study in order to join ISRO? Syllabus of ISRO entrance exam in computer science?
The exam will take place in 2 stages — Written and Interview. The written exam will take place on 17th December Moreover, if you are preparing for other Engineering Exams like GATE , know the complete exam pattern to boost up your exam preparation. If you take a careful look at the past year papers of ISRO exams , you will find that many questions get repeated every year. If you were surprised by the fact that most questions are repeated in ISRO exams year after year, we have more surprise in store for you. If you concentrate on these topics and prepare them thoroughly, you will definitely be able to qualify the written ISRO exam.
Write a review
In this plan, gradeup will provide notes, quizzes, live sessions and other important resources. Engineering Mathematics Study Notes. Engineering Mathematics Booster Quiz 1. Catalyst for Engineering Mathematics. Engineering Mathematics Booster Quiz 2. Engineering Mathematics Booster Quiz 3.
Tech in Mechanical whichever is applicable and the test will be objective type. Logic functions, Minimization, Design and synthesis of combinational and sequential circuits; Number representation and computer arithmetic fixed and floating point. Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability. Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis; Design: Greedy approach, Dynamic programming, Divide-and-conquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching. Asymptotic analysis best, worst, average cases of time and space, upper and lower bounds, Basic concepts of complexity classes — P, NP, NP-hard, NP-complete.