ISRO Solved Questions | Computer Science | Govt Exam

Explore linear probing in hash tables with a 2016 computer science question, inserting keys like 37, 38, 72, 48, 98, and 11 to reveal the final index 5.

Learn how the divide and conquer technique designs algorithms by dividing a problem into left and right parts and conquering the solution, with references to sorting like bubble sort.

Determine the total number of nodes in a complete binary tree with three non-leaf nodes, yielding seven total nodes.

This lecture demonstrates evaluating an expression with a stack, pushing operands, popping top elements, and applying binary operators such as exponential operator, multiplication, addition, and subtraction to yield the result.

Examine a C program with an int variable, a pointer to that int, and a double pointer, tracing addresses and dereferenced values to show the output prints 5 three times.

Examine how a while loop's iterations grow logarithmically, using base two and base five examples to illustrate the time complexity.

Analyze how little endian encoding and typecasting influence program output, including pointer behavior and binary evaluation, ending with 64 as the result.

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.

Demonstrate solving a binomial square using A^2 + 2AB + B^2 with A = √3 and B = √7 to evaluate (√3 + √7)^2.

Derive that for x less than 1, the series 1 + x^2 + x^4 + … equals one over one minus x squared.

Examine a deadlock scenario with three processes, each needing a maximum of two units from 40 available, and show that deadlock will never occur.

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.

Learn how triggers automatically enforce data integrity during inserts, updates, or deletes, ensuring consistency between primary keys and foreign keys through side effects of modifications.

Design a logical schema to prevent data inconsistency and duplication while enabling easy data access, ensuring consistent, reliable information across related tables.

This lecture covers memory management with three-page frames, tracing the sequence 4 5 2 1 2 4 and exploring FIFO and least recently used replacements.

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.

Trace the counting semaphore from an initial value of seven through up and down operations to reach a final value of five. Identify how to solve for the unknown X.

Use the effective memory access time formula E = B × 10 ms + (1 − B) × 20 ns, where B is the page fault probability.

This lecture explains how to compute the one’s complement of a binary number and obtain the result by adding one, using an example like 1010 to compare options.

Analyze page replacement algorithms, memory frames, and page faults, and explain how Bradley's anomaly affects performance as frame counts increase and the most recently used behavior emerges.

Explore how foreign keys must form a subset of primary keys to preserve relational integrity, and identify insert, delete, and update actions that violate constraints using R and S tables.

Explore clustering indexes in databases, including how keys, non-keys, and ordering influence search efficiency, with a book-index analogy to locate data quickly.

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 the order of the b+ tree and how a 1024-byte block size defines leaf and internal node capacity, yielding an order of 63.

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.

Explore the concept of renaming in processor design and its role in eliminating pipeline hazards to improve efficiency in register and local variable access.

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.

Analyze a five-stage instruction pipeline with a 2.5 GHz clock, account for internal delay, and compute a speedup of about 3.2 when there are no stalls.

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

Examine a nor gate oscillator question, showing how feedback yields a square-wave output with alternating 0 and 1 states and stable transitions.

Solve a logic cycle problem using x1, y1, x2, and y2, and discuss converting the outputs to binary to interpret signal relationships.

Derive the minimum boolean expression for a given circuit and simplify its terms. Preview a future series on computer science topics and invite subscribers.

Learn how to convert a hexadecimal number to binary by grouping digits into four-bit blocks in the 16-system, 0–9 and A–F. The example concludes with the answer D.

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

Assess how a language accepts strings with an even number of ones using given examples, and evaluate which options correctly describe the regular expression behavior.

examine a grammar for ambiguity by testing strings and determining if a deterministic framework can accept the language, with examples of strings generated by G and membership checks.

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.

Delve into type 2 grammar, exploring terminal and nonterminal symbols and how their roles shape formal grammars, as showcased in question 40 from the ISRO solved questions course.

Analyze how symbol table structure affects time complexity, showing linear time for some implementations and logarithmic time when using an ordered arrangement.

Explore core compiler design concepts, including assembler passes, legality checks for instructions, and the assembly symbol table, with insights into local optimization.

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.

Examine a nested query that uses title and price as primary keys to identify the most expensive book and return its title and details.

Examines which employee and department attributes cannot be expressed with the basic relational algebra. It highlights department address and salary-related results and notes the limitations of basic operations.

Explore how configuration management controls changes to the source code and keeps software up to date. Understand maintenance practices and upgrade cycles that govern application configuration and ongoing updates.

Explore how choosing between two programming languages affects project cost and maintenance over five years, using a cost benefit analysis where L2 yields twice the lines of code as L1.

Estimate effort for a 2000 lines of code digital signal processing software using the Kokomo model. Use a 0.2 multiplicative factor, a 1.5 exponential factor, and 14 percent per month.

Explore the spiral model of software development and the determinants in selecting activities, noting references to risk and database insights.

Explain bit stuffing and nibble-based flag sequences to prevent ambiguity in the stream, and describe dynamic routing updates, jam signals, and a protocol that assigns unique IP addresses to hosts.

Analyze a token ring network timing to estimate signal propagation: a bit transmitted in one second corresponds to microsecond-scale travel, about 20 meters per microsecond, illustrating a single network blip.

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.

Calculate a CRC using a specified polynomial to protect a message, perform division, append the resulting CRC bits to form the transmitted frame, and verify the final encoded sequence.

Identify the maximum size of data the application layer can pass to the DCP layer, and explain how protocols govern transmission between layers.

Determine the minimum sequence number bits required to uniquely label 25 packets on a duplex link, and conclude that five bits suffice.

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.

Analyze the memory hierarchy across L1 and L2 caches and main memory using the given access times and hit ratios to compute the average access time.

Explain how public inheritance affects access to A's public and protected members from derived classes B and C, and why private members remain inaccessible.

Explain the distinction between compile-time and runtime resolution of function calls in C and C++, highlighting why some statements are correct about compile-time behavior.

Explains how DNS spoofing and DNS hijacking occur when a DNS server accepts incorrect information for an unauthoritative host, leading to misleading lookups and data disclosure.

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

Examine a group theory question about a group's order and inverses, showing that a commutative group is abelian, and conclude the correct option is b.

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.

Determine the maximum number of edges in an undirected graph with n vertices without self-loops. Each vertex connects to at most n-1 others, so the maximum edges are n(n-1)/2.

Determine the minimum number of men required to implement bullion funds using a boolean function with a, b, b complement, and a into b, yielding final expression G2 G2.

Explain the binary subtraction logic for inputs e and b, deriving the output B using difference, borrow, and the complement of B in a digital electronics context.

Identify a redundant gate in the given circuit, replace it, and simplify the resulting boolean expression, including complements and terms with x, y, and z.

Explore how dynamic hazards occur when input delays or internal faults misalign timing, causing the output to differ from the expected value.

Explore excess-3 code, also called cell complementing or self-complementing code, and learn how complementing a digit yields paired value, demonstrated by 0 0 0 1 and 0 1 0 0.

Analyze a boolean expression from question 71, apply complements and simplification steps, and determine the final logic result in the ISRO computer science context.