a n nodes
b log2 n nodes
c 2n-1
d 2nnodes
2. The expression 1 * 2 ^ 3 * 4 ^ 5 * 6 will be evaluated as
a 3230
b 16230
c 49152
d 173458
3. The feature in object-oriented programming that allows the same operation to be carried out differently, depending on the object, is
a Inheritance
b Polymorphism
c Overfunctioning
d overriding
4. The microinstructions stored in the control memory of a processor have a width of 26 bits. Each microinstruction is divided into three fields: a microoperation field of 13 bits, a next address field (X), and a MUXselect field (Y). There are 8 status bits in the inputs of the MUX. How many bits are there in the X and Y fields, and what is the size of the control memory in number of words?
a 10,3,1024
b 8,5,256
c 5,8,2048
d 10,3,512
5. A CPU has 24-bit instructions. A program starts at address 300 (in decimal). Which one of the following is a legal program counter (all values in decimal)?
a 400
b 500
c 600
d 700
6. Consider a disk pack with 16 surfaces, 128 tracks per surface and 256 sectors per track. 512 bytes of data are stores in a bit serial manner in a sector. The capacity of the disk pack and the number of bits required to specify a particular sector in the disk are respectively
a 256 Mbyte, 19 bits
b 256 Mbyte, 28 bits
c 512 Mbyte, 20 bits
d 64 Gbyte, 28 bits
7. Consider a pipelined processor with the following four stages
IF: Instruction Fetch
ID: Instruction Decode and Operand Fetch
EX: Execute WB: Write Back
The IF, ID and WB stages take one clock cycle each to complete the operation. The ADD and SUB instructions need 1 clock cycle and the MUL instruction need 3 clock cycles in the EX stage. Operand forwarding is used in the pipelined processor. What is the number of clock cycles taken to complete the following sequence of instructions?
ADD R2, R1, RO R2<-R1+RO
MUL R4, R3, R2 R4<-R3*R2
SUB R6, R5, R4 R6<-R5-R4
a 7
b 8
c 10
d 14
8. The use of multiple register windows with overlap causes a reduction in the number of memory accesses for .
1.Function locals and parameters
2.Register saves and restores
3.1nstruction fetches
a 1 only
b 2 only
c 3 only
d 1,2 and 3
9. A processor that has c,arry, overflow and sign flag bits as part of its program status word (PSW}performs addition of the following two 2′s complement numbers 01001101 and 11101001. After the execution of this addition operation, the status of the carry, overflow and sign flags, respectively will be
a 1,1,0
b 1,0,0
c 0,1,0
d 1,0,1
10. The two numbers given below are multiplied using the Booth’s algorithm.
Multiplicand: 0101 1010 1110 1110
Multiplier : 0111 01111011 1101
How many additions/Subtractions are required for the multiplication of the above two numbers?
a 6
b 8
c 10
d 12
11. The addition of 4-bit, two’s complement, binary numbers 1101 and 0100 results in
a 0001 and an overflow
b 1001 and no overflow
c 0001 and no overflow
d 1001 and an overflow
12. Which of the flowing statements about relative addressing mode is FALSE?
a It enables reduced instruction size
b It allows indexing of array element with same instruction
c It enables easy relocation of data
d It enables faster address calculation than absolute addressing
13. Substitution of values for names (whose values are constants) is done in
a Local optimization
b Loop optimization
c Constant folding
d Strength reduction
14. A root α of equation f(x)=0 can be computed to any degree of accuracy if a ‘good’ initial approximation X0 is chosen for which
a f (x0) > 0
b f (x0) f”( x0) > 0
c f (x)0 f” (x0) < 0
d f" (x0) > 0
15. Which of the following statement is correct?
a ∆ (Uk Vk) = Uk ∆ Vk + Vk ∆ Uk
b ∆ (Uk Vk) = Uk+ 1 ∆ Vk + Vk+1 ∆ Uk
C ∆ (Uk Vk) = Vk+1 ∆ Uk + Uk ∆ Vk
d ∆ (Uk Vk) = Uk+ 1 ∆ Vk + Vk ∆ Uk
16. The shift operator E is defined as
E [f(xi)] = f (xi+h) and E-1[f(xi)) = f (xi-h)
Then ∆ (forward difference) in terms of E is
a E - 1
b E
C 1-E-1
d 1-E
17. The formula
a Simpson rule
b Trapezoidal rule
c Romberg’s rule
d Gregory’s formula
18. The cubic polynomial y(x) which takes the following values: y(O)=1, y(1 )=0, y(2)=1 and y(3)=10 is,
a x3 + 2x2 + 1
b x3 + 3x2 – 1
C x3 + 1
d x3 – 2x2 + 1
19. x = a cos(t), y:;: b sin(t) is the parametric form of
a Ellipse
b Hyperbola
c Circle
d Parabola
20. The value of x at which y is minimum for y = x2 -3x + 1 is
a -3/2
b 3/2
c 0
d -5/4
21. The formula
a Newton’s backward formula
b Gauss forward formula
c Gauss backward formula
d Stirling’s formula
22. If G is a graph with e edges and n vertices the sum of the degrees of all vertices in G is
a e
b e/2
c e2
d 2 e
23. Let G be an arbitrary graph with n nodes and k components. If a vertex is removed from G, the number of components in the resultant graph must necessarily lie between.
a k and n
b k-1 and k+ 1
c k-1 and n-1
d k+ 1 and n-k
24. A graph in which all nodes are of equai degree, is known as
a Multigraph
b Non regular graph
c Regular graph
d Complete graph
25. If in a graph G there is one and only one path between every pair of vertices then G is a
a Path
b Walk
c Tree
d Circuit
26. A simple graph (a graph without parallel edge or loops) with n vertices and k components can have at most
a n edges
b (n-k) edges
c (n-k) (n-k+ 1) edges
d (n-k) (n-k+1)/2 edges.
27. Consider the polynomial p(x) = ao + alX + a2x2 + a3x3, where aj 1:- 0, V i. The minimum number of multiplications needed to evaluate p on an input x is
a 3
b 4
c 6
d 9
28. Consider the following code written in a pass-by-reference language like FORTRAN.
S1: The compiler will generate code to allocate a temporary nameless cell, initialize it to 13, and pass the address of the cell to swap
S2: On execution the code will generate a runtime error on line L1
S3: On execution the code will generate a runtime error on line l2
S4: The program will print 13 and 8
S5: The program will print 13 and -2
Exactly the following set of statement(s) is correct:
a S1 and S2
b S1 and S4
c S3
d S1 and S5
29. A square matrix A is called orthogonal if A’ A=
a 1
b A
c -A
d -I
No comments:
Post a Comment