Академический Документы
Профессиональный Документы
Культура Документы
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. 1200
B. 1408
C. 33
D. 1050
A. 0
B. 1
C. 2
D. 3
A. Script
B. Blackboard
C. Production Rules
D. Fuzzy Logic
p = getnode()
info(p) = 10
next (p) = list
list = p
A. Bottom up parsing.
B. Top down parsing.
C. Recursive parsing.
D. Predictive parsing.
S → Aa ∣ b
A → Ac ∣ Sd ∣ ϵ
A. S → Aa ∣ b, A → bdA′ , A′ → A′ c ∣ A′ ba ∣ A ∣ ϵ
B. S → Aa ∣ b, A → A′ ∣ bdA′ , A′ → cA′ ∣ adA′ ∣ ϵ
C. S → Aa ∣ b, A → A′ c ∣ A′ d, A′ → bdA′ ∣ cA ∣ ϵ
D. S → Aa ∣ b, A → cA′ ∣ adA′ ∣ bdA′ , A′ → A ∣ ϵ
x: integer := 1
y: integer := 2
procedure add
x:= x + y
procedure second (P: Procedure)
x: integer := 2
p()
procedure first
y: integer := 3
second (add)
first ()
write_integer(x)
What does it print if the language uses dynamic scoping with deep
binding?
A. 2
B. 3
C. 4
D. 5
A. OR gate
B. AND gate
C. NAND gate
D. XOR gate
A. 1
B. 2
C. N/2
D. 2N − 1
If the frame buffer has 8 bits per pixel and 8 bits are allocated for
each of the R, G, B components, what would be the size of the
lookup table?
A. 24 bytes
B. 1024 bytes
C. 768 bytes
D. 256 bytes
A. 0x22
B. 0x1c
C. 0x16
D. Results in overflow.
A. 4
B. 5
C. 6
D. 8
A. 5
B. 6
C. 8
D. 9
A. 5.27
B. 2.00
C. 4.16
D. 6.09
Two eight bit bytes 11000011 and 01001100 are added. What are
the values of the overflow, carry and zero flags respectively, if the
arithmetic unit of the CPU uses 2's complement form?
A. 0, 1, 1′
B. 1, 1, 0
C. 1, 0, 1
D. 0, 1, 0
Your Answer: Correct Answer: D Not Attempted Discuss
How many check bits are required for 16 bit data word to detect 2
bit errors and single bit correction using hamming code?
A. 5
B. 6
C. 7
D. 8
A. 192
B. 240
C. 1920
D. 1966
A. RS − 232
B. USB
C. Firewire
D. PCI
A. RJCH
B. QIBG
C. GQPM
D. XPIN
A. {NOT, OR}
B. {NOR}
C. {AND, OR}
D. {AND, NOT}
A. Serializable
B. Repeated Read
C. Committed Read
D. Uncommitted Read
ISBN → Title
ISBN → Publisher
Publisher → Address
Calculate the order of leaf ( Pleaf ) and non leaf (P) nodes of a B+
leaf
tree based on the information given below.
A. Pleaf = 51 & p = 46
B. Pleaf = 47 & p = 52
C. Pleaf = 46 & p = 51
D. Pleaf = 52 & p = 47
A. Hashed file
B. B-Tree file
C. Indexed file
D. Sequential file
A. A + A'BCD
B. AB + CD
C. A + BCD
D. ABC + D
A. 1032
B. 776
C. 1284
D. 1536
In a three stage counter, using RS flip flops what will be the value of
the counter after giving 9 pulses to its input? Assume that the value
of counter before giving any pulses is 1.
A. 1
B. 2
C. 9
D. 10
A. Gourard shading
B. Phong shading
C. Constant shading
D. Flat shading
A. 8
B. 15
C. 14
D. 13
(2 ) (5 ) (1 )
1 2 1
vectors and and transforms them to and
(2 )
3
respectively?
(1 0 )
1 −1
A.
( 0.5 0.5 )
B.
0 0
( 1 1)
C.
−1 0
( 1 0)
D.
−1 1
A. CF = 0 or ZF = 0
B. ZF = 0 and SF = 1
C. CF = 0 and ZF = 0
D. CF = 0
A1: INC AL
JNZ A1
A. 1
B. 255
C. 256
D. Will not come out of the loop.
A. 3CH
B. 34H
C. 74H
D. 24H
The voltage ranges for a logic high and a logic low in RS- 232 C
standard is
A. Preamble
B. CRC
C. Address
D. Location
A. 11010110111011
B. 11010110111101
C. 11010110111110
D. 11010110111001
A. 20%
B. 25%
C. 40%
D. 66%
A. Unicast addressing
B. Multicast addressing
C. Broadcast addressing
D. Anycast addressing
A. Class A, 3
B. Class A, 8
C. Class B, 3
D. Class B, 32
Which algorithm is used to shape the bursty traffic into a fixed rate
traffic by averaging the data rate?
The protocol data unit for the transport layer in the internet stack is
A. Segment
B. Message
C. Datagram
D. Frame
A. −15
B. 7
C. −11
D. −3
Consider the following set of processes, with arrival times and the
required CPU-burst times given in milliseconds.
A. P1, P2, P3
B. P2, P1, P3
C. P3, P2, P1
D. P2, P3, P1
A. 150 KB/s
B. 1.38 MB/s
C. 300 KB/s
D. 2.40 MB/s
A. 25 and 5
B. 15 and 5
C. 15 and 0
D. 10 and 5
A. n
B. n2
C. n!
D. 2n
A. 5, 3
B. 10, 10
C. 15, 13
D. 15, 15
A. 218
B. 220
C. 233
D. 251
A. Mutual exclusion
B. Reentrancy
C. Hold and wait
D. No pre-emption
Your Answer: Correct Answer: B Not Attempted Discuss
Predict the state of this system, assuming that there are a total of 5
instances of resource type 1 and 4 instances of resource type 2.
A. Priority queing
B. Shortest job first
C. Youngest job first
D. Round robin
A. Ready
B. Blocked
C. Idle
D. Running
A. 55 and 45 seconds
B. 80 and 20 seconds
C. 75 and 25 seconds
D. 60 and 40 seconds
#include <stdio.h>
#include <math.h>
void main ()
{
double pi = 3.1415926535;
int a = 1;
int i;
for (i=0; i < 3; i++)
if (a = cos(pi * i/2))
printf("% d", 1);
else printf("%d", 0);
}
A. 000
B. 010
C. 101
D. 111
Class Test
{
public static void main (String [] args)
{
int x = 0;
int y = 0
for (int z = 0; z < 5; z++)
{
if((++x >2)||(++y > 2))
{
x++;
}
}
System.out.printIn (x+ "" + y);
}
}
A. 82
B. 85
C. 83
D. 53
9 6 2 3 4 4 4 4 3 4 4 2 5 8 6 8 5 5 3 2 3 3 9 6 2 7
A. {8, 5, 3, 2, 9, 6}
B. {4, 3, 6, 2, 5}
C. {3, 9, 6, 2, 7}
D. {3, 9, 6, 2}
A. 4
B. 5
C. 6
D. 7
A. Pathological coupling
B. Control coupling
C. Data coupling
D. Message coupling
A. Unit testing
B. Beta testing
C. Stress testing
D. Mutation testing
A. 50%
B. 60%
C. 70%
D. 10%
A. 0.5, 0.25
B. 0.25, 0.5
C. 0.5, 1
D. 1, 0.5
A. 14
B. 20
C. 21
D. 28
What are the final states of the DFA generated from the following
NFA?
A. q0 , q1 , q2
B. [q0 , q1 ], [q0 , q2 ], []
C. q0 , [q1 , q2 ]
D. [q0 , q1 ], q2
The number of elements in the power set of the set {{A, B}, C} is
A. 7
B. 8
C. 3
D. 4
Your Answer: Correct Answer: D Not Attempted Discuss
A. n∗ (n − 1)/2
B. n2
C. n∗ (n + 1)/2
D. n∗ (n + 1)
A. 101010. 110
B. 100110. 101
C. 101010. 101
D. 100110. 110
A. Raise
B. Exception
C. Error
D. Throwable