Professional Documents
Culture Documents
Correct Marks:
Qs. Attempted: 0
Total Questions: 0 Penalty Marks:
80 Correct Attempts: 0
Total Marks: 0 Resultant Marks:
80 Incorrect 0
Exam Duration: Attempts: Time Taken:
60 Minutes 0 0 Minutes
Technical
A. 192.166.200.50
B. 00056A:01A01A5CCA7FF60
C. 568, Airport Road
D. 01:A5:BB:A7:FF:60
SHA-1 is a
A. encryption algorithm
B. decryption algorithm
C. key exchange algorithm
D. message digest function
(1) Round
(A) Disk check
robin
(B) Batch processing (2) Scan
(C) Time sharing (3) LIFO
(D) Stack operation (4) FIFO
A B C D
a 3 4 2 1
b 4 3 2 1
c 3 4 1 2
d 2 4 1 3
A page fault
Using a larger block size in a fixed block size file system leads to
A. 1
B. 2
C. 3
D. 4
A. 15
B. 9
C. 10
D. 13
A. 12.8 ms
B. 11.8 ms
C. 10.8 ms
D. 09,8 ms
A. −2n−1 to (2n−1 − 1)
B. −(2n−1 − 1) to (2n−1 − 1)
C. −2n−1 to 2n−1
D. −(2n−1 + 1) to (2n−1 − 1)
A. Absolute mode
B. Indirect mode
C. Immediate mode
D. Index mode
i. I1 requires 25 microseconds
ii. I2 requires 35 microseconds
iii. I3 requires 20 microseconds
I1 has the highest priority and I3 has the lowest. What is the
possible range of time for I3 to be executed assuming that it may or
may not occur simultaneously with other interrupts?
A. Bank switching
B. Indexed mapping
C. Two-way memory interleaving
D. Memory segmentation
A. 7 5 1 0 3 2 4 6 8 9
B. 0 2 4 3 1 6 5 9 8 7
C. 0 1 2 3 4 5 6 7 8 9
D. 9 8 6 4 2 3 0 1 5 7
A. 2
B. 3
C. 4
D. 6
A. abc × +def ^ ^ −
B. abc × +de^ f ^ −
C. ab + c × d − e^ f ^
D. − + a × bc^^ def
A. A + B − C∗D
B. +A∗ − BCD
C. ABC − D∗ +
D. A + BC − D∗
A. 1267
B. 1164
C. 1264
D. 1169
A. A
B. B
C. C
D. D
A. n nodes
B. log2 n nodes
C. 2n − 1
D. 2n nodes
A. 3230
B. 16230
C. 49152
D. 173458
A. Inheritance
B. Polymorphism
C. Overfunctioning
D. Overriding
A. 10, 3, 1024
B. 8, 5, 256
C. 5, 8, 2048
D. 10, 3, 512
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
The IF, ID and WB stages take one clock cycle each to complete
the operation. The number of clock cycles for the EX stage
depends on the instruction. The ADD and SUB instructions need 1
clock cycle and the MUL instruction needs 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?
A. 7
B. 8
C. 10
D. 14
A. I only
B. II only
C. III only
D. I, II and III
A processor that has carry, 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
The two numbers given below are multiplied using the Booth's
algorithm
A. 6
B. 8
C. 10
D. 12
A. Local optimization
B. Loop optimization
C. Constant folding
D. Strength reduction
A. f (x 0 ) > 0
B. f (x 0 )f ″ (x 0 ) > 0
C. f (x 0 )f ″ (x 0 ) < 0
D. f ″ (x 0 ) > 0
Your Answer: Correct Answer: @ Not Attempted Discuss
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
A. E−1
B. E
C. 1 − E −1
D. 1−E
The formula
xa
∫ y(n)dx ≃ h/2(y0 + 2y1 + ⋯ + 2yn−1 + yn ) − h/12(▿yn − △ y0 )
x0
A. Simpson rule
B. Trapezoidal rule
C. Romberg's rule
D. Gregory's formula
A. x3 + 2x 2 + 1
B. x3 + 3x 2 − 1
C. x3 +1
D. x3 − 2x 2 + 1
A. Ellipse
B. Hyperbola
C. Circle
D. Parabola
A. -3/2
B. 3/2
C. 0
D. -5/4
k(k+1) 2 k…(k+n−1) n
The formula Pk = y0 + k▿y0 + ▿ y0 +⋯+ ▿ y0 is
2 n!
A. e
B. e/2
C. e2
D. 2e
A. k and n
B. k − 1 and k + 1
C. k − 1 and n − 1
D. k + 1 and n − k
A. Multigraph
B. Non regular graph
C. Regular graph
D. Complete graph
Your Answer: Correct Answer: C Not Attempted Discuss
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
A. n edges
B. n − k edges
C. (n − k)(n − k + 1) edges
D. (n − k)(n − k + 1)/2 edges
A. 3
B. 4
C. 6
D. 9
subroutine swap(ix,iy)
it = ix
L1 : ix = iy
L2 : iy = it
end
ia = 3
ib = 8
call swap (ia, ib+5)
print *, ia, ib
end
A. S1 and S2
B. S1 and S4
C. S3
D. S1 and S5
A. I
B. A
C. -A
D. -I
A. becomes zero
B. remains unaltered
C. becomes infinitive
D. becomes negative of its original value
∣3 3∣
If ∣ ∣ = 3 then the value of x is
∣x 5∣
A. 2
B. 3
C. 4
D. 5
A. a null matrix
B. A+B+C
C. (A+B+C)'
D. -(A+B+C)
A. f (b − a)
B. f (b) − f (a)
b
C. ∫ f (x)dx
a
b
D. ∫ xf (x)dx
a
1000 −25
A. e
√2π
B. 1000
√2π
1000 −2.5
C. e
√2π
D. 400
√2π
A. 2x
B. 2
C. −2
D. 1
Activities which ensure that the software that has been built, is
traceable to customer requirement is covered as part of
A. Verification
B. Validation
C. Maintenance
D. Modeling
A. Regression Testing
B. Integration Testing
C. Unit Testing
D. System Testing
A. Replace
B. Join
C. Change
D. Update
Your Answer: Correct Answer: B Not Attempted Discuss
A. Transaction log
B. Query language
C. Report writer
D. Data manipulation language
A. Null Integrity
B. Referential Integrity
C. Domain Integrity
D. Null and Domain Integrity
A. Driver
B. Spooler
C. Interpreter
D. Linkage editor
Process is
A. Starvation
B. System throughput
C. Low device utilization
D. Cycle stealing
III. The amount of increment depends on the size of the data item
accessed
A. I only
B. II only
C. III only
D. II and III only