The difficulties and struggles of today are but the price we must pay for the accomplishments and victories of tomorrow.
1. The rank of the matrix
2. The trapezoidal rule for integration gives exact result when the integrand is a
polynomial of degree
(A) 0 but not 1
(B) 1 but not 0
(C) 0 or 1
(D) 2
View/Hide Ans
Correct Answer is C
3. The solution to the recurrence equation
T(2k) = 3T(2k-1) + 1, T(1) = 1 is
(A) 2k
(B) (3k+1-1)/2
(C) 3log2k
(D) 2log3k
View/Hide Ans
Correct Answer is B
4. 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 the same colour is
(A) 2
(B) 3
(C) 4
(D) n-2[n/2]+2
View/Hide Ans
Correct Answer is D
5. In the worst case, the number of comparisons needed to search a singly linked
list of length n for a given element is
(A) log2n
(B) n/2
(C) log2n-1
(D) n
View/Hide Ans
Correct Answer is D
6. Which of the following is true?
(A) The set of all rational negative numbers forms a group under multiplication.
(B) The set of all non-singular matrices forms a group under multiplication.
(C) The set of all matrices forms a group under multiplication.
(D) Both B and C are true.
View/Hide Ans
Correct Answer is B
7. The language accepted by a Pushdown Automaton in which the stack is limited to
10 items is best described as
(A) Context free
(B) Regular
(C) Deterministic Context free
(D) Recursive
View/Hide Ans
Correct Answer is B
8. "If X then Y unless Z" is represented by which of the following formulas in
prepositional logic?
(Note: "¬", is negation, "∨" is conjunction, and "→" is implication)
(A) (X ∧ ¬Z) → Y
(B) (X ∧ Y) → ¬Z
(C) X → (Y ∧ ¬Z)
(D) (X → Y) ∧ ¬Z
View/Hide Ans
Correct Answer is A
9. A device employing INTR line for device interrupt puts the CALL instruction on the
data bus while
(A) is active
(B) HOLD is active
(C) READY is active
(D) None of the above
View/Hide Ans
Correct Answer is A
10. In 8085, which of the following modifies the program counter?
(A) Only PCHL instruction
(B) Only ADD instructions
(C) Only JMP and CALL instructions
(D) All instructions
View/Hide Ans
Correct Answer is D
11. In serial data transmission, every byte of data is padded with a ‘0’ in the
beginning and one or two ‘1’s at the end of byte because
(A) Receiver is to be synchronized for byte reception
(B) Receiver recovers lost ‘0’s and ‘1’s from these padded bits
(C) Padded bits are useful in parity computation
(D) None of the above
View/Hide Ans
Correct Answer is A
12. Minimum SOP expression for f(w,x,y,z) shown in Karnaugh-map below is
13. Which of the following is not a form of memory?
(A) instruction cache
(B) instruction register
(C) instruction opcode
(D) translation look-a-side buffer
View/Hide Ans
Correct Answer is C
14. The decimal value 0.25
(A) is equivalent to the binary value 0.1
(B) is equivalent to the binary value 0.01
(C) is equivalent to the binary value 0.00111…
(D) cannot be represented precisely in binary
View/Hide Ans
Correct Answer is B
15. The 2’s complement representation of the decimal value –15 is
(A) 1111
(B) 11111
(C) 111111
(D) 10001
View/Hide Ans
Correct Answer is D
16. Sign extension is a step in
(A) floating point multiplication
(B) signed 16 bit integer addition
(C) arithmetic left shift
(D) converting a signed integer from one size to another
View/Hide Ans
Correct Answer is D
17. In the C language
(A) At most one activation record exists between the current activation record
and the activation record for the main
(B)The number of activation records between the current activation record and
the activation record fro the main depends on the actual function calling
sequence.
(C)The visibility of global variables depends on the actual function calling
sequence.
(D) Recursion requires the activation record for the recursive function to be
saved on a different stack before the recursive fraction can be called.
View/Hide Ans
Correct Answer is B
18. The results returned by function under value-result and reference parameter
passing conventions
(A) Do not differ
(B) Differ in the presence of loops
(C) Differ in all cases
(D) May differ in the presence of exception
View/Hide Ans
Correct Answer is D
19. 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
(A) Zero
(B) More than zero but less than that of an equivalent 3NF decomposition
(C) Proportional to the size of F+
(D) Indetermine
View/Hide Ans
Correct Answer is A
20. With regard to the expressive power of the formal relational query languages,
which of the following statements is true?
(A) Relational algebra is more powerful than relational calculus
(B) Relational algebra has the same power as relational calculus.
(C) Relational algebra has the same power as safe relational calculus.
(D) None of the above
View/Hide Ans
Correct Answer is C
21. In 2’s complement addition, overflow
(A) is flagged whenever there is carry from sign bit addition
(B) cannot occur when a positive value is added to a negative value
(C) is flagged when the carries from sign bit and previous bit match
(D) None of the above
View/Hide Ans
Correct Answer is B
22. Which of the following scheduling algorithms is non-preemptive?
(A) Round Robin
(B) First-In First-Out
(C) Multilevel Queue Scheduling
(D) Multilevel Queue Scheduling with Feedback
View/Hide Ans
Correct Answer is B
23. The optimal page replacement algorithm will select the page that
(A) Has not been used for the longest time in the past.
(B) Will not be used for the longest time in the future.
(C) Has been used least number of times.
(D) Has been used most number of times.
View/Hide Ans
Correct Answer is B
24. In the absolute addressing mode
(A) the operand is inside the instruction
(B) the address of the operand is inside the instruction
(C) the register containing the address of the operand is specified inside the
instruction
(D) the location of the operand is implicit
View/Hide Ans
Correct Answer is B
25. Maximum number of edges in a n-node undirected graph without self loops is
(A) n2
(B) n(n-1)/2
(C) n-1
(D) n(n+1)/2
View/Hide Ans
Correct Answer is B
26. Consider the following logic ckt whose inputs are functions f2, f1, f3 and output
is f.
27. 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 the Enable input.
28. Let f(A, B) = A'+ B. Simplified expression for function f( f(x + y, y), z) is
(A) x'+ z
(B) xyz
(C) xy' + z
(D) None of the above
View/Hide Ans
Correct Answer is C
29. What are the states of the Auxillary Carry(AC) and Carry Flag(CY) after
executing the following 8085 program?
MVI H, 5DH
MIV L, 6BH
MOV A, H
ADD L
(A) AC = 0 and CY = 0
(B) AC = 1 and CY = 1
(C) AC = 1 and CY = 0
(D) AC = 0 and CY = 1
View/Hide Ans
Correct Answer is C
30. 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
31. The performance of a pipelined processor suffers if
(A) the pipeline stages have different delays
(B) consecutive instructions are dependent on each other
(C) the pipeline stages share hardware resources
(D) All of the above
View/Hide Ans
Correct Answer is D
32. Horizontal microprogramming
(A) does not require use of signal decoders
(B) results in larger sized microinstructions than vertical microprogramming
(C) uses one bit for each control signal
(D) all of the above
View/Hide Ans
Correct Answer is D
33. 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 the array is stored
starting from memory address 0, the address of a[40][50] is
(A) 4040
(B) 4050
(C) 5040
(D) 5050
View/Hide Ans
Correct Answer is B
34. The number of leaf nodes in a rooted tree of n nodes, with each node having 0 or
3 children is:
(A) n/2
(B) (n-1)/3
(C) (n-1)/2
(D) (2n+1)/3
View/Hide Ans
Correct Answer is D
35. 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 Stop else Goto 1;
Assuming that x is present A, what is the expected number of comparisons made
by the algorithm before it terminates?
(A) n
(B) n - 1
(C) 2n
(D) n/2
View/Hide Ans
Correct Answer is A
36. The running time of the following algorithm
Procedure A(n)
if n≤2 return(1) else return (A(√n));
is best described by
(A) O(n)
(B) O(log n)
(C) O(log log n)
(D) O(1)
View/Hide Ans
Correct Answer is C
37. 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 possible height (number of nodes on the path
from the root to the furthest leaf) of such a tree on n nodes is best described by
which of the following?
(A) log2 n
(B) log4/3 n
(C) log2 n
(D) log3/2 n
View/Hide Ans
Correct Answer is D
38. The smallest finite automaton which accepts the language
{x | length of x is divisible by 3} has
(A) 2 states
(B) 3 states
(C) 4 states
(D) 5 states
View/Hide Ans
Correct Answer is B
39. Which of the following is true?
(A) The complement of a recursive language is recursive.
(B) The complement of a recursively enumerable language is recursively
enumerable.
(C) The complement of a recursive language is either recursive or recursively
enumerable.
(D) The complement of a context-free language is context-free
View/Hide Ans
Correct Answer is A
40. The Newton-Raphson iteration
can be used to solve the equation
(A) X2 = 3
(B) X3 = 3
(C) X2 = 2
(D) X3 = 2
View/Hide Ans
Correct Answer is C
41. Four fair coins are tossed simultaneously. The probability that at least one head
and one tail turn up is
(A) 1/16
(B) 1/8
(C) 7/8
(D) 15/16
View/Hide Ans
Correct Answer is C
42. The binary relation S = ∅(empty set) on set A = {1,2,3} is
(A) Neither reflexive nor symmetric
(B) Symmetric and reflexive
(C) Transitive and reflexive
(D) Transitive and symmetric
View/Hide Ans
Correct Answer is D
43. The C language is:
(A) A context free language
(B) A context sensitive language
(C) A regular language
(D) Parsable fully only by a Turing machine
View/Hide Ans
Correct Answer is A
44. To evaluate an expression without any embedded function calls
(A) One stack is enough
(B) Two stacks are needed
(C) As many stacks as the height of the expression tree are needed
(D) A Turning machine is needed in the general case
View/Hide Ans
Correct Answer is A
45. Dynamic linking can cause security concerns because
(A) Security is dynamic
(B) The path for searching dynamic libraries is not known till runtime
(C) Linking is insecure
(D) Cryptographic procedures are not available for dynamic linking
View/Hide Ans
Correct Answer is B
46. 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 a program waits for certain events
such as I/O, another program is immediately scheduled for execution.
(C) If the execution of a program terminates, another program is immediately scheduled
for execution.
(A) A
(B) A and B
(C) A and C
(D) A, B and C
View/Hide Ans
Correct Answer is B
47. In the index allocation scheme of blocks to a file, the maximum possible size of
the file depends on
(A) the size of the blocks, and the size of the address of the blocks.
(B) the number of blocks used for the index, and the size of the blocks.
(C) the size of the blocks, the number of blocks used for the index, and the size
of the address of the blocks.
(D) None of the above
View/Hide Ans
Correct Answer is B
48. 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 bytes.
Given this scenario, what would be
the best choice of the degree (i.e. the number of pointers per node) of the B+ -tree?
(A) 16
(B) 42
(C) 43
(D) 44
View/Hide Ans
Correct Answer is C
49. 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 definitely 3NF, but it is not known
which is which.
To make a guaranteed identification, which one of the following
tests should be used on the decompositions?
(Note: Assume that the closures of F and
G are available).
(A) Dependency-preservation
(B) Lossless-join
(C) BCNF definition
(D) 3NF definition
View/Hide Ans
Correct Answer is C
50. From the following instance of a relation schema R(A, B, C), we can conclude that:
© 2022. All Rights Reserved | Copyright | Terms of Use & Privacy Policy