COMPUTER SCIENCE - PAGE 16
1. Which of the following is a correct predicate logic statement for “Every Natural number has one successor”?
(A) ∀x∃y (succ(x, y) ∧ (∃z succ(x, z) ⇒ equal (y, z)))
(B) ∀x∃y (succ(x, y) ∨ (∃z succ(x, z) ⇒ equal (y, z)))
(C) ∃y∀x (succ(x, y) ∧ (∃z succ(x, z) ⇒ equal (y, z)))
(D) ∀x∃ysucc (x, y)
Ans: A
2. α – β cutoffs are applied to ______
(A) Depth first search
(B) Best first search
(C) Minimax search
(D) Breadth first search
Ans: C
3. Enumeration is a process of
(A) Declaring a set of numbers
(B) Sorting a list of strings
(C) Assigning a legal values possible for a variable
(D) Sequencing a list of operators
Ans: D
4. Which of the following is not a part of an expert system shell?
(A) Knowledge Base
(B) Inference Engine
(C) Explanation Facility
(D) None of the above
Ans: A
5. The Blocks World Problem in Artificial Intelligence is normally discussed to explain a _______
(A) Search technique
(B) Planning system
(C) Constraint satisfaction system
(D) Knowledge base system
Ans: B
6. Means-Ends Analysis process centres on the detection of difference between the current state and the goal state. Once such a difference is found, and then to reduce the difference one applies ______
(A) A forward search that can reduce the difference.
(B) A backward search that can reduce the difference.
(C) A bidirectional search that can reduce the difference.
(D) An operator that can reduce the difference.
Ans: D
7. Suppose a file of 10,000 characters is to be sent over a line at 2400 bps. Assume that the data is sent in frames. Each frame consists of 1000 characters and an overhead of 48 bits per frame. Using synchronous transmission, the total overhead time is ______.
(A) 0.05 second
(B) 0.1 second
(C) 0.2 second
(D) 2.0 second
Ans: C
8. Which of the following is the size of Network bits and Host bits of Class Aof IP address?
(A) Network bits 7, Host bits 24
(B) Network bits 14, Host bits 16
(C) Network bits 15, Host bits 16
(D) Network bits 16, Host bits 16
Ans: A
9. Which of the following field of the TCP header tells how many bytes may be sent starting at the byte acknowledged?
(A) TCP header length
(B) Window size
(C) Acknowledgement number
(D) Urgent pointer
Ans: B
10. Which of the following is a bit rate of an 8-PSK signal having 2500 Hz bandwidth?
(A) 2500 bps
(B) 5000 bps
(C) 7500 bps
(D) 20000 bps
Ans: C
11. Match the following:
(a) UDP (i) Message Transfer Protocol
(b) OSPF (ii) Bit-oriented Protocol
(c) SMTP (iii) Interior Gateway Routing Protocol
(d) HDLC (iv) Connectionless Transport Protocol
Codes:
(a) (b) (c) (d)
(A) (iii) (iv) (ii) (i)
(B) (iv) (iii) (ii) (i)
(C) (iv) (iii) (i) (ii)
(D) (iii) (iv) (i) (ii)
Ans: C
12. Given the IP address 201.14.78.65 and the subnet mask 255.255.255.224. What is the subnet address?
(A) 201.14.78.32
(B) 201.14.78.64
(C) 201.14.78.65
(D) 201.14.78.224
Ans: B
13. If an artificial variable is present in the ‘basic variable’ of optimal simplex table then the solution is ______
(A) Alternative solution
(B) Infeasible solution
(C) Unbounded solution
(D) Degenerate solution
Ans: B
14. An optimal assignment requires that the minimum number of horizontal and vertical lines that can be drawn to cover all zeros be equal to the number of
(A) Rows or columns
(B) Rows + columns
(C) Rows + columns – 1
(D) Rows + columns + 1
Ans: A
18. Given the following productions of a grammar:
S→ aA| aBB;
A→aaA |λ;
B→ bB| bbC;
C→ B
Which of the following is true?
(A) The language corresponding to the given grammar is a set of even number of a’s.
(B) The language corresponding to the given grammar is a set of odd number of a’s.
(C) The language corresponding to the given grammar is a set of even number of a’s followed by odd number of b’s.
(D) The language corresponding to the given grammar is a set of odd number ofa’s followed by even number of b’s.
Ans: B
15. What is the size of the Unicode character in Windows Operating System?
(A) 8-Bits
(B) 16-Bits
(C) 32-Bits
(D) 64-Bits
Ans: A
16. In which tree, for every node the height of its left sub tree and right sub tree differ almost by one?
(A) Binary search tree
(B) AVL tree
(C) Threaded Binary Tree
(D) Complete Binary Tree
Ans: B
17. The design issue of Data link Layer in OSI Reference Model is
(A) Framing
(B) Representation of bits
(C) Synchronization of bits
(D) Connection control
Ans: B
18. Given the following expressions of a grammar
E -> E * F / F + E / F
F -> F – F / id
Which of the following is true?
(A) * has higher precedence than +
(B) – has higher precedence than *
(C) + and – have same precedence
(D) + has higher precedence than *
Ans: D
19. The language accepted by the nondeterministic pushdown automaton
M= ({q0, q1, q2}, {a, b}, {a, b, z}, δ, q0, z, {q2}) with transitions
δ (q0 a, z) = { (q1 a), (q2 λ)};
δ (q1, b, a) = { (q1, b)}
δ (q1, b, b) ={ (q1 b)}, δ (q1, a, b) = { (q2, λ)} is
(A) L(abb*a)
(B) {a} U L(abb*a)
(C) L(ab*a)
(D) {a} U L(ab*a)
Ans: B
20. Given an empty stack, after performing push (1), push (2), Pop, push (3), push (4), Pop, Pop, push (5), pop, what is the value of the top of the stack?
(A) 4
(B) 3
(C) 2
(D) 1
Ans: D
21. Assume statements S1 and S2 defined as:
S1: L2-L1 is recursive enumerable where L1 and L2 are recursive and recursive enumerable respectively.
S2: The set of all Turing machines is countable.
Which of the following is true?
(A) S1 is correct and S2 is not correct.
(B) Both S1 and S2 are correct.
(C) Both S1 and S2 are not correct.
(D) S1 is not correct and S2 is correct.
Ans: B
22. Non-deterministic pushdown automaton that accepts the language generated by the grammar: S→aSS | ab is
(A) δ(q0, λ, z) = { (q1, z)};
δ(q0, a, S) = { (q1, SS)}, (q1, B) }
δ(q0, b, B) = { (q1, λ)},
δ(q1, λ, z) = { (qf, λ)}
(B) δ(q0, λ, z) = { (q1, Sz)};
δ(q0, a, S) = { (q1, SS)}, (q1, B) }
δ(q0, b, B) = { (q1, λ)},
δ(q1, λ, z) = { (qf, λ)}
(C) δ(q0, λ, z) = { (q1, Sz)};
δ(q0, a, S) = { (q1, S)}, (q1, B) }
δ(q0, b, λ) = { (q1, B)},
δ(q1, λ, z) = { (qf, λ)}
(D) δ(q0, λ, z) = { (q1, z)};
δ(q0, a, S) = { (q1, SS)}, (q1, B) }
δ(q0, b, λ) = { (q1, B)},
δ(q1, λ, z) = { (qf, λ)}
Ans: B
23. Match the following:
(a) Dangling pointer (i) Buffer replacement policy
(b) Page fault (ii) Variable length records
(c) List representation (iii) Object identifier
(d) Toss immediate (iv) Pointer-swizzling
Codes:
(a) (b) (c) (d)
(A) (iii) (iv) (ii) (i)
(B) (iv) (iii) (ii) (i)
(C) (iv) (iii) (i) (ii)
(D) (iii) (iv) (i) (ii)
Ans: A
24. _______ constraints ensure that a value that appears in one relation for a given set of attributes also appears for a certain set of attributes in another relation.
(A) Logical Integrity
(B) Referential Integrity
(C) Domain Integrity
(D) Data Integrity
Ans: B
25. The SQL expression
Select distinct T, branch_name from branch T, branch S
where T.assets>S.assets and S.branch_city=”Mumbai” finds the names of
(A) All branches that have greater assets than some branch located in Mumbai.
(B) All branches that have greater assets than all branches in Mumbai.
(C) The branch that has greatest asset in Mumbai.
(D) Any branch that has greater assets than any branch in Mumbai.
Ans: A
26. Let A be the set of comfortable houses given as
A = {x1/0.8, x2/0.9, x3/0.1, x4/0.7} and B be the set of affordable houses B = {x1/0.9, x2/0.8, x3/0.6, x4/0.2}
Then the set of comfortable and affordable houses is
(A) {x1/0.8, x2/0.8, x3/0.1, x4/0.2}
(B) {x1/0.9, x2/0.9, x3/0.6, x4/0.7}
(C) {x1/0.8, x2/0.8, x3/0.6, x4/0.7}
(D) {x1/0.7, x2/0.7, x3/0.7, x4/0.9}
Ans: A
27. Support of a fuzzy set
A = { x1/0.2, x2/0.15, x3/0.9, x4/0.95, x5/0.15} within a universal set X is given as
(A) {x1/0.15, x2/0.15, x3/0.15, x4/0.15, x5/0.15}
(B) {x1/0.95, x2/0.95, x3/0.95, x4/0.95, x5/0.95}
(C) {x3, x4}
(D) {x1, x2, x3, x4, x5}
Ans: D
28. In a single perceptron, the updation rule of weight vector is given by
(A) W(n + 1)=w(n)+η[d(n)-y(n)]
(B) W(n + 1) =w(n)–η[d(n)-y(n)]
(C) w(n + 1)=w(n)+η[d(n)-y(n)]* x (n)
(D) w(n + 1)=w(n)–η[d(n)-y(n)]* x (n)
Ans: C
29. ______ refers to the discrepancy among a computed, observed or measured value and the true specified or theoretically correct values.
(A) Fault
(B) Failure
(C) Defect
(D) Error
Ans: D
30. Which logic family dissipates the minimum power?
(A) DTL
(B) TTL
(C) ECL
(D) CMOS
Ans: D
31. Which of the following electronic component is not found in IC’s?
(A) Diode
(B) Resistor
(C) Transistor
(D) Inductor
Ans: D
32. Match the following with respect to C++ data types:
a. User defined type 1. Qualifier
b. Built in type 2. Union
c. Derived type 3. Void
d. Long double 4. Pointer
Code:
a b c d
(A) 2 3 4 1
(B) 3 1 4 2
(C) 4 1 2 3
(D) 3 4 1 2
Ans: C
33. The instruction: MOV CL, [BX] [DI] + 8 represent the _____ addressing mode.
(A) Based Relative
(B) Based Indexed
(C) Indexed Relative
(D) Register Indexed
Ans: B
34. AES is a round cipher based on the Rijndal Algorithm that uses a 128-bit block of data. AES has three different configurations. ______ rounds with a key size of 128 bits, ______ rounds with a key size of 192 bits and ______ rounds with a key size of 256 bits.
(A) 5, 7, 15
(B) 10, 12, 14
(C) 5, 6, 7
(D) 20, 12, 14
Ans: D
35. Match the following IC families with their basic circuits:
a. TTL 1. NAND
b. ECL 2. NOR
c. CMOS 3. Inverter
Code:
a b c
(A) 1 2 3
(B) 3 2 1
(C) 2 3 1
(D) 2 1 3
Ans: C
36. A binary ripple counter is required to count up to 16383. How many flip-flops are required?
(A) 16382
(B) 8191
(C) 512
(D) 14
Ans: D
37. In UNIX, which of the following command is used to set the task priority?
(A) Init
(B) Nice
(C) Kill
(D) PS
Ans: D
38. How many people must there be in a room before there is a 50% chance that two of them were born on the same day of the year?
(A) At least 23
(B) At least 183
(C) At least 366
(D) At least 730
Ans: A
39. Match the following identities/laws to their corresponding name:
(a) x + x = x
x • x = x i. Dominance
(b) x + 0 = x
x • 1 = x ii. Absorption
(c) x + 1 = 1
x • 0 = 0 iii. Idempotent
(d) x • (x + y) = x iv. Identity
Codes:
(a) (b) (c) (d)
(A) iii iv i ii
(B) iv iii i ii
(C) iv iii ii i
(D) iii iv ii i
Ans: A
40. In which one of the following, continuous process improvement is done?
(A) ISO9001
(B) RMMM
(C) CMM
(D) None of the above
Ans: C
41. The ______ of a program or computing system is the structure or structures of the system, which comprise software components, the externally visible properties of these components, and the relationship among them.
(A) E-R diagram
(B) Data flow diagram
(C) Software architecture
(D) Software design
Ans: C
42. Working software is not available until late in the process in
(A) Waterfall model
(B) Prototyping model
(C) Incremental model
(D) Evolutionary Development model
Ans: A
43. Equivalence partitioning is a ______ testing method that divides the input domain of a program into classes of data from which test cases can be derived.
(A) White box
(B) Black box
(C) Regression
(D) Smoke
Ans: B
44. Consider the following characteristics:
(i) Correct and unambiguous
(ii) Complete and consistent
(iii) Ranked for importance and/or stability and verifiable
(iv) Modifiable and Traceable
Which of the following is true for a good SRS?
(A) (i), (ii) and (iii)
(B) (i), (iii) and (iv)
(C) (ii), (iii) and (iv)
(D) (i), (ii), (iii) and (iv)
Ans: D
45. Linked Lists are not suitable for _____.
(A) Binary Search
(B) Polynomial Manipulation
(C) Insertion
(D) Radix Sort
Ans: A
46. What is the size of the following Union? Assume that the size of int = 2, size of float = 4, size of char = 1
union tag {
int a;
float b;
char c;
};
(A) 2
(B) 4
(C) 1
(D) 7
Ans: B
47. What is the output of the following program segment?
sum (n)
{
if ( n < 1 ) return n;
else return (n + sum(n–1));
}
main()
{
print f(“%d”, sum(5));
}
(A) 10
(B) 16
(C) 15
(D) 14
Ans: C
48. Assume that x and y is non-zero positive integers. What does the following program segment perform?
While (x! =0)
{
if (x>y)
x = x-y
else
y=y-x;
printf(“%d”,x);
(A) Computes LCM of two numbers
(B) Computes GCD of two numbers
(C) Divides large number with small number
(D) Subtracts smaller number from large number
Ans: B
49. Which of the following is the most powerful paring method?(A) LL (I)
(B) Canonical LR
(C) SLR
(D) LALR
Ans: C
50. Usage of Preemption and Transaction Rollback prevents ______.
(A) Unauthorized usage of data file
(B) Deadlock situation
(C) Data manipulation
(D) File preemption
Ans: B
(A) ∀x∃y (succ(x, y) ∧ (∃z succ(x, z) ⇒ equal (y, z)))
(B) ∀x∃y (succ(x, y) ∨ (∃z succ(x, z) ⇒ equal (y, z)))
(C) ∃y∀x (succ(x, y) ∧ (∃z succ(x, z) ⇒ equal (y, z)))
(D) ∀x∃ysucc (x, y)
Ans: A
2. α – β cutoffs are applied to ______
(A) Depth first search
(B) Best first search
(C) Minimax search
(D) Breadth first search
Ans: C
3. Enumeration is a process of
(A) Declaring a set of numbers
(B) Sorting a list of strings
(C) Assigning a legal values possible for a variable
(D) Sequencing a list of operators
Ans: D
4. Which of the following is not a part of an expert system shell?
(A) Knowledge Base
(B) Inference Engine
(C) Explanation Facility
(D) None of the above
Ans: A
5. The Blocks World Problem in Artificial Intelligence is normally discussed to explain a _______
(A) Search technique
(B) Planning system
(C) Constraint satisfaction system
(D) Knowledge base system
Ans: B
6. Means-Ends Analysis process centres on the detection of difference between the current state and the goal state. Once such a difference is found, and then to reduce the difference one applies ______
(A) A forward search that can reduce the difference.
(B) A backward search that can reduce the difference.
(C) A bidirectional search that can reduce the difference.
(D) An operator that can reduce the difference.
Ans: D
7. Suppose a file of 10,000 characters is to be sent over a line at 2400 bps. Assume that the data is sent in frames. Each frame consists of 1000 characters and an overhead of 48 bits per frame. Using synchronous transmission, the total overhead time is ______.
(A) 0.05 second
(B) 0.1 second
(C) 0.2 second
(D) 2.0 second
Ans: C
8. Which of the following is the size of Network bits and Host bits of Class Aof IP address?
(A) Network bits 7, Host bits 24
(B) Network bits 14, Host bits 16
(C) Network bits 15, Host bits 16
(D) Network bits 16, Host bits 16
Ans: A
9. Which of the following field of the TCP header tells how many bytes may be sent starting at the byte acknowledged?
(A) TCP header length
(B) Window size
(C) Acknowledgement number
(D) Urgent pointer
Ans: B
10. Which of the following is a bit rate of an 8-PSK signal having 2500 Hz bandwidth?
(A) 2500 bps
(B) 5000 bps
(C) 7500 bps
(D) 20000 bps
Ans: C
11. Match the following:
(a) UDP (i) Message Transfer Protocol
(b) OSPF (ii) Bit-oriented Protocol
(c) SMTP (iii) Interior Gateway Routing Protocol
(d) HDLC (iv) Connectionless Transport Protocol
Codes:
(a) (b) (c) (d)
(A) (iii) (iv) (ii) (i)
(B) (iv) (iii) (ii) (i)
(C) (iv) (iii) (i) (ii)
(D) (iii) (iv) (i) (ii)
Ans: C
12. Given the IP address 201.14.78.65 and the subnet mask 255.255.255.224. What is the subnet address?
(A) 201.14.78.32
(B) 201.14.78.64
(C) 201.14.78.65
(D) 201.14.78.224
Ans: B
13. If an artificial variable is present in the ‘basic variable’ of optimal simplex table then the solution is ______
(A) Alternative solution
(B) Infeasible solution
(C) Unbounded solution
(D) Degenerate solution
Ans: B
14. An optimal assignment requires that the minimum number of horizontal and vertical lines that can be drawn to cover all zeros be equal to the number of
(A) Rows or columns
(B) Rows + columns
(C) Rows + columns – 1
(D) Rows + columns + 1
Ans: A
18. Given the following productions of a grammar:
S→ aA| aBB;
A→aaA |λ;
B→ bB| bbC;
C→ B
Which of the following is true?
(A) The language corresponding to the given grammar is a set of even number of a’s.
(B) The language corresponding to the given grammar is a set of odd number of a’s.
(C) The language corresponding to the given grammar is a set of even number of a’s followed by odd number of b’s.
(D) The language corresponding to the given grammar is a set of odd number ofa’s followed by even number of b’s.
Ans: B
15. What is the size of the Unicode character in Windows Operating System?
(A) 8-Bits
(B) 16-Bits
(C) 32-Bits
(D) 64-Bits
Ans: A
16. In which tree, for every node the height of its left sub tree and right sub tree differ almost by one?
(A) Binary search tree
(B) AVL tree
(C) Threaded Binary Tree
(D) Complete Binary Tree
Ans: B
17. The design issue of Data link Layer in OSI Reference Model is
(A) Framing
(B) Representation of bits
(C) Synchronization of bits
(D) Connection control
Ans: B
18. Given the following expressions of a grammar
E -> E * F / F + E / F
F -> F – F / id
Which of the following is true?
(A) * has higher precedence than +
(B) – has higher precedence than *
(C) + and – have same precedence
(D) + has higher precedence than *
Ans: D
19. The language accepted by the nondeterministic pushdown automaton
M= ({q0, q1, q2}, {a, b}, {a, b, z}, δ, q0, z, {q2}) with transitions
δ (q0 a, z) = { (q1 a), (q2 λ)};
δ (q1, b, a) = { (q1, b)}
δ (q1, b, b) ={ (q1 b)}, δ (q1, a, b) = { (q2, λ)} is
(A) L(abb*a)
(B) {a} U L(abb*a)
(C) L(ab*a)
(D) {a} U L(ab*a)
Ans: B
20. Given an empty stack, after performing push (1), push (2), Pop, push (3), push (4), Pop, Pop, push (5), pop, what is the value of the top of the stack?
(A) 4
(B) 3
(C) 2
(D) 1
Ans: D
21. Assume statements S1 and S2 defined as:
S1: L2-L1 is recursive enumerable where L1 and L2 are recursive and recursive enumerable respectively.
S2: The set of all Turing machines is countable.
Which of the following is true?
(A) S1 is correct and S2 is not correct.
(B) Both S1 and S2 are correct.
(C) Both S1 and S2 are not correct.
(D) S1 is not correct and S2 is correct.
Ans: B
22. Non-deterministic pushdown automaton that accepts the language generated by the grammar: S→aSS | ab is
(A) δ(q0, λ, z) = { (q1, z)};
δ(q0, a, S) = { (q1, SS)}, (q1, B) }
δ(q0, b, B) = { (q1, λ)},
δ(q1, λ, z) = { (qf, λ)}
(B) δ(q0, λ, z) = { (q1, Sz)};
δ(q0, a, S) = { (q1, SS)}, (q1, B) }
δ(q0, b, B) = { (q1, λ)},
δ(q1, λ, z) = { (qf, λ)}
(C) δ(q0, λ, z) = { (q1, Sz)};
δ(q0, a, S) = { (q1, S)}, (q1, B) }
δ(q0, b, λ) = { (q1, B)},
δ(q1, λ, z) = { (qf, λ)}
(D) δ(q0, λ, z) = { (q1, z)};
δ(q0, a, S) = { (q1, SS)}, (q1, B) }
δ(q0, b, λ) = { (q1, B)},
δ(q1, λ, z) = { (qf, λ)}
Ans: B
23. Match the following:
(a) Dangling pointer (i) Buffer replacement policy
(b) Page fault (ii) Variable length records
(c) List representation (iii) Object identifier
(d) Toss immediate (iv) Pointer-swizzling
Codes:
(a) (b) (c) (d)
(A) (iii) (iv) (ii) (i)
(B) (iv) (iii) (ii) (i)
(C) (iv) (iii) (i) (ii)
(D) (iii) (iv) (i) (ii)
Ans: A
24. _______ constraints ensure that a value that appears in one relation for a given set of attributes also appears for a certain set of attributes in another relation.
(A) Logical Integrity
(B) Referential Integrity
(C) Domain Integrity
(D) Data Integrity
Ans: B
25. The SQL expression
Select distinct T, branch_name from branch T, branch S
where T.assets>S.assets and S.branch_city=”Mumbai” finds the names of
(A) All branches that have greater assets than some branch located in Mumbai.
(B) All branches that have greater assets than all branches in Mumbai.
(C) The branch that has greatest asset in Mumbai.
(D) Any branch that has greater assets than any branch in Mumbai.
Ans: A
26. Let A be the set of comfortable houses given as
A = {x1/0.8, x2/0.9, x3/0.1, x4/0.7} and B be the set of affordable houses B = {x1/0.9, x2/0.8, x3/0.6, x4/0.2}
Then the set of comfortable and affordable houses is
(A) {x1/0.8, x2/0.8, x3/0.1, x4/0.2}
(B) {x1/0.9, x2/0.9, x3/0.6, x4/0.7}
(C) {x1/0.8, x2/0.8, x3/0.6, x4/0.7}
(D) {x1/0.7, x2/0.7, x3/0.7, x4/0.9}
Ans: A
27. Support of a fuzzy set
A = { x1/0.2, x2/0.15, x3/0.9, x4/0.95, x5/0.15} within a universal set X is given as
(A) {x1/0.15, x2/0.15, x3/0.15, x4/0.15, x5/0.15}
(B) {x1/0.95, x2/0.95, x3/0.95, x4/0.95, x5/0.95}
(C) {x3, x4}
(D) {x1, x2, x3, x4, x5}
Ans: D
28. In a single perceptron, the updation rule of weight vector is given by
(A) W(n + 1)=w(n)+η[d(n)-y(n)]
(B) W(n + 1) =w(n)–η[d(n)-y(n)]
(C) w(n + 1)=w(n)+η[d(n)-y(n)]* x (n)
(D) w(n + 1)=w(n)–η[d(n)-y(n)]* x (n)
Ans: C
29. ______ refers to the discrepancy among a computed, observed or measured value and the true specified or theoretically correct values.
(A) Fault
(B) Failure
(C) Defect
(D) Error
Ans: D
30. Which logic family dissipates the minimum power?
(A) DTL
(B) TTL
(C) ECL
(D) CMOS
Ans: D
31. Which of the following electronic component is not found in IC’s?
(A) Diode
(B) Resistor
(C) Transistor
(D) Inductor
Ans: D
32. Match the following with respect to C++ data types:
a. User defined type 1. Qualifier
b. Built in type 2. Union
c. Derived type 3. Void
d. Long double 4. Pointer
Code:
a b c d
(A) 2 3 4 1
(B) 3 1 4 2
(C) 4 1 2 3
(D) 3 4 1 2
Ans: C
33. The instruction: MOV CL, [BX] [DI] + 8 represent the _____ addressing mode.
(A) Based Relative
(B) Based Indexed
(C) Indexed Relative
(D) Register Indexed
Ans: B
34. AES is a round cipher based on the Rijndal Algorithm that uses a 128-bit block of data. AES has three different configurations. ______ rounds with a key size of 128 bits, ______ rounds with a key size of 192 bits and ______ rounds with a key size of 256 bits.
(A) 5, 7, 15
(B) 10, 12, 14
(C) 5, 6, 7
(D) 20, 12, 14
Ans: D
35. Match the following IC families with their basic circuits:
a. TTL 1. NAND
b. ECL 2. NOR
c. CMOS 3. Inverter
Code:
a b c
(A) 1 2 3
(B) 3 2 1
(C) 2 3 1
(D) 2 1 3
Ans: C
36. A binary ripple counter is required to count up to 16383. How many flip-flops are required?
(A) 16382
(B) 8191
(C) 512
(D) 14
Ans: D
37. In UNIX, which of the following command is used to set the task priority?
(A) Init
(B) Nice
(C) Kill
(D) PS
Ans: D
38. How many people must there be in a room before there is a 50% chance that two of them were born on the same day of the year?
(A) At least 23
(B) At least 183
(C) At least 366
(D) At least 730
Ans: A
39. Match the following identities/laws to their corresponding name:
(a) x + x = x
x • x = x i. Dominance
(b) x + 0 = x
x • 1 = x ii. Absorption
(c) x + 1 = 1
x • 0 = 0 iii. Idempotent
(d) x • (x + y) = x iv. Identity
Codes:
(a) (b) (c) (d)
(A) iii iv i ii
(B) iv iii i ii
(C) iv iii ii i
(D) iii iv ii i
Ans: A
40. In which one of the following, continuous process improvement is done?
(A) ISO9001
(B) RMMM
(C) CMM
(D) None of the above
Ans: C
41. The ______ of a program or computing system is the structure or structures of the system, which comprise software components, the externally visible properties of these components, and the relationship among them.
(A) E-R diagram
(B) Data flow diagram
(C) Software architecture
(D) Software design
Ans: C
42. Working software is not available until late in the process in
(A) Waterfall model
(B) Prototyping model
(C) Incremental model
(D) Evolutionary Development model
Ans: A
43. Equivalence partitioning is a ______ testing method that divides the input domain of a program into classes of data from which test cases can be derived.
(A) White box
(B) Black box
(C) Regression
(D) Smoke
Ans: B
44. Consider the following characteristics:
(i) Correct and unambiguous
(ii) Complete and consistent
(iii) Ranked for importance and/or stability and verifiable
(iv) Modifiable and Traceable
Which of the following is true for a good SRS?
(A) (i), (ii) and (iii)
(B) (i), (iii) and (iv)
(C) (ii), (iii) and (iv)
(D) (i), (ii), (iii) and (iv)
Ans: D
45. Linked Lists are not suitable for _____.
(A) Binary Search
(B) Polynomial Manipulation
(C) Insertion
(D) Radix Sort
Ans: A
46. What is the size of the following Union? Assume that the size of int = 2, size of float = 4, size of char = 1
union tag {
int a;
float b;
char c;
};
(A) 2
(B) 4
(C) 1
(D) 7
Ans: B
47. What is the output of the following program segment?
sum (n)
{
if ( n < 1 ) return n;
else return (n + sum(n–1));
}
main()
{
print f(“%d”, sum(5));
}
(A) 10
(B) 16
(C) 15
(D) 14
Ans: C
48. Assume that x and y is non-zero positive integers. What does the following program segment perform?
While (x! =0)
{
if (x>y)
x = x-y
else
y=y-x;
printf(“%d”,x);
(A) Computes LCM of two numbers
(B) Computes GCD of two numbers
(C) Divides large number with small number
(D) Subtracts smaller number from large number
Ans: B
49. Which of the following is the most powerful paring method?(A) LL (I)
(B) Canonical LR
(C) SLR
(D) LALR
Ans: C
50. Usage of Preemption and Transaction Rollback prevents ______.
(A) Unauthorized usage of data file
(B) Deadlock situation
(C) Data manipulation
(D) File preemption
Ans: B
51. The _____ language was originally designed as the Transformation Language for Style Sheet facility.
(A) XSTL
(B) XML
(C) XQuery
(D) XPath
Ans: A
52. Views are useful for _____ unwanted information, and for collecting together information from more than one relation into a single view.
(A) Hiding
(B) Deleting
(C) Highlighting
(D) All of the above
Ans: A
53. The decision tree classifier is a widely used technique for ______.
(A) Classification
(B) Association
(C) Partition
(D) Clustering
Ans: A
54. Cross_tab displays permit users to view ______ of multidimensional data at a time.
(A) One dimension
(B) Two dimensions
(C) Three dimensions
(D) Multi dimensions
Ans: B
55. A method to provide secure transmission of email is called ____.
(A) TLS
(B) SA
(C) IPSec
(D) PGP
Ans: D
56. Thoma’s-write rule is ______.
(A) Two phase locking protocol
(B) Timestamp ordering protocol
(C) One phase locking protocol
(D) Sliding window protocol
Ans: B
57. Match the following:
List – I List - II
Process state transition Reason for transition
a Ready→ Running i. Request made by the process is satisfied or an event for which it was waiting occurs.
b Blocked→ Ready ii. Process wishes to wait for some action by another process.
c Running→ Blocked iii. The process is dispatched.
d Running→ Ready iv. The process is preempted.
Codes:
a b c d
(A) iii i ii iv
(B) iv i iii ii
(C) iv iii i ii
(D) iii iii ii i
Ans: A
58. The hit ratio of a Translation Look Aside Buffer (TLAB) is 80%. It takes 20 nanoseconds (ns) to search TLAB and 100 ns to access main memory. The effective memory access time is ______.
(A) 36 ns
(B) 140 ns
(C) 122 ns
(D) 40 ns
Ans: B
59. Consider the input/output (I/O) requests made at different instants of time directed at a hypothetical disk having 200 tracks as given in the following table:
Serial No. 1 2 3 4 5
Track No. 12 85 40 100 75
Time of arrival 65 80 110 100 175
Assume that :
Current head position is at track no. 65
Direction of last movement is towards higher numbered tracks
Current clock time is 160 milliseconds
Head movement time per track is 1 millisecond.
“look” is a variant of “SCAN” diskarm scheduling algorithm. In this algorithm, if no more I/O requests are left in current direction, the disk head reverses its direction. The seek times in Shortest Seek First (SSF) and “look” disk-arm scheduling algorithms respectively are :
(A) 144 and 123 milliseconds
(B) 143 and 123 milliseconds
(C) 149 and 124 milliseconds
(D) 256 and 186 milliseconds
Ans: B
60. The maximum number of keys stored in a B-tree of order m and depth d is
(A) md + 1 – 1
(B) (md+1 – 1) / (m – 1)
(C) (m – 1) (md + 1 – 1)
(D) (md – 1)/(m – 1)
Ans: B
61. Which of the following set of UNIX commands will always display “WELCOME”?
(A) Export title=WELCOME; Echo $title
(B) Title = WELCOME; export $ title; sh –c “echo $title”
(C) Title = WELCOME; export title; sh –c “echo $title”
(D) Title = WELCOME; echo $title
Ans: C
62. The speed up of a pipeline processing over an equivalent non-pipeline processing is defined by the ratio:
(A) S = n tn / (k + n – 1)tp
(B) S = n tn / (k + n + 1)tp
(C) S = n tn / (k – n + 1)tp
(D) S = (k + n – 1)tp / n tn
Where n → no. of tasks
tn → time of completion of each task
k → no. of segments of pipeline
tp → clock cycle time
S → speed up ratio
Ans: A
63. Suppose that someone starts with a chain letter. Each person who receives the letter is asked to send it on to 4 other people. Some people do this, while some do not send any letter.
How many people have seen the letter, including the first person, if no one receives more than one letter and if the chain letter ends after there have been 100 people who read it but did not send it out? Also find how many people sent out the letter?
(A) 122 & 22
(B) 111 & 11
(C) 133 & 33
(D) 144 & 44
Ans: D
64. A hash function f defined as f (key) = key mod 13, with linear probing is used to insert keys 55, 58, 68, 91, 27, 145. What will be the location of 79?
(A) 1
(B) 2
(C) 3
(D) 4
Ans: B
65. Which of the following is true while converting CFG to LL (I) grammar?
(A) Remove left recursion alone
(B) Factoring grammar alone
(C) Both of the above
(D) None of the above
Ans: D
66. Identify the Risk factors which are associated with Electronic payment system.
(A) Fraudulent use of Credit Cards.
(B) Sending Credit Card details over internet.
(C) Remote storage of Credit Card details.
(D) All of the above
Ans: B
67. Which of the following are two special functions that are meant for handling exception that occurs during exception handling itself?
(A) Void terminate ( ) and Void unexpected ( )
(B) Non void terminate ( ) and void unexpected ( )
(C) Void terminate ( ) and non-void unexpected ( )
(D) Non void terminate ( ) and non-void unexpected ( )
Ans: D
68. Which of the following memory allocation scheme suffers from external fragmentation?
(A) Segmentation
(B) Pure demand paging
(C) Swapping
(D) Paging
Ans: D
69. Basis path testing falls under
(A) System testing
(B) White box testing
(C) Black box testing
(D) Unit testing
Ans: C
70. The User Work Area (UWA) is a set of Program variables declared in the host program to communicate the contents of individual records between
(A) DBMS & the Host record
(B) Host program and Host record
(C) Host program and DBMS
(D) Host program and Host language
Ans: B
71. The worst case time complexity of AVL tree is better in comparison to binary search tree for
(A) Search and Insert Operations
(B) Search and Delete Operations
(C) Insert and Delete Operations
(D) Search, Insert and Delete Operations
Ans: A
72. The GSM network is divided into the following three major systems:
(A) SS, BSS, OSS
(B) BSS, BSC, MSC
(C) CELL, BSC, OSS
(D) SS, CELL, MSC
Ans: B
73. If the disk head is located initially at 32, find the number of disk moves required with FCFS if the disks queue of I/O blocks requests are 98, 37, 14, 124, 65, 67.
(A) 239
(B) 310
(C) 321
(D) 325
Ans: B
74. Component level design is concerned with
(A) Flow oriented analysis
(B) Class based analysis
(C) Both of the above
(D) None of the above
Ans: A
75. The ‘C’ language is
(A) Context free language
(B) Context sensitive language
(C) Regular language
(D) None of the above
Ans: D
76. The Mobile Application Protocol (MAP) typically runs on top of which protocol?
(A) SNMP (Simple Network Management Protocol)
(B) SMTP (Simple Mail Transfer Protocol)
(C) SS7 (Signalling System 7)
(D) HTTP (Hyper Text Transfer Protocol)
Ans: D
77. If a packet arrives with an M-bit value is ‘l’ and a fragmentation offset value ‘0’, and then it is ______ fragment.
(A) First
(B) Middle
(C) Last
(D) All of the above
Ans: D
78. The number of bit strings of length eight that will either start with a 1 bit or end with two bits 00 shall be
(A) 32
(B) 64
(C) 128
(D) 160
Ans: D
79. In compiler design ‘reducing the strength’ refers to
(A) Reducing the range of values of input variables.
(B) Code optimization using cheaper machine instructions.
(C) Reducing efficiency of program.
(D) None of the above
Ans: C
80. In which addressing mode, the effective address of the operand is generated by adding a constant value to the contents of register?
(A) Absolute
(B) Indirect
(C) Immediate
(D) Index
Ans: B
81. Which of the following is true?
(A) A relation in BCNF is always in 3NF.
(B) A relation in 3NF is always in BCNF.
(C) BCNF and 3NF are same.
(D) A relation in BCNF is not in 3NF.
Ans: B
82. Given memory partitions of 100 K, 500 K, 200 K, 300 K and 600 K (in order) and processes of 212 K, 417 K, 112 K, and 426 K (in order), using the first-fit algorithm, in which partition would the process requiring 426 K be placed?
(A) 500 K
(B) 200 K
(C) 300 K
(D) 600 K
Ans: B
83. The maturity levels used to measure a process are
(A) Initial, Repeatable, Defined, Managed, Optimized.
(B) Primary, Secondary, Defined, Managed, Optimized.
(C) Initial, Stating, Defined, Managed, Optimized.
(D) None of the above
Ans: A
84. The problem of indefinite blockage of low-priority jobs in general priority scheduling algorithm can be solved using:
(A) Parity bit
(B) Aging
(C) Compaction
(D) Timer
Ans: C
85. Which API is used to draw a circle?
(A) Circle ( )
(B) Ellipse ( )
(C) Round Rect ( )
(D) Pie ( )
Ans: B
86. In DML, RECONNCT command cannot be used with
(A) OPTIONAL Set
(B) FIXED Set
(C) MANDATOR Set
(D) All of the above
Ans: D
87. RAD stands for ______.
(A) Rapid and Design
(B) Rapid Aided Development
(C) Rapid Application Development
(D) Rapid Application Design
Ans: C
88:-The output of a lexical analyzer is __________.
A:-Program B:-Machine code
C:-Object code D:-Stream of tokens
Ans: D
89:-The amount of vertical space between lines of text in a document is called _________.
A:-Word spacing B:-Line spacing C:-Multi-line D:-Single line
Ans: B
90:-The communication between computers in network is governed by a set of rules and regulations known as _______________. A:-Protocols B:-Standard rules C:-System rules D:-None of the above
Ans: A
91:-The SQL CREATE TABLE command is a ____________.
A:-DCL command B:-TCL command C:-DML command D:-DDL command
Ans: D
92:-The ____________ file system is always mounted.
A:-Directory B:-Root C:-CatchFS D:-None of the above
Ans: B
93:-____________ were designed to be a reliable mechanism for websites to remember stateful information or to record the user's browsing activity.
A:-Browsers B:-Cookies C:-Pug-ins D:-Scripts
Ans: B
94:-A ____________ is someone who seeks to beach defenses and exploit weaknesses in a computer system or network.
A:-Blocker B:-Robber C:-Hacker D:-Scripts
Ans: C
95:-A _________ is a field or collection of fields in a relational database table that provides a link between data in two tables.
A:-Primary key B:-Master key C:-Collection key D:-Foreign key
Ans: D
96:-The base of an octal number system is ___________.
A:-8 B:-16 C:-2 D:-10
Ans: A
97:-The '#' symbol at the beginning of a statement in a C/C++ program indicates that it is a _____________.
A:-Comment B:-Object directive C:-Preprocessor directive D:-String
Ans: C
98:-Hardware/Software designed to guard against unauthorized access to a computer network is known as ___________.
A:-Netwall B:-Wallblock C:-Bouncer D:-Firewall
Ans: D
99:-A row in a relational table is also referred to as __________.
A:-Value B:-Field C:-Tuple D:-Attribute
Ans: C
100:-The program that converts high level code to low level code is called ____________.
A:-Processor B:-Compiler C:-Emulator D:-Converter
Ans: B
(A) XSTL
(B) XML
(C) XQuery
(D) XPath
Ans: A
52. Views are useful for _____ unwanted information, and for collecting together information from more than one relation into a single view.
(A) Hiding
(B) Deleting
(C) Highlighting
(D) All of the above
Ans: A
53. The decision tree classifier is a widely used technique for ______.
(A) Classification
(B) Association
(C) Partition
(D) Clustering
Ans: A
54. Cross_tab displays permit users to view ______ of multidimensional data at a time.
(A) One dimension
(B) Two dimensions
(C) Three dimensions
(D) Multi dimensions
Ans: B
55. A method to provide secure transmission of email is called ____.
(A) TLS
(B) SA
(C) IPSec
(D) PGP
Ans: D
56. Thoma’s-write rule is ______.
(A) Two phase locking protocol
(B) Timestamp ordering protocol
(C) One phase locking protocol
(D) Sliding window protocol
Ans: B
57. Match the following:
List – I List - II
Process state transition Reason for transition
a Ready→ Running i. Request made by the process is satisfied or an event for which it was waiting occurs.
b Blocked→ Ready ii. Process wishes to wait for some action by another process.
c Running→ Blocked iii. The process is dispatched.
d Running→ Ready iv. The process is preempted.
Codes:
a b c d
(A) iii i ii iv
(B) iv i iii ii
(C) iv iii i ii
(D) iii iii ii i
Ans: A
58. The hit ratio of a Translation Look Aside Buffer (TLAB) is 80%. It takes 20 nanoseconds (ns) to search TLAB and 100 ns to access main memory. The effective memory access time is ______.
(A) 36 ns
(B) 140 ns
(C) 122 ns
(D) 40 ns
Ans: B
59. Consider the input/output (I/O) requests made at different instants of time directed at a hypothetical disk having 200 tracks as given in the following table:
Serial No. 1 2 3 4 5
Track No. 12 85 40 100 75
Time of arrival 65 80 110 100 175
Assume that :
Current head position is at track no. 65
Direction of last movement is towards higher numbered tracks
Current clock time is 160 milliseconds
Head movement time per track is 1 millisecond.
“look” is a variant of “SCAN” diskarm scheduling algorithm. In this algorithm, if no more I/O requests are left in current direction, the disk head reverses its direction. The seek times in Shortest Seek First (SSF) and “look” disk-arm scheduling algorithms respectively are :
(A) 144 and 123 milliseconds
(B) 143 and 123 milliseconds
(C) 149 and 124 milliseconds
(D) 256 and 186 milliseconds
Ans: B
60. The maximum number of keys stored in a B-tree of order m and depth d is
(A) md + 1 – 1
(B) (md+1 – 1) / (m – 1)
(C) (m – 1) (md + 1 – 1)
(D) (md – 1)/(m – 1)
Ans: B
61. Which of the following set of UNIX commands will always display “WELCOME”?
(A) Export title=WELCOME; Echo $title
(B) Title = WELCOME; export $ title; sh –c “echo $title”
(C) Title = WELCOME; export title; sh –c “echo $title”
(D) Title = WELCOME; echo $title
Ans: C
62. The speed up of a pipeline processing over an equivalent non-pipeline processing is defined by the ratio:
(A) S = n tn / (k + n – 1)tp
(B) S = n tn / (k + n + 1)tp
(C) S = n tn / (k – n + 1)tp
(D) S = (k + n – 1)tp / n tn
Where n → no. of tasks
tn → time of completion of each task
k → no. of segments of pipeline
tp → clock cycle time
S → speed up ratio
Ans: A
63. Suppose that someone starts with a chain letter. Each person who receives the letter is asked to send it on to 4 other people. Some people do this, while some do not send any letter.
How many people have seen the letter, including the first person, if no one receives more than one letter and if the chain letter ends after there have been 100 people who read it but did not send it out? Also find how many people sent out the letter?
(A) 122 & 22
(B) 111 & 11
(C) 133 & 33
(D) 144 & 44
Ans: D
64. A hash function f defined as f (key) = key mod 13, with linear probing is used to insert keys 55, 58, 68, 91, 27, 145. What will be the location of 79?
(A) 1
(B) 2
(C) 3
(D) 4
Ans: B
65. Which of the following is true while converting CFG to LL (I) grammar?
(A) Remove left recursion alone
(B) Factoring grammar alone
(C) Both of the above
(D) None of the above
Ans: D
66. Identify the Risk factors which are associated with Electronic payment system.
(A) Fraudulent use of Credit Cards.
(B) Sending Credit Card details over internet.
(C) Remote storage of Credit Card details.
(D) All of the above
Ans: B
67. Which of the following are two special functions that are meant for handling exception that occurs during exception handling itself?
(A) Void terminate ( ) and Void unexpected ( )
(B) Non void terminate ( ) and void unexpected ( )
(C) Void terminate ( ) and non-void unexpected ( )
(D) Non void terminate ( ) and non-void unexpected ( )
Ans: D
68. Which of the following memory allocation scheme suffers from external fragmentation?
(A) Segmentation
(B) Pure demand paging
(C) Swapping
(D) Paging
Ans: D
69. Basis path testing falls under
(A) System testing
(B) White box testing
(C) Black box testing
(D) Unit testing
Ans: C
70. The User Work Area (UWA) is a set of Program variables declared in the host program to communicate the contents of individual records between
(A) DBMS & the Host record
(B) Host program and Host record
(C) Host program and DBMS
(D) Host program and Host language
Ans: B
71. The worst case time complexity of AVL tree is better in comparison to binary search tree for
(A) Search and Insert Operations
(B) Search and Delete Operations
(C) Insert and Delete Operations
(D) Search, Insert and Delete Operations
Ans: A
72. The GSM network is divided into the following three major systems:
(A) SS, BSS, OSS
(B) BSS, BSC, MSC
(C) CELL, BSC, OSS
(D) SS, CELL, MSC
Ans: B
73. If the disk head is located initially at 32, find the number of disk moves required with FCFS if the disks queue of I/O blocks requests are 98, 37, 14, 124, 65, 67.
(A) 239
(B) 310
(C) 321
(D) 325
Ans: B
74. Component level design is concerned with
(A) Flow oriented analysis
(B) Class based analysis
(C) Both of the above
(D) None of the above
Ans: A
75. The ‘C’ language is
(A) Context free language
(B) Context sensitive language
(C) Regular language
(D) None of the above
Ans: D
76. The Mobile Application Protocol (MAP) typically runs on top of which protocol?
(A) SNMP (Simple Network Management Protocol)
(B) SMTP (Simple Mail Transfer Protocol)
(C) SS7 (Signalling System 7)
(D) HTTP (Hyper Text Transfer Protocol)
Ans: D
77. If a packet arrives with an M-bit value is ‘l’ and a fragmentation offset value ‘0’, and then it is ______ fragment.
(A) First
(B) Middle
(C) Last
(D) All of the above
Ans: D
78. The number of bit strings of length eight that will either start with a 1 bit or end with two bits 00 shall be
(A) 32
(B) 64
(C) 128
(D) 160
Ans: D
79. In compiler design ‘reducing the strength’ refers to
(A) Reducing the range of values of input variables.
(B) Code optimization using cheaper machine instructions.
(C) Reducing efficiency of program.
(D) None of the above
Ans: C
80. In which addressing mode, the effective address of the operand is generated by adding a constant value to the contents of register?
(A) Absolute
(B) Indirect
(C) Immediate
(D) Index
Ans: B
81. Which of the following is true?
(A) A relation in BCNF is always in 3NF.
(B) A relation in 3NF is always in BCNF.
(C) BCNF and 3NF are same.
(D) A relation in BCNF is not in 3NF.
Ans: B
82. Given memory partitions of 100 K, 500 K, 200 K, 300 K and 600 K (in order) and processes of 212 K, 417 K, 112 K, and 426 K (in order), using the first-fit algorithm, in which partition would the process requiring 426 K be placed?
(A) 500 K
(B) 200 K
(C) 300 K
(D) 600 K
Ans: B
83. The maturity levels used to measure a process are
(A) Initial, Repeatable, Defined, Managed, Optimized.
(B) Primary, Secondary, Defined, Managed, Optimized.
(C) Initial, Stating, Defined, Managed, Optimized.
(D) None of the above
Ans: A
84. The problem of indefinite blockage of low-priority jobs in general priority scheduling algorithm can be solved using:
(A) Parity bit
(B) Aging
(C) Compaction
(D) Timer
Ans: C
85. Which API is used to draw a circle?
(A) Circle ( )
(B) Ellipse ( )
(C) Round Rect ( )
(D) Pie ( )
Ans: B
86. In DML, RECONNCT command cannot be used with
(A) OPTIONAL Set
(B) FIXED Set
(C) MANDATOR Set
(D) All of the above
Ans: D
87. RAD stands for ______.
(A) Rapid and Design
(B) Rapid Aided Development
(C) Rapid Application Development
(D) Rapid Application Design
Ans: C
88:-The output of a lexical analyzer is __________.
A:-Program B:-Machine code
C:-Object code D:-Stream of tokens
Ans: D
89:-The amount of vertical space between lines of text in a document is called _________.
A:-Word spacing B:-Line spacing C:-Multi-line D:-Single line
Ans: B
90:-The communication between computers in network is governed by a set of rules and regulations known as _______________. A:-Protocols B:-Standard rules C:-System rules D:-None of the above
Ans: A
91:-The SQL CREATE TABLE command is a ____________.
A:-DCL command B:-TCL command C:-DML command D:-DDL command
Ans: D
92:-The ____________ file system is always mounted.
A:-Directory B:-Root C:-CatchFS D:-None of the above
Ans: B
93:-____________ were designed to be a reliable mechanism for websites to remember stateful information or to record the user's browsing activity.
A:-Browsers B:-Cookies C:-Pug-ins D:-Scripts
Ans: B
94:-A ____________ is someone who seeks to beach defenses and exploit weaknesses in a computer system or network.
A:-Blocker B:-Robber C:-Hacker D:-Scripts
Ans: C
95:-A _________ is a field or collection of fields in a relational database table that provides a link between data in two tables.
A:-Primary key B:-Master key C:-Collection key D:-Foreign key
Ans: D
96:-The base of an octal number system is ___________.
A:-8 B:-16 C:-2 D:-10
Ans: A
97:-The '#' symbol at the beginning of a statement in a C/C++ program indicates that it is a _____________.
A:-Comment B:-Object directive C:-Preprocessor directive D:-String
Ans: C
98:-Hardware/Software designed to guard against unauthorized access to a computer network is known as ___________.
A:-Netwall B:-Wallblock C:-Bouncer D:-Firewall
Ans: D
99:-A row in a relational table is also referred to as __________.
A:-Value B:-Field C:-Tuple D:-Attribute
Ans: C
100:-The program that converts high level code to low level code is called ____________.
A:-Processor B:-Compiler C:-Emulator D:-Converter
Ans: B
- Computer Application
- Computer Application- Page 1
- Computer Science
- Computer Science- Page 1
- Computer Science- Page 2
- Computer Science- Page 3
- Computer Science- Page 4
- Computer Science- Page 5
- Computer Science- Page 6
- Computer Science- Page 7
- Computer Science- Page 8
- Computer Science- Page 9
- Computer Science- Page 10
- Computer Science- Page 11
- Computer Science- Page 12
- Computer Science- Page 13
- Computer Science- Page 14
- Computer Science- Page 15