1.COCOMO stands for
(A) COnstructive COst MOdel
2.Match the following :
a. Good quality i. Program does not fail for a specified time in a given environment
b. Correctness ii. Meets the functional requirements
c. Predictable iii. Meets both functional and non-functional requirements
d. Reliable iv. Process is under statistical control
Codes :
a b c d
(A) iii ii iv i
3.While estimating the cost of software, Lines Of Code (LOC) and Function Points (FP) are used to measure which one of the following ?
(A) Size of software
4.A good software design must have
(C) Low module coupling, High module cohesion
5.Cyclometric complexity of a flow graph G with n vertices and e edges is
(A) V(G) = e–n+2
6.When the following code is executed what will be the value of x and y ?
int x = 1, y = 0;
y = x++;
(A) 2,1
7.How many values can be held by an array A(–1,m;1,m) ?
(A) m(m+2)
8.What is the result of the expression
(1&2)+(3/4) ?
(A) 0
9.How many times the word ‘print’ shall be printed by the following program segment ?
for (i=1, i<2,i++)
for (j=1,j<2,j++)
for(k=1,k<2,k++)
printf("print/n")
(A) 8
10.Which of the following is not a type of Database Management System ?
(A) Sequential
11.Manager’s salary details are to be hidden from Employee Table. This Technique is called as
(A)External level Datahiding
12.A Network Schema
(A) permits many to many relationship
13.Which normal form is considered as adequate for usual database design ?
(A) 3NF
14.If D1,D2, .. ..Dn are domains in a relational model, then the relation is a table, which is a subset of
(A)D1×D2× ... ×Dn
15.Which of the following addresses is used to deliver a message to the correct application program running on a host ?
(A) Port
16.In ________ substitution, a character in the plaintext is always changed to the same character in the ciphertext, regardless of its position in the text.
(A) polyalphabetic
17.In classful addressing, the IP address 190.255.254.254 belongs to
(A) Class B
18.In hierarchical routing with 4800 routers, what region and cluster sizes should be chosen to minimize the size of the routing table for a three- layer hierarchy ?
(A) 15 clusters, 16 regions and 20 routers
19.In IPv4 header, the ______ field is needed to allow the destination host to determine which datagram a newly arrived fragments belongs to.
(A) identification
20.Given L1=L(a*baa*) and L2=L(ab*). The regular expression corresponding to language L3 = L1/L2 (right quotient) is given by
(A) a*ba*
21.Given the production rules of a grammar G1 as S1 → AB | aaB A → a | Aa B→b and the production rules of a grammar G2 as
S2 → aS2bS2 | bS2aS2 | λ Which of the following is correct statement ?
(A) G1 is ambiguous and G2 is ambiguous.
22.Given a grammar : S1 → Sc, S → SA | A, A → aSb | ab, there is a rightmost derivation S1 ⇒ Sc ⇒ SAC ⇒ SaSbc Thus, SaSbc is a right sentential form, and its handle is
(A) aSb
23.The equivalent production rules corresponding to the production rules S → Sα1 |Sα2 | β1 | β2 is
(A) S → β1 | β2 | β1A | β2A,
A → α1A | α2A | λ
24.Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively and transition table as given below :
a b
p – q
q r s
r r s
s r s
The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is
(A) 3
25.Which is the correct statement(s) for Non Recursive predictive parser ?
S1 : First(α) = {t| α ⇒* tβ for some string β} ⇒*tβ
S2 : Follow(X)={ a| S⇒*αXaβ some strings α and β}
(A) Both statements S1 and S2 correct.
26.Given an open address hash table with load factor α < 1, the expected number of probes in a successful search is
(B) Atmost 1/α in 1/1– α
27.For a B-tree of height h and degree t,the total CPU time used to insert a node is
(A) O(th)
28.The time complexity to build a heap with a list of n numbers is
(A) O(n)
29.The value of postfix expression :
8 3 4 + – 3 8 2 / + * 2 $ 3 + is
(A) 52
30.Consider the following statements for priority queue :
S1 : It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations.
S2 : The elements of a priority queue may be complex structures that are ordered on one or several fields.
(A) Both S1 and S2 are correct
31.Repository of information gathered from multiple sources, storing under unified scheme at a single site is called as
(A)Data warehousing
32.The task of correcting and pre processing data is called as
(A) Data cleaning
33.Using data p=3, q=11, n=pq, d=7 in RSA algorithm find the cipher text of the given plain text SUZANNE
(A) BUTAEEZ
34.The relation “divides” on a set of positive integers is ________.
(A) Anti symmetric and transitive
35.Give as good a big–O estimate as possible for the following functions :
(nlogn+n2)(n3+2)and(n!+2n)(n3+log(n2+1))
(A) O(n5) & O(n3* n!)
36.A test contains 100 true/false questions. How many different ways can a student answer the questions on the test, if the answer may be left blank also.
(A) 3 to the power of 100
37.Which of the following connected simple graph has exactly one spanning tree ?
Complete graph
Hamiltonian graph
Euler graph
(A) None of the above
38.How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components ?
(A)M–N+C
39.Which of the following shall be a compound proposition involving the propositions p, q and r, that is true when exactly two of the p, q and r are true and is false otherwise ?
(C) (p ∧ q ∧⎤ r) ∨ ( p ∧ ⎤ q ∧ r) ∨ (⎤ p ∧ q ∧ r)
40.The truth value of the statements :
∃!xP(x) → ∃xP(x) and ∃!x⎤ P(x) → ⎤∀xP(x), (where the notation ∃!xP(x) denotes the proposition “There exists a unique x such that P(x) is true”) are :
(A) True and True
41.How many different Boolean functions of degree 4 are there ?
(A) 2 to the power of 16
42.A Boolean operator s is defined as follows :
1 s 1 = 1, 1 s 0 = 0, 0 s 1 = 0 and 0s0=1 What will be the truth value of the expression (x s y) s z = x s (y s z) ?
(A)Always true
43.Which one of the following is decimal value of a signed binary number 1101010, if it is in 2’s complement form ?
(A) – 22
44.A set of processors P1, P2, ......, Pk can execute in parallel if Bernstein’s conditions are satisfied on a pairwise
basis; that is P1 || P2 || P3 || ..... || Pk if and only if :
(A) Pi || Pj for all i ≠ j
45.When a mobile telephone physically moves from one to another cell, the base station transfers ownership to the cell getting strongest signal. This process is known as _______.
(A) handoff
46.A virtual memory based memory management algorithm partially swaps out a process. This is an example of
(A) medium term scheduling
47.Assuming that the disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O block requests are 98, 37, 14, 124, 65, 67 :
(A)321
48.Let the page fault service time be 10 millisecond(ms) in a computer with average memory access time being 20 nanosecond(ns). If one page fault is generated for every 106 memory accesses, what is the effective access time for memory ?
(A) 30 ns
49.Consider the following UNIX command : sort <in> temp; head – 30 <temp; rm temp Which of the following functions shall be performed by this command ?
(A) Sort, taking the input from “in” and writing the output to “temp” then prints 30 lines from temp on terminal. Finally “temp” is removed.
50.The mv command changes
(A) the directory entry
(A) COnstructive COst MOdel
2.Match the following :
a. Good quality i. Program does not fail for a specified time in a given environment
b. Correctness ii. Meets the functional requirements
c. Predictable iii. Meets both functional and non-functional requirements
d. Reliable iv. Process is under statistical control
Codes :
a b c d
(A) iii ii iv i
3.While estimating the cost of software, Lines Of Code (LOC) and Function Points (FP) are used to measure which one of the following ?
(A) Size of software
4.A good software design must have
(C) Low module coupling, High module cohesion
5.Cyclometric complexity of a flow graph G with n vertices and e edges is
(A) V(G) = e–n+2
6.When the following code is executed what will be the value of x and y ?
int x = 1, y = 0;
y = x++;
(A) 2,1
7.How many values can be held by an array A(–1,m;1,m) ?
(A) m(m+2)
8.What is the result of the expression
(1&2)+(3/4) ?
(A) 0
9.How many times the word ‘print’ shall be printed by the following program segment ?
for (i=1, i<2,i++)
for (j=1,j<2,j++)
for(k=1,k<2,k++)
printf("print/n")
(A) 8
10.Which of the following is not a type of Database Management System ?
(A) Sequential
11.Manager’s salary details are to be hidden from Employee Table. This Technique is called as
(A)External level Datahiding
12.A Network Schema
(A) permits many to many relationship
13.Which normal form is considered as adequate for usual database design ?
(A) 3NF
14.If D1,D2, .. ..Dn are domains in a relational model, then the relation is a table, which is a subset of
(A)D1×D2× ... ×Dn
15.Which of the following addresses is used to deliver a message to the correct application program running on a host ?
(A) Port
16.In ________ substitution, a character in the plaintext is always changed to the same character in the ciphertext, regardless of its position in the text.
(A) polyalphabetic
17.In classful addressing, the IP address 190.255.254.254 belongs to
(A) Class B
18.In hierarchical routing with 4800 routers, what region and cluster sizes should be chosen to minimize the size of the routing table for a three- layer hierarchy ?
(A) 15 clusters, 16 regions and 20 routers
19.In IPv4 header, the ______ field is needed to allow the destination host to determine which datagram a newly arrived fragments belongs to.
(A) identification
20.Given L1=L(a*baa*) and L2=L(ab*). The regular expression corresponding to language L3 = L1/L2 (right quotient) is given by
(A) a*ba*
21.Given the production rules of a grammar G1 as S1 → AB | aaB A → a | Aa B→b and the production rules of a grammar G2 as
S2 → aS2bS2 | bS2aS2 | λ Which of the following is correct statement ?
(A) G1 is ambiguous and G2 is ambiguous.
22.Given a grammar : S1 → Sc, S → SA | A, A → aSb | ab, there is a rightmost derivation S1 ⇒ Sc ⇒ SAC ⇒ SaSbc Thus, SaSbc is a right sentential form, and its handle is
(A) aSb
23.The equivalent production rules corresponding to the production rules S → Sα1 |Sα2 | β1 | β2 is
(A) S → β1 | β2 | β1A | β2A,
A → α1A | α2A | λ
24.Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively and transition table as given below :
a b
p – q
q r s
r r s
s r s
The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is
(A) 3
25.Which is the correct statement(s) for Non Recursive predictive parser ?
S1 : First(α) = {t| α ⇒* tβ for some string β} ⇒*tβ
S2 : Follow(X)={ a| S⇒*αXaβ some strings α and β}
(A) Both statements S1 and S2 correct.
26.Given an open address hash table with load factor α < 1, the expected number of probes in a successful search is
(B) Atmost 1/α in 1/1– α
27.For a B-tree of height h and degree t,the total CPU time used to insert a node is
(A) O(th)
28.The time complexity to build a heap with a list of n numbers is
(A) O(n)
29.The value of postfix expression :
8 3 4 + – 3 8 2 / + * 2 $ 3 + is
(A) 52
30.Consider the following statements for priority queue :
S1 : It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations.
S2 : The elements of a priority queue may be complex structures that are ordered on one or several fields.
(A) Both S1 and S2 are correct
31.Repository of information gathered from multiple sources, storing under unified scheme at a single site is called as
(A)Data warehousing
32.The task of correcting and pre processing data is called as
(A) Data cleaning
33.Using data p=3, q=11, n=pq, d=7 in RSA algorithm find the cipher text of the given plain text SUZANNE
(A) BUTAEEZ
34.The relation “divides” on a set of positive integers is ________.
(A) Anti symmetric and transitive
35.Give as good a big–O estimate as possible for the following functions :
(nlogn+n2)(n3+2)and(n!+2n)(n3+log(n2+1))
(A) O(n5) & O(n3* n!)
36.A test contains 100 true/false questions. How many different ways can a student answer the questions on the test, if the answer may be left blank also.
(A) 3 to the power of 100
37.Which of the following connected simple graph has exactly one spanning tree ?
Complete graph
Hamiltonian graph
Euler graph
(A) None of the above
38.How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components ?
(A)M–N+C
39.Which of the following shall be a compound proposition involving the propositions p, q and r, that is true when exactly two of the p, q and r are true and is false otherwise ?
(C) (p ∧ q ∧⎤ r) ∨ ( p ∧ ⎤ q ∧ r) ∨ (⎤ p ∧ q ∧ r)
40.The truth value of the statements :
∃!xP(x) → ∃xP(x) and ∃!x⎤ P(x) → ⎤∀xP(x), (where the notation ∃!xP(x) denotes the proposition “There exists a unique x such that P(x) is true”) are :
(A) True and True
41.How many different Boolean functions of degree 4 are there ?
(A) 2 to the power of 16
42.A Boolean operator s is defined as follows :
1 s 1 = 1, 1 s 0 = 0, 0 s 1 = 0 and 0s0=1 What will be the truth value of the expression (x s y) s z = x s (y s z) ?
(A)Always true
43.Which one of the following is decimal value of a signed binary number 1101010, if it is in 2’s complement form ?
(A) – 22
44.A set of processors P1, P2, ......, Pk can execute in parallel if Bernstein’s conditions are satisfied on a pairwise
basis; that is P1 || P2 || P3 || ..... || Pk if and only if :
(A) Pi || Pj for all i ≠ j
45.When a mobile telephone physically moves from one to another cell, the base station transfers ownership to the cell getting strongest signal. This process is known as _______.
(A) handoff
46.A virtual memory based memory management algorithm partially swaps out a process. This is an example of
(A) medium term scheduling
47.Assuming that the disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O block requests are 98, 37, 14, 124, 65, 67 :
(A)321
48.Let the page fault service time be 10 millisecond(ms) in a computer with average memory access time being 20 nanosecond(ns). If one page fault is generated for every 106 memory accesses, what is the effective access time for memory ?
(A) 30 ns
49.Consider the following UNIX command : sort <in> temp; head – 30 <temp; rm temp Which of the following functions shall be performed by this command ?
(A) Sort, taking the input from “in” and writing the output to “temp” then prints 30 lines from temp on terminal. Finally “temp” is removed.
50.The mv command changes
(A) the directory entry
No comments:
Post a Comment