Ans .
C
The beam-penetration is used with random scan monitors and Shadow-Mask is used in raster-scan systems which one is better than other cannot be said as it is dependent on use.
Ans .
D
ALines can have one of three cap styles: Butt, Round, or Square. Depending on which Cap setting you choose, you get three noticeably different capped lines. Here are the options: Butt Cap: Chops off the stroke at the ends. Round Cap: Extends the stroke past the ends (or around the dash location) with semicircular ends. (The radius of each semicircle equals half the stroke weight.) Projecting Cap: Extends the stroke past the ends (or around the dash location) with squared ends. (The amount of each extension equals half the stroke weight.) Unless otherwise specified, HTML5 Canvas lines are defaulted with the butt cap style.
Ans .
C
The attributes for a line are color, width and style or type. The attributes for a are style, color, pattern. The attributes for text are font, size, color, orientation The attributes for marker are type, size, color
Ans .
A
The line segment joining (-1, 0) and (4, 5) is a straight diagonal line. which will intersect the window at (0,1) and (2,3). you can check it by drawing graphically on a graph.
Ans .
D
RGB stands for -Red,Green,Blue HSV stands for -Hue, Stauration,Value HLS stands for -Hue, Stauration,Lightness CMY stands for -Cyan, Magenta, yellow is a subset of RGB. Read These Models for details
Ans .
C
At 1 Mbps, the receiver receives 1,000,000(1+0.001)= 1,001,000 bps instead of 1,000,000 bps. i.e 1,000,000 bits sent and received 1,001,000 so extra bits are 1000
Ans .
D
for finding Compliment the value of U is taken one by one and value of set A is subtracted from (u,1) pair element wise. and the resultant is written in answer. for (5,1) it results in (0,0) so not placed in the resultant set. hence answer D
Ans .
D
In the fuzzy set old the alpha value is compared with value of set and if it is greater than or equal to alpha value it is replaced by 1 otherwise by zero. hence answer D
Ans .
A
Perceptron Learning is an example of Supervised training, in which the learning rule is provided with set of examples of proper network behaviour. A learning management system (LMS) is a software application for the administration, documentation, tracking, reporting and delivery of e-learning education courses or training programs.Colleges and universities use LMSs to deliver online courses and augment on-campus courses. Corporate training departments use LMSs to deliver online training the delta rule is a gradient descent learning rule for updating the weights of the inputs to artificial neurons in single-layer neural network. So all the three learning falls under the category of Error Correcting Learning
Ans .
B
Code blocks allow many algorithms to be implemented with clarity elegance, and efficiency. Moreover, they help the programmer better conceptualize the true nature of algorithm being implemented.
Ans .
A
Check out the basic syntax of Return, break, Goto, Continue in Programming languages like C/C++.
Ans .
C
Control string consists of conversion specifications and literal characters. The string format consists of two types of items - characters that will be printed to the screen, and format commands that define how the other arguments are displayed.
Ans .
A
The concepts of fopen, fclose, feof, ferror functions in C++.
Ans .
C
In Prolog Variables begin with an uppercase letter. Predicate names, function names, and the names for objects must begin with a lowercase letter. and Rules and facts are terminated by full stop (.)
Ans .
B
Since in both case the word obtained after removal belongs to that particular language L. and the language L is regular so both the Languages defined by even and Chop are regular
Ans .
D
Software Testing is the process of executing a program or system with the intent of finding errors. as per the definition of myres. Software testing can also be stated as the process of validating and verifying that a software program/application/product: 1. meets the business and technical requirements that guided its design and development; 2. works as expected; and 3. can be implemented with the same characteristics.
Ans .
B
Vo =200 failures µ = 100 failures ?o = 20 failure/CPU hr. current failure intensity = ?0(1- µ/Vo) =20(1-100/200) = 20(1-0.5) = 10 failures/CPU hr
Ans .
D
All complexity adjustment factors are average. Therefore CAF = 0.65+0.01(SFi) i= 1 to 14 = (0.65+0.01* (14*3) : Rate for average is 3 = 0.65 + 0.42 = 1.07 Calculating FP FP = UFP * CAF = 628 * 1.07 = 672
Ans .
A
These are the definitions of these key terms.
Ans .
C
Error mathematically is the difference between the observed or approximately determined value and the true value of a quantity. Error is used to refer to human action that results in software containing a defect or fault. where as Failure refers to a condition that causes a system to fail. Hence answer is C
Ans .
C
CMM Level 5 is called "Optimized". The software process is at CMM Level 5, if there is continuous process improvement, if there is quantitative feedback from the process, and from piloting innovative ideas and technologies. Software processes are at CMM Level 5, if there are process change management, defect prevention and technology change management.
Ans .
C
In Book Table There is Transitive dependency, Title, Publisher, year are dependent on catalog_no and Price dependent on all the three. so it is in 2NF, But in Collection table no transitive Dependency exists so it is in 3NF
Ans .
B
Specialization Lattice ? has the constraint that a subclass can be a subclass of more than one class/subclass relationship.
Ans .
A
The Thomas Write rule is a rule in timestamp-based concurrency control. Wait-die scheme is a non-preemptive technique for deadlock prevention. A wait-for graph in computer science is a directed graph used for deadlock detection in operating systems and relational database systems. Some systems facilitate deadlock recovery by implementing checkpointing and rollback.
Ans .
D
Since the Decomposition will consists of S,T,U and V and all are interdependent on each other. so if in case R1 or R2 contains 3 attributes then it becomes 2NF and if they both contain 2 attributes each they will be in 3NF. Hence the answer
Ans .
B
Web browser is a software that is used to view the pages in HTML
Ans .
B
2 Phase Locking (2PL) is a concurrency control method that guarantees serializability. The protocol utilizes locks, applied by a transaction to data, which may block (interpreted as signals to stop) other transactions from accessing the same data during the transaction?s life. 2PL may be lead to deadlocks that result from the mutual blocking of two or more transactions. Timestamp-based concurrency control algorithm is a non-lock concurrency control method. In Timestamp based method, deadlock cannot occur as no transaction ever waits
Ans .
D
An explanation facility is the part of an expert system that "explains the reasoning of the system to the user". Means-ends analysis is useful for many human "planning" activities. Prolog is based on the resolution proof method developed by Robinson in 1966 For a Natural language processing system to be capable of producing advice similar to that which one might get from a lawyer, it needs to operate at the same pragmatic level of abstraction as does a lawyer.
Ans .
C
The STRIPS language is very simple but expressive language that lends itself to efficient planning algorithms. STRIPS was devised by SRI in the early 1970s to control a robot called Shakey. Shakey?s task was to negotiate a series of rooms, move boxes, and grab objects. The STRIPS language was used to derive plans that would control Shakey?s movements so that he could achieve his goals. So Strips was Not related to Only NLP and it is related to all others.
Ans .
B
A frame has a set of slots, A slot represents a relation to another frame (or value). A slot has one or more facets, A facet represents some aspect of the relation
Ans .
C
The Greedy Best-First-Search algorithm works in a way that it has some estimate (called a heuristic) of how far from the goal any vertex is. Instead of selecting the vertex closest to the starting point, it selects the vertex closest to the goal.
Ans .
B
First-order predicate calculus allows quantified variables to refer to objects in the domain of discourse, and not to predicates or functions. ? Likes: Likes(george,kate) ? Likes is a variable ranging over predicates not allowed in first-order predicate calculus ? allowed in second-order predicate calculus ? also called higher-order predicate calculi
Ans .
C
Alpha?beta pruning is a search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree. It is an adversarial search algorithm used commonly for machine playing of two-player games
Ans .
B
Given that there are on an average 6 processes per minute. So the arrival rate = 5 process/min. i.e. every 12 seconds a new process arrives on an average. Or we can say that every process stays for 12 seconds with the CPU Service time = 6 sec. Hence the fraction of time CPU is busy = service time / staying time = 6 / 12 =0.5 So the CPU is busy for 50% of the time.
Ans .
B
In optimal page replacement theory, remove the page from frame, is not required in nearest future. The page reference string is : 1 2 3 2 5 6 3 4 6 3 7 3 1 5 3 6 3 4 2 4 3 4 5 1
Ans .
B
In the disk-arm scheduling algorithms The number of requests for disk service are highly influenced by file allocation method. The time required to read or write a disk block determined by 3 factors. Seek time: The time to move the arm to the proper cylinder. Rotational delay: the time for the proper sector to rotate under the head. Actual data transfer time Among these, the Seek time dominates.
Ans .
C
Super block maintains the list of free disk blocks in the Unix file system. The super block contains an array of free disk block numbers, one of which points to the next entry in the list. That entry in turn will be a data block, which contains an array of some other free blocks and a next pointer. When process requests for a block, it searches the free block list returns the available disk block from the array of free blocks in the super block. If the super block contains only one entry which is a pointer to a data block, which contains a list of other free blocks, all the entries from that block will be copied to the super block free list and returns that block to the process.
Ans .
B
A part of windows 2000 operating system that is not portable is Virtual Memory management. The design of the VM manager assumes that the underlying hardware supports virtual-to-physical mapping, a paging mechanism, and transparent cache coherence on multiprocessor systems and allows multiple page-table entries to map to the same page frame. The VM manager in Windows uses a page-based management scheme with a page size of 4 KB.
Ans .
C
$? -- The exit status of the last command executed. $# -- The number of arguments supplied to a script. $0 -- The filename of the current script. $* -- All the arguments are double quoted. If a script receives two arguments, $* is equivalent to $1 $2.
Ans .
D
Register Indirect Addressing is that it can reference memory without paying the price of having a full memory address in the instruction.
Ans .
A
The reverse polish notation equivalent to the infix expression ((A +B) * C + D)/(E +F +G) is A B + C * D + E F + G +
Ans .
C
In digital circuit theory, sequential logic is a type of logic circuit whose output depends not only on the present value of its input signals but on the past history of its inputs.
Ans .
D
To specify a particular operation, out of the 2n possible operations, one needs n bits. As the machine is byte addressable, to specify a particular byte we need (m+10) bits (2(n+10) bytes are there). So 3 addressable and 1 operations needs 3(m+10)+n=3m+n+30 bits
Ans .
D
Master Slave JK Flip Flop Removes the Race Around Condition from JK FLipFlops.
Ans .
C
Microprocessor: Microprocessor is a simple central processing unit (CPU) on a single chip (remember the word ?Single Chip?). It includes Arithmetic logic unit (ALU), control unit (CU), registers, instruction decoders, bus control circuit etc. but everything should be on a single chip. Microcomputer: A microcomputer is the association of microprocessor and the peripheral I/O devices, support circuitry and memory (both data and program). It is not necessary to be on a single chip (remember this point, not in a single chip).
Ans .
C
seq FIRST INCREMENT LAST If FIRST or INCREMENT is omitted, it defaults to 1. That is, an omitted INCREMENT defaults to 1 even when LAST is smaller than FIRST. FIRST, INCREMENT, and LAST are interpreted as floating point values. INCREMENT is usually positive if FIRST is smaller than LAST, and INCREMENT is usually negative if FIRST is greater than LAST. e.g. seq 10 10 110 10 20 30 40 50 60 70 80 90 100 110
Ans .
D
MFC is a SDK interface, a library consisting in a set of classes that act as wrappers around portions of the Windows API, so that C++ programmers may program Windows using some concepts of the object-oriented programming (OOP) paradigm
Ans .
D
The Windows API, informally WinAPI, is Microsoft's core set of application programming interfaces (APIs) available in the Microsoft Windows operating systems. It was formerly called the Win32 API; however, the name Windows API more accurately reflects its roots in 16-bit Windows and its support on 64-bit Windows. Hence Windows 32 bit API support all the 16 bit, 32 bit and 64 bit windows.
Ans .
C
Definition of Object orientation as per book "Object - Oriented Modeling And Design With Uml, 2/E" By Blaha
Ans .
B
Aggregation is defined as "the 'part-whole' or a 'part-of' relationship in which objects representing the components of something are associated with an object representing the entire assembly". Encapsulation can also be called as information hiding. It consists of separating the external aspects of an object, which are accessible to other objects, from the internal implementation details of the object, which are hidden from other objects. Generalization is the relationship between a class and one or more refined versions of it.Generalization is sometimes called a ?is-a? relationship. Each instance of a subclass is an instance of the superclass. The notation for generalization is a triangle connecting a superclass to subclass If two objects are usually considered independent, even though they may be linked, it is an association.
Ans .
A
Smalltalk was the first popular object oriented language. it is not only a language but also a development environment. the most important contribution that Smalltalk provides is it is a language with extensive metadata available and modifiable at run time.
Ans .
D
A servlet configuration object used by a servlet container used to pass information to a servlet during initialization. ServletContext Defines a set of methods that a servlet uses to communicate with its servlet container which enables servlets to log events. ServletRequest Defines an object to provide client request information to a servlet. A ServletRequest object provides data including parameter name and values, attributes, and an input stream. ervletResponse Defines an object to assist a servlet in sending a response to the client. The servlet container creates a ServletResponse object and passes it as an argument to the servlet's service method.
Ans .
C
object.captureEvents (eventTypes); It causes the window or document to capture all events of the specified type.
Ans .
C
To create an anchor HTML link that points to another place on the same webpage, you need to create two anchors: 1. First you create an anchor link that the person clicks on initially. Here is the HTML code for the anchor link. Jump to any place 2. Next, you need to create a named anchor in the spot that you are going to jump to. This anchor will require the following syntax. Jump to this place
Ans .
B
total memory requirements is 1024 * 1024 *8 bits. to convert it to byte we need to divide by 8 then to kb we need to divide by 1024 and then to mega byte again need to divide by 1024, resulting in 1 value. so the result is 1 Megabyte.
Ans .
C
DES uses a 56-bit key, meaning that there are 2^56 possible keys under which a message can be encrypted. This is exactly 72,057,594,037,927,936, or approximately 72 quadrillion possible keys. AES comes with three standard key sizes (128, 192 and 256 bits). Many people see this and think that if there are three distinct sizes instead of just one, then there must be some difference, and since the 256-bit version is a bit slower than the 128-bit version (by about 40%), it must be "more secure". So they go for "the most secure" and choose 256-bit keys RSA is one of the first practicable public-key cryptosystems and is widely used for secure data transmission.RSA stands for Ron Rivest, Adi Shamir and Leonard Adleman, who first publicly described the algorithm in 1977. SHA stands for "secure hash algorithm". The four SHA algorithms are structured differently and are named SHA-0, SHA-1, SHA-2, and SHA-3.SHA-1 produces a message digest based on principles similar to those used by Ronald L. Rivest of MIT in the design of the MD4 and MD5 message digest algorithms, but has a more conservative design.
Ans .
A
Hamming distance of a code is the minimum Hamming distance between any two codewords in the code. HammingDist({0000000000,0000011111,1111100000,1110000011,1111111111}) = 5
Ans .
A
An alternate optimal solution is also called as an alternate optima, which is when a linear / integer programming problem has more than one optimal solution. Typically, an optimal solution is a solution to a problem which satisfies the set of constraints of the problem and the objective function which is to maximize or minimize. so it does not require reformulation of the problem in order to obtain a solution
Ans .
B
The maximization problem has to be changed to minimization before the Hungarian method may be applied. This transformation may be done in either of the following two ways: a. by subtracting all the elements from the largest element of the matrix. b. by multiplying the matrix elements by-1
Ans .
C
The initial basic feasible solution of the transportation problem is 80
Ans .
B
E1 is correct and E 2 is not correct.
Ans .
B
Tracing: When, i=1 C=2; b=10; When, i=2 w[2]=4 so, c=c + w[2] c= 2+4= 6 so c= 6 if 6<15 condition gets true so b=10+10=20; c=6; b=20 When, i=3 w[3]=6 so, c=c + w[3] c= 6+6= 12 so c= 12 if 12<15 condition gets true so b=20+12=32; c=12; b=32 When, i=4 w[4]=9 so, c=c + w[4] c= 12+9= 21 so c= 21 if 21<15 condition gets FALSE so b+(1-(c-m)/w[i])*p[i] is 32+(1-(21-15)/9)*18=38 c=21; b=38; Here we got the maximum profit as 38. To obtain this maximum capacity we need to consider the Item 4 first then Item 2 then Item 1 that is 18+10+10 = 38.
Ans .
C
T(n) = 3T(floor (n/4))+ n ~ 3T(n/4)+n Apply Masters theorem n ^ (log 4 3) < n Hence T(n) = T(n) If T(n) = T(n) then T(n) = O(n) If T(n) = T(n) then T(n) = O(n 2 ) answer can be A and C
Ans .
A
If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n = m, the expected number of collisions involving a particular key K is less than 1.
Ans .
B
The subgraph-isomorphism problem is in NP.this can be proved using Clique Theory. Read NP Problems That can be solved using Clique Theory. The set partition problem is also on NP. Let the certificate y be a subset Y of the set S. The verification algorithm A takes the following steps to verify: (1) check if every number in Y is a number in S (2) compute the sum of all numbers in the set Y (3) computer the set S ? Y (4) compute the sum of all numbers in the set S - Y (5) compare the two numbers obtained in (2) and (4) to see it these two numbers are identical. If yes, then return yes.
Ans .
C
The minimum depth occurs for the path that always takes the smaller portion of the split, i.e., the nodes that take a proportion of work from the parent node. The ?rst node in the path(after the root) gets a proportion of work (the size of data processed by this node is an), the second one gets a2 so on. The recursion bottoms out when the size of data becomes 1. Assuming the recursion ends at level m, we have amn = 1 or m = lg(1/n)/lg(?) or m=-lgn/lga the maximum depth is approximately ?lgn/lg(1 ? a).
Ans .
B
Ten signals need 10x3000 =30000 Hz 9 (10-1) Guard bands (or gaps) needs =300x9 =2700 Kz so minimum bandwidth need 30000+2700= 32700Hz ans is B
Ans .
B
Since there are six 1200 bps terminals, therefore 6 x 1200 + n x 300 = 9600.n = 8.
Ans .
D
Options: This is optional field, which is used if the value of IHL is greater than 5. These options may contain values for options such as Security, Record Route, Strict source routing, Loose source routing, Time Stamp etc.
Ans .
A
as the layers 4,5,6,7 are assumed to be present at user's site and layer 1,2,3 are assumed to be present at your service provider's site. so the layers 4,5,6,7 are considered to be host-to-host layers and layers 1,2,3 are considered to be end-to-end layers.
Ans .
C
the given subnet mask's encoded IP address is 11111111111111111111000000000000 12 bits are available for the hostid ==> 2^12 possible hostids. so the maximum number of hosts on this subnet is 2^12 = 4096 hosts.
Ans .
C
since 4 bit numbering is used so maximum possible value in 4 bits is 2^4 - 1 = 15. so the maximum window size is 15.
Ans .
D
In case of G1 for generation of word aab two different parse trees exists. so it is ambiguous. similarly in case of G2.
Ans .
C
1. Chomsky Normal Form. A grammar where every production is either of the form A --> BC or A --> c (where A, B, C are arbitrary variables and c an arbitrary symbol). in the given set option iii suits for Chomsky Normal form 2. A Grammar is in Greibach normal form (GNF) if the right-hand sides of all production rules start with a terminal symbol, optionally followed by some variables. in the given set option iv suits for Greibach Normal form 3. an LL grammar is a formal grammar that can be parsed by an LL parser, which parses the input from Left to right, and constructs a Leftmost derivation of the sentence. in the given set option ii suits for LL grammar. Hence Option C is Chosen.
Ans .
D
L1 we can decompose as anbn |n<100 and anbn|n>100 First part regular ,second part DCFL , so it is obviously CFL L2 needs two comparison n(a)= n(b) again n(b)=n(c) so we can not make a PDA for this so it is CSL but not Context Free D is correct answer here