Previous Year Questions
49 questions — organised by subject with solutions and explanations.
🎯 Practice smarter, not harder
Just sign in to unlock everything. Free for all students.
The performance of a pipelined processor suffers if
A device employing INTR line for device interrupt puts the CALL instruction on the data bus while
In the absolute the Addressing Modes :
What are the states of the Auxiliary Carry (AC) and Carry Flag (CY) after executing the following 8085 program ? MIV H, 5DH MIV L, 6BH MOV A, H ADD L
Horizontal microprogramming
In 8085 which of the following modifies the program counter ?
Which of the following is not a form of memory ?
A B+-tree index is to be built on the Name attribute of the relation STUDENT. Assume that all student names are of length 8 bytes, disk blocks are of size 512 bytes, and index pointers are of size 4 b
With regard to the expressive power of the formal relational query languages, which of the following statements is true ?
Relation R with an associated set of functional dependencies, F , is decomposed into BCNF. The redundancy (arising out of functional dependencies) in the resulting set of relations is.
From the following instance of relation schema R(A,B,C), we can conclude that :
In the index allocation scheme of blocks to a file, the maximum possible size of the file depends on
Relation R is decomposed using a set of functional dependencies, F ,and relation S is decomposed using another set of functional dependencies, G. One decomposition is definitely BCNF , the other is de
In 2's complement addition, overflow
Consider the following multiplexor where I0,I1,I2,I3 are four data input lines selected by two address line combinations A1A0 = 00,01,10,11 respectively and f is the output of the multiplexor. EN is t
The decimal value of 0.25
The 2's complement represent representation of the decimal value -15 is
Let f(A,B) = A' + B. Simplified expression for function f(f(x+y,y),z) is
Minimum sum of product expression for f (w,x,y,z) shown in Karnaugh-map below is
Sign extension is a step in
Consider the following logic circuit whose inputs are functions f1, f2, f3 and output is f Given that f1(x, y, z) = (0, 1, 3, 5), f2(x, y, z) = (6, 7) and f(x, y, z) = (1, 4, 5), f3 is :
The minimum number of colours required to colour the vertices of a cycle with n nodes in such a way that no two adjacent nodes have same colour is.
"If X then Y unless Z" is represented by which of the following formulas in prepositional logic? ( , is negation, is conjunction, and is implication)
The binary relation S = (empty set) on set A = {1,2,3} is
The trapezoidal rule for integration gives exact result when the integrand is a polynomial of degree
The rank of the matrix is
Maximum number of edges in a n-node undirected graph without self loops is
The Newton-Raphson iteration can be used to solve the equation
Which of the following is true?
Four fair coins are tossed simultaneously. The probability that at least one head and one tail turn up is
Which combination of the following features will suffice to characterize an OS as a multi-programmed OS ? (A)More than one program may be loaded into main memory at the same time for execution. (B) If
Which of the following scheduling algorithms is non-preemptive ?
The optimal page replacement algorithm will select the page that
A weight-balanced tree is a binary tree in which for each node, the number of nodes in the let sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possib
The results returned by function under value-result and reference parameter passing conventions
Consider the following declaration of a two-dimensional array in C : Char a[100][100] Assuming that the main memory is byte-addressable and that array is stored starting form memory address 0, the add
Consider the following algorithm for searching for a given number x in an unsorted array A[1.....n] having n distinct values : (1) Choose an i uniformly at random from [1....n] (2) If A[i] = x then st
To evaluate an expression without any embedded function calls
In the worst case, the number of comparisons needed to search a single linked list of length n for a given element is
The finite state machine described by the following state diagram with A as starting state, where an arc label is x/y and x stands for 1-bit input and y stands for 2-bit output.
The language accepted by a Pushdown Automaton in which the stack is limited to 10 items is best described as
The C language is :
The smallest finite automaton which accepts the language {x length of x is divisible by 3} has
Which of the following is true ?