People begin to become successful the minute they decide to be.
1. A file is downloaded in a home computer using a 56 kbps MODEM connected to an Internet Service Provider. If the download of file completes in 2 minutes, what is the maximum size of data downloaded?
(A) 112 Mbits
(B) 6.72 Mbits
(C) 67.20 Mbits
(D) 672 Mbits
View/Hide Ans
Correct Answer is B
2. In ................ CSMA protocol, after the station finds the line idle, it sends or refrains from sending based on the outcome of a random number generator.
(A) Non-persistent
(B) 0-persistent
(C) 1-persistent
(D) p-persistent
View/Hide Ans
Correct Answer is D
3. Which of the following substitution technique have the relationship between a character in the plaintext and a character in the ciphertext as one-to-many?
(A) Monoalphabetic
(B) Polyalphabetic
(C) Transpositional
(D) None of the above
View/Hide Ans
Correct Answer is B
4. What is the maximum length of CAT-5 UTP cable in Fast Ethernet network?
(A) 100 meters
(B) 200 meters
(C) 1000 meters
(D) 2000 meters
View/Hide Ans
Correct Answer is A
5. The ................ is a set of standards that defines how a dynamic web document should be written, how input data should be supplied to the program, and how the output result should be used.
(A) Hyper Text Markup Language
(B) File Transfer Protocol
(C) Hyper Text Transfer Protocol
(D) Common Gateway Interface
View/Hide Ans
Correct Answer is D
6. The count-to-infinity problem is associated with
(A) Flooding algorithm
(B) Hierarchical routing algorithm
(C) Distance vector routing algorithm
(D) Link state routing algorithm
View/Hide Ans
Correct Answer is C
7. The IEEE single-precision and double-precision format to represent floating-point numbers, has a length of ................. and ................ respectively.
(A) 8 bits and 16 bits
(B) 16 bits and 32 bits
(C) 32 bits and 64 bits
(D) 64 bits and 128 bits
View/Hide Ans
Correct Answer is C
8. Consider an undirected graph G with 100 nodes. The maximum number of edges to be included in G so that the graph is not connected is
(A) 2451
(B) 4950
(C) 4851
(D) 9900
View/Hide Ans
Correct Answer is C
9. The amortized time complexity to perform ............. operation(s) in Splay trees is O(lg n).
(A) Search
(B) Search and Insert
(C) Search and Delete
(D) Search, Insert and Delete
View/Hide Ans
Correct Answer is D
10. Suppose that the splits at every level of Quicksort are in proportion 1-ß to ß, where 0<ß≤0.5 is a constant. The number of elements in an array is n. The maximum depth is approximately
(A) 0.5 ß lg n
(B) 0.5 (1-ß) lg n
(C) - (lg n)/(lg ß)
(D) - (lg n)/lg (1-ß)
View/Hide Ans
Correct Answer is D
11. The minimum number of nodes in a binary tree of depth d (root is at level 0) is
(A) 2d - 1
(B) 2d+1 - 1
(C) d + 1
(D) d
View/Hide Ans
Correct Answer is C
12. The efficient data structure to insert/delete a number in a stored set of numbers is
(A) Queue
(B) Linked list
(C) Doubly linked list
(D) Binary tree
View/Hide Ans
Correct Answer is C
13. The number of states in a minimal deterministic finite automaton corresponding to the language L = { an | n≥4 } is
(A) 3
(B) 4
(C) 5
(D) 6
View/Hide Ans
Correct Answer is C
14. Regular expression for the language L = { w ∈ {0, 1}* | w has no pair of consecutive zeros} is
(A) (1 + 010)*
(B) (01 + 10)*
(C) (1 + 010)* (0 + λ)
(D) (1 + 01)* (0 + λ)
View/Hide Ans
Correct Answer is D
15. Consider the following two languages:
L1 = {an bl ak | n+l+k>5 }
L2 = {an bl ak |n>5, l>3, k≤l }
Which of the following is true?
(A) L1 is regular language and L2 is not regular language.
(B) Both L1 and L2 are regular languages.
(C) Both L1 and L2 are not regular languages.
(D) L1 is not regular language and L2 is regular language.
View/Hide Ans
Correct Answer is A
16. LL grammar for the language L = {an bm cn+m | m≥0, n≥0} is
(A) S → aSc | S1 ; S1 → bS1c | λ
(B) S → aSc | S1| λ ; S1 → bS1c
(C) S → aSc | S1| λ ; S1 → bS1c| λ
(D) S → aSc | λ ; S1 → bS1c| λ
View/Hide Ans
Correct Answer is C
17. Assume the statements S1 and S2 given as:
S1: Given a context free grammar G, there exists an algorithm for determining whether L(G) is infinite.
S2: There exists an algorithm to determine whether two context free grammars generate the same language.
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.
View/Hide Ans
Correct Answer is A
18. The number of eight-bit strings beginning with either 111 or 101 is ...............
(A) 64
(B) 128
(C) 265
(D) None of the above
View/Hide Ans
Correct Answer is A
19. Find the number of ways to paint 12 offices so that 3 of them will be green, 2 of them pink, 2 of them yellow and the rest ones white.
(A) 55,440
(B) 1,66,320
(C) 4.790E+08
(D) 39,91,680
View/Hide Ans
Correct Answer is B
20. Consider the following statements:
(i) A graph in which there is a unique path between every pair of vertices is a tree.
(ii) A connected graph with e = v – 1 is a tree.
(iii) A graph with e = v – 1 that has no circuit is a tree.
Which of the above statements is/are true?
(A) (i) & (iii)
(B) (ii) & (iii)
(C) (i) & (ii)
(D) All of the above
View/Hide Ans
Correct Answer is D
21. Consider the In-order and Post-order traversals of a tree as given below:
In-order: j e n k o p b f a c l g m d h i
Post-order: j n o p k e f b c l m g h i d a
The Pre-order traversal of the tree shall be
(A) a b f e j k n o p c d g l m h i
(B) a b c d e f j k n o p g l m h i
(C) a b e j k n o p f c d g l m h i
(D) j e n o p k f b c l m g h i d a
View/Hide Ans
Correct Answer is C
22. A simple graph G with n-vertices is connected if the graph has
(A) (n - 1) (n - 2)/2 edges
(B) more than (n - 1) (n - 2)/2 edges
(C) less than (n - 1) (n - 2)/2 edges
(D) ∑ki=1 C(ni, 2) edges
View/Hide Ans
Correct Answer is B
23. Which one of the following set of gates is best suited for ‘parity’ checking and ‘parity’ generation?
(A) AND, OR, NOT
(B) NAND, NOR
(C) EX-OR, EX-NOR
(D) None of the above
View/Hide Ans
Correct Answer is C
24. The quantification ∃!x P(x) denotes the proposition "There exists a unique x such that P(x) is true", express the quantification using universal and existential quantifications and logical operators:
(A) ∃x P(x) ∨ ∀x∀y ((P(x) ∨ P(y)) → x = y)
(B) ∀ x P(x) ∧ ∀x∀y ((P(x) ∨ P(y)) → x = y)
(C) ∃x P(x) ∧ ∀x∀y ((P(x) ∧ P(y)) → x = y)
(D) ∃x P(x) ∧ ∃x∃y ((P(x) ∨ P(y)) → x = y)
View/Hide Ans
Correct Answer is C
25. If F and G are Boolean functions of degree n. Then, which of the following is true?
(A) F ≤ F + G and F G ≥ F
(B) G ≤ F + G and F G ≥ G
(C) F ≥ F + G and F G ≤ F
(D) G ≥ F + G and F G ≤ F
View/Hide Ans
Correct Answer is A
26. Match the following identities/laws to their corresponding name:
Codes:
List I
List II
(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
(A) a-iii b-iv c-i d-ii
(B) a-iv b-iii c-i d-ii
(C) a-iv b-iii c-ii d-i
(D) a-iii b-iv c-ii d-i
View/Hide Ans
Correct Answer is A
27. In which one of the following, continuous process improvement is done?
(A) ISO9001
(B) RMMM
(C) CMM
(D) None of the above
View/Hide Ans
Correct Answer is C
28. 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
View/Hide Ans
Correct Answer is C
29. Working software is not available until late in the process in
(A) Waterfall model
(B) Prototyping model
(C) Incremental model
(D) Evolutionary Development model
View/Hide Ans
Correct Answer is A
30. 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
View/Hide Ans
Correct Answer is B
31. 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)
View/Hide Ans
Correct Answer is D
32. Linked Lists are not suitable for ..................
(A) Binary Search
(B) Polynomial Manipulation
(C) Insertion
(D) Radix Sort
View/Hide Ans
Correct Answer is A
33. 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
View/Hide Ans
Correct Answer is B
34. What is the output of the following program segment?
sum(n)
{
if ( n < 1 ) return n;
else return (n + sum(n–1));
}
main()
{
printf(“%d”, sum(5));
}
(A) 10
(B) 16
(C) 15
(D) 14
View/Hide Ans
Correct Answer is C
35. Assume that x and y are 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
View/Hide Ans
Correct Answer is B
36. Consider the following program segment:
d=0;
for(i=1; i<31, ++i)
for(j=1; j<31, ++j)
for(k=1; k<31, ++k)
if ((i+j+k)%3)= = 0);
d = d + 1;
printf("%d", d);
The output will be
(A) 9000
(B) 3000
(C) 90
(D) 2700
View/Hide Ans
Correct Answer is X
37. Usage of Preemption and Transaction Rollback prevents ..................
(A) Unauthorised usage of data file
(B) Deadlock situation
(C) Data manipulation
(D) File pre-emption
View/Hide Ans
Correct Answer is B
38. The ............... language was originally designed as the Transformation Language for Style Sheet facility.
(A) XSTL
(B) XML
(C) XQuery
(D) XPath
View/Hide Ans
Correct Answer is A
39. 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
View/Hide Ans
Correct Answer is A
40. The decision tree classifier is a widely used technique for ...............
(A) Classification
(B) Association
(C) Partition
(D) Clustering
View/Hide Ans
Correct Answer is A
41. Cross_tab displays permit users to view ................ of multidimensional data at a time.
(A) One dimension
(B) Two dimensions
(C) Three dimensions
(D) Multidimensions
View/Hide Ans
Correct Answer is B
42. A method to provide secure transmission of email is called .................
(A) TLS
(B) SA
(C) IPSec
(D) PGP
View/Hide Ans
Correct Answer is D
43. Thoma’s-write rule is .................
(A) Two phase locking protocol
(B) Timestamp ordering protocol
(C) One phase locking protocol
(D) Sliding window protocol
View/Hide Ans
Correct Answer is B
44. Match the following:
Codes :
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.
(A) a-iii b-i c-ii d-iv
(B) a-iv b-i c-iii d-ii
(C) a-iv b-iii c-i d-ii
(D) a-iii b-iii c-ii d-i
View/Hide Ans
Correct Answer is A
45. 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
View/Hide Ans
Correct Answer is B
46. 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:
47. Assume that an implementation of Unix operating system uses i-nodes to keep track of data blocks allocated to a file. It supports 12 direct block addresses, one indirect block address and one double indirect block address. The file system has 256 bytes block size and 2 bytes for disk block address. The maximum possible size of a file in this system is
(A) 16 MB
(B) 16 KB
(C) 70 KB
(D) 71 KB
View/Hide Ans
Correct Answer is X
48. 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
View/Hide Ans
Correct Answer is C
49. What type of logic circuit is represented by the figure shown below?
50. The speed up of a pipeline processing over an equivalent non-pipeline processing is defined by the ratio:
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
View/Hide Ans
Correct Answer is A
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∃y succ (x, y)
View/Hide Ans
Correct Answer is A
2. ∝ - β cutoffs are applied to .............
(A) Depth first search
(B) Best first search
(C) Minimax search
(D) Breadth first search
View/Hide Ans
Correct Answer is C
3. Assume that each alphabet can have a value between 0 to 9 in a cryptoarithmetic problem
CROSS
+ROADS
---------
DANGER
---------
Which of the following statement is true ?
(i) No two alphabets can have the same numeric value.
(ii) Any two alphabets may have the same numeric value.
(iii) D = 0
(iv) D = 1
(A) (i) and (iii)
(B) (i) and (iv)
(C) (ii) and (iii)
(D) (ii) and (iv)
View/Hide Ans
Correct Answer is B
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
View/Hide Ans
Correct Answer is 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
View/Hide Ans
Correct Answer is B
6. Means-Ends Analysis process centres around the detection of difference between the current state and the goal state. Once such a difference is found, 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.
View/Hide Ans
Correct Answer is 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
View/Hide Ans
Correct Answer is C
8. Which of the following is the size of Network bits and Host bits of Class A of 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
View/Hide Ans
Correct Answer is 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
View/Hide Ans
Correct Answer is 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
View/Hide Ans
Correct Answer is C
11. Match the following :
Codes :
List I
List II
(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
(A) (a-iii) (b-iv) (c-ii) (d-i)
(B) (a-iv) (b-iii) (c-ii) (d-i)
(C) (a-iv) (b-iii) (c-i) (d-ii)
(D) (a-iii) (b-iv) (c-i) (d-ii)
View/Hide Ans
Correct Answer is 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
View/Hide Ans
Correct Answer is 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
View/Hide Ans
Correct Answer is 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
View/Hide Ans
Correct Answer is A
15. Which of the following is the minimum cost for an assignment problem given below ?
View/Hide Ans
Correct Answer is C
16. Assume, L is regular language. Let statements S1 and S2 be defined as :
S1 : SQRT(L) = { x| for some y with |y| = |x|2, xy∈L}
S2 : LOG(L) = { x| for some y with |y| = 2|x|, xy∈L}
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 Ss is correct.
View/Hide Ans
Correct Answer is B
17. A regular grammar for the language L = {anbm | n is even and m is even} is given by
(A) S→aSb|S1; S1 → bS1a|λ
(B) S→aaS|S1; S1 → bSb|λ
(C) S→aSb|S1; S1 → S1ab|λ
(D) S→aaS|S1; S1 → bbS1|λ
View/Hide Ans
Correct Answer is D
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 of a’s followed by even number of b’s.
View/Hide Ans
Correct Answer is B
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)
View/Hide Ans
Correct Answer is B
20. The language L = {an bn am bm | n≥0, m≥0} is
(A) Context free but not linear
(B) Context free and linear
(C) Not Context free and not linear
(D) Not Context free but linear
View/Hide Ans
Correct Answer is A
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.
View/Hide Ans
Correct Answer is 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, λ)}
View/Hide Ans
Correct Answer is B
23. Match the following :
Codes :
List I
List II
(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
(A) (a-iii) (b-iv) (c-ii) (d-i)
(B) (a-iv) (b-iii) (c-ii) (d-i)
(C) (a-iv) (b-iii) (c-i) (d-ii)
(D) (a-iii) (b-iv) (c-i) (d-ii)
View/Hide Ans
Correct Answer is 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
View/Hide Ans
Correct Answer is 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.
View/Hide Ans
Correct Answer is A
26. Let A be the set of comfortable houses given as
Then the set of comfortable and affordable houses is
View/Hide Ans
Correct Answer is A
27. Support of a fuzzy set
within a universal set X is given as
View/Hide Ans
Correct Answer is 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)
View/Hide Ans
Correct Answer is 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
View/Hide Ans
Correct Answer is D
30. Which logic family dissipates the minimum power ?
(A) DTL
(B) TTL
(C) ECL
(D) CMOS
View/Hide Ans
Correct Answer is D
31. Which of the following electronic component is not found in IC’s ?
(A) Diode
(B) Resistor
(C) Transistor
(D) Inductor
View/Hide Ans
Correct Answer is D
32. A given memory chip has 14 address pins and 8 data pins. It has the following number of locations.
(A) 28
(B) 214
(C) 26
(D) 212
View/Hide Ans
Correct Answer is B
33. The instruction: MOV CL, [BX] [DI] + 8 represents the ............... addressing mode.
(A) Based Relative
(B) Based Indexed
(C) Indexed Relative
(D) Register Indexed
View/Hide Ans
Correct Answer is B
34. The power dissipation of a flip-flop is 3 mW. The power dissipation of a digital system with 4 flip-flops is given by
(A) 34 mW
(B) 43 mW
(C) 4/3 mW
(D) 12 mW
View/Hide Ans
Correct Answer is D
35. An astable multivibrator using the 555 timer to generate a square wave of 5 KHz with 70% duty cycle will have
(A) RA = 40.4 KΩ, RB = 17.25 KΩ, C = 2000 pF
(B) RA = 17.25 KΩ, RB = 40.4 KΩ, C = 2000 pF
(C) RA = 40.4 KΩ, RB = 17.25 KΩ, C = 5000 pF
(D) RA = 17.25 KΩ, RB = 40.4 KΩ, C = 5000 pF
View/Hide Ans
Correct Answer is X
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
View/Hide Ans
Correct Answer is D
37. The time complexity of recurrence relation
T(n) = T(n/3) + T(2n/3) + O(n) is
(A) O(log n)
(B) O(n)
(C) O(n log n)
(D) O(n2 )
View/Hide Ans
Correct Answer is C
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
View/Hide Ans
Correct Answer is A
39. The number of possible parenthesizations of a sequence of n matrices is
(A) O(n)
(B) θ(n log n)
(C) O(2n)
(D) None of the above
View/Hide Ans
Correct Answer is C
40. The time complexity of an efficient algorithm to find the longest monotonically increasing subsequence of n numbers is
(A) O(n)
(B) O(n lg n)
(C) O(n2)
(D) None of the above
View/Hide Ans
Correct Answer is B
41. Given a binary search trees for a set of n=5 keys with the following probabilities :
42. Given 0-1 knapsack problem and fractional knapsack problem and the following statements :
S1 : 0-1 knapsack is efficiently solved using Greedy algorithm.
S2 : Fractional knapsack is efficiently solved using Dynamic programming.
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.
View/Hide Ans
Correct Answer is C
43. Equivalence class partitioning approach is used to divide the input domain into a set of equivalence classes, so that if a program works correctly for a value, then it will work correctly for all the other values in that class. This is used .................
(A) to partition the program in the form of classes.
(B) to reduce the number of test cases required.
(C) for designing test cases in white box testing.
(D) all of the above.
View/Hide Ans
Correct Answer is B
44. The failure intensity for a basic model as a function of failures experienced is given as λ(µ)-λ0[1 - (µ)/(V0)] where λ0 is the initial failure intensity at the start of the execution, µ is the average or expected number of failures at a given point in time, the quantity V0 is the total number of failures that would occur in infinite time.
Assume that a program will experience 100 failures in infinite time, the initial failure intensity was 10 failures/CPU hr. Then the decrement of failures intensity per failure will be
(A) 10 per CPU hr.
(B) 0.1 per CPU hr.
(C) -0.1 per CPU hr.
(D) 90 per CPU hr
View/Hide Ans
Correct Answer is C
45. Improving processing efficiency or performance or restructuring of software to improve changeability is known as
(A) Corrective maintenance
(B) Perfective maintenance
(C) Adaptive maintenance
(D) Code maintenance
View/Hide Ans
Correct Answer is B
46. In ...............,modules A and B make use of a common data type, but perhaps perform different operations on it.
(A) Data coupling
(B) Stamp coupling
(C) Control coupling
(D) Content coupling
View/Hide Ans
Correct Answer is B
47. Consider the following schemas :
Branch_Schema = (branch_name, assets, city)
Customer_Schema = (cutstomer_name, street, city)
Deposit_Schema = (branch_name, account_number, customer_name, balance)
Borrow_Schema = (branch_name, loan_number, customer_name, amount)
Which of the following tuple relational calculus finds all customers who have loan amount more than Rs 12,000 ?
(A) {t(customer_name) | t∈borrow[?] t[amount]>12000}
(B) {t |t(customer_name) | t∈borrow[?] t[amount]>12000}
(C) {t |[?] ∈ borrow (t(customer_name=s(customer_ name))[?] [amount]>12000}
(D) {t |[?] ∈ borrow (t(customer_name)[?] s[amount]>12000}
View/Hide Ans
Correct Answer is C
48. Match the following :
Codes :
List I
List II
(a) Create
(i) The E-R Model
(b) Select
(ii) Relationship Model
(c) Rectangle
(iii) DDL
(d) Record
(iv) DML
(A) (a-iii) (b-iv) (c-i) (d-ii)
(B) (a-iv) (b-iii) (c-ii) (d-i)
(C) (a-iv) (b-iii) (c-i) (d-ii)
(D) (a-iii) (b-iv) (c-ii) (d-i)
View/Hide Ans
Correct Answer is A
49. Match the following :
Codes
(A) (a-iii) (b-iv) (c-ii) (d-i)
(B) (a-iv) (b-iii) (c-ii) (d-i)
(C) (a-ii) (b-iii) (c-iv) (d-i)
(D) (a-iii) (b-iv) (c-i) (d-ii)
View/Hide Ans
Correct Answer is C
50. Sixty (60) reusable components were available for an application. If only 70% of these components can be used, rest 30% would have to be developed from scratch. If average component is 100 LOC and cost of each LOC is Rs 14, what will be the risk exposure if risk probability is 80% ?
(A) Rs 25,200
(B) Rs 20,160
(C) Rs 25,160
(D) Rs 20,400
View/Hide Ans
Correct Answer is B
51. Consider the following two function declarations :
(i) int *f( )
(ii) int (*f)( )
Which of the following is true ?
(A) Both are identical.
(B) The first is a correct declaration and the second is wrong.
(C) Both are different ways of declaring pointer to a function.
(D) The first declaration is a function returning a pointer to an integer and the second is a pointer to function returning integer.
View/Hide Ans
Correct Answer is D
52. Assume that we have constructor function for both Base and Derived classes. Now consider the declaration :
main ( )
Base *p = new Derived;
In what sequence, the constructor will be executed ?
(A) Derived class constructor is followed by Base class constructor.
(B) Base class constructor is followed by Derived class constructor.
(C) Base class constructor is never called.
(D) Derived class constructor is never called.
View/Hide Ans
Correct Answer is B
53. What is the output of the following program ?
#include <stdio.h>
main( )
{
int a, b = 0;
static int c[10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 0};
for (a=0; a<10;++a);
if ((c[a]%2)= =0) b+=c[a];
printf("%d",b);
}
(A) 15
(B) 25
(C) 45
(D) 20
View/Hide Ans
Correct Answer is D
54. A Program contains the following declarations and initial assignments
int i = 8, j = 5;
double x = 0.005, y = -0.01;
char c=’c’, d=’d’;
Determine the value of the following expressions which involve the use of library functions:
abs(i-2*j) ; log(exp(x)) ; toupper(d)
(A) 2; 0.005; D
(B) 1; 0.005; D
(C) 2; 0.005; E
(D) 1; 0.005; e
View/Hide Ans
Correct Answer is A
55. MPEG involves both spatial compression and temporal compression. The spatial compression is similar to JPEG and temporal compression removes .............. frames.
(A) Temporal
(B) Voice
(C) Spatial
(D) Redundant
View/Hide Ans
Correct Answer is D
56. If the data unit is 111111 and the divisor is 1010. In CRC method, what is the dividend at the transmission before division ?
(A) 1111110000
(B) 1111111010
(C) 111111000
(D) 111111
View/Hide Ans
Correct Answer is C
57. If user A wants to send an encrypted message to user B. The plain text of A is encrypted with the .................
(A) Public Key of user A
(B) Public Key of user B
(C) Private Key of user A
(D) Private Key of user B
View/Hide Ans
Correct Answer is B
58. A ............... can forward or block packets based on the information in the network layer and transport layer header.
(A) Proxy firewall
(B) Firewall
(C) Packet filter firewall
(D) Message digest firewall
View/Hide Ans
Correct Answer is A
59. Which of the following graphics devices are known as active graphics devices ?
(i) Alphanumeric devices
(ii) Thumb wheels
(iii) Digitizers
(iv) Joystics
(A) (i) and (ii)
(B) (iii) and (iv)
(C) (i), (ii) and (iii)
(D) (i), (ii), (iii) and (iv)
View/Hide Ans
Correct Answer is D
60. A diametric projection is said to be trimetric projection when
(i) two of the three foreshortening factors are equal and third is arbitrary.
(ii) all of the three foreshortening factors are equal.
(iii) all of the three foreshortening factors are arbitrary.
Which of the above is true ?
(A) (i) and (ii)
(B) (ii) and (iii)
(C) (i) only
(D) (iii) only
View/Hide Ans
Correct Answer is C
61. Which of the following is/are fundamental method(s) of antialiasing ?
(i) Increase of sample rate.
(ii) Treating a pixel as a finite area rather than as a point.
(iii) Decrease of sample rate.
(A) (i) and (ii)
(B) (ii) and (iii)
(C) (i) only
(D) (ii) only
View/Hide Ans
Correct Answer is A
62. The two color systems – the HSV and HLS are
(A) Hue, Saturation, Value and Hue, Lightness, Saturation.
(B) High, Standard, Value and High, Lightness, Saturation.
(C) Highly, Saturated, Value and Highly, Lightened, Saturation.
(D) Highly, Standard, Value and Hue, Lightness, Saturation.
View/Hide Ans
Correct Answer is A
63. The parametric representation of the line segment between the position vectors P1(2, 3) and P2(5, 4) is given as
(A) x(t)=2+7t, y(t)=3+7t, 0≤t≤∞
(B) x(t)=2+10t, y(t)=3+12t, 0≤t≤1
(C) x(t)=2+3t, y(t)=3+t, 0≤t≤1
(D) t(x,y)=14t, 0≤t≤1
View/Hide Ans
Correct Answer is C
64. Consider the following transformation matrix for rotation(clockwise) :
65. Consider the following sequence of operations :
(i) Pointer p1 is set to point at a new heap-dynamic variable.
(ii) Pointer p2 is assigned p1’s value.
(iii) The heap dynamic variable pointed to by p1 is explicitly de-allocated, but p2 is not changed by the operation.
This situation leads to which of the following :
(A) p1 becomes a dangling pointer
(B) p2 becomes a dangling pointer
(C) Both p1 and p2 are now dangling pointers
(D) Neither p1 nor p2 is now a dangling pointer
View/Hide Ans
Correct Answer is B
66. The programming languages C and C++ are not strongly typed languages because :
(A) Both C and C++ allow functions for which parameters are not type checked.
(B) Both C and C++ allow functions for which parameters are type checked.
(C) Both C and C++ allow functions for which parameters are not type checked and also the union types in these languages are not type checked.
(D) Union types in these (C and C++) languages are not type checked.
View/Hide Ans
Correct Answer is C
67. The tracing model in Prolog describes program execution in terms of certain events. These events are
(A) call and exit
(B) call and fail
(C) call, exit and redo
(D) call, exit, redo and fail
View/Hide Ans
Correct Answer is D
68. Which of the following statements is not correct with reference to distributed systems ?
(A) Distributed system represents a global view of the network and considers it as a virtual uni-processor system by controlling and managing resources across the network on all the sites.
(B) Distributed system is built on bare machine, not an add-on to the existing software.
(C) In a distributed system, kernel provides smallest possible set of services on which other services are built. This kernel is called microkernel. Open servers provide other services and access to shared resources.
(D) In a distributed system, if a user wants to run the program on other nodes or share the resources on remote sites due to their beneficial aspects, user has to log on to that site.
View/Hide Ans
Correct Answer is D
69. A system contains 10 units of resource of same type. The resource requirement and current allocation of these resources for three processes P, Q and R are as follows :
70. Consider the following set of processes with the length of CPU burst time in milliseconds (ms) :
71. Consider a main memory with 3 page frames for the following page reference string :
5, 4, 3, 2, 1, 4, 3, 5, 4, 3, 4, 1, 4
Assuming that the execution of process is initiated after loading page 5 in memory, the number of page faults in FIFO and second chance replacement respectively are
(A) 8 and 9
(B) 10 and 11
(C) 7 and 9
(D) 9 and 8
View/Hide Ans
Correct Answer is D
72. Which of the following shell scripts will produce the output “my first script” ?
(A) for i in my first script { echo –i $i}
(B) for my first script; do echo –n; done
(C) for i in my first script; do echo –i $i; done
(D) for n in my first script; do echo –i $i; done
View/Hide Ans
Correct Answer is C
73. The portion of Windows 2000 operating system which is not portable is
(A) processor management
(B) user interface
(C) device management
(D) virtual memory management
View/Hide Ans
Correct Answer is D
74. Match the following for Windows Operating System :
Codes :
List I
List II
(a) Hardware abstraction layer
(i) Starting all processes, emulation of different operating systems, security functions, transform character based applications to graphical representation.
(b) Kernel
(ii) Export a virtual memory interface, support for symmetric multiprocessing, administration, details of mapping memory, configuring I/O buses, setting up DMA.
(c) Executive
(iii) Thread scheduling, interrupt and exception handling, recovery after power failure.
(d) Win32 subsystem
(iv) Object manager, virtual memory manager, process manager, plug and- play and power manager.
(A) (a-i) (b-iii) (c-ii) (d-iv)
(B) (a-iv) (b-iii) (c-ii) (d-i)
(C) (a-ii) (b-iii) (c-iv) (d-i)
(D) (a-iii) (b-ii) (c-i) (d-iv)
View/Hide Ans
Correct Answer is C
75. Which of the following statements is not true for UNIX Operating System ?
(A) Major strength of UNIX Operating System is its open standards which enabled large number of organizations ranging from academicia to industries to participate in its development.
(B) UNIX kernel uses modules with well specified interfaces and provides advantages like simplified testing and maintenance of kernel. It has better extensibility as the kernel is not monolithic.
(C) UNIX is kernel based operating system with two main components viz. process management subsystem and file management subsystem.
(D) All devices are represented as files which simplify the management of I/O devices and files. The directories structure used is directed acyclic graph.
View/Hide Ans
Correct Answer is B
© 2022. All Rights Reserved | Copyright | Terms of Use & Privacy Policy