Ans .
A
- Explanation :
T(Read) = 0.8 * 50 + 0.2 * (300 + 50) = 110 nanosecs
T(Write) = 1 * max(300,50) = 1* 300 = 300 nanosecs
Hence, Average access time for both read and write requests = 0.75 * 110 + 0.25 * 300 = 157.5 nanosecs
Ans .
C
- Explanation :
Internal interrupts are caused due to some internal error (like division by zero)
External interrupts are caused due some h/w event like power failure etc
Software interrupts or system calls are appropriate methods for switching from a user mode to kernel mode
Ans .
A
- Explanation :
It prints 200 characters in 1600x10-3seconds. Hence-->1 sec it prints 200000/1600=125character/sec.
Ans .
D
- Explanation :
XCHG -- Does not Change any Flag.
SUB -- Changes all the flag of Flag Register
STC --Set Carry flag i.e. it changes only carry flag
DCR -- Decrement Register changes all flags but not carry flag
Ans .
B
- Explanation :
In the given program OR operation is performed With A
Content of A is 00h in all iteration and when value of A becomes 0 (it is possible when c is 0) the loop stops.
In each iteration, the register pair is decreased and initial value of register pair is 7.
So it runs 7 times.
Ans .
D
- Explanation :
Perform the hexadecimal summation of 87h and 79h.
The result is 0 as sum, setting z i.e zero flag to 1 and also results in carry so CY flag to 1
Ans .
A
- Explanation :
In distributed computer networks, location transparency is the use of names to identify network resources, rather than their actual location.
For example, files are accessed by its unique file name, but the actual data is stored in physical locations spread around a disk in either the local computer or in a network.
Ans .
D
- Explanation :
Two phase locking is pessimistic(negative) protocol (assumes bad thing going to happen) since it applies locks (for safety).
Time stamping is an optimistic(positive) protocol (assumes good thing going to happen) since it uses no locking.
Ans .
B
- Explanation :
At Checkpoints; * Logs are deleted if immediate update takes place
* Log Operations are executed if deferred update takes place
Empty logs are what one is left with after all the checkpoints.
Ans .
B
- Explanation :
Attribute closure of an attribute is the attribute that are reachable by this attribute.
Closure{A} : A --> B, B--> C, AC --> D so {ABCD}
Closure{E} is E as E is reachable by itself, as in closure of attributes attribute itself is always true.
Ans .
D
- Explanation :
All reconstructions need two operations
* Join
* Union
Since the operations above are commutative, the reconstructions are commutative too.
Ans .
A
- Explanation :
Every binary relation is by default always in BCNF.
Ans .
D
- Explanation :
All of the above mentioned categories refer to Animation Languages.
Ans .
A
- Explanation :
keyboard is logical device and so is locator
Data globe, sonic pen are 3D interaction devices
Tablet joystick are continuous devices as we can not lift up our hand during their operation
Light pen and touch screen are direct devices as we directly touch them to get our work done
Ans .
B
- Explanation :
Dithering is a technique used to approximate the halftones without reducing spatial resolution.
Ans .
A
- Explanation :
Since the rotation is not about origin, we translate the point of rotation to origin and apply similiar translation to all of the other points
A translates to (1,1), B translates to (2,2) and C translates to (6,3).
Apply rotation on A(45 degrees) about origin. resulting in option A as answer.
Ans .
B
- Explanation :
the parameter t is calculated:
t = (f-p1)/(p2-p1)
where f is a value from point in question, p1 and p2 are end points
Option (B) is just a vector notation of the same.
Ans .
D
- Explanation :
The term "isometric" comes from the Greek for "equal measure", reflecting that the scale along each of the axis of the projection is the same (unlike some other forms of graphical projection).
In cavalier projection (sometimes cavalier perspective or high view point) a point of the object is represented by three coordinates, x, y and z. On the drawing, it is represented by only two coordinates, x? and y?. On the flat drawing, two axes, x and z on the figure, are perpendicular and the length on these axes are drawn with a 1:1 scale; it is thus similar to the dimetric projections, although it is not an axonometric projection, as the third axis, here y, is drawn in diagonal, making an arbitrary angle with the x? axis, usually 30 or 45°. The length of the third axis is not scaled.
Orthographic projection (or orthogonal projection) is a means of representing a three-dimensional object in two dimensions. It is a form of parallel projection, where all the projection lines are orthogonal to the projection plane
Ans .
C
- Explanation :
The Call by reference can be performed by Implicit or explicit reference which depends on the language like C, C++, JAVA uses external reference and PYTHON uses Internal reference.
So S2 is correct.
S1 is clearly understood and S3 is clearly Incorrect.
so S2 & S1 are correct
Ans .
A
- Explanation :
x=x*(a+b)-5; every character here is a token token no character 1 x 2 = 3 x 4 * 5 ( 6 a 7 + 8 b 9 ) 10 - 11 5 12 ;
Ans .
C
- Explanation :
Message-Passing Interface (MPI) standard
MPI_Isend and MPI_Irecv are non-blocking message passing routines and MPI_Ibsend buffered nonblocking so options A and B are correct
MPI_Ssend and MPI_Bsend are blocking message so D is also
δ (q1,a, 1) = {(q1,11)}
δ (q1,b, 1) = {(q2 , λ)}
δ(q2 , b, 1) = {(q2 , λ)}
δ (q2 , λ , 0) = {(q0, λ)}
Accepts the language
Ans .
B
- Explanation :
The following deterministic pushdown automata accepts the language anbn
Ans .
D
- Explanation :
Pumping Lemma -> Is just a technique to prove there is some loop (in machine) or infiniteness (in the specified language).
And most of the time it is used in the negative sense. (like if language does not satisfy Pumping Lemma then it is not regular).
Ans .
D
- Explanation :
Since the condition, n >= 4, m >= 3 is specified, the above languages dont hold true
Ans .
D
- Explanation :
Suppose there are 'n' devices in network.
In a mesh network every device connects remaining (n-1) devices
Here Link Between two device will be counted 2 times.
Hence,Total Number of Physical channels which are required to Link between all the devices= n(n-1)/2
Ans .
B
- Explanation :
In asynchronous transmission, for each character, we need to send data, parity, start and stop bits.
Size of one character = 7+1+1+1 =10 bits
Line transmits 3200 bits in.one second.
No of characters transmitted in one second = 3200/10 =320
Ans .
B
- Explanation :
Ans .
D
- Explanation :
Distance between points= 48000 km = 48 ×106meter
Propagation speed = 2.4 ×108 meter / sec.
Propagation Time = Distance between points/Propgation speed
= 48×106/2.4×108=0.2sec
= 200 ms
Ans .
B
- Explanation :
HDLC(high level data link control) is a classical bit oriented code-transparent synchronous data link layer protocol developed by theInternational Organization for Standardization (ISO) protocol
HDLC provides both connection-oriented and connectionless service.
HDLC can be used for point to multipoint connections, but is now used almost exclusively to connect one device to another, using what is known as Asynchronous Balanced Mode (ABM)
Ans .
A
- Explanation :
In asymmetric-key cryptography, the Private key is known only by the receiver and public key is announced to all.
Ans .
C
- Explanation :
A binary tree of height h has <= 2h leaves.
At least n! leaves are required for sorting.
Thus n! <= 2h.
h >= lg(n!) = sum_{i=2}^n lg(i) > sum_{i=n/2}^n lg(i) > sum_{i=n/2}^n lg(n/2) > (n/2) lg(n/2) = Omega(n lg n).
Ans .
C
- Explanation :
Bucket sort---->iv. O(n) Matrix chain multiplication----->ii. O(n3) Huffman codes---->iii. O(nlgn) All pairs shortest paths---->i. O(n3/gn)
Ans .
D
- Explanation :
The clique decision problem is NP-complete.
SAT is one of the first problems that was proven to be NP-complete.
So option (A) matches with rule 3 and 4.We infer clique is NP and 3 SAt is NP hard
Vertex Cover Problem is a known NP Complete problem
So option (B) also matches with rule 3 and 4.We infer clique is NP and vertex problem is NP hard
The problem is NP-complete.
So option (C) matches with rule 3 and 4.We infer clique is NP and Subset problem is NP hard
None of the options proves Clique problem is NP Hard.
So answer Must be D
Ans .
C
- Explanation :
Dijkstra algorithm is a Greedy algorithm while Floyd-Warshall is Dynamic programming algorithm
Ans .
B
- Explanation :
Using matrix multiplication method
Case I)
A1 =10x100,A2=100x5,A3=5x50.
((A1A2)A3) :first find A1A2(=P) no of muls=10*100*5=5000.//A1A2= P(assume)
then PA3 : P is 10x5 and A3 is 5x50
no of muls=10*5*50=2500.
Total no of multiplications=5000+2500=7500.
Case II)
(A1(A2A3)) :first A2A3(=Q) no of muls=100*5*50=25000.//A2A3=Q(assume)
(A1Q). Q is 100x50 and A1 is 10x100.
no of muls=10*100*50=50000.
Total no of multiplications=50000+25000=75000.
Compare both first one is 10 times faster than 2nd one..
Ans .
C
- Explanation :
In binary search after each comparison
if value > x, the numbers greater than x are avoided
if value < x, the numbers lower than x are avoided
These avoided numbers won't come again in any comparison.
Ans .
B
- Explanation :
With respect to multi-threading, synchronization is the capability to control the access of multiple threads to shared resources.
Without synchronization, it is possible for one Java thread to modify a shared variable while another thread is in the process of using or updating same shared variable.
This usually leads to erroneous behavior or program.
Ans .
A
- Explanation :
A person may have either none or many animals as pets(one to many relationships)
which is shown by A
hence A is the ans
Ans .
D
- Explanation :
Autoboxing is the automatic conversion that the Java compiler makes between the primitive types and their corresponding object wrapper classes.
Ans .
D
- Explanation :
The XML can define the behavior of document elements by all of the above parameters
Ans .
D
- Explanation :
Stereotype is used for extending the UML language
Ans .
C
- Explanation :
The applet method init() is called initially if the applet page isn't found in the cache
Ans .
B
- Explanation :
function point this approach is independent of the language ,tools, or methodologies used for implementation
Ans .
B
- Explanation :
Number of value adjustment factors(or degrees of influence ) are based on responses of 14 (Fi , i=1 to 14) questions
FP = Count total ×(0.65+0.01×?(Fi)) Where count total is the sum of all FP entries. OR
FP=UFP * CAF ( unadjusted function point * complexity adjustment factor)
Ans .
B
- Explanation :
Number of reusable components planned =60
Part of reusable components actually included=70%
Number of components developed freshly = 30% of 60=18
Development cost = 18 x 100 x 14$
Probability of occurrence of risk =80%
Risk exposure = 0.8 x 18 x 100 x 14 = 20160$
Ans .
B
- Explanation :
max possible reliability is 1 or 100 % so ans is C
Ans .
A
- Explanation :
FAN IN =Number of components that can call or pass control to component A
FAN OUT=Number of components that are called by component A
Ans .
D
- Explanation :
Temporal cohesion: all of statements activated at a single time, such as start up or shut down, are brought together. Initialization, clean up.
Functions weakly related to one another, but more strongly related to functions in other modules so may need to change lots of modules when do maintenance.
Ans .
D
- Explanation :
The storage hierarchy is a ranking of storage devices based on several factors: access speed, capacity, cost per bit, and volatility.
Registers - fastest access, highest cost/bit, low capacity, volatile
Main memory - slower access than registers (faster than disks), lower cost/bit than registers (higher than disks), higher capacity than registers (lower than disks), volatile
Electronic disks - a.k.a. flash memory has slower access than main memory (faster than hard drives), lower cost/bit than main memory (higher than hard drives), higher capacity than main memory (lower than hard drives), nonvolatile
Magnetic disks - slower access than flash memory (faster than tapes), lower cost/bit than flash memory (higher than tapes), higher capacity than flash memory (lower than tapes), nonvolatile.
Ans .
NONE OF THE ABOVE
- Explanation :
no. of disk blocks possible = 16GB/ 1KB = 16M disk blocks available
no. of disk block address possible to store in 1 disk block = 1kB/32bits = 256 address can be stored in 1 disk block
256 disk block address...1 disk block
16M disk block address--> x
x = 16M/256 = 65536
NONE OF THE ABOVE
Ans .
D
- Explanation :
11-12-9-16-1-34-36 sequence of access..
So 1+3+7+15+33+2=61
Ans .
A
- Explanation :
allocated Max need P1 6 11 5 P2 3 5 2 total resource =13 AND free resources =13-11=2 so clearly these 2 can only be given P3 2 8 6 to P2 which will be completed and release its all 5 resource then next P1 can take 5 resource and be completed and finally P3 so right ans is choice 1 P2P1P3
Ans .
A
- Explanation :
monitor is a thread-safe class, object, or module that uses wrapped mutual exclusion in order to safely allow access to a method or variable by more than one thread.
The defining characteristic of a monitor is that its methods are executed with mutual exclusion:
At each point in time, at most one thread may be executing any of its methods.
Using a condition variable(s), it can also provide the ability for threads to wait on a certain condition (thus using the above definition of a "monitor").
For the rest of this article, this sense of "monitor" will be referred to as a "thread-safe object/class/module".
Ans .
B
- Explanation :
In computer science, distributed shared memory (DSM) is a form of memory architecture where the (physically separate) memories can be addressed as one (logically shared) address space.
Here, the term "shared" does not mean that there is a single centralized memory but "shared" essentially means that the address space is shared (same physical address on two processors refers to the same location in memory.
Distributed global address space (DGAS), is a similar term for a wide class of software and hardware implementations, in which each node of a cluster has access to shared memory in addition to each node's non-shared private memory.
Ans .
C
- Explanation :
~(∀x) F(x) =($x)(~F(x))
Ans .
B
- Explanation :
A* is an informed search algorithm, or a best-first search, meaning that it solves problems by searching among all possible paths to the solution (goal) for the one that incurs the smallest cost (least distance travelled, shortest time, etc.), and among these paths it first considers the ones that appear to lead most quickly to the solution.
It is formulated in terms of weighted graphs: starting from a specificnode of a graph, it constructs a tree of paths starting from that node, expanding paths one step at a time, until one of its paths ends at the predetermined goal node.
At each iteration of its main loop, A* needs to determine which of its partial paths to expand into one or more longer paths.
It does so based on an estimate of the cost (total weight) still to go to the goal node.
Specifically, A* selects the path that minimizes
f(n)=g(n)+h(n)
where n is the last node on the path, g(n) is the cost of the path from the start node to n, and h(n) is a heuristic that estimates the cost of the cheapest path from n to the goal.
The heuristic is problem-specific. For the algorithm to find the actual shortest path, the heuristic function must be admissible, meaning that it never overestimates the actual cost to get to the nearest goal node.
Ans .
B
- Explanation :
A∨B,∼A∨D,C∨∼B A & ~A will cancel out and so will B and ~B
Ans .
B
- Explanation :
a.Script iv. Frame like structures used to represent stereotypical patterns for commonly occurring events in terms of actors, roles, props and scenes b. Conceptual Dependencies iii. Primitive concepts and rules to represent natural language statements c. Frames ii. Knowledge about objects and events is stored in record-like structures consisting of slots and slot values. d. Associative Network i. Directed graph with labelled nodes for graphical representation of knowledge
Ans .
B
- Explanation :
The User Interface - Where the user interacts with the expert system. In other words where questions are asked, and advice is produced The inference engine is the main processing element of the expert system. The inference engine chooses rules from the agenda to fire. If there are no rules on the agenda, the inference engine must obtain information from the user in order to add more rules to the agenda The Knowledge Base - Where the information is stored in the expert system in the form of facts and rules (basically a series of IF statements). This is where the programmer writes the code for the expert system. Explanation module . Gives the user, the ability to follow inferencing steps at any time during consultation
Ans .
B
- Explanation :
A computer based information system is needed due to growing size of organizations which need to process large volume of data as timely and accurate decisions are to be taken.
Ans .
D
- Explanation :
Ans .
B
- Explanation :
Ans .
B
- Explanation :
context-free pumping lemma to be the following. Let L be an infinite context-free language. Then there exists some positive integer m such that any w that is a member of L with |w| ≥ m can be decomposed as w = uvxyz, with |vxy| ≤ m, and |vy| ≥ 1, such that wi = uvixyiz, is also in L for all i = 0, 1, 2, ....
Ans .
B
- Explanation :
spatial mask for point (x,y) used to implement the digital Laplacian of the 2-D is given by [ f(x+1,y),f(x-1,y),f(x,y+1),f(x,y-1)]-4f(x,y) so possible mask are 0 1 0 1 1 1 1 -4 1 or 1 8 1 0 1 0 1 1 1 here in S1 a 1 is missing on the right side of -4
Ans .
D
- Explanation :
The first order estimate of image entropy is maximum when a = 1/4, b =1/4, c=1/4, d=1/4
Ans .
A
- Explanation :
The transfer function of a Butterworth lowpass filter of order n with cutoff frequency at distance D0 from the origin is defined as: H(u,v) = 1/1+(D(u,v)/D0)2n
Ans .
B
- Explanation :
it is B infeasible else if condition is false it may be degenrate or unbounded
Ans .
C
- Explanation :
Ans is C choice A is must to be start for a solution Choice B is converted to case A first then we try soln we can find unfeasible soln i.e allocations are less than m+n-1 which is a case of degenracy
Ans .
C
- Explanation :
The minimum time required to complete all the jobs is 13 hours in total.
Ans .
D
- Explanation :
Both are true hence ans is D
Ans .
C
- Explanation :
The Crossover point of a fuzzy set is the element in U at which its membership function is 0.5 The Support of a fuzzy set F is the crisp set of all points in the Universe of Discourse U such that the membership function of F is non-zero. if membership is 1 then it is core of a fuzzy set alpha cut (or λͅ -cut) can be anything from 0 to 1 (0<= λͅ<=1) μA(x)=0.5
Ans .
A
- Explanation :
some clue supervised --->under some guidance by some teacher Reinforcement--->evaluation in form of reward or critics (minus points) Unsupervised ---->no information about desired responses Recording --->some memory storage
Ans .
A
- Explanation :
Windows Vista contain built-in partition manager which allows us to shrink and expand pre-defined drives
Ans .
A
- Explanation :
In computing, Trojan horse, or Trojan, is any malicious computer program which is used to hack into a computer by misleading users of its true intent. The term is derived from the Ancient Greek story of the wooden horse that was used to help Greek troops invade the city of Troy by stealth.[1][2][3][4][5]
Trojans are generally spread by some form of social engineering, for example where a user is duped into executing an e-mail attachment disguised to be unsuspicious, (e.g., a routine form to be filled in), or by drive-by download. Although their payload can be anything, many modern forms act as a backdoor, contacting a controller which can then have unauthorized access to the affected computer.[6]this infection allows an attacker to access users' personal information such as banking information, passwords, or personal identity (IP address).
Ans .
B
- Explanation :
rest are different types of distributed computing The two concepts parallel computing and distributed computing are very closely related; they mostly come from very different backgrounds. Parallel computing means that different activities happen at the same time. The term was mostly used in scientific computing (consumer computers until very recently simply were not parallel) where it typically means: spread out a single application over many many cores/processors/processes to get it done bigger/faster. Current big parallel computers have 100 thousand to a million parallel processors/cores/threads/whatever. Distributed computing comes from the business world where you have distributed systems such as airline reservation systems, where many people access and modify the same data at the same time. The machinery involved here is typically much looser coupled, and the activities in a distributed system are typically far less synchronized