ISRO Solved Questions | Computer Science | Govt Exam

Explains sequential search in an array, where you inspect elements one by one to find a target, and discusses best, worst, and average comparisons, with the average equal to (n+1)/2.

Calculate the disk capacity for a 16-surface, 128-track, 256-sector disk with 512-byte sectors, and show that 19 bits are needed to address a specific sector.

Explore real-time scheduling choices by comparing round robin, first come first served, pre-emptive, and random rules, and conclude that pre-emptive scheduling best ensures important tasks run first.

Explore how a single resource triggers deadlock when two or more processes contend, with one allocated and others waiting in a single-resource system.

Identify functional requirements in software engineering, focusing on correct data processing and calculations. Assess portability across systems and robustness to handle wrong inputs, distinguishing these from upgradeability.

Explore Flynn's taxonomy and identify the von Neumann architecture as the primitive sisd model, with simd and misd variants illustrating single instruction or data configurations.

Explain the difference between SR flip-flop and JK flip-flop, focusing on feedback, input combinations, and state behavior; note that 1,1 is invalid for SR, while JK toggles with 1,1.

explains software robustness, reliability, and portability, illustrating how a program handles wrong inputs and still produces correct outputs across platforms.

Investigate finite-length tape automata with forward and backward movement, exploring how rewinding capability affects directional motion and whether certain configurations are considered missing.

Examine properties of recursively enumerable and recursive languages, including closure under complement, proper subset relations, and criteria for when a language is recursive, as in question 38.

Explore a grammar for a language, test whether the string a b a b belongs to it, and examine palindrome possibilities and related answers.

Investigate the immortality problem and working, understand the definition of said concepts, as referenced with bridges, kings, and business riches, economically.

Analyze maximum and minimum outcomes in a joint scenario from isro solved questions for computer science, including r with m twopence and s heads in doubles.

Split a class B network into six subnet bits, yielding 64 subnets and 1024 hosts per subnet, with 62 subnets and 1022 hosts after reservations.

Analyze how statements true for a specific example may differ from general rules in technology exam questions, and how examiners use examples to illustrate defined text.

This lecture explains evaluating a limit that initially forms 0/0, applying limit techniques, and determining that the value equals 1.

A connected graph G is Eulerian if and only if every vertex has even degree. The lecture highlights this condition and how it characterizes Eulerian graphs.