ISRO Scientist/Engineer CS Solved Papers
Prepare for ISRO ICRB examinations with verified solutions covering Algorithms, Theory of Computation, Compiler Design, Computer Architecture, OS, Discrete Mathematics, and Computer Networks.
All ISRO CS PYQs / All CS Subjects / All Topics
Marking scheme: +3.00 positive, -0.75 negative (ICRB Standard).
In the V Model of Software Testing shown below, please identify (A), (B), (C), (D):
For a software project, following information about the domain characteristics are given:
| Sl No | Description | Count | Average Weight factor |
|---|---|---|---|
| 1 | Number of user inputs | 30 | 4 |
| 2 | Number of user outputs | 60 | 5 |
| 3 | Number of user enquiries | 20 | 4 |
| 4 | Number of files | 5 | 10 |
| 5 | Number of external interfaces | 4 | 7 |
Assume that all complexity adjustment values are average having scale = 3. The function point value for the project will be
Consider the regular expression R over the alphabet $\{a, b\}$:
$$(a^*b)^* + (b^*a)^*$$Which of the following regular expressions below describe the same language as R?
Consider the deterministic finite-state automaton (DFA) below over the alphabet $\{a, b\}$. The state with a small incoming arrow is the initial state, while a double circle state denotes a final state.
Transitions:
Initial state $q_0$ (non-final): on 'a' goes to $q_1$; on 'b' goes to $q_2$.
State $q_1$ (final): on 'b' loops to $q_1$; on 'a' goes to $q_2$.
State $q_2$ (final): on 'a, b' loops to $q_2$.
The number of states in the MINIMAL DFA for the language accepted by this DFA is:
Consider the context-free grammar G below. Here S is the starting non-terminal symbol, while a and b are terminal symbols.
$$S \rightarrow aSb \mid T$$$$T \rightarrow bT \mid b$$The language generated by G is: