GATE CSE previous-year questions

2026 · CS1 - ForenoonGeneral AptitudeVerbal AptitudeMCQ · 1 mark

The antonym of the word protagonist is ________.

2026 · CS1 - ForenoonGeneral AptitudeAnalytical AptitudeMCQ · 1 mark

Consider a knock-out women's badminton singles tournament where there are no ties. The loser in each game is eliminated from the tournament. Every player plays until she is defeated or remains the last undefeated player.…

2026 · CS1 - ForenoonGeneral AptitudeQuantitative AptitudeMCQ · 1 mark

A student needs to enroll for a minimum of 60 credits. A student cannot enroll for more than 70 credits. The credits are divided amongst project and three distinct sets of courses namely, core courses, specialization cou…

2026 · CS1 - ForenoonGeneral AptitudeAnalytical AptitudeMCQ · 1 mark

'When the teacher is in the room, all students stand silently.' If the above statement is true, which one of the following statements is not necessarily true?

2026 · CS1 - ForenoonGeneral AptitudeAnalytical AptitudeMCQ · 2 marks

Combinatorics deals with problems involving counting. For example, "How many distinct arrangements of N distinct objects in M spaces on a circle are possible?" is a typical problem in combinatorics. This kind of counting…

2026 · CS1 - ForenoonGeneral AptitudeAnalytical AptitudeMCQ · 2 marks

In the 2020 summer Olympics' Javelin throw finals, Neeraj Chopra exhibited a spectacular performance to win the gold medal. The silver medal was won by Jakub Vadlejch and the bronze medal was won by Vitezlav Vesely. Ther…

2026 · CS1 - ForenoonGeneral AptitudeQuantitative AptitudeMCQ · 2 marks

An unbiased six-faced dice whose faces are marked with numbers 1, 2, 3, 4, 5, and 6 is rolled twice in succession and the number on the top face is recorded each time. The probability that the number appearing in the sec…

2026 · CS1 - ForenoonEngineering MathematicsProbabilityMCQ · 1 mark

An urn contains one red ball and one blue ball. At each step, a ball is picked uniformly at random from the urn, and this ball together with another ball of the same color is put back in the urn. The probability that the…

2026 · CS1 - ForenoonEngineering MathematicsCombinatoricsMCQ · 1 mark

Consider 4 x 4 matrices with their elements from {0, 1}. The number of such matrices with even number of 1s in every row and every column is

2026 · CS1 - ForenoonEngineering MathematicsLinear AlgebraMCQ · 1 mark

For n > 1, the maximum multiplicity of any eigenvalue of an n x n matrix with elements from R is

2026 · CS1 - ForenoonComputer OrganizationCPU Architecture and Addressing ModesMCQ · 1 mark

Match each addressing mode in List I with the corresponding data element or data-structure element in List II. | List I: Addressing mode | List II: High-level-language element | | --- | --- | | P. Immediate | 1. Element…

2026 · CS1 - ForenoonComputer OrganizationCPU Architecture and Addressing ModesMCQ · 1 mark

Consider a processor P whose instruction set architecture is the load-store architecture. The instruction format is such that the first operand of any instruction is the destination operand. Which one of the following se…

2026 · CS1 - ForenoonComputer OrganizationInstruction PipeliningMCQ · 1 mark

Which one of the following dependencies among the register operands of different instructions can cause a data hazard in a pipelined processor?

2026 · CS1 - ForenoonAlgorithmsDivide and ConquerMCQ · 1 mark

Consider the following recurrence relations: for all n > 1, T1(n) = 4*T1(n/2) + T2(n), and T2(n) = 5*T2(n/4) + \(\Theta(\log_2 n)\). Assume that for all n ≤ 1, T1(n) = 1 and T2(n) = 1. Which one of the following options …

2026 · CS1 - ForenoonComputer NetworksTCP, UDP and IPMCQ · 1 mark

With respect to a TCP connection between a client and a server, which one of the following statements is true?

2026 · CS1 - ForenoonComputer NetworksRouting and Application LayerMSQ · 1 mark

Which of the following statements is/are true with respect to the interaction of a web browser with a web server using HTTP 1.1?

2026 · CS1 - ForenoonEngineering MathematicsLinear AlgebraMSQ · 1 mark

Let n > 1. Consider an n x n matrix M with its elements from R. Let the vector (0, 1, 0, 0, ..., 0) in \(R^{n}\) be in the null space of M. Which of the following options is/are always correct?

2026 · CS1 - ForenoonDigital LogicLogic Functions and MinimizationMSQ · 1 mark

Consider the following Boolean expression of a function F: F(P,Q) = (P' + Q) XOR (P'Q). Which of the following expressions is/are equivalent to F ?

2026 · CS1 - ForenoonComputer OrganizationData RepresentationMSQ · 1 mark

Consider the 8-bit signed integers X, Y and Z represented using the sign-magnitude form. The binary representations of X and Y are as follows: X: 10110100 Y: 01001100 Which of the following operations to compute Z resu…

2026 · CS1 - ForenoonProgramming & Data StructuresTreesMSQ · 1 mark

Let n be an odd number greater than 100. Consider a binary minheap with n elements stored in an array P whose index starts from 1. Which of the following indices of P do/does NOT correspond to any leaf node of the minhea…

2026 · CS1 - ForenoonProgramming & Data StructuresHashingMSQ · 1 mark

Consider a hash table P[0, 1, ..., 10] that is initially empty. The hash table is maintained using open addressing with linear probing. The hash function used is h(x) = (x + 7) mod 11. Consider the following sequence of …

2026 · CS1 - ForenoonTheory of ComputationPush Down Automata: CFL & DCFLMSQ · 1 mark

Consider the following grammar where S is the start symbol, and a and b are terminal symbols. S → aSbS | bS | ε Which of the following statements is/are true?

2026 · CS1 - ForenoonTheory of ComputationFinite Automata: Regular LanguagesMSQ · 1 mark

Let M be a nondeterministic finite automaton (NFA) with 6 states over a finite alphabet. Which of the following options CANNOT be the number of states in the minimal deterministic finite automaton (DFA) that is equivalen…

2026 · CS1 - ForenoonCompiler DesignLexical AnalysisMSQ · 1 mark

Consider the following C statements: char *str1 = "Hello; /* Statement S1 */ char *str2 = "Hello;"; /* Statement S2 */ int *str3 = "Hello"; /* Statement S3 */ Which of the following options is/are co…

2026 · CS1 - ForenoonCompiler DesignParsing TechniquesMSQ · 1 mark

Which of the following statements is/are true?

2026 · CS1 - ForenoonOperating SystemsDeadlockMSQ · 1 mark

With respect to deadlocks in an operating system, which of the following statements is/are FALSE?

2026 · CS1 - ForenoonDatabase ManagementDatabase Design: Functional Dependencies and NormalizationMSQ · 1 mark

Let P, Q, R and S be the attributes of a relation in a relational schema. Let X → Y indicate functional dependency in the context of a relational database, where X, Y are subsets of {P,Q,R,S}. Which of the following opti…

2026 · CS1 - ForenoonDatabase ManagementDatabase Design: Functional Dependencies and NormalizationMSQ · 1 mark

In the context of relational database normalization, which of the following statements is/are true?

2026 · CS1 - ForenoonEngineering MathematicsCalculusNAT · 1 mark

Consider the function f: R → R defined as follows: f(x) = c1*\(e^{x}\) - c2*loge(1/x), if x > 0 f(x) = 3, otherwise where c1, c2 are real numbers. If f is continuous at x = 0, then c1 + c2 = _________. (answer in integer…

2026 · CS1 - ForenoonProgramming & Data StructuresTreesNAT · 1 mark

The height of a binary tree is the number of edges in the longest path from the root to a leaf in the tree. The maximum possible height of a full binary tree with 23 nodes is _________. (answer in integer)

2026 · CS1 - ForenoonProgramming & Data StructuresProgrammingNAT · 1 mark

Consider the following program in C: ```c #include <stdio.h> void func(int i, int j) { if(i < j) { int i = 0; while (i < 10) { j += 2; i++; } } printf("%d", i); } int main() { int i = 9, j…

2026 · CS1 - ForenoonOperating SystemsDeadlockNAT · 1 mark

Consider a system consisting of k instances of a resource R, being shared by 5 processes. Assume that each process requires a maximum of two instances of resource R and a process can request or release only one instance …

2026 · CS1 - ForenoonComputer OrganizationData RepresentationMCQ · 2 marks

Consider the real valued variables X, Y and Z represented using the IEEE 754 single-precision floating-point format. The binary representations of X and Y in hexadecimal notation are as follows: X: 35C00000 Y: 34A00000…

2026 · CS1 - ForenoonDigital LogicSequential CircuitsMCQ · 2 marks

Consider a 2-bit saturating up/down counter that performs saturating up-count when \(P=0\) and saturating down-count when \(P=1\). Its next-state table is shown below. The counter is built as a synchronous sequential cir…

2026 · CS1 - ForenoonComputer OrganizationMemory OrganizationMCQ · 2 marks

The size of the physical address space of a processor is \(2^{32}\) bytes. The capacity of a cache memory unit is \(2^{23}\) bytes. The cache block size is 128 bytes. The cache memory unit can be built as a direct mapped…

2026 · CS1 - ForenoonProgramming & Data StructuresLinked ListMCQ · 2 marks

Consider the following code snippet in C language that computes the number of nodes in a non-empty singly linked list pointed to by the pointer variable head. ```c struct node{ int elt; struct node *next; }; int getListS…

2026 · CS1 - ForenoonProgramming & Data StructuresTreesMCQ · 2 marks

Let P be the set of all integers from 1 to 15. Consider any order of insertion of the elements of P into a binary search tree that creates a complete binary tree. Which one of the following elements can NEVER be the thir…

2026 · CS1 - ForenoonAlgorithmsGraph AlgorithmsMCQ · 2 marks

Let G(V,E) be an undirected, edge-weighted graph with integer weights. The weight of a path is the sum of the weights of the edges in that path. The length of a path is the number of edges in that path. Let s in V be a v…

2026 · CS1 - ForenoonDatabase ManagementRelational Model: Relational Algebra and Tuple CalculusMCQ · 2 marks

Consider a relational database schema with two relations R(P,Q) and S(X,Y). Let E = {<u> | there ∃ v, there ∃ w, <u,v> in R and <v,w> in S} be a tuple relational calculus expression. Which one of the following relational…

2026 · CS1 - ForenoonComputer NetworksTCP, UDP and IPMCQ · 2 marks

A TCP sender successfully establishes a connection with a TCP receiver and starts the transmission of segments. The TCP congestion control mechanism's slow-start threshold is set to 10000 segments. Assume that the round-…

2026 · CS1 - ForenoonComputer NetworksTCP, UDP and IPMCQ · 2 marks

Consider the implementation of sliding window protocol over a lossless link, with a window size of W frames, where each frame is of size 1000 bits (including header). The bandwidth of the link is 100 kbps (1k = \(10^{3}\…

2026 · CS1 - ForenoonEngineering MathematicsCalculusMSQ · 2 marks

Let f: R → R be defined as follows: f(x) = (|x|/2 - x)(x - |x|/2) Which of the following statements is/are true?

2026 · CS1 - ForenoonAlgorithmsGraph AlgorithmsMSQ · 2 marks

Let G(V,E) be a simple, undirected graph. A vertex cover of G is a subset V' subset of V such that for every (u,v) in E, u in V' or v in V'. Let the size of the smallest vertex cover in G be k. Let S be any vertex cover …

2026 · CS1 - ForenoonDigital LogicLogic Functions and MinimizationMSQ · 2 marks

Consider a Boolean function F with the following minterm expression: F(P,Q,R,S) = \(\sum m(1, 2, 3, 4, 5, 7, 10, 12, 13, 14)\) Which of the following options is/are the minimal sum-of-products expression(s) of F ?

2026 · CS1 - ForenoonAlgorithmsGraph AlgorithmsMSQ · 2 marks

Let G(V,E) be a simple, undirected, edge-weighted graph with unique edge weights. Which of the following statements about the minimum spanning trees (MST) of G is/are true?

2026 · CS1 - ForenoonAlgorithmsGraph AlgorithmsMSQ · 2 marks

Consider the following pseudocode for depth-first search (DFS) algorithm which takes a directed graph G(V,E) as input, where d[v] and f[v] are the discovery time and finishing time, respectively, of the vertex v in V. D…

2026 · CS1 - ForenoonTheory of ComputationFinite Automata: Regular LanguagesMSQ · 2 marks

Let L1 and L2 be two languages over a finite alphabet, such that L1 intersect L2 and L2 are regular languages. Which of the following statements is/are always true?

2026 · CS1 - ForenoonTheory of ComputationPush Down Automata: CFL & DCFLMSQ · 2 marks

Consider the following context-free grammar G. S → abaABAbba A → aaBBAb | bBabaa B → aBb | ab In the above grammar, S is the start symbol, a and b are terminal symbols, and A and B are non-terminal symbols. Let L(G) be t…

2026 · CS1 - ForenoonCompiler DesignParsing TechniquesMSQ · 2 marks

Consider the following two syntax-directed definitions for type declarations. | SDD1: Grammar \(G_1\) | Semantic rules | | --- | --- | | \(D \to TV\) | \(D.\mathrm{type}=T.\mathrm{type};\; V.\mathrm{type}=T.\mathrm{type…

2026 · CS1 - ForenoonOperating SystemsMemory Management and Virtual MemoryMSQ · 2 marks

Consider a system that has a cache memory unit and a memory management unit (MMU). The address input to the cache memory is a physical address. The MMU has a translation lookaside buffer (TLB). Assume that when a page is…

2026 · CS1 - ForenoonAlgorithmsGraph AlgorithmsMSQ · 2 marks

An undirected, unweighted, simple graph G(V,E) is said to be 2-colorable if there exists a function c: V → {0,1} such that for every (u,v) in E, c(u) ≠ c(v). Which of the following statements about 2-colorable graphs is/…

2026 · CS1 - ForenoonComputer NetworksTCP, UDP and IPMSQ · 2 marks

An ISP having an address block 202.16.0.0/15 assigns a block of 6000 IP addresses to a client, using the classless internet domain routing (CIDR) super-netting approach. Which of the following address blocks can be assig…

2026 · CS1 - ForenoonEngineering MathematicsCombinatoricsNAT · 2 marks

Let G be an undirected graph, which is a path on 8 vertices. The number of matchings in G is ______. (answer in integer)

2026 · CS1 - ForenoonEngineering MathematicsProbabilityNAT · 2 marks

Let X be a random variable which takes values in the set {1,2,3,4,5,6,7,8}. Further, Pr(X=1) = Pr(X=2) = Pr(X=5) = Pr(X=7) = 1/6 and Pr(X=3) = Pr(X=4) = Pr(X=6) = Pr(X=8) = 1/12. The expected value of X, denoted by E[X],…

2026 · CS1 - ForenoonOperating SystemsFile System and Device ManagementNAT · 2 marks

Consider a hard disk with a rotational speed of 15000 rpm. The time to move the read/write head from a track to its adjacent track is 1 millisecond. Initially, the head is on track 0. The number of sectors per track is 4…

2026 · CS1 - ForenoonComputer OrganizationInstruction PipeliningNAT · 2 marks

The EX stage of a pipelined processor performs the memory read operations for LOAD instructions, and the operations for the arithmetic and logic instructions. Let tEX denote the time taken by the EX stage to perform the …

2026 · CS1 - ForenoonProgramming & Data StructuresProgrammingNAT · 2 marks

Consider the recursive functions represented by the following code segment: ```c int bar(int n){ if (n == 1) return 0; else return 1 + bar(n/2); } int foo(int n){ if (n == 1) return 1; else return 1 + foo(bar(n)); } ``` …

2026 · CS1 - ForenoonProgramming & Data StructuresTreesNAT · 2 marks

The following sequence corresponds to the preorder traversal of a binary search tree T: 50, 25, 13, 40, 30, 47, 75, 60, 70, 80, 77 The position of the element 60 in the postorder traversal of T is ______. (answer in inte…

2026 · CS1 - ForenoonOperating SystemsProcess Management-INAT · 2 marks

Consider the following program snippet. Assume that the program compiles and runs successfully. Further, assume that the fork() system call is always successful in creating a process. ```c int main () { int i; for (i…

2026 · CS1 - ForenoonOperating SystemsProcess Management-INAT · 2 marks

Consider a CPU that has to execute two types of processes. The first type, Actuators (A), requires a CPU burst of 6 seconds. The second type, Controllers (C), requires a CPU burst of 8 seconds. A new process of type A ar…

2026 · CS1 - ForenoonDatabase ManagementDatabase Design: Functional Dependencies and NormalizationNAT · 2 marks

Consider a relational database schema with a relation R(A,B,C,D). If {A,B} and {A,C} are the only two candidate keys of the relation R, then the number of superkeys of relation R is ______. (answer in integer)

2026 · CS2 - AfternoonGeneral AptitudeVerbal AptitudeMCQ · 1 mark

Expedite, Hasten, Hurry, __________ Fill the blank by choosing a word with a meaning similar to that of the words given above.

2026 · CS2 - AfternoonGeneral AptitudeQuantitative AptitudeMCQ · 1 mark

A day can only be cloudy or sunny. The probability of a day being cloudy is 0.5, independent of the condition on other days. What is the probability that in any given four days, there will be three cloudy days and one su…

2026 · CS2 - AfternoonGeneral AptitudeQuantitative AptitudeMCQ · 1 mark

The values of Stock A and Stock B on a particular day are Rs. 50 and Rs. 80, respectively. An investor invests Rs. 100 in Stock A and Rs. 80 in Stock B. He sells all the stocks the next day when the value of Stock A is R…

2026 · CS2 - AfternoonGeneral AptitudeAnalytical AptitudeMCQ · 1 mark

'When it is raining, peacocks dance.' Based only on this sentence, which one of the following options is necessarily true?

2026 · CS2 - AfternoonGeneral AptitudeVerbal AptitudeMCQ · 2 marks

Water : P :: Food : Q Choose the P and Q combination from the options below to form a meaningful analogy.

2026 · CS2 - AfternoonGeneral AptitudeQuantitative AptitudeMCQ · 2 marks

An unbiased six-faced dice whose faces are marked with numbers 1, 2, 3, 4, 5, and 6 is rolled twice in succession and the number on the top face is recorded each time. The probability that the sum of the two recorded num…

2026 · CS2 - AfternoonEngineering MathematicsDiscrete MathematicsMCQ · 1 mark

For two different persons x and y, the predicate M(x, y) denotes that x knows y. Consider the following statement. There is a person who does not know anyone else, but that person is known by everyone else. Which one of …

2026 · CS2 - AfternoonProgramming & Data StructuresTreesMCQ · 1 mark

The set T represents various traversals over binary tree. The set S represents the order of visiting nodes during a traversal. T: I: Inorder, II: Preorder, III: Postorder S: L: left subtree, node, right subtree; M: node,…

2026 · CS2 - AfternoonTheory of ComputationTuring Machine: RE, REC and UndecidabilityMCQ · 1 mark

Which one of the following statements is equivalent to the following assertion? Turing machine M decides the language L subset of {0,1}*

2026 · CS2 - AfternoonEngineering MathematicsProbabilityMCQ · 1 mark

The probability density function f(x) of a random variable X which takes real values is f(x) = (1 / (3*\(\sqrt{2*\pi}\))) * exp(-\(x^{2}\)/18), x in (-∞, +∞) Which one of the following statements is correct about the ra…

2026 · CS2 - AfternoonDatabase ManagementER-ModelMCQ · 1 mark

In the context of DBMS, consider the two sets T and S given below. T: I: Logical schema, II: Physical schema, III: External schema S: L: Views, M: File organization and indexes, N: Relations Which one of the following is…

2026 · CS2 - AfternoonDigital LogicLogic Functions and MinimizationMCQ · 1 mark

Which one of the following options is not a property of Boolean Algebra? Note: + is OR operation, . is AND operation, and ' is NOT operation

2026 · CS2 - AfternoonProgramming & Data StructuresProgrammingMCQ · 1 mark

In C runtime environment, which one of the following is stored in heap?

2026 · CS2 - AfternoonComputer OrganizationIO OrganizationMCQ · 1 mark

Consider the following two statements about interrupt handling mechanisms in a CPU. S1: In non-vectored interrupt mechanism, it usually takes more time to start the Interrupt Service Routine (ISR) when compared to that i…

2026 · CS2 - AfternoonProgramming & Data StructuresProgrammingMCQ · 1 mark

Consider the following three ANSI-C programs, P1, P2, and P3. P1: ```c #include <stdio.h> int a=5; int main(){ int a=7; return(0); } P2: #include <stdio.h> int main(){ int a=5; int a=7; return(0); } P3: #incl…

2026 · CS2 - AfternoonDatabase ManagementTransactions and Concurrency ControlMCQ · 1 mark

Consider concurrent execution of two transactions T1 and T2 in a DBMS, both of which access a data object A. For these two transactions to not conflict on A, which one of the following statements must be true?

2026 · CS2 - AfternoonComputer NetworksNetwork PerformanceMCQ · 1 mark

Consider a file of size 4 million bytes being transferred between two hosts connected via a path consisting of three consecutive links of bandwidth 2 Mbps, 500 kbps, and 1 Mbps, respectively. All processing delays and pr…

2026 · CS2 - AfternoonComputer NetworksRouting and Application LayerMCQ · 1 mark

Which one of the following protocols may need to broadcast some of its messages?

2026 · CS2 - AfternoonOperating SystemsProcess Management-IMCQ · 1 mark

Which one of the following CPU scheduling algorithms cannot be preemptive?

2026 · CS2 - AfternoonAlgorithmsAlgorithm Analysis and Asymptotic NotationsMCQ · 1 mark

Consider the following functions, where n is a positive integer. n^(1/3), log(n), log(n!), 2^(log(n)) Which one of the following options lists the functions in increasing order of asymptotic growth rate? Note: Assume the…

2026 · CS2 - AfternoonAlgorithmsAlgorithm Analysis and Asymptotic NotationsMSQ · 1 mark

Which of the following can be recurrence relation(s) corresponding to an algorithm with time complexity \(\Theta(n)\)?

2026 · CS2 - AfternoonEngineering MathematicsDiscrete MathematicsMSQ · 1 mark

Let R be a binary relation on the set {1, 2, ..., 10}, where (x,y) in R if the product of x and y is square of an integer. Which of the following properties is/are satisfied by R?

2026 · CS2 - AfternoonEngineering MathematicsCalculusMSQ · 1 mark

For a real number a, let I(a) = integral from -1 to 1 of (\(3x^{2}\) - a*x + 1) dx. Which of the following statements is/are true?

2026 · CS2 - AfternoonComputer OrganizationData RepresentationMSQ · 1 mark

In a system, numbers are represented using 4-bit two's complement form. Consider four numbers N1=1011, N2=1101, N3=1010 and N4=1001 in the system. Which of the following operations will result in arithmetic overflow?

2026 · CS2 - AfternoonTheory of ComputationPush Down Automata: CFL & DCFLMSQ · 1 mark

Which of the following grammars is/are ambiguous?

2026 · CS2 - AfternoonProgramming & Data StructuresHashingNAT · 1 mark

The keys 5, 28, 19, 15, 26, 33, 12, 17, 10 are inserted into a hash table using the hash function h(k) = k mod 9. The collisions are resolved by chaining. After all the keys are inserted, the length of the longest chain …

2026 · CS2 - AfternoonEngineering MathematicsLinear AlgebraNAT · 1 mark

Consider the system of linear equations given below. ax + y = b 16x + ay = 24 Suppose the values of a and b are chosen such that the system of linear equations produce multiple solutions. Then the product of a and b is _…

2026 · CS2 - AfternoonAlgorithmsSortingNAT · 1 mark

Consider an array A = [10, 7, 8, 19, 41, 35, 25, 31]. Suppose the merge sort algorithm is executed on array A to sort it in increasing order. The merge sort algorithm will carry out a total of 7 merge operations. A merge…

2026 · CS2 - AfternoonComputer NetworksTCP, UDP and IPNAT · 1 mark

If an IP network uses a subnet mask of 255.255.240.0, the maximum number of IP addresses that can be assigned to network interfaces is __________. (answer in integer)

2026 · CS2 - AfternoonComputer OrganizationData RepresentationNAT · 1 mark

The 32-bit IEEE 754 single precision representation of a number is 0xC2710000. The number in decimal representation is ________. (rounded off to two decimal places)

2026 · CS2 - AfternoonCompiler DesignLexical AnalysisNAT · 1 mark

A lexical analyzer uses the following token definitions letter → [A-Za-z] digit → [0-9] id → letter (letter | digit)* number → digit+ ws → (blank | tab | newline)+ For the string given below, x1 23mm 78 y 7z zz5 14A 8H A…

2026 · CS2 - AfternoonAlgorithmsGraph AlgorithmsMCQ · 2 marks

Consider a complete graph Kn with n vertices (n > 4). Note that multiple spanning trees can be constructed over Kn. Each of these spanning trees is represented as a set of edges. The Jaccard coefficient between any two s…

2026 · CS2 - AfternoonAlgorithmsGraph AlgorithmsMCQ · 2 marks

Let G be a weighted directed acyclic graph with m edges and n vertices. Given G and a source vertex s in G, which one of the following options gives the worst case time complexity of the fastest algorithm to find the len…

2026 · CS2 - AfternoonAlgorithmsAlgorithm Analysis and Asymptotic NotationsMCQ · 2 marks

Consider an array A of integers of size n. The indices of A run from 1 to n. An algorithm is to be designed to check whether A satisfies the condition given below. For all i,j in {1,...,n-1} such that i > j, (A[i+1] - A[…

2026 · CS2 - AfternoonAlgorithmsDynamic ProgrammingMCQ · 2 marks

Consider a table T, where the elements T[i][j], 0 ≤ i,j ≤ n, represent the cost of the optimal solutions of different subproblems of a problem that is being solved using a dynamic programming algorithm. The recursive for…

2026 · CS2 - AfternoonDigital LogicLogic Functions and MinimizationMCQ · 2 marks

Consider the following 4-variable Boolean function F(A,B,C,D) = \(\sum m(0,1,2,3,8,9,10,11)\) Consider A as MSB, D as LSB. Which one of the following options represents the minimal sum of products form for the above func…

2026 · CS2 - AfternoonCompiler DesignParsing TechniquesMCQ · 2 marks

Consider the canonical LR(0) parsing of the grammar below using terminals {a,b,c} and non-terminals {A,B,C,S} with S as the start symbol. S → ACB A → aA | ε C → cC | ε B → bB | b Which one of the following options gives …

2026 · CS2 - AfternoonDatabase ManagementDatabase Design: Functional Dependencies and NormalizationMCQ · 2 marks

In the context of schema normalization in relational DBMS, consider a set F of functional dependencies. The set of all functional dependencies implied by F is called the closure of F. To compute the closure of F, Armstro…

2026 · CS2 - AfternoonComputer NetworksISO/OSI Stack and SWPMCQ · 2 marks

Consider the transmission of data bits 110001011 over a link that uses Cyclic Redundancy Check (CRC) code for error detection. If the generator bit pattern is given to be 1001, which one of the following options shows th…

2026 · CS2 - AfternoonComputer OrganizationCPU Architecture and Addressing ModesMCQ · 2 marks

Consider a processor that has 16 general purpose registers and it uses 2-byte instruction format for all its instructions. Variable-sized opcodes are permitted. There are three different types of instructions; M-type, R-…

2026 · CS2 - AfternoonDatabase ManagementIndexingMCQ · 2 marks

An index in a DBMS is said to be dense if an index entry appears for every search-key value in the indexed file. Otherwise it is called a sparse index. Consider the following two statements. S1: A hash index must be a de…

2026 · CS2 - AfternoonTheory of ComputationPush Down Automata: CFL & DCFLMSQ · 2 marks

Let Σ = {a,b,c,d} and let L = {\(a^{i}\) \(b^{j}\) \(c^{k}\) \(d^{l}\) | i,j,k,l ≥ 0}. Which of the following constraints ensure(s) that the language L is context-free?

2026 · CS2 - AfternoonProgramming & Data StructuresTreesMSQ · 2 marks

Consider a binary search tree (BST) with n leaf nodes (n > 0). Given any node V, the key present in the node is denoted as Val(V). All the keys present in the given BST are distinct. The keys belong to the set of real nu…

2026 · CS2 - AfternoonProgramming & Data StructuresStacks & QueuesMSQ · 2 marks

Consider a stack S and a queue Q. Both of them are initially empty and have the capacity to store ten elements each. The elements 1, 2, 3, 4, and 5 arrive one by one, in that order. When an element arrives, it is assigne…

2026 · CS2 - AfternoonOperating SystemsProcess Management-IIMSQ · 2 marks

Consider three processes P1, P2, and P3 running identical code, as shown in the pseudocode below. A and B are two binary semaphores initialized to 1 and 0, respectively. X is a shared variable initialized to 0. Each line…

2026 · CS2 - AfternoonComputer OrganizationMemory OrganizationMSQ · 2 marks

Consider a system with a processor and a 4 KB direct mapped cache with block size of 16 bytes. The system has a 16 MB physical memory. Four words P, Q, R, and S are accessed by the processor in the same order 10 times. T…

2026 · CS2 - AfternoonOperating SystemsFile System and Device ManagementNAT · 2 marks

To keep track of free blocks in a file system, one of the two approaches is generally used - using bitmaps (bit vectors) or using linked lists. Consider that the linked list approach is used to keep track of free blocks …

2026 · CS2 - AfternoonOperating SystemsMemory Management and Virtual MemoryNAT · 2 marks

A system has a Translation Lookaside Buffer (TLB) that has a reach of 1 MB. TLB reach is defined as the total amount of physical memory that can be accessed through the TLB entries. The paging system uses pages of size 4…

2026 · CS2 - AfternoonOperating SystemsMemory Management and Virtual MemoryNAT · 2 marks

Consider contiguous allocation of physical memory to processes using variable partitioning scheme. Suppose there are 8 holes in the memory of sizes 20 KB, 4 KB, 25 KB, 18 KB, 7 KB, 9 KB, 15 KB, and 12 KB. Assume that no …

2026 · CS2 - AfternoonComputer OrganizationMemory OrganizationNAT · 2 marks

Consider a system with 1 MB physical memory and a word length of 1 byte. The system uses a direct mapped cache, with block numbers starting from 0. The word with physical address 0xA2C28 is mapped to the cache block numb…

2026 · CS2 - AfternoonComputer OrganizationInstruction PipeliningNAT · 2 marks

A non-pipelined instruction execution unit that operates at 1.6 GHz clock takes an average of 5 clock cycles to complete the execution of an instruction. To improve the performance, the system was pipelined with a goal o…

2026 · CS2 - AfternoonComputer NetworksTCP, UDP and IPNAT · 2 marks

Consider a new TCP connection between a sender and a receiver. The receiver advertised window is constant at 48 KB, the maximum segment size (MSS) is 2 KB, and the slow start threshold for TCP congestion control is 16 KB…

2026 · CS2 - AfternoonProgramming & Data StructuresProgrammingNAT · 2 marks

Consider the following ANSI-C program. ```c #include <stdio.h> int main(){ int *ptr, a, b, c; a=5; b=11; c=20; ptr=&a; *ptr=c; ptr=&c; a=*(&b); c=*ptr-a; printf("%d",c); return(0); } ``` The output of this pr…

2026 · CS2 - AfternoonProgramming & Data StructuresProgrammingNAT · 2 marks

Consider the following ANSI-C function. ```c int func(int start, int end){ int length=end+1-start; if((length<1)||(start<0)||(end<0)){ return(0); } if(length%3==0){ return(func(start+1, end)); } else if(lengt…

2026 · CS2 - AfternoonEngineering MathematicsLinear AlgebraNAT · 2 marks

The determinant of a 4 x 4 matrix A is 3. The value of the determinant of 2A is ____________. (answer in integer)

2026 · CS2 - AfternoonEngineering MathematicsProbabilityNAT · 2 marks

Suppose an unbiased coin is tossed 6 times. Each coin toss is independent of all previous coin tosses. Let E1 be the event that among the second, fourth, and sixth coin tosses, there are at least two heads. Let E2 be the…

2026 · CS2 - AfternoonEngineering MathematicsCalculusNAT · 2 marks

Consider a function f: (0,1) → {0,1} defined as follows. For a real number r in (0,1), f(r) = 1 if the second digit after the decimal point in r is one of the four digits 2, 3, 6 and 7. Otherwise, f(r) is equal to 0. The…

2026 · CS2 - AfternoonComputer NetworksNetwork PerformanceNAT · 2 marks

It is necessary to design a link-layer protocol between two hosts that are directly connected over a lossless link of length 3000 kilometers. Assume that the link bandwidth is \(10^{8}\) bits per second and that the prop…

2026 · CS1 - ForenoonGeneral AptitudeAnalytical AptitudeMCQ · 1 mark

The figure shows two 4-tile patterns. Either one or both of the patterns can be used any number of times and in any orientation to construct a new pattern. Which one of the options below cannot be constructed by using on…

2026 · CS1 - ForenoonGeneral AptitudeAnalytical AptitudeMCQ · 2 marks

In Panel I of the figure below, the front view and top view of a structure are shown. Which one of the 3D structures shown in Panel II possesses the views shown in Panel I?

2026 · CS1 - ForenoonGeneral AptitudeQuantitative AptitudeMCQ · 2 marks

For positive real numbers S and K, the function H_K(S) is defined as: H_K(S) = max(S-K, 0). The max function is defined as: max(a,b) = a when a > b, b when a <= b. The graph below shows the plot of a function N(S) versus…

2026 · CS1 - ForenoonCompiler DesignCode Generation and OptimizationMCQ · 2 marks

Consider the control flow graph shown in the figure. Which one of the following options correctly lists the set of redundant expressions (common subexpressions) in the basic blocks B4 and B5? Note: All the variables are …

2026 · CS2 - AfternoonGeneral AptitudeAnalytical AptitudeMCQ · 1 mark

A black square PQRS has been cut into two parts. One part of it is shown in Panel I. Which one of the shapes in Panel II is the other part?

2026 · CS2 - AfternoonGeneral AptitudeAnalytical AptitudeMCQ · 2 marks

Two tiles are missing in Panel I. Which one of the options in Panel II is the appropriate choice for the missing tiles?

2026 · CS2 - AfternoonGeneral AptitudeAnalytical AptitudeMCQ · 2 marks

Figures (i) and (ii) represent intercity highway systems. The black dots represent cities and the line segments between them represent intercity highways. A salesperson needs to make a trip. She needs to start from a cit…

2026 · CS2 - AfternoonGeneral AptitudeAnalytical AptitudeMCQ · 2 marks

The figure in Panel I below is a grid of cells with four rows and four columns. The numbers on the top and on the left represent the number of cells that are to be shaded in that column and row, respectively. Which one o…

2026 · CS2 - AfternoonCompiler DesignCode Generation and OptimizationMCQ · 2 marks

Consider the control flow graph given below. Which one of the following options is the set of live variables at the exit point of each basic block?

2026 · CS2 - AfternoonTheory of ComputationFinite Automata: Regular LanguagesMSQ · 2 marks

Consider the following two finite automata D1 and D2. Which of the following statements is/are true?

2026 · CS2 - AfternoonDigital LogicCombinational CircuitsNAT · 2 marks

Consider the digital circuit shown below with two input lines A and B, two select lines S0 and S1, and an output line Y. The blocks Q and M represent active high 2:4 decoder and 4-to-1 multiplexer, respectively. Out of 1…

2025 · CS1 - ForenoonGeneral AptitudeVerbal AptitudeMCQ · 1 mark

Ravi had ______ younger brother who taught at ______ university. He was widely regarded as ______ honorable man. Select the option with the correct sequence of articles to fill in the blanks.

2025 · CS1 - ForenoonGeneral AptitudeVerbal AptitudeMCQ · 1 mark

The CEO's decision to downsize the workforce was considered myopic because it sacrificed long-term stability to accommodate short-term gains. Select the most appropriate option that can replace the word "myopic" without …

2025 · CS1 - ForenoonGeneral AptitudeQuantitative AptitudeMCQ · 1 mark

The average marks obtained by a class in an examination were calculated as 30.8. However, while checking the marks entered, the teacher found that the marks of one student were entered incorrectly as 24 instead of 42. Af…

2025 · CS1 - ForenoonGeneral AptitudeAnalytical AptitudeMCQ · 1 mark

Consider the relationships among P, Q, R, S, and T: - P is the brother of Q. - S is the daughter of Q. - T is the sister of S. - R is the mother of Q. The following statements are made based on the relationships given ab…

2025 · CS1 - ForenoonGeneral AptitudeVerbal AptitudeMCQ · 2 marks

"I put the brown paper in my pocket along with the chalks, and possibly other things. I suppose every one must have reflected how primeval and how poetical are the things that one carries in one's pocket: the pocket-knif…

2025 · CS1 - ForenoonGeneral AptitudeQuantitative AptitudeMCQ · 2 marks

A fair six-faced dice, with the faces labelled '1', '2', '3', '4', '5', and '6', is rolled thrice. What is the probability of rolling '6' exactly once?

2025 · CS1 - ForenoonGeneral AptitudeQuantitative AptitudeMCQ · 2 marks

A shop has 4 distinct flavors of ice-cream. One can purchase any number of scoops of any flavor. The order in which the scoops are purchased is inconsequential. If one wants to purchase 3 scoops of ice-cream, in how many…

2025 · CS1 - ForenoonComputer OrganizationIO OrganizationMCQ · 1 mark

Suppose a program is running on a non-pipelined single processor computer system. The computer is connected to an external device that can interrupt the processor asynchronously. The processor needs to execute the interr…

2025 · CS1 - ForenoonCompiler DesignParsing TechniquesMCQ · 1 mark

Which ONE of the following statements is FALSE regarding the symbol table?

2025 · CS1 - ForenoonCompiler DesignCode Generation and OptimizationMCQ · 1 mark

Which ONE of the following techniques used in compiler code optimization uses live variable analysis?

2025 · CS1 - ForenoonOperating SystemsMemory Management and Virtual MemoryMCQ · 1 mark

Consider a demand paging memory management system with 32-bit logical address, 20-bit physical address, and page size of 2048 bytes. Assuming that the memory is byte addressable, what is the maximum number of entries in …

2025 · CS1 - ForenoonDatabase ManagementTransactions and Concurrency ControlMCQ · 1 mark

A schedule of three database transactions T1, T2, and T3 is shown. Ri(A) and Wi(A) denote read and write of data item A by transaction Ti, i = 1,2,3. The transaction T1 aborts at the end. Which other transaction(s) will …

2025 · CS1 - ForenoonComputer NetworksISO/OSI Stack and SWPMCQ · 1 mark

Identify the ONE CORRECT matching between the OSI layers and their corresponding functionalities as shown. OSI Layers: (a) Network layer, (b) Transport layer, (c) Datalink layer Functionalities: (I) Packet routing, (II) …

2025 · CS1 - ForenoonEngineering MathematicsDiscrete MathematicsMCQ · 1 mark

g(.) is a function from A to B, f(.) is a function from B to C, and their composition defined as f(g(.)) is a mapping from A to C. If f(.) and f(g(.)) are onto (surjective) functions, which ONE of the following is TRUE a…

2025 · CS1 - ForenoonAlgorithmsGraph AlgorithmsMCQ · 1 mark

Let G be any undirected graph with positive edge weights, and T be a minimum spanning tree of G. For any two vertices, u and v, let d1(u,v) and d2(u,v) be the shortest distances between u and v in G and T, respectively. …

2025 · CS1 - ForenoonTheory of ComputationPush Down Automata: CFL & DCFLMCQ · 1 mark

Consider the following context-free grammar G, where S, A, and B are the variables (non-terminals), a and b are the terminal symbols, S is the start variable, and the rules of G are described as: S → aaB | Abb A → a | aA…

2025 · CS1 - ForenoonAlgorithmsAlgorithm Analysis and Asymptotic NotationsMCQ · 1 mark

Consider the following recurrence relation: T(n) = 2T(n-1) + n*\(2^{n}\) for n > 0, T(0) = 1. Which ONE of the following options is CORRECT?

2025 · CS1 - ForenoonDatabase ManagementTransactions and Concurrency ControlMSQ · 1 mark

Consider the 3-way handshaking protocol for TCP connection establishment. Let the three packets exchanged during the connection establishment be denoted as P1, P2, and P3, in order. Which of the following option(s) is/ar…

2025 · CS1 - ForenoonEngineering MathematicsLinear AlgebraMSQ · 1 mark

Consider the given system of linear equations for variables x and y, where k is a real-valued constant. Which of the following option(s) is/are CORRECT? x + ky = 1 kx + y = -1

2025 · CS1 - ForenoonDigital LogicLogic Functions and MinimizationMSQ · 1 mark

Let X be a 3-variable Boolean function that produces output as '1' when at least two of the input variables are '1'. Which of the following statement(s) is/are CORRECT, where a,b,c,d,e are Boolean variables?

2025 · CS1 - ForenoonComputer OrganizationData RepresentationMSQ · 1 mark

The number -6 can be represented as 1010 in 4-bit 2's complement representation. Which of the following is/are CORRECT 2's complement representation(s) of -6?

2025 · CS1 - ForenoonProgramming & Data StructuresTreesMSQ · 1 mark

Which of the following statement(s) is/are TRUE for any binary search tree (BST) having n distinct integers?

2025 · CS1 - ForenoonTheory of ComputationFinite Automata: Regular LanguagesMSQ · 1 mark

A regular language L is accepted by a non-deterministic finite automaton (NFA) with n states. Which of the following statement(s) is/are FALSE?

2025 · CS1 - ForenoonOperating SystemsProcess Management-INAT · 1 mark

Suppose in a multiprogramming environment, the following C program segment is executed. A process goes into I/O queue whenever an I/O related operation is performed. Assume that there will always be a context switch when…

2025 · CS1 - ForenoonEngineering MathematicsCombinatoricsNAT · 1 mark

Let S be the set of all ternary strings defined over the alphabet {a,b,c}. Consider all strings in S that contain at least one occurrence of two consecutive symbols, that is, "aa", "bb" or "cc". The number of such string…

2025 · CS1 - ForenoonEngineering MathematicsCalculusNAT · 1 mark

Consider the given function f(x). f(x) = ax + b for x < 1 f(x) = \(x^{3}\) + \(x^{2}\) + 1 for x ≥ 1 If the function is differentiable everywhere, the value of b must be ________. (rounded off to one decimal place)

2025 · CS1 - ForenoonEngineering MathematicsProbabilityNAT · 1 mark

A box contains 5 coins: 4 regular coins and 1 fake coin. When a regular coin is tossed, the probability P(head) = 0.5 and for a fake coin, P(head) = 1. You pick a coin at random and toss it twice, and get two heads. The …

2025 · CS1 - ForenoonAlgorithmsSortingNAT · 1 mark

The pseudocode of a function fun() is given below: ```text fun(int A[0,...,n-1]){ for i=0 to n-2 for j=0 to n-i-2 if (A[j]>A[j+1]) then swap A[j] and A[j+1] } ``` Let A[0,...,29] be an array storing 3…

2025 · CS1 - ForenoonProgramming & Data StructuresProgrammingNAT · 1 mark

```c #include <stdio.h> void foo(int *p, int x){ *p=x; } int main(){ int *z; int a = 20, b = 25; z = &a; foo(z,b); printf("%d",a); return 0; } ``` The output of the given C program is __________. (Answer in…

2025 · CS1 - ForenoonProgramming & Data StructuresTreesNAT · 1 mark

The height of any rooted tree is defined as the maximum number of edges in the path from the root node to any leaf node. Suppose a Min-Heap T stores 32 keys. The height of T is _____________. (Answer in integer)

2025 · CS1 - ForenoonComputer OrganizationMemory OrganizationMCQ · 2 marks

Consider a memory system with 1M bytes of main memory and 16K bytes of cache memory. Assume that the processor generates 20-bit memory address, and the cache block size is 16 bytes. If the cache uses direct mapping, how …

2025 · CS1 - ForenoonComputer OrganizationCPU Architecture and Addressing ModesMCQ · 2 marks

A processor has 64 general-purpose registers and 50 distinct instruction types. An instruction is encoded in 32-bits. What is the maximum number of bits that can be used to store the immediate operand for the given instr…

2025 · CS1 - ForenoonOperating SystemsProcess Management-IMCQ · 2 marks

A computer has two processors, M1 and M2. Four processes P1, P2, P3, P4 with CPU bursts of 20, 16, 25, and 10 milliseconds, respectively, arrive at the same time and these are the only processes in the system. The schedu…

2025 · CS1 - ForenoonDatabase ManagementRelational Model: Relational Algebra and Tuple CalculusMCQ · 2 marks

Consider two relations describing teams and players in a sports league: - teams(tid,tname): tid, tname are team-id and team-name, respectively - players(pid, pname, tid): pid, pname, and tid denote player-id, player-name…

2025 · CS1 - ForenoonComputer NetworksTCP, UDP and IPMCQ · 2 marks

A packet with the destination IP address 145.36.109.70 arrives at a router whose routing table is shown. Which interface will the packet be forwarded to? Subnet Address | Subnet Mask (CIDR) | Interface | --- | --- | --- …

2025 · CS1 - ForenoonEngineering MathematicsLinear AlgebraMCQ · 2 marks

Let A be a 2x2 matrix as given. A = \[\begin{bmatrix}1 & 1\\1 & -1\end{bmatrix}\] What are the eigenvalues of the matrix \(A^{13}\) ?

2025 · CS1 - ForenoonDigital LogicLogic Functions and MinimizationMCQ · 2 marks

Consider the following four variable Boolean function in sum-of-product form F(b3,b2,b1,b0) = \(\sum m(0, 2, 4, 8, 10, 11, 12)\). where the value of the function is computed by considering b3b2b1b0 as a 4-bit binary numb…

2025 · CS1 - ForenoonAlgorithmsGraph AlgorithmsMCQ · 2 marks

Let G(V,E) be an undirected and unweighted graph with 100 vertices. Let d(u,v) denote the number of edges in a shortest path between vertices u and v in V. Let the maximum value of d(u,v), u,v in V such that u ≠ v, be 30…

2025 · CS1 - ForenoonTheory of ComputationFinite Automata: Regular LanguagesMCQ · 2 marks

Consider the following two languages over the alphabet {a,b}: L1 = { α β α | α in {a,b}+ AND β in {a,b}+ } L2 = { α β α | α in {a}+ AND β in {a,b}+ } Which ONE of the following statements is CORRECT?

2025 · CS1 - ForenoonTheory of ComputationPush Down Automata: CFL & DCFLMCQ · 2 marks

Consider the following two languages over the alphabet {a,b,c}, where m and n are natural numbers. L1 = {\(a^{m}\) \(b^{m}\) c^(m+n) | m,n ≥ 1} L2 = {\(a^{m}\) \(b^{n}\) c^(m+n) | m,n ≥ 1} Which ONE of the following stat…

2025 · CS1 - ForenoonCompiler DesignParsing TechniquesMSQ · 2 marks

Which of the following statement(s) is/are TRUE while computing First and Follow during top down parsing by a compiler?

2025 · CS1 - ForenoonDatabase ManagementDatabase Design: Functional Dependencies and NormalizationMSQ · 2 marks

Consider a relational schema team(name, city, owner), with functional dependencies {name → city, name → owner}. The relation team is decomposed into two relations, t1(name,city) and t2(name,owner). Which of the following…

2025 · CS1 - ForenoonEngineering MathematicsDiscrete MathematicsMSQ · 2 marks

Which of the following predicate logic formulae/formula is/are CORRECT representation(s) of the statement: "Everyone has exactly one mother"? The meanings of the predicates used are: - mother(y,x): y is the mother of x -…

2025 · CS1 - ForenoonEngineering MathematicsDiscrete MathematicsMSQ · 2 marks

A = {0,1,2,3,...} is the set of non-negative integers. Let F be the set of functions from A to itself. For any two functions, f1,f2 in F, we define (f1 (dot) f2)(n) = f1(n) + f2(n) for every number n in A. Which of the f…

2025 · CS1 - ForenoonOperating SystemsFile System and Device ManagementNAT · 2 marks

A disk of size 512M bytes is divided into blocks of 64K bytes. A file is stored in the disk using linked allocation. In linked allocation, each data block reserves 4 bytes to store the pointer to the next data block. The…

2025 · CS1 - ForenoonCompiler DesignCode Generation and OptimizationNAT · 2 marks

Refer to the given 3-address code sequence. This code sequence is split into basic blocks. The number of basic blocks is ________. (Answer in integer) 1001: i = 1 1002: j = 1 1003: t1 = 10*i 1004: t2 = t1+j 1005: t3 = 8*…

2025 · CS1 - ForenoonComputer OrganizationMemory OrganizationNAT · 2 marks

A computer has a memory hierarchy consisting of two-level cache (L1 and L2) and a main memory. If the processor needs to access data from memory, it first looks into L1 cache. If the data is not found in L1 cache, it goe…

2025 · CS1 - ForenoonOperating SystemsMemory Management and Virtual MemoryNAT · 2 marks

In optimal page replacement algorithm, information about all future page references is available to the operating system (OS). A modification of the optimal page replacement algorithm is as follows: The OS correctly pred…

2025 · CS1 - ForenoonDatabase ManagementStructured Query Language (SQL)NAT · 2 marks

Consider the following database tables of a sports league. player(pid,pname,age) coach(cid,cname) team(tid,tname,city,cid) members(pid,tid) An instance of the tables: player: (1,Jasprit,31) (2,Atharva,24) (3,Ishan,26)…

2025 · CS1 - ForenoonEngineering MathematicsProbabilityNAT · 2 marks

Suppose a 5-bit message is transmitted from a source to a destination through a noisy channel. The probability that a bit of the message gets flipped during transmission is 0.01. Flipping of each bit is independent of on…

2025 · CS1 - ForenoonComputer NetworksTCP, UDP and IPNAT · 2 marks

Suppose a message of size 15000 bytes is transmitted from a source to a destination using IPv4 protocol via two routers. Router-1 has MTU=5000 bytes, Router-2 has MTU=3000 bytes, both including IP header. The number of f…

2025 · CS1 - ForenoonEngineering MathematicsProbabilityNAT · 2 marks

Consider a probability distribution given by the density function P(x). P(x) = C*\(x^{2}\), for 1 ≤ x ≤ 4; P(x) = 0, for x < 1 or x > 4 The probability that x lies between 2 and 3, i.e., P(2 ≤ x ≤ 3) is __________. (roun…

2025 · CS1 - ForenoonDigital LogicSequential CircuitsNAT · 2 marks

Consider a finite state machine (FSM) with one input X and one output f, represented by the given state transition table. The minimum number of states required to realize this FSM is ________. (Answer in integer) State: …

2025 · CS1 - ForenoonProgramming & Data StructuresProgrammingNAT · 2 marks

```c #include <stdio.h> int foo(int S[],int size){ if(size == 0) return 0; if(size == 1) return 1; if(S[0] ≠ S[1]) return 1+foo(S+1,size-1); return foo(S+1,size-1); } int main(){ int A[]={0,1,2,2,2,0,0,1,1}; …

2025 · CS1 - ForenoonProgramming & Data StructuresLinked ListNAT · 2 marks

Let LIST be a datatype for an implementation of linked list defined as follows: ```c typedef struct list { int data; struct list *next; } LIST; Suppose a program has created two linked lists, L1 and L2. L1 contains 9…

2025 · CS1 - ForenoonProgramming & Data StructuresProgrammingNAT · 2 marks

```c #include <stdio.h> int gate (int n) { int d, t, newnum, turn; newnum = turn = 0; t=1; while (n≥t) t *= 10; t /=10; while (t>0) { d = n/t; n = n%t; t /= 10; if (turn) newnum = 10*newnum + d;…

2025 · CS1 - ForenoonProgramming & Data StructuresHashingNAT · 2 marks

In a double hashing scheme, h1(k) = k mod 11 and h2(k) = 1 + (k mod 7) are the auxiliary hash functions. The size m of the hash table is 11. The hash function for the i-th probe in the open address table is [h1(k) + i*h2…

2025 · CS2 - AfternoonGeneral AptitudeVerbal AptitudeMCQ · 1 mark

Despite his initial hesitation, Rehman's _________ to contribute to the success of the project never wavered. Select the most appropriate option to complete the above sentence.

2025 · CS2 - AfternoonGeneral AptitudeVerbal AptitudeMCQ · 1 mark

Bird : Nest :: Bee : _______ Select the correct option to complete the analogy.

2025 · CS2 - AfternoonGeneral AptitudeQuantitative AptitudeMCQ · 1 mark

If P*\(e^{x}\) = Q*e^(-x) for all real values of x, which one of the following statements is true?

2025 · CS2 - AfternoonGeneral AptitudeQuantitative AptitudeMCQ · 1 mark

Let p1 and p2 denote two arbitrary prime numbers. Which one of the following statements is correct for all values of p1 and p2?

2025 · CS2 - AfternoonGeneral AptitudeAnalytical AptitudeMCQ · 2 marks

Based only on the conversation below, identify the logically correct inference: "Even if I had known that you were in the hospital, I would not have gone there to see you", Ramya told Josephine.

2025 · CS2 - AfternoonGeneral AptitudeAnalytical AptitudeMCQ · 2 marks

If IMAGE and FIELD are coded as FHBNJ and EMFJG respectively then, which one among the given options is the most appropriate code for BEACH?

2025 · CS2 - AfternoonGeneral AptitudeQuantitative AptitudeMCQ · 2 marks

Which one of the following options is correct for the given data in the table? Iteration (i): 0, 1, 2, 3 Input (I): 20, -4, 10, 15 Output (X): 20, 16, 26, 41 Output (Y): 20, -80, -800, -12000

2025 · CS2 - AfternoonEngineering MathematicsLinear AlgebraMCQ · 1 mark

If A = \[\begin{bmatrix}1 & 2\\2 & -1\end{bmatrix}\], then which ONE of the following is \(A^{8}\)?

2025 · CS2 - AfternoonEngineering MathematicsCalculusMCQ · 1 mark

The value of x such that x > 1, satisfying the equation integral from 1 to x of (t ln t) dt = 1/4 is

2025 · CS2 - AfternoonProgramming & Data StructuresTreesMCQ · 1 mark

Consider a binary tree T in which every node has either zero or two children. Let n > 0 be the number of nodes in T. Which ONE of the following is the number of nodes in T that have exactly two children?

2025 · CS2 - AfternoonEngineering MathematicsLinear AlgebraMCQ · 1 mark

Let L, M, and N be non-singular matrices of order 3 satisfying the equations \(L^{2}\) = \(L^{-1}\), M = \(L^{8}\) and N = \(L^{2}\). Which ONE of the following is the value of the determinant of (M - N)?

2025 · CS2 - AfternoonEngineering MathematicsDiscrete MathematicsMCQ · 1 mark

Let P(x) be an arbitrary predicate over the domain of natural numbers. Which ONE of the following statements is TRUE?

2025 · CS2 - AfternoonComputer NetworksTCP, UDP and IPMCQ · 1 mark

Consider the following two statements. (i) Address Resolution Protocol (ARP) provides a mapping from an IP address to the corresponding hardware (link-layer) address. (ii) A single TCP segment from a sender S to a receiv…