1 Crore+ students have signed up on EduRev. Have you? Download the App 
Find the smallest number y such that y x 162 (y multiplied by 162) is a perfect cube.
Rahul, Murali, Srinivas and Arul are seated around a square table. Rahul is sitting to the left of Murali. Srinivas is sitting to the right of Arul. Which of the following pairs are seated opposite each other ?
Research in the workplace reveals thatpeople work for many reasons _________.
The probability that a kdigit number does NOT contain the digits 0, 5 or 9 is
After Rajendra Chola returned from his voyage to Indonesia, he ______ to visit the temple in Tanjavur.
Six people are seated around a circular table. There are at least two men and two women. There are at least three righthanded persons. Every woman has a lefthanded person to her immediate right. None of the women are righthanded. The number of women at the table is
"The hold of the nationalist imagination on our colonial past is such that anything inadequately or improperly natinalist is just not history"
Q. Which of the following statements best reflects the author's opinion?
The expression [(x + y)  x  y] / 2 is equal to
A contour line joins locations having the same height above the mean sea level. The following is a contour plot of a geographical region. Contour lines are shown at 25 m intervals in this plot.
Q. If in a flood, the water level rises to 525 m, which of the villages P, Q, R, S, T get submerged?
Arun, Gulab, Neel and Shweta must choose one shirt each from a pile of four shirts coloured red, pink, blue and white respectively. Arun dislikes the colour red and Shweta dislikes the colour white. Gulab and Neel like all the colours. In how many different ways can they choose the shirts so that no one has a shirt with a colour he or she dislikes?
Let X be a Gaussian random variable with mean 0 and variance σ^{2}. Let Y = max(X,0) where max(a,b) is the maximum of a and b. The median of Y is _____.
Note: This questions appeared as Numerical Answer Type.
Consider a TCP client and a TCP server running on two different machines. After completing data transfer, the TCP client calls close to terminate the connection and a FIN segment is sent to the TCP server. Serverside TCP responds by sending an ACK which is received by the clientside TCP. As per the TCP connection state diagram(RFC 793), in which state does the client side TCP connection wait for the FIN from the serverside TCP?
A sender S sends a message m to receiver R, which is digitally signed by S with its private key. In this scenario, one or more of the following security violations can take place.
(I) S can launch a birthday attack to replace m with a fraudulent message.
(II) A third party attacker can launch a birthday attack to replace m with a fraudulent message.
(III) R can launch a birthday attack to replace m with a fraudulent message.
Consider the following intermediate program in three address code
p = a  b
q = p * c
p = u * v
q = p + q
Q. Which one of the following corresponds to a static single assignment from the above code?
The following functional dependencies hold true for the relational schema R{V, W, X, Y, Z}:
V > W
VW > X
Y > VX
Y > Z
Q. Which of the following is irreducible equivalent for this set of functional dependencies?
Consider the following CPU processes with arrival times (in milliseconds) and length of CPU bursts (in milliseconds) as given below:
Q. If the preemptive shortest remaining time first scheduling algorithm is used to schedule the processes, then the average waiting time across all processes is _______ milliseconds.
Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are:
Note: The height of a tree with a single node is 0.
The statement (¬ p) => (¬ q) is logically equivalent to which of the statements below?
I. p => q
II. q => p
III. (¬ q) ∨ p
IV. (¬ p) ∨ q
Consider a database that has the relation schema EMP (EmpId, EmpName, and DeptName). An instance of the schema EMP and a SQL query on it are given below.
Q. The output of executing the SQL query is _______.
Note: This questions appeared as Numerical Answer Type.
Threads of a process share
Let c^{1},c^{n} be scalars not all zero. Such that the following expression holds:
where a_{i} is column vectors in R^{n}. Consider the set of linear equations.
Ax = B.
where A = [a_{1}.......a_{n}] and
Q. Then, Set of equations has
Consider the firstorder logic sentence
F: ∀ x (∃ y R(x,y)).
Q. Assuming nonempty logical domains, which of the sentences below are implied by F?
I. ∃y (∃x R(x,y))
II. ∃y (∀x R(x,y))
III. ∀y (∃x R(x,y))
IV. ∼∃x (∀y R(x,y))
Consider the following grammar
p > xQRS
Q > yzz
R > w∈
S > y
Q. Which is FOLLOW(Q)?
Consider a twolevel cache hierarchy L1 and L2 caches. An application incurs 1.4 memory accesses per instruction on average. For this application, the miss rate of L1 cache 0.1, the L2 cache experience on average. 7 misses per 1000 instructions. The miss rate of L2 expressed correct to two decimal places is ______________.
Note: This questions appeared as Numerical Answer Type.
Consider the following functions from positives integers to real numbers 10, √n, n, log_{2}n, 100/n. The CORRECT arrangement of the above functions in increasing order of asymptotic complexity is:
Consider the C struct defines below:
Q. The base address of student is available in register R1. The field student.grade can be accessed efficiently using
Consider the following C code:
Q. The code suffers from which one of the following problems:
Consider the Karnaugh map given below, where X represents “ don’t care” and blank represents 0.
Q. Assume for all inputs (a, c, d) the respective complements (a', b', c', d')are also available. The above logic is implemented 2input NOR gates only. The minimum number of gates required is ____________.
Consider the following table
Q. Match the algorithm to design paradigms they are based on:
Consider the C code fragment given below.
Q. Assuming that m and n point to valid NULL terminated linked lists, invocation of join will
Consider the language L given by the regular expression (a + b) *b(a +b) over the alphabet {a, b}. The smallest number of states needed in a deterministic finitestate automaton (DFA) accepting L is ______.
Note: This questions appeared as Numerical Answer Type.
The nbit fixedpoint representation of an unsigned real number X uses f bits for the fraction part. Let i = n  f. The range of decimal values for X in this representation is
Let T be a tree with 10 vertices. The sum of the degrees of all the vertices in T is _____.
Note: This questions appeared as Numerical Answer Type.
Consider the following contextfree grammar over the alphabet ∑ = {a, b, c} with S as the start symbol:
S > abScT  abcT
T > bT  b
Q. Which of the following represents the language generated by the above grammar?
When two 8bit numbers A_{7} ... A_{0} and B_{7} ... B_{0} in 2's complement representation (with A_{0} and B_{0} as the least significant bits) are added using ripplecarry adder. the sum bits obtained are S_{7} ... S_{0}and the carry bits are C_{7} ... C_{0}. An overflow is said to have occured if
Consider a database that has the relation schemas EMP (EmpId, EmpName, DepId), and DEPT(DeptName, DeptId). Note that the DepId can be permitted to be NULL in the relation EMP. Consider the following queries on the database expressed in tuple relational calculus.
I. {t  ∃ u ∈ EMP (t[EMPName] = u[EmpName] ∧ ∀ v ∈ DEPT (t[DeptId] ≠ DeptId]))}
II. {t  ∃ u ∈ EMP (t[EMPName] = u[EmpName] ∧ ∃ v ∈ DEPT (t[DeptId] ≠ DeptId]))}
III. {t  ∃ u ∈ EMP (t[EMPName] = u[EmpName] ∧ ∃ v ∈ DEPT (t[DeptId] = DeptId]))}
Let G = (V, E) be any connected undirected edgeweighted graph. The weights of the edges in E are positive any distinct. Consider the following statements:
I. Minimum Spanning Tree of G is always unique.
II. Shortest path between any two vertices of G is always unique.
Q. Which of the above statements is/are necessarily true?
Consider the expression (a1) * ((( b + c ) / 3 )) + d)). Let X be the minimum number of registers required by an optimal code generation (without any register spill) algorithm for a load/store architecture, in which
(i) only load and store instructions can have memory operands and
(ii) arithmetic instructions can have only register or immediate operands.
The value of X is ________.
Note: This questions appeared as Numerical Answer Type.
Consider the C functions foo and bar given below:
Q. Invocations of foo(3) and bar(3) will result in:
Let p, q, and r be the propositions and the expression (p > q) > r be a contradiction. Then, the expression (r > p)> q is
Consider a RISC machine where each instruction is exactly 4 bytes long. Conditional and unconditional branch instructions use PC relative addressing mode with Offset specified in bytes to the target location of the branch instruction. Further the Offset is always with respect to the address of the next instruction in the program sequence. Consider the following instruction sequence
Q. f the target of the branch instruction is i, then the decimal value of the Offest is __________.
Note: This questions appeared as Numerical Answer Type.
Consider the following grammar over the alphabet {a,b,c} given below, S and T are nonterminals.
G1: S>aSbT
T> cT∈
G2: S>bSaT
T> cT∈
Q.The language L1(G1) ∩ L2(G2).
If G is grammar with productions
S → SaS  aSb  bSa  SS  ∈
Q. where S is the start variable, then which one of the following is not generated by G?
In a RSA cryptosystem a particular A uses two prime numbers p = 13 and q =17 to generate her public and private keys. If the public key of Ais 35. Then the private key of A is ____________.
Note: This questions appeared as Numerical Answer Type.
Let A be m×n real valued square symmetric matrix of rank 2 with expression given below.
Consider the following statements
(i) One eigenvalue must be in [5, 5].
(ii) The eigenvalue with the largest magnitude must be strictly greater than 5.
Q. Which of the above statements about engenvalues of A is/are necessarily CORRECT?
In a database system, unique time stamps are assigned to each transaction using Lamport’s logical clock. Let TS(T1) and TS(T2) be the time stamps of transactions T1 and T2 respectively. Besides, T1 holds a lock on the resource R, and T2 has requested a conflicting lock on the same resource R. The following algorithm is used to prevent deadlocks in the database assuming that a killed transaction is restarted with the same timestamp.
Q. Assume any transactions that is not killed terminates eventually. Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks?
The values of parameters for the Stopand – Wait ARQ protocol are as given below.
Q. Assume that there are no transmission errors. Then the transmission efficiency (expressed in percentage) of the Stopand – Wait ARQ protocol for the above parameters is _________( correct to 2 decimal place) .
Note: This questions appeared as Numerical Answer Type.
The value of the given expression
Consider the following two functions
Q. The output printed when fun1 (5) is called is
Consider a 2way set associative cache with 256 blocks and uses LRU replacement, Initially the cache is empty. Conflict misses are those misses which occur due the contention of multiple blocks for the same cache set. Compulsory misses occur due to first time access to the block. The following sequence of accesses to memory blocks
(0,128,256,128,0,128,256,128,1,129,257,129,1,129,257,129)
is repeated 10 times. The number of conflict misses experienced by the cache is ___________.
A computer network uses polynomial over GF(2) for error checking with 8 bits as information bits and uses x^{3} + x + 1 as the generator polynomial to generate the check bits.
In this network, the message 01011011 is transmitted as
Consider the following languages over the alphabet ∑= {a,b,c}. Let L_{1} = {a^{n} b^{n}c^{m}  m, n >= 0 } and L_{2} = {a^{m}b^{n}c^{n} m, n >= 0}.
Q. Which of the following are contextfree languages?
I. L_{1} ∪ L_{2}
II. L_{1} ∩ L_{2}
Consider the following grammar:
where relop is a relational operate (e.g < >, ….), ε refers to the empty statement, and if ,then, elseare terminals. Consider a program P following the above grammar containing ten if terminals. The number of control flows paths in P is ____________. For example, the program
if e_{1} then e_{2} else e_{3}
has 2 control flow paths, e_{1} > e_{2} and e_{1} > e_{3}
A multithreaded program P executes with x number of threads and uses y number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are nonreentrant, i.e., if a thread holds a lock l, then it cannot reacquire lock l without releasing it. If a thread is unable to acquire a lock, it blocks until the lock becomes available. The minimum value of x and the minimum value of y together for which execution of P can result in a deadlock are:
Consider the following C program.
Q. Recall that strlen is defined in string.h as returning a value of type size_t, which is an unsigned int . The output of the program is _________.
Note: This questions appeared as Numerical Answer Type.
A cache memory unit with capacity of N words and block size of B words is to be designed. If it is designed as direct mapped cache, the length of the TAG field is 10 bits. If the cache unit is now designed as a 16way setassociative cache, the length of the TAG field is ______ bits.
Note: This questions appeared as Numerical Answer Type.
Let A be an array of 31 numbers consisting of a sequence of 0’s followed by a sequence of 1’s. The problem is to find the smallest index i such that A[i] is 1 by probing the minimum number of locations in A. The worst case number of probes performed by an optimal algorithm is________.
Note: This questions appeared as Numerical Answer Type.
The number of integers between 1 and 500 (both inclusive) that are divisible by 3 or 5 or 7 is ______.
Note: This questions appeared as Numerical Answer Type.
Consider a database that has the relation schema CR(StudentName, CourseName). An instance of the schema CR is as given below.
Q. The following query is made on the database. T1 ← π_{CourseName}(σ_{StudentName=’SA’}(CR)) T2 ← CR ÷ T1 The number of rows in T2 is ________.
Note: This questions appeared as Numerical Answer Type.
Consider a combination of T and D flipflops connected as shown below. The output of the D flipflop is connected to the input of the T flipflop and the output of the T flipflop is connected to the input of the D flipflop
Q. Initially, both Q_{0} and Q_{1} are set to 1 (before the 1st clock cycle). The outputs
Let u and v be two vectors in R^{2} whose Euclidean norms satisfy u = 2v. What is the value α such that w = u + αv bisects the angle between u and v ?
Let A and B be infinite alphabets and let # be a symbol outside both A and B. Let f be a total functional from A^{*} to B^{*} .We say f is computable if there exists a Turning machine M which given an input x in A^{*}, always halts with f(x) on its tape. Let L_{f} denotes the language {x#f(x)x∈A^{*}}. Which of the following statements is true?
Brass gets discoloured in air because of the presence of which of the following gases in air?
The output of executing the following C program is ________.
Instruction execution in a processor is divided into 5 stages. Instruction Fetch(IF), Instruction Decode (ID), Operand Fetch(OF), Execute(EX), and Write Back(WB), These stages take 5,4,20, 10 and 3 nanoseconds (ns) respectively. A pipelined implementation of the processor requires buffering between each pair of consecutive stages with a delay of 2 ns. Two pipelined implementations of the processor are contemplated:
(i) a naïve pipeline implementation (NP) with 5 stages and
(ii) an efficient pipeline (EP) where the OF stage id divided into stages OF1 and OF2 with execution times of 12 ns and 8 ns respectively.
The speedup (correct to two decimals places) achieved by EP over NP in executing 20 independent instructions with no hazards is ________________.
Note: This questions appeared as Numerical Answer Type.
407 docs127 tests

407 docs127 tests
