1. How many are there to place 8 indistinguishable balls into four distinguishable bins?
ANS. B
2. Match List-I with List-II:
Choose the correct option:
| List-I | List-II |
| (Software process Models) | (Software System) |
| (a) Waterfall model | (i) e-business that starts with only the basic functionality and then moves on to more advanced features. |
| (b) Incremental development | (ii) An inventory control system for a supermarket to be developed in a highway |
| (c) Prototyping | (iii) A virtual reality system for simulating vehicle navigation in a highway. |
| (d) RAD | (iv) Automate the manual system for student record maintenance in a school |
ANS. D
3. A computer has six tapes drives with n processes competing for them. Each process may need two drives. What is the maximum value of n for the system to be deadlock free?
ANS. A
4. In the context of 3D computer graphics, which of the following statements is/are TRUE?
P: Orthographics transformations keep parallel lines parallel
Q: Orthographic transformations are affine transformations
Select your answer from the options:
P: Orthographics transformations keep parallel lines parallel
Q: Orthographic transformations are affine transformations
Select your answer from the options:
ANS. A
5. Which of the following statements are DMl statements?
(a) Update [tablename] Set [ columnname] = VALUE
(b) Delete [tablename]
(c) Select * from [tablename]
(a) Update [tablename] Set [ columnname] = VALUE
(b) Delete [tablename]
(c) Select * from [tablename]
ANS. C
6. What percentage(%) of the IPv4, IP address space do all class C addresses consume?
ANS. A
7. Which of the following key constraints is required for functioning of foreign key in the context of relational database?
ANS. B
8. Software Reuse is
ANS. B
9. Which of the following is principal conjunctive normal form for [(p ∨ q) ∧ ∼p → ∼q]?
A) p ∨ ∼q
B) p ∨ q
C) ∼ p ∨ q
D) ∼p ∨ ∼ q
A) p ∨ ∼q
B) p ∨ q
C) ∼ p ∨ q
D) ∼p ∨ ∼ q
ANS. A
10. Match List-I with List-II
Choose the correct option:
| List-I | List-II |
| (a) p → q | (i) ¬ (q → ¬ p) |
| (b) p ∨ q | (ii) p ∧ ¬ q |
| (c) p ∧ q | (iii) ¬ p → q |
| (d) ¬ (p → q) | (iv) ¬ p v q |
ANS. D
11. Consider the following methods:
M1 : mean of maximum
M2: Centre of area
M3: Height method
Which of the following is/are defuzzification method(s)?
M1 : mean of maximum
M2: Centre of area
M3: Height method
Which of the following is/are defuzzification method(s)?
| A) Only M1 |
| B) Only M1 and M2 |
| C) Only M2 and M3 |
| D) M1, M2 and M3 |
ANS. D
12. Replacing the expression 4*2.14 by 8.56 is known as
ANS. A
13. A fuzzy conjunction operator denoted as t(x,y) and fuzzy disjunction operator denoted as s(x,Y) form dual pair if they satisfy the condition:
ANS. C
14. Which data structure is used by the compiler for managing variables and their attributes?
ANS. C
15. Which type of addressing mode, less number of memory references are required?
ANS. D
16. How many different Boolean functions of degree n are there?
ANS. A
17. Consider the equation (146) b + (313) b-2 = (246) 8 . Which of the following is the value of b?
ANS. B
18. Match List-I with List-II
Choose the correct option:
| List-I | List-II |
| (a) Disk | (i) Thread |
| (b) CPU | (ii) Signal |
| (c) Memory | (iii) File System |
| (d) Interrupt | (iv) Virtual address |
ANS. B
19. In the TCP/IP model, encryption and decryption are functions of ____ layer
ANS. D
20. Suppose that a connected planar graph has six vertices, each of degrees four. Into how many regions is the plane divided by a planar representation of this graph?
ANS. B
21. Consider a disk system with 100 cylinders. The requests to access the cylinders occur in the following sequence:
4,34,10,7,19,73,2,15,6,20
Assuming that the head is current at cylinder 50, what is the time taken to satisfy all requests if it takes 1ms to move from the cylinder to adjacent one and the shortest seek time first policy is used?
4,34,10,7,19,73,2,15,6,20
Assuming that the head is current at cylinder 50, what is the time taken to satisfy all requests if it takes 1ms to move from the cylinder to adjacent one and the shortest seek time first policy is used?
ANS. D
22. Which of the following problems is/are decidable problem(s) (recursively enumerable) on a Turing machine M?
(a) G is a CFG with L(G)=∅
(b) There exist two TMs M1 and M2 such that L(M) ⊆ {L(M1)UL(M2)}= language of all TMs
(c) M is a TM that accepts w using a most 2|w| cells of tape
(a) G is a CFG with L(G)=∅
(b) There exist two TMs M1 and M2 such that L(M) ⊆ {L(M1)UL(M2)}= language of all TMs
(c) M is a TM that accepts w using a most 2|w| cells of tape
ANS. C
23. Consider Euler's Φ function given by
Φ(n) = n πp|n(1-(1/p))
Where p runs over all the primes dividing n. What is the value of Φ(45)?
Φ(n) = n πp|n(1-(1/p))
Where p runs over all the primes dividing n. What is the value of Φ(45)?
ANS. D
24
Consider double hashing of the form
h(k,i)=(h1 (k)+ih2 (k)) mod m
Where h1(k) = k mod m
h2(k)=1+(k mod n)
Where n=m-1and m=701
for k=123456, what is the difference between first and second probes in terms of slots?
h(k,i)=(h1 (k)+ih2 (k)) mod m
Where h1(k) = k mod m
h2(k)=1+(k mod n)
Where n=m-1and m=701
for k=123456, what is the difference between first and second probes in terms of slots?
ANS. C
25. At a particular time of computation, the value of a counting semaphore is 7. Then 20 P(wait) operations and 15 V(signal) operations are completed on this semaphore. What is the resulting value of the semaphore?
ANS. C
26. Software validation mainly checks for inconsistencies between
ANS. C
27. Shift-reduce parser consists of
(a) input buffer
(b) stack
(c) parse table
choose the correct option from those given below:
(a) input buffer
(b) stack
(c) parse table
choose the correct option from those given below:
ANS. D
28. For a statement
A language L ⊆ Σ * is recursive if there exists some Turing machine M Which of the following conditions is satisfied for any string w?
A) If w ∈ L, then m accepts w and M will not halt
B) If w ∉ L, then M accepts w and M will halt by reaching at final state
C) If w ∉ L, then M halts without reaching to acceptable state
D) If w ∈ L, then M halts without reaching to an acceptable state
A language L ⊆ Σ * is recursive if there exists some Turing machine M Which of the following conditions is satisfied for any string w?
A) If w ∈ L, then m accepts w and M will not halt
B) If w ∉ L, then M accepts w and M will halt by reaching at final state
C) If w ∉ L, then M halts without reaching to acceptable state
D) If w ∈ L, then M halts without reaching to an acceptable state
ANS. C
29. K-mean clustering algorithm has clustered the given 8 observations into 3 clusters after 1st iteration as follows:
C1 : {(3,3), (5,5), (7,7)}
C2 : {(0,6), (6,0), (3,0)}
C3 : {(8,8),(4,4)}
What will be the Manhattan distance for observation (4,4) from cluster centroid C1 in second iteration?
A) 2
B) √2
C) 0
D) 18
C1 : {(3,3), (5,5), (7,7)}
C2 : {(0,6), (6,0), (3,0)}
C3 : {(8,8),(4,4)}
What will be the Manhattan distance for observation (4,4) from cluster centroid C1 in second iteration?
A) 2
B) √2
C) 0
D) 18
ANS. A
30. What is the output of the following JAVA program
public class Good{
Private int m;
Public Good(int m){ this.m = m; }
public Boolean equals(Good n){ return n.m=m; }
public static void main(String args [ ]){
Good m1 = new Good(22);
Good m2 = new Good(22);
Object S1 = new Good(22);
Object S2 = new good(22);
System.out.println(m1.equals(m2));
System.out.println(m1.equals(s2));
System.out.println(m1.equals(s2));
System.out.println(s1.equals(m2));
}
}
public class Good{
Private int m;
Public Good(int m){ this.m = m; }
public Boolean equals(Good n){ return n.m=m; }
public static void main(String args [ ]){
Good m1 = new Good(22);
Good m2 = new Good(22);
Object S1 = new Good(22);
Object S2 = new good(22);
System.out.println(m1.equals(m2));
System.out.println(m1.equals(s2));
System.out.println(m1.equals(s2));
System.out.println(s1.equals(m2));
}
}
ANS. D
31. In relational database, if a relation R is in BCNF, then which of the following is true about relation R?
ANS. D
32. In relational database management, which of the following is/are property/properties of candidate key?
P:Uniqueness
Q: Irreducibility
P:Uniqueness
Q: Irreducibility
ANS. C
33. Consider three intensive processes, which requires 10,20 and 30 units of time and arrive at times 0,2 and 6 respectively. how many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero ad at the end
ANS. B
34. Reinforcement learning can be formalized terms of ___ in which the agent initially only knows the set of possible ___ and the set of possible actions
ANS. C
35. Which of the following statements is/are true?
P: In a scripting language like javaScript, types are typically associated with values, not variables.
Q: It is not possible to show images on a web page without the tag of HTML
Select the correct answer from the given below:
P: In a scripting language like javaScript, types are typically associated with values, not variables.
Q: It is not possible to show images on a web page without the tag of HTML
Select the correct answer from the given below:
ANS. A
36. Match List-I with List-II:
| List-I | List-II |
| (a) Prims's algorithm | (i)O(V3 logV) |
| (b) Dijkstra's algorithm | (ii) O(VE2) |
| (c) Faster all pairs shortest path | (iii) O(ElogV) |
| (d) Edmonds-karp algorithm | (iv) O(V2) |
ANS. B
37. How many address lines and data lines are required to provide a memory capacity of 16K x 16?
ANS. C
38. Consider the following steps:
S1 : Characterize the structure of an optimal solution
S2 : Computer the value of an optimal solution in bottom-up fashion
Which of the step(s) is/are common to both dynamic programming and greedy algorithms?
S1 : Characterize the structure of an optimal solution
S2 : Computer the value of an optimal solution in bottom-up fashion
Which of the step(s) is/are common to both dynamic programming and greedy algorithms?
ANS. A
39. Match List-I with List-II:
Where L1 : Regular language
L2 : Context-free language
L3 : Recursive language
L4 : Recursively enumerable language
Choose the correct from those given below:
Where L1 : Regular language
L2 : Context-free language
L3 : Recursive language
L4 : Recursively enumerable language
| List-I | List-2 |
| (a) L'3 ∪ L4 | (i) Context-free language |
| (b) L'2 ∪ L3 | (ii) Recursively enumerable language |
| (c) L1* ∩ L2 | (iii) Recursive language |
ANS. B
40. A fully connected network topology is a topology in which there is a direct link between all pairs of nodes. Given a fully connected network with n nodes, the number of direct links as a function of n can be expressed as
ANS. D
41. Suppose that the register A and register K have the bit configuration. Only the three leftmost bits of A are compared with memory words because K has 1's in these positions. Because of its organization, this type of memory is uniquely suited to parallel seches by data association. This type of memory is known as
ANS. C
42. What will be the number of states when a MOD-2 counter is followed by a MOD-5 counter?
ANS. B
43. In the context of software testing, which of the following statements is/are NOT correct?
P: A minimal test set that achieves 100% path coverage will also achieve 100% statement coverage.
Q: A minimal test set that achieves 100% path coverage will generally detect more faults than one that achieves 100% statement coverage
R: A minimal test set that achieves 100% statement coverage will generally detect more faults than one that achieves 100% branch coverage
P: A minimal test set that achieves 100% path coverage will also achieve 100% statement coverage.
Q: A minimal test set that achieves 100% path coverage will generally detect more faults than one that achieves 100% statement coverage
R: A minimal test set that achieves 100% statement coverage will generally detect more faults than one that achieves 100% branch coverage
ANS. A
44. Consider the following:
(a) Evolution
(b) Selection
(c) reproduction
(d) Mutation
Which of the following are found in genetic algorithms?
(a) Evolution
(b) Selection
(c) reproduction
(d) Mutation
Which of the following are found in genetic algorithms?
ANS. C
45. The value of the derivative of the sigmoid function given by
f(x)= 1 / (1+e(-2x)) at x=0 is
A) 0
B) 1/2
C) 1/4
D) ∞
f(x)= 1 / (1+e(-2x)) at x=0 is
A) 0
B) 1/2
C) 1/4
D) ∞
ANS. B
46. Consider the poset ({3,5,9,15,24,45},|).
Which of the following is correct for the given poset?
Which of the following is correct for the given poset?
ANS. D
47. Find the zero-one matrix of the transitive closure of the relation given by Matrix A:
ANS. A
48. Hadoop(a big data tool) works with number of related tools. Choose from the following, the common tools included into Hadoop:
ANS. C
49. Consider the following properties with respect to a flow network G=(V,E) in which a flow is a real-valued function f : V x V → R
P1 : For all u,v ∈ V, f(u,v) = -f(v,u)
P2 : Σ v ∈ V f(u,v) = 0 for all u ∈ V
Which one of the following is/are correct?
P1 : For all u,v ∈ V, f(u,v) = -f(v,u)
P2 : Σ v ∈ V f(u,v) = 0 for all u ∈ V
Which one of the following is/are correct?
ANS. A
50. Let Aα0 denotes the α-cut of a fuzzy set A at α0. If α1 < α2 , then
ANS. A
51. Which of the following statements is/are true with regard to various layers in the Internet stack? P: At the link layer, a packet of transmitted information is called a frame Q: At the network layer, a packet of transmitted information is called a segment
ANS. A
52. Consider the following C-code fragment running on a 32-bit x86 machine:
typedef struct{
union{
Unsigned char a;
unsigned short b;
}
unsigned char c;
}S;
S B[10];
S*p=&B[4];
S*q=&B[5];
p→ U.b=0x1234;
/* structure S takes 32-bits */
If M is the value of q-p and N is the value of ((int) & (p→ c))-((int)p), then (M,N) is
typedef struct{
union{
Unsigned char a;
unsigned short b;
}
unsigned char c;
}S;
S B[10];
S*p=&B[4];
S*q=&B[5];
p→ U.b=0x1234;
/* structure S takes 32-bits */
If M is the value of q-p and N is the value of ((int) & (p→ c))-((int)p), then (M,N) is
ANS. C
53. Consider an LPP given as
Max Z = 2x1 - x2 + 2x3
Subject to the constraints
2x1 + x2 ≤ 10
x1 + 2x2 - 2x3 ≤ 20
x1 + 2x3 ≤ 5
x1, x2, x3 ≥ 0
What shall be the solution of the LPP after applying first iteration of the Simplex Method?
A) x1=5/2, x2=0, x3=0, Z=5
B) x1=0, x2=0, x3=5/2, Z=5
C) x1=0, x2=5/2, x3=0, Z= -5/2
D) x1=0, x2=0, x3=10, Z=20
Max Z = 2x1 - x2 + 2x3
Subject to the constraints
2x1 + x2 ≤ 10
x1 + 2x2 - 2x3 ≤ 20
x1 + 2x3 ≤ 5
x1, x2, x3 ≥ 0
What shall be the solution of the LPP after applying first iteration of the Simplex Method?
A) x1=5/2, x2=0, x3=0, Z=5
B) x1=0, x2=0, x3=5/2, Z=5
C) x1=0, x2=5/2, x3=0, Z= -5/2
D) x1=0, x2=0, x3=10, Z=20
ANS. B
54. A web application and its support environment has not been fully fortified against attack. Web engineers estimate that the likelihood of repelihood an attack is only 30 percent. The application does not contain sensitive or controversial information, so the threat probability is 25 percent. What is the integrity of the web application?
ANS. D
55. Which of the following terms best describes Git?
ANS. C
56. How can the decision algorithm be constructed for deciding whether context-free language L is finite?
(a) By Constructing redundant CFG in CNF generating language L
(b) By constructing non-redundant CFG G in CNF generating language L
(c) By constructing non-redundant CFG in CNF generating language L-{∧} (∧ stands for null)
Which of the following is correct?
(a) By Constructing redundant CFG in CNF generating language L
(b) By constructing non-redundant CFG G in CNF generating language L
(c) By constructing non-redundant CFG in CNF generating language L-{∧} (∧ stands for null)
Which of the following is correct?
ANS. C
57. For which values of m and n does the complete bipartite graph km,n have a Hamilton circuit?
A) m ≠ n, m, n≥ 2
B) m ≠ n, m, n≥ 3
C) m = n, m, n≥ 2
D) m = 2, m, n≥ 3
A) m ≠ n, m, n≥ 2
B) m ≠ n, m, n≥ 3
C) m = n, m, n≥ 2
D) m = 2, m, n≥ 3
ANS. C
58. What is the name of the protocol that allows a client to send a broadcast message with its MAC address and receive an IP address in reply?
ANS. C
59. The RSA encryption algorithm also works in reverse, that is, you can encrypt a message with the private key and decrypt it using the public key. This property is used in
ANS. B
60. Which of the following features is supported in the relational database model?
ANS. C
61. Which of the following statements is/are TRUE?
P: In software engineering, defects that are discovered earlier are more expensive to fix
Q: A software design is said to be a good design, if the components are strongly cohesive and weakly coupled
Select the correct answer from the options given below:
P: In software engineering, defects that are discovered earlier are more expensive to fix
Q: A software design is said to be a good design, if the components are strongly cohesive and weakly coupled
Select the correct answer from the options given below:
ANS. B
62. For a magnetic disk with concentric circular tracks, the seek latency is not linearly proportional to the seek distance due to
ANS. B
63. How many states are there in a minimum state automata equivalent to regular expression given below?
regular expression is a*b(a+b)
regular expression is a*b(a+b)
ANS. C
64. How many bit strings of length ten either start with a 1 bit or end with two bits 00?
ANS. C
65. Consider that a process has been allocated 3 frames and has a sequence of page referencing 1,2,1,3,7,4,5,6,3,1
What shall be the difference i page faults for the above string using the algorithm of LRU and Optimal page replacement for referencing the string?
What shall be the difference i page faults for the above string using the algorithm of LRU and Optimal page replacement for referencing the string?
ANS. A
66. Software products need are adaptive maintenance for which of the following reasons?
ANS. B
67. Consider the following C++ function f() :
unsigned int f(unsigned int n)
{
unsigned int b=0;
while(n)
{
b+=n&1;
n>>=1;
}
return b;
}
The function f() returns the int that represents the___p___in the binary representation of positive integer n, where P is
unsigned int f(unsigned int n)
{
unsigned int b=0;
while(n)
{
b+=n&1;
n>>=1;
}
return b;
}
The function f() returns the int that represents the___p___in the binary representation of positive integer n, where P is
ANS. D
68. The fault can be easily diagnosed in the microprogram control unit using diagnostic tools by maintaining the contents of
ANS. D
69. The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by
ANS. C
70. A processor can support a maximum memory of 4 GB where memory is word addressable and a word is 2 bytes. What will be the size of the address bus of the processor?
ANS. C
71. Match List-I with List-II:
Choose the correct option from those given below:
| List-I | List-II |
| (a) Greedy best-first | (i) Minimal cost (p)+h(p) |
| (b) Lowest cost-firs | (ii) Minimal h(p) |
| (c) A* algorithm | (iii) Minimal cost (p) |
ANS. D
72. Which of the following are the primary objectives of risk monitoring in software project tracking?
P: To assess whether predicted risks do, in fact, occur
Q: To ensure that risk aversion steps defined for the risk are being properly applied
R: To collect information that can be used for future risk analysis
P: To assess whether predicted risks do, in fact, occur
Q: To ensure that risk aversion steps defined for the risk are being properly applied
R: To collect information that can be used for future risk analysis
ANS. D
73. On translating the expression given below into quadruple representation, how many operations are required? (i*j)+(e+f)*(a*b+c)
ANS. B
74. Consider the following statements regarding 2D transforms in computer graphics:
S1: M is a 2x2 matrix that reflects (mirror) only 2D point about the x-axis.
S2: A 2x2 matrix which mirrors any 2D point about the X-axis, is a rotation matrix. What can you say about the statements S1 and S2?
S1: M is a 2x2 matrix that reflects (mirror) only 2D point about the x-axis.
S2: A 2x2 matrix which mirrors any 2D point about the X-axis, is a rotation matrix. What can you say about the statements S1 and S2?
ANS. B
75. Which of the following UNIX/Linux pipes will count the number of lines in all the files having .c and .h as their extension in the current working directory?
ANS. D
76. The parallel bus arbitration technique uses an external priority encoder and a decoder. Suppose, a parallel arbiter has 5 bus arbiters. What will be the size of priority encoder and decoder respectively?
ANS. D
77. Which of the following is best running time to sort n integers in the range 0 to n2-1
ANS. B
78. Following table has two attributes Employee_id and Manager_id, where Employee_id is a primary key and manager_id is a foreign key referencing Employee_id with on-delete cascade:
On deleting the table (20,40), the set of other tuples that must be deleted to maintain the referential integrity of table is
| Employee_id | Manager_id |
| 20 | 40 |
| 25 | 40 |
| 30 | 35 |
| 35 | 20 |
| 40 | 45 |
| 45 | 25 |
ANS. B
79. Which of the following is an application of depth-first search?
ANS. C
80. Consider the following grammar:
S→ XY
X→ YaY | a and y → bbX
Which of the following statements is/are true about the above grammar?
(a) Strings produced by the grammar can have consecutive three a's
(b) Every string produced by the grammar have alternate a and b
(c) Every string produced by the grammar have at least two a's
(d) Every string produced by the grammar have b's in multiple of 2.
S→ XY
X→ YaY | a and y → bbX
Which of the following statements is/are true about the above grammar?
(a) Strings produced by the grammar can have consecutive three a's
(b) Every string produced by the grammar have alternate a and b
(c) Every string produced by the grammar have at least two a's
(d) Every string produced by the grammar have b's in multiple of 2.
ANS. D
81. Consider a raster system with resolution 640 by 480. What size is frame buffer (in bytes) for this system to store 12 bits per pixel?
ANS. A
82. Using the phong reflectance model, the strength of the specular highlight is determined by the angle between
ANS. D
83. With respect to relational algebra, which of the following operations are included from mathematical set theory
(a) join
(b) Intersection
(c) Cartisian product
(d) Project
(a) join
(b) Intersection
(c) Cartisian product
(d) Project
ANS. B
84. How many cards must be selected from a standard deck of 52 cards to guarantee that at least three hearts are present among them?
ANS. D
85. Which of the following is an example of unsupervised neural network?
ANS. D
86. There are many sorting algorithms based on comparison. The running time of heap sort algorithm is O(nlogn). Let P, but unlike Q, heapsort sorts in place where (P,Q) is equal to
ANS. D
87. You are designed a link layer protocol for a link with bandwidth of 1 Gbps (109 bits/second) over a fiber link with length of 800 km. Assume the speed of light in this medium is 200000 km/second. What is the propagation delay in this link?
ANS. D
88. Consider the following two statements with respect to IPv4 in computer networking:
P: The loopback(IP) address is a member of class B network
Q: The loopback(IP) address is used to send a packet from host to itself
What can you say about the statements P and Q?
P: The loopback(IP) address is a member of class B network
Q: The loopback(IP) address is used to send a packet from host to itself
What can you say about the statements P and Q?
ANS. B
89. The STRIPS representation is
ANS. B
90. Which of the following has the same expressive power with regard to relational query language?
(a) Relational algebra and Domain relational calculus
(b) Relational algebra and Tuple relational calculus
(c) Relational algebra and Domain relational calculus restricted to safe expression
(d) Relational algebra and Tuple relational calculus restricted to safe expression
(a) Relational algebra and Domain relational calculus
(b) Relational algebra and Tuple relational calculus
(c) Relational algebra and Domain relational calculus restricted to safe expression
(d) Relational algebra and Tuple relational calculus restricted to safe expression
ANS. B
91. Which of the following statements is/are true
P: An XML document with correct as specified by W3C is called “well formed”.
Q: An XML documented validated against a DTD is both “Well-Formed” and “valid”.
R: is syntactically correct declaration for the version of an XML document.
Select the correct answer from the options given below:
P: An XML document with correct as specified by W3C is called “well formed”.
Q: An XML documented validated against a DTD is both “Well-Formed” and “valid”.
R: is syntactically correct declaration for the version of an XML document.
Select the correct answer from the options given below:
ANS. A
92. Consider the following pseudo-code fragment in which an invariant for the loop is " m * xk = p nand k ≥ 0 " (Here, p and n are integer variables that have been initialized):
/* Pre-conditions:p ≥ 1 ∧ n ≥ 0 */
/* Assume that overflow never occurs */
int x=p; int k=n; int m=1;
while(k< >0)
{
if(k is odd) then m=m*x;
x=x*x;
k=⌊(k/2)⌋; /* floor(k/2) */
}
Which of the following must be true at the end of the while loop?
/* Pre-conditions:p ≥ 1 ∧ n ≥ 0 */
/* Assume that overflow never occurs */
int x=p; int k=n; int m=1;
while(k< >0)
{
if(k is odd) then m=m*x;
x=x*x;
k=⌊(k/2)⌋; /* floor(k/2) */
}
Which of the following must be true at the end of the while loop?
ANS. B
93. The component in MVC is responsible for
ANS. C
94. Consider the game tree given below:
Here ○ and □ represents MIN and MAX nodes respectively. The value of the root node of the game tree is
Here ○ and □ represents MIN and MAX nodes respectively. The value of the root node of the game tree is
ANS. B
95. Suppose that a computer program takes 100 seconds of execution time on a computer with multiplication operation responsible for 80 seconds of this time.
How much do you have to improve the speed of multiplication operation if you are asked to execute this program four times faster.
How much do you have to improve the speed of multiplication operation if you are asked to execute this program four times faster.
ANS. C
96. Which of the following are not shared by the threads of the same process?
(a) Stack
(b) Registers
(c) Address Space
(d) Message Queue
(a) Stack
(b) Registers
(c) Address Space
(d) Message Queue
ANS. C
97. Consider the following statements:
S1 : For any integer n>1, a Φ(n) = 1(mod n) for all a ∈ Z*n, where Φ(n) is euler’s phi function.
S2 : If p is prime, then ap = 1(mod p) for all a ∈ Z*p
Which one of the following is are correct:
S2 : If p is prime, then ap = 1(mod p) for all a ∈ Z*p
Which one of the following is are correct:
ANS. A
98. You need 500 subnets, each with about 100 usable host addresses per subnet. What network mass will you assign using a class B network address?
ANS. B
99. The ability to inject packets into the internet with false source address is known as :
ANS. D
100. Consider the complexity class CO-NP as the set of languages L such that L’ ε NP, and the following two statements:
S1 : P ⊆ CO-NP
S2 : If NP ≠ CO-NP, then P ≠ NP
Which of the following is/are correct?
S1 : P ⊆ CO-NP
S2 : If NP ≠ CO-NP, then P ≠ NP
Which of the following is/are correct?
ANS. C
Wabunamwo Hoi Richter https://marketplace.visualstudio.com/items?itemName=1ciaprocvicma.Projekt-Z-gratuita
ReplyDeletegaradeso
Nimunrupmo Angela Kutzler https://www.thecrane.org/profile/HD-Online-Player-Gearexpert-51-Full-Version-HOT/profile
ReplyDeleteboitecadre
ofinOstag-ga John Chongbang https://wakelet.com/@nuselpassbea580
ReplyDeletealadtobkonf
Unojainta Lydia Yoggerst Here
ReplyDeleteturesbersty
Nice blog!
ReplyDeleteCompetition Guru is best UGC NET Coaching in Chandigarh. There are 2 papers in the UGC NET exam for both JRF and AF posts.
provquifesse Novi Roberts link
ReplyDeletehttps://colab.research.google.com/drive/1j4oVBBUL8_lBymwNwcmUPakIousMlAjZ
download
link
touchsraffgimar