Let G = (V, E) be a weighted undirected graph and let T be a Minimum Spanning Tree (MST) of G maintained using adjacency

Consider a graph G = (V, E), where V = {v1, v2, ...., v100}, E = {(vi, vj) | 1 ≤ i < j ≤ 100}, and weight of the edg

For parameters a and b, both of which are $$\omega \left( 1 \right)$$, T(n) = $$T\left( {{n^{1/a}}} \right) + 1$$, and T

Consider the productions A $$ \to $$ PQ and A $$ \to $$ XY. Each of the five non-terminals A, P, Q, X, and Y has two att

Consider the following grammar. S $$ \to $$ aSB| d B $$ \to $$ b The number of reduction steps taken by a bottom-up pars

Consider the following statements. I. Symbol table is accessed only during lexical analysis and syntax analysis. II. Com

An organization requires a range of IP addresses to assign one to each of its 1500 computers. The organization has appro

Assume that you have made a request for a web page through your web browser to a web server. Initially the browser cache

Consider a TCP connection between a client and a server with the following specifications: the round trip time is 6 ms,

Consider the following statements about the functionality of an IP based router. I. A router does not modify the IP pack

A computer system with a word length of 32 bits has a 16 MB byte-addressable main memory and a 64 KB, 4-way set associat

Consider a non-pipelined processor operating at 2.5 GHz. It takes 5 clock cycles to complete an instruction. You are goi

A processor has 64 registers and uses 16-bit instruction format. It has two types of instructions: I-type and R-type. Ea

Consider the following statements. I. Daisy chaining is used to assign priorities in attending interrupts. II. When a de

Consider the following data path diagram. Consider an instruction: R0 $$ \leftarrow $$ R1 + R2. The following steps are

A direct mapped cache memory of 1 MB has a block ize of 256 bytes. The cache has an access time of 3 ns and a hit rate o

Let G = (V, E) be a directed, weighted graph with weight function w: E $$ \to $$ R. For some function f: V $$ \to $$ R,

In a balanced binary search tree with n elements, what is the worst case time complexity of reporting all elements in ra

Consider the array representation of a binary min-heap containing 1023 elements. The minimum number of comparisons requi

What is the worst case time complexity of inserting n2 elements into an AVL-tree with n elements initially?

The preorder traversal of a binary search tree is 15, 10, 12, 11, 20, 18, 16, 19. Which one of the following is the post

What is the worst case time complexity of inserting n elements into an empty linked list, if the linked list needs to be

Consider a double hashing scheme in which the primary hash function is h1(k)=k mod 23, and the secondary hash function i

Consider the following C program. #include < stdio.h > int main () { int a [4] [5] = {{1, 2, 3, 4, 5},

Consider a schedule of transactions T1 and T2 : Here, RX stands for “Read(X)” and WX stands for “Write(X)”. Which one o

Consider a relational table R that is in 3NF, but not in BCNF. Which one of the following statements is TRUE?

Consider a database implemented using B+ tree for file indexing and installed on a disk drive with block size of 4 KB. T

Consider a relational database containing the following schemas. The primary key of each table is indicated by underlyi

Which one of the following is used to represent the supporting many-one relationships of a weak entity set in an entity-

Consider three registers R1, R2 and R3 that store numbers in IEEE-754 single precision floating point format. Assume tha

Consider the Boolean function z(a,b,c). Which one of the following minterm lists represents the circuit given above?

If there are m input lines and n output lines for a decoder that is used to uniquely address a byte addressable 1 KB RAM

A multiplexer is placed between a group of 32 registers and an accumulator to regulate data movement such that at any gi

Which one of the following predicate formulae is NOT logically valid? Note that W is a predicate formula without any fre

Let A and B be two n$$ \times $$n matrices over real numbers. Let rank(M) and det(M) denote the rank and determinant of

The number of permutations of the characters in LILAC so that no character appears in its original position, if the two

For n > 2, let a {0, 1}n be a non-zero vector. Suppose that x is chosen uniformly at random from {0, 1}n. Then, the p

Graph G is obtained by adding vertex s to K3,4 and making s adjacent to every vertex of K3,4. The minimum number of colo

Let G be a group of 35 elements. Then the largest possible size of a subgroup of G other than G itself is ______.

Consider the functions I. $${e^{ - x}}$$ II. $${x^2} - \sin x$$ III. $$\sqrt {{x^3} + 1} $$ Which of the above functions

Let R be the set of all binary relations on the set {1,2,3}. Suppose a relation is chosen from R at random. The probabil

Each of a set of n processes executes the following code using two semaphores a and b initialized to 1 and 0, respective

Consider the following five disk access requests of the form (request id, cylinder number) that are present in the disk

Consider the following set of processes, assumed to have arrived at time 0. Consider the CPU scheduling algorithms Short

Consider a paging system that uses a 1-level page table residing in main memory and a TLB for address translation. Each

Consider the following statements about process state transitions for a system using preemptive scheduling. I. A running

Consider allocation of memory to a new process. Assume that none of the existing holes in the memory will exactly fit th

Consider the following C functions. int tob(int b, int* arr) { int i; for (i=0; b>0; i++) { if (

Consider the following C functions. int fun1 (int n) { static int i = 0; if (n > 0) { ++i;

Consider the following languages. L1 = {wxyx | w, x, y ∈ (0 + 1)+} L2 = {xy | x, y ∈ (a + b)*, |x| = |y|, x ≠ y} Which o

Which of the following languages are undecidable? Note that $$\langle M\rangle $$ indicates encoding of the Turing machi

Consider the following language. L = {x $$ \in $$ {a, b}* | number of a’s in x is divisible by 2 but not divisible by 3}

Consider the following statements. I. If L1 $$ \cup $$ L2 is regular, then both L1 and L2 must be regular. II. The class

Which one of the following regular expressions represents the set of all binary strings with an odd number of 1’s?

Consider the language L = { $${a^n}|n \ge 0$$ } $$ \cup $$ { $${a^n}{b^n}|n \ge 0$$ } and the following statements. I. L

The drawn of the 21st century witnessed the melting glaciers oscillating between giving too much and too little to billi

His knowledge of the subject was excellent but his classroom performance was ______.

Select the word that fits the analogy: Cook : Cook :: Fly : _____

There are multiple routes to reach from node 1 to node 2, as shown in the network. The cost of travel on an edge betwee

If P = 3, R = 27, T = 243, then Q + S = ______.

Goods and Services Tax (GST) is an indirect tax introduced in India in 2017 that is imposed on the supply of goods and s

Two straight lines are drawn perpendicular to each other in X-Y plane. If $$\alpha $$ and $$\beta $$ are the acute angle

The figure below shows an annular ring with outer and inner radii as b and a, respectively. The annular space has been p

The total revenue of a company during 2014-2018 is shown in the bar graph. If the total expenditure of the company in ea

Raman is confident of speaking English _____ six months as he has been practising regularly_____the last three weeks.