# ISRO original papers and official Keys

Download links for previous years ISRO original Papers and official Keys:

Skip to content

- Tutorials
- Practice DS & Algo.
- Algorithms
- Analysis of Algorithms
- Asymptotic Analysis
- Worst, Average and Best Cases
- Asymptotic Notations
- Little o and little omega notations
- Lower and Upper Bound Theory
- Analysis of Loops
- Solving Recurrences
- Amortized Analysis
- What does 'Space Complexity' mean ?
- Pseudo-polynomial Algorithms
- Polynomial Time Approximation Scheme
- A Time Complexity Question

- Searching Algorithms
- Sorting Algorithms
- Graph Algorithms
- Pattern Searching
- Geometric Algorithms
- Mathematical
- Bitwise Algorithms
- Randomized Algorithms
- Greedy Algorithms
- Dynamic Programming
- Divide and Conquer
- Backtracking
- Branch and Bound
- All Algorithms

- Analysis of Algorithms
- Data Structures
- Interview Corner
- Languages
- CS Subjects
- GATE
- Web Technologies
- Software Designs
- School Learning
- School Programming
- Mathematics
- Maths Notes (Class 8-11)
- NCERT Solutions
- RD Sharma Solutions

- ISRO CS
- UGC NET CS

- Student
- Jobs
- Courses

- ISRO CSE Syllabus for Scientist/Engineer Exam 2018
**ISRO original papers and official Keys**- GeeksforGeeks – Official Partner of Pragyan
- What are the benefits of interning as content writer at GeeksforGeeks?
- How to add articles to “To Do” and “Done” lists on GeeksforGeeks?
- A Step by Step Guide for Placement Preparation | Set 1
- A Step by Step Guide for Placement Preparation | Set 2
- Top 10 algorithms in Interview Questions
- N Queen Problem | Backtracking-3
- Printing all solutions in N-Queen Problem
- Warnsdorff’s algorithm for Knight’s tour problem
- The Knight’s tour problem | Backtracking-1
- Rat in a Maze | Backtracking-2
- Count number of ways to reach destination in a Maze
- Count all possible paths from top left to bottom right of a mXn matrix
- Print all possible paths from top left to bottom right of a mXn matrix
- Unique paths in a Grid with Obstacles
- Unique paths covering every non-obstacle block exactly once in a grid
- Depth First Search or DFS for a Graph
- Breadth First Search or BFS for a Graph
- Level Order Binary Tree Traversal
- Tree Traversals (Inorder, Preorder and Postorder)
- Inorder Tree Traversal without Recursion
- Inorder Tree Traversal without recursion and without stack!
- Print Postorder traversal from given Inorder and Preorder traversals
- Overview of Data Structures | Set 1 (Linear Data Structures)
- Program for nth Catalan Number
- vector::push_back() and vector::pop_back() in C++ STL

Save Article

Improve Article

Save Article

Like Article

Download links for previous years ISRO original Papers and official Keys:

Writing code in comment? Please use ide.geeksforgeeks.org, generate link and share the link here.