0 of 100 questions completed
Questions:
General instruction:
1. The clock will be set at the server. The countdown timer at the top right corner of screen will display the remaining time available for you to complete the examination. When the timer reaches zero, the examination will end by itself. You need not terminate the examination or submit your paper.
2. The Question Palette displayed on the right side of screen will show the status of each question using one of the following symbols.
(White)You have not answered the question
(Green)You have answered the question
(Orange)You have NOT answered the question, but have marked the question for review.
The Mark for Review status for a question simply indicates that you would like to look0 at that question again. If a question is answered, but marked for review, then the answer will be considered for evaluation unless the status is modified by the candidates.
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading…
You must sign in or sign up to start the quiz.
You must first complete the following:
0 of 100 questions answered correctly
Time has elapsed
You have reached 0 of 0 marks, (0)
Earned Point(s): 0 of 0, (0)
0 Essay(s) Pending (Possible Point(s): 0)
The M components in MVC are responsible for
On translating the expression given below into quadruple representation, how many operations are required?
(i∗j)+(e+f)∗(a∗b+c)
Which of the following is application of depth-first search?
A Web application and its support environment has not been fully fortified against attack. Web engineers estimate that the likelihood of repelling 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?
In relational databases, if relation R is in BCNF, then which of the following is true about relation R?
Let Aα0 denotes the α-cut of a fuzzy set A at α0. If α1<α2, then
The ability to inject packets into the Internet with a false source address is known as
Consider the following pseudo-code fragment in which an invariant for the loop is “ m∗x ^{k}=p ^{n} and k≥0 ” (here, p and n are integer variable 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?
Consider the poset ({3,5,9,15,24,45},∣).
Which of the following is correct for the given poset ?
How many ways are there to place 8 indistinguishable balls into four distinguishable bins?
How many bit strings of length ten either start with a 1 bit or end with two bits 00 ?
Suppose that a connected planar graph has six vertices, each of degree four. Into how many regions is the plane divided by a planar representation of this graph?
For which values of m and n does the complete bipartite graph km,n have a Hamiltonian circuit ?
Which of the following is principal conjunctive normal form for [(p∨q)∧ ⌉p→⌉q] ?
How many cards must be selected from a standard deck of 52 cards to guarantee that at least three hearts are present among them?
Match List-I with List-II:
List -I List-II
(a) p→q (i) ~(q→~p)
(b) p V q (ii) p /\ ~q
(c) p /\ q (iii)~p →q
(d)~(p→q) (iv) ~p V q
Find the zero-one matrix of the transitive closure of the relation given by the matrix A :
Consider an LPP given as
What shall be the solution of the LLP after applying first iteration of the Simplex Method?
Which type of addressing mode, less number of memory references are required?
Suppose that the register A and the 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 searches by data association. This type of memory is known as
How many different Boolean functions of degree n are the
The fault can be easily diagnosed in the micro-program control unit using diagnostic tools by maintaining the contents of
What will be the number of states when a MOD-2 counter is followed by a MOD-5 counter?
For a magnetic disk with concentric circular tracks, the seek latency is not linearly proportional to the seek distance due to
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?
Consider the equation (146)_{b}+(313)_{b-2}=(246)_{8}. Which of the following is the value of b?
How many address lines and data lines are required to provide a memory capacity of 16K×16?
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 the multiplication operation if you are asked to execute this program four times faster?
Consider the following C-code fragment running on a 32-bit X86 machine:
typedef struct {
union {
unsigned char a;
unsigned short b;
} U;
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
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(s1.equals(s2));
System.out.println(m1.equals(s2));
System.out.println(s1.equals(m2));
}
}
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
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 <img /> tag of HTML.
Select the correct answer from the options given below:
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?
Consider the following statements regarding 2D transforms in computer graphics:
S1: is a 2×2 matrix that reflects (mirrors) only 2D point about the X-axis.
S2: A 2×2 matrix which mirrors any 2D point about the X-axis, is a rotation matrix.
What can you say about the statements S1 and S2?
In the context of 3D computer graphics, which of the following statements is/are true?
P : Orthographic transformations keep parallel lines parallel.
Q : Orthographic transformations are affine transformations.
Select the correct answer from the options given below:
Using the phong reflectance model, the strength of the specular highlight is determined by the angle between
Which of the following has same expressive power with regard to relational query language?
(a) Rational algebra and domain relational calculus
(b) Relational algebra and tuples relational calculus
(c) Relational algebra and domain relational calculus restricted to safe expression
(d) Relational algebra and tuples relational calculus restricted to safe expression
Which of the following features is supported in the rational database model?
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
In relational databases, if relation R is in BCNF, then which of the following is true about relation R?
Which of the following key constraints is required for functioning of foreign key in the context relational databases?
In relational database management, which of the following is/are property/properties of candidate key?
P: Uniqueness
Q: Irreducibility
Which of the following statements are DML statements?
(a) Update [tablename]
Set [columnname]=VALUE
(b) Delete [tablename]
(c) Select * from [tablename]
Hadoop (a big data tool) works with number of related tools. Choose from the following, the common tools included into Hadoop:
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:
Employee_id Manager_id
20 40
25 40
30 35
35 20
40 45
45 25
On deleting the table (20,40), the set of other tuples that must be deleted to maintain the referential integrity of table is
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 the second iteration?
Consider a disk system with 100 cylinders. The requests to access the cylinders occur in the following sequences:
4,37,10,7,19,73,2,15,6,20
Assuming that the head is currently at cylinder 50, what is the time taken to satisfy all requests if it takes 1 ms to move from the cylinder to adjacent one and the shortest seek time first policy is used?
Match List-I with List-II:
List-I List-II
(a) Disk (i) Thread
(b) CPU (ii) Signal
(c) Memory (iii) File system
(d) Interrupt (iv) Virtual address space
Choose the correct option from those given below
Consider that a process has been allocated 3 frames and has a sequence of page referencing as 1,2,1,3,7,4,5,6,3,1. What shall be the difference in page faults for the above string using the algorithms of LRU and optimal page replacement for referencing the string?
Which of the following are NOT shared by the threads of the same process?
(a) Stack
(b)Registers
(c)Address space
(d)Message queue
Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (pre-emptive scheduling) algorithm, then ………….. context switches are required (suppose context switch at the beginning of Ready queue and at the end of Ready queue are not counted).
At a particular time of computation, the value of a counting semaphore is 10. Then 12 P operations and “x” V operations were performed on this semaphore. If the final value of semaphore is 7, x will be
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by
A computer has six tape 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?
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?
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?
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:
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.
Software reuse is
Which of the following terms best describes Git?
Software products need adaptive maintenance for which of the following reasons?
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
Software validation mainly checks for inconsistencies between
List-I(Software Process Models) List-II(Software Systems)
(a) Waterfall model (i) e-business software that starts with only the basic functionalities and then moves on to more advanced features
(b) Incremental development (ii) An inventory control system for super-market to be developed within three months
(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
Choose the correct option from those given below:
Match List-I with List-II:
List-I List-II
(a)Prim’s algorithm (i)O(V ^{3 }logV)
(b)Dijkstra’s algorithm (ii)O(VE^{2})
(c)Faster all-pairs shortest path (iii)O(E lgV)
(d)Edmonds-Karp algorithm (iv)O(V ^{2 })
Choose the correct option from those options given below:
There are many sorting algorithms based on comparison. The running time of heapsort algorithm is O(nlgn). Like P, but unlike Q, heapsort sorts in place where (P,Q) is equal to
Consider the Euler’s phi function given by
where p runs over all the primes dividing n. What is the value of ϕ(45)?
Which of the following is best running time to sort n integers in the range 0 to n^{2}−1?
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−1 and m=701. For k=123456, what is the difference between first and second probes in terms of slots?
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?
Consider the following steps:
S1: Characterize the structure of an optimal solution
S2: Compute the value of an optimal solution in bottom-up fashion
Which of the following step(s) is/are common to both dynamic programming and greedy algorithms?
Consider the following properties with respect to a flow network G=(V,E) in which a flow is a real-valued function f:V×V→R
P1: For all u,v,∈V,f(u,v)=−f(v,u)
P2:
Which one of the following is/are correct?
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 a ^{p}≡1(mod p) for all a ∈Z ^{∗}_{p} .
Which one of the following is/are correct?
Which data structure is used by the compiler for managing variables and their attributes?
Replacing the expression 4∗2⋅14 by 8⋅56 is known as
Shift-reduce parser consists of
(a) input buffer
(b) stack
(c) parse table
Choose the correct option from those given below:
How many states are there in a minimum state automata equivalent to regular expression given below?
Regular expression is a∗b(a+b)
Match List-I with List-II:
where L1: Regular language, L2: Context-free language, L3: Recursive language, L4: Recursively enumerable language
List – I List – II
(a) L3’∪L4 (i) Context-free language
(b) L2’∪L3 (ii) Recursively enumerable language
(c) L1*∩L2 (iii) Recursive Language
Choose the correct option from those given below:
How can the decision algorithm be constructed for deciding whether context-free language L is finite?
By constructing redundant CFG G in CNF generating language L−−
By constructing non-redundant CFG G in CNF generating language L
By constructing non-redundant CFG G in CNF generating language L−{∧} ( ∧ stands for null)
Which of the following is correct?
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.
Which of the following problems is/are decidable problem(s) (recursively enumerable) on 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)∪L(M2)}= language of all TMs.
c. M is a TM that accepts ω using at most 2∣ω∣ cells of tape.
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 ω?
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
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?
You are designing a link layer protocol for a link with bandwidth of 1 Gbps (10^{9} 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?
You need 500 subnets, each with about 100 usable host address per subnet. What network mask will you assign using a class B network address?
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?
In the TCP/IP model, encryption and decryption are functions of ____ layer.
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.
What percentage (%) of the IPv4, IP address space do all class C addresses consume?
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
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
Math List-I with List-II:
List-I List-II
(a) Greedy best-first (i) Minimal cost (p)+h(p)
(b) Lowest cost-first (ii) Minimal h(p)
(c)A∗ algorithm (iii) Minimal cost (p)
Choose the correct option from those given below:
The STRIPS representation is
A fuzzy conjunction operator denoted as t(x,y) and a fuzzy disjunction operator denoted as s(x,y) form a dual pair if they satisfy the condition:
Consider the following methods:
M1: Mean of maximum
M2: Centre of area
M3: Height method
Which of the following is/are defuzzification method(s)?
Consider the following:
(a) Evolution
(b) Selection
(c) Reproduction
(d) Mutation
Which of the following are found in genetic algorithms?
Which of the following is an example of unsupervised neural network?
The value of the derivative of Sigmoid function given by f(x)=at x=0 is
Reinforcement learning can be formalized in terms of ____ in which the agent initially only knows the set of possible _____ and the set of possible actions.