MOV instruction copies the data from one location to other
MVI B, 82H / Copy value 82H to register B
MOV A, B / Copy value of B (82H) to accumulator A
MOV C, A / Copy value of accumulator A (82H) to register C
MVI D, 37H / Copy value 37H to register D
OUT PORT1 /Copy value of accumulator A (82H) to PORT 1 (because still accumulator A is having 82H)

DI(Disable Interrupt): DI allows the microprocessor to reject the interrupt. In DI the interrupts are disabled immediately and no flags are affected.
SIM(Set Instruction Mask): It uses flags to disable the interrupts. Here “1” indicated that the interrupt is masked and “0” indicates the the instruction is not masked.

→ In one second, device is sending - 4800 characters to DMA
→ 1 character = 8 bits
→ So in one second, device is sending - (4800⨯8) bits to DMA
→ In one cycle, DMA sends - 32 bits.
→ To send (4800 ⨯ 8) bits DMA needs = (4800⨯8)/30 cycles = 1200 cycles
→ Now in one second CPU executes 10⁶ instructions.
→ But because of cycle stealing, CPU has slow down and the % by which CPU gets slow down can be calculated as
= 1200/10⁶ * 100
= 12/10000 * 100
=0.12%

CPU after completing the execution of a instruction checks the status of interrupt if there is a interrupt then CPU executes the interrupt service routine to service it else CPU stats executing next instruction.

Excluded for evaluation

Forward Chaining: Forward chaining starts with the available data and uses inference rules to extract more data until a conclusion is reached.
It is also known as data driven inference technique.
It is bottom up reasoning.
It is a breadth first search.
For Example: “If it is raining then i will bring the umbrella”. Here “it is raining” is a available data from which more data is extracted and a conclusion “i will bring the umbrella” is drived.
Backward Chaining: Backward chaining is an inference method described colloquially as working backward from the goal.
It is also known as goal driven inference technique.
Here we starts from a goal and apply inference rules to get some data.
It is top down reasoning.
It is a depth first search.
For Example: “If it is raining then i will bring the umbrella”. Here our conclusion is “i will bring the umbrella”. Now If I am bringing an umbrella then it can be stated that it is raining that is why I am bringing the umbrella. So here “ It is raining” is the data obtained from goal . Hence it was derived in a backward direction so it is the process of backward chaining.

→ Dynamic programming language is a class of high-level programming languages which, at runtime, execute many common programming behaviors that static programming languages perform during compilation. These behaviors could include extension of the program, by adding new code, by extending objects and definitions, or by modifying the type system.
→ Ada is a structured, statically typed, imperative, and object-oriented high-level computer programming language, extended from Pascal and other languages.
→ Prolog is a logic programming language associated with artificial intelligence and computational linguistics. Prolog is intended primarily as a declarative programming language: the program logic is expressed in terms of relations, represented as facts and rules.
→ Python is dynamically typed and garbage-collected. It supports multiple programming paradigms, including procedural, object-oriented, and functional programming

Socket address: A socket address is used to uniquely identify a process on a host.
Example: There can be multiple hosts that are communicating to a server. So to identify each host uniquely IP address is required. Now there could be multiple processes executing on a host machine So to identify each process uniquely on a host Port number is used.
So to identify a process on a host combination of an IP address and a port number is used and this combination is termed as Socket Address.
Socket Address is a 48-bit address which includes 32 -bit IP address and 16-bit Port address.

1 minute - 1500 frames
60 seconds - 1500 frames
1 second - 1500/60 frames
1 second = 25 frames
Now each frame is of 8,000 bits.
So total bits in 1 second = 25 × 80 bits
= 25×8000/1000000 Mbps
= 200/100 Mbps
= 2 Mbps

For example, consider a subnet with 720 routers. If there is no hierarchy, each router needs 720 routing table entries.
If the subnet is partitioned into 24 regions of 30 routers each, each router needs 30 local entries plus 23 remote entries for a total of 53 entries.
If a three-level hierarchy is chosen, with eight clusters, each containing 9 regions of 10 routers, each router needs 10 entries for local routers, 8 entries for routing to other regions within its own cluster, and 7 entries for distant clusters, for a total of 25 entries.

In a classful addressing, the IP addresses with 0 (zero) as network number refers to the default IP of a host when it has no IP. When a host don’t have any IP then it sends a RARP request by having 0.0.0.0 as source IP.
NOTE: So none of the options is correct but according to UGC official answer keys the correct answer is given as option(A)

SMTP(Simple Mail Transfer Protocol) is used to send mail containing text, voice, video, to MTA of destination.
MIME(Multimedia Internet Mail Extension) is not a mail protocol. It is used to send mails containing ASCII and Non-ASCII files.
It is an extension of SMTP but not a mail protocol.
POP3(Post Office Protocol) is a client server architecture used to download message from MTA to workstation for offline use.
IMAP(Internet Message Access Protocol) is a client server architecture used to check messages without downloading from MTA.

Explanation: 1 character ------- 8-bits
1,00,000 character ---------- 8,00,000 bits
2000 bits--------- 1 second
1 bit ---------- 1/2000 seconds
8,00,000 bits ---------(1/2000)* 8,00,000
= 400 seconds

Each activity a_i has a start time s_i and a finish time f_i where 0 ≤ s_i < f_i < ∞. If selected, activity a_i takes place during the half-open time interval [ s_i , f_i ]. Activities a_i and a_j are compatible if the intervals [ s_i , f_i ] and [ s_j , f_j ] do not overlap. That is, a_i and a_j are compatible if s_i ≥ f_j or s_j ≥ f_i. In the activity-selection problem, we wish to select a maximum-size subset of mutually compatible activities.

The radix sort running time depends on the stable sort used as the intermediate sorting algorithm. When each digit is in the range 0 to k-1(It takes k possible values), and ‘k’ is not too large, counting sort is the obvious choice. Each pass over n d-digits numbers then takes time O(n+k). There are ‘d’ passes, and so total time for radix sort is O(d (n + k))

Assume T(n) = O(1) for small n≤80.
T(n) ≤ T(n/5)+T((7n/10)+6)+O(n)
Inductively verify that T(n)≤cn for some constant c.
T(n) ≤ c(n/5)+c(7n/10+6)+O(n)
≤ 9cn/10+6c+O(n)
≤ cn
In above, choose c so that c((n/10)−6) beats the function O(n) for all n.
Note: They given ‘s’ instead 5.

Floyd-Warshall algorithm utilizes Dynamic Programming to solve the all-pairs shortest paths problem on a directed graph in θ(V³) time, where “V” is the number of vertices.

The above problem is nothing but Optimal Binary Search Tree(OBST). The OBST we are using the recurrence relation is
Initially, we have w(i,j)=q(i), c(i,j)=0 and r(i,i)=0, 0 ≤ i ≤ 4. The observations are w(i,j)=p(j)+q(j)+w(i,j-1), we get
w(0,1) = p(1) + q(1) + w(0,0) = 8
c(0,1) = w(0,1) + min{c(0,0) + c(1,1)} = 8
r(0,1) = 1
w(1,2) = p(2) + q(2) + w(1,1) = 7
c(1,2) = w(1,2) + min{c(1,1) + c(2,2)} = 7
r(0,2) = 2
w(2,3) = p(3) + q(3) + w(2,2) = 3
c(2,3) = w(2,3) + min{c(2,2) + c(3,3)} = 3
r(2,3) = 3
w(3,4) = p(4) + q(4) + w(3,3) = 3
c(3,4) = w(3,4) + min{c(3,3) + c(4,4)} = 3
r(3,4) = 4 knowing w(i, i+1) and c(i, i+1), 0 ≤ i < 4 and to compute recurrence relation of OBST and compute w(i, i+2), c(i,i+2) and r(i,i+2), 0 ≤ i < 3. This process can repeated until w(0,4), c(0,4) and r(0,4) are obtained.

Context sensitive languages are closed under union, intersection, complement, concatenation, kleene star, ϵ-free Homomorphism, substitution( ϵ-free), inverse homomorphism, reverse, intersection with regular language.
Hence the correct option is (C)

{aⁿ bⁿ|n > 0} is a deterministic context free language but not regular because the given language requires a storing device and finite state machine does not contain any storing device. {aⁿ bⁿ|n > 0} can be accepted by a pushdown automata by pushing all the a’s on top of stack and when b’s come as input pop one “a” for each “b”.
The given language {aⁿ bⁿ a^{n. | n > 0} is a context sensitive language because for this language if we push a’s on top of stack and for every “b” we will pop a single “a” from top of stack and when after “b” again “a” will come as input then that time stack will be empty and we can’t compare number of a’s that come after “”b”. But we can have a linear bounded automata that can accept the given language by moving the read/write head accordingly.
Since the given language is CSL and CSL are closed under complement so given language can not be accepted by a deterministic pushdown automation {an bn an} is context sensitive language but not context free language, the logic is the same as above. SInce for given language can’t be accepted by pushdown automata, so it is not a context free language.}

Performance: Performance refers to the response of the system while performing a certain actions in certain period of time. A software can perform better only if it have well structured,easy to maintain architecture.
Reliability: Reliability refers to the ability of a software to continue to operate in the presence of a predefined condition. A software can be reliable if it’s architecture is good enough to work well in inappropriate situations.
Usability: Usability refers to the ease in using the software. The usability is not related to the architecture of the software no matter how complex or simple the software architecture is but the main thing is should be easy to use by the user.
Portability: It refers to the ability to port the software to different platforms or systems. The architecture of a software should be in a way that it can be used at different platforms.
Other than usability all given attributes are somewhere affected by the architecture of the software.

Option(a) is not correct because S → XYX, Y → bbb it means the regular expression for given grammar will contain "bbb" in between.
Option(B) is incorrect because "bbbb(a+b)* can also be generated by given grammar.
Option (C) is correct because S → XYX X → aX|bX|λ Y → bbb , here "bbb" will be in middle and X → aX|bX|λ can generate (a+b)* and since S → XYX is having "X" before and after "Y" so it is correct.
Option (D) is not correct because X → aX|bX|λ can generate (a+b)^* and since S → XYX is having "X" before and after "Y" so we can have (a+b)* before and after "bbb"

L1 is CFL because we can push all a's first on the top of stack when a "b" come as input change the state and don't push "b" on stack now when "a" comes after "b" then for each "a" pop one "a" from top of stack.
L2 is not CFL because we can push all a's first on the top of stack when a "b" come as input change the state and don't push "b" on stack now when "a" comes after "b" then for each "a" pop one "a" from top of stack. . Bur for "b" that comes in last we don't have "a" to compare them. So it is not CFL language.

Abstract class may consist of at least one abstract method.
Abstract method means method without body, we can also be called as pure virtual functions.

Polymorphism: Polymorphism means many forms. It is used to perform similar operations to do similar things.
Inheritance: It is the process of creating new classes(derived class) from existing classes( base class) by inheriting their properties into derived class.
Encapsulation:It is the process of Picking both operator and attributes with operations appropriate to model an object
Abstraction: Abstraction refers to the process of Hiding implementation details of methods from users of objects

Critical review committee(CRC) should have:
(a)one or two users representatives
(b)project coordinators
(c)one or two system analysts
In a CRC team there is no need of a programmer. Hence Option(C) is the correct answer.

Ponits, lines and polygon lines are the basic building blocks of computer graphics

→ Java programming language whereas Javascript is script language.
→ Java can used to create the application independently.
→ JavaScript is used along with HTML mainly meant for validation.

Option(A): XML uses DTD to define the structure of an XML document. It defines the structure with a list of legal elements. Hence statement (a) is correct.
Option(B): XSLT (eXtensible Stylesheet Language Transformations) is the recommended style sheet language for XML.XSLT is far more sophisticated than CSS. With XSLT you can add/remove elements and attributes to or from the output file. You can also rearrange and sort elements, perform tests and make decisions about which elements to hide and display, and a lot more. XSLT uses XPath to find information in an XML document.
Hence here XML is not using XSL to describe the data. So statement (b) is wrong.
Option(C): Everything in an XML document is a node:
The entire document is a document node
Every XML element is an element node
The text in the XML elements are text nodes
Every attribute is an attribute node
Comments are comment nodes
Hence statement (c) is correct.

Statement (a) is true.
An abstract class may or may not have abstract methods so that it may provide the complete and default code.

Working set is used to provide frames according to the dynamically changing requirements of a process in the main memory. Here pages are stored in the main memory on demand i.e.only when a page is required for execution of a process it is allocated a frame into main memory.
Segmentation supports the user view of memory because it divides a process into segments in such a way that the meaning of the code does not change after dividing it.
Dynamic partitioning helps in eliminating the internal fragmentation by providing the partitions dynamically but using this method of partitioning external fragmentation can’t be avoided. So compaction is a method used to overcome the external fragmentation problem in dynamic partitioning.
Using fixed partitioning we can store a process in fixed partitions of main memory. By doing this only the pages required for the successful execution of a process are bring into memory and this way instead of storing only a single process in main memory, multiple processes can be stored now. Hence degree of multiprogramming increases.

Memory management unit is used for converting the logical address into the physical address. It does not allocate memory or it is not responsible for the cache management. It’s task is to compare the logical address with the limit if it is less than the limit, it adds the logical address to the base value and provides the physical address.

Special files: Special files in UNIX operating system are used for I/O devices. In the file system they appear like an ordinary file or a directory. Special files are used to store information about the I/O devices.

Boot block contains the code for making OS ready.
Super block contains information about file.
Inode contains information about file system.
Data block contains info regarding data storage.

Indivisibility of operation refers to the irreducibility of an operation i.e either an operation will be executed completely or it will not be executed.
So we can say that indivisibility of operation means Processor can not be preempted because a non-pre-empted operation is the one which is either not executed but if its execution starts then it can’t be interrupted until it executes completely.

A Horn clause is a clause(a disjunction of literals) with at most one positive literal.
Any Horn clause therefore belongs to one of four categories:
A rule: 1 positive literal, at least 1 negative literal.
A fact or unit: 1 positive literal, 0 negative literals.
A negated goal : 0 positive literals, at least 1 negative literal.
The null clause: 0 positive and 0 negative literals.

Modus ponens rule / Rule of detachment: According to Modus ponens rule given P and P → Q, we can infer Q

Expert systems: are designed to solve complex problems by reasoning through bodies of knowledge, represented mainly as if–then rules rather than through conventional procedural code.
So we can say that expert systems are used for problem reduction.
For problem reduction an expert system can use forward or backward chaining.
Forward Chaining: Forward chaining starts with the available data and uses inference rules to extract more data until a conclusion is reached.
It is also known as data driven inference technique.
It is bottom up reasoning.
It is a breadth first search.
Backward Chaining: Backward chaining is an inference method described colloquially as working backward from the goal.
It is also known as goal driven inference technique.
Here we starts from a goal and apply inference rules to get some data.
It is top down reasoning.
It is a depth first search.

LISP is functional language. A functional language:
Uses declarative programming model.
Focus is on “ what you are doing”
Supports parallel programming.
It’s functions have no side effects.
Supports both "Abstraction over Data" and "Abstraction over Behavior".

Purchasing method to acquire computer systems for a Management Information System (MIS) is just a business investment. Purchasing a line will not yield a better flexibility .
Purchasing method requires cash up-front and it does not have risk of obsolescence.
Hence option(C) is the correct answer.

JPEG( Joint Photographic Experts Group) is a commonly used method of lossy compression for digital images, particularly for those images produced by digital photography. The degree of compression can be adjusted, allowing a selectable tradeoff between storage size and image quality. JPEG typically achieves 10:1 compression with little perceptible loss in image quality
MPEG (Moving Picture Experts Group): It is a method of lossy compression for coding audio-visual information (e.g., movies, video, music).
Arithmetic coding is a form of entropy encoding used in lossless data compression. Normally, a string of characters such as the words "hello there" is represented using a fixed number of bits per character, as in the ASCII code. When a string is converted to arithmetic encoding, frequently used characters will be stored with fewer bits and not-so-frequently occurring characters will be stored with more bits, resulting in fewer bits used in total.

Blind deconvolution: a deconvolution technique that permits recovery of the target scene from a single or set of "blurred" images in the presence of a poorly determined or unknown point spread function (PSF). Any blurred image can be given as input to blind deconvolution algorithm, it can deblur the image.

Feasible Solution: The set of values of decision variables X_j (j = 1, 2, ... n) which satisfy all the constraints and non-negativity conditions of a linear programming problem simultaneously is said to constitute the feasible solution to that problem.
Basic Solution: For a set of m simultaneous equations in n variables (n > m), a solution obtained by setting (n – m) variables equal to zero and solving for remaining m variables is called a “basic feasible solution”.
Basic Feasible Solution: A feasible solution to LP problem which is also the basic solution is called the “basic feasible solution”. Basic feasible solutions are of two types;
(a) Degenerate: A basic feasible solution is called degenerate if value of at least one basic variable is zero.
(b) Non-degenerate: A basic feasible solution is called ‘non-degenerate’ if all values of m basic variables are non-zero and positive.
Hence the correct option is option(A)

The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies:
→The solution must be feasible, i.e. it must satisfy all the supply and demand constraints.
→The number of positive allocations must be equal to m+n-1, where m is the number of rows and n is the number of columns.
→All the positive allocations must be in independent positions.

Current Windows versions and all back to Windows XP and prior Windows NT (3.x, 4.0) are shipped with system libraries which support string encoding of two types: 16-bit "Unicode" (UTF-16 since Windows 2000) and a (sometimes multibyte) encoding called the "code page" (or incorrectly referred to as ANSI code page).
Hence option (c) is the correct answer.

chmod→ chmod is the command and system call which is used to change the access permissions of file system objects (files and directories). It is also used to change special mode flags. The request is filtered by the umask. The name is an abbreviation of change mode.
ugo → user,group and others
a→ all permissions
+ → defaultly will take all permissions
R,W,X→ Read(R), Write(W) and Execute(X)

rm → It removes the file in a directory.
\ → It will remove matches with escape sequences in between files [chap0, chap1, chap2, chap3]
According to given command, Option-A is the appropriate answer.

object-oriented approach to databases have:
(a)The ability to develop more realistic models of the real world.
(b)The ability to represent the world in a non-geometric way.
(c)The ability to develop databases using natural language approaches.

Attribute "one" can have values:
1,2,3,4,5,6,7,8,9,10
Attribute "two" can have values:
1,2,3,4,5
Since "one" is given as the primary key so it can't have duplicates or null value. And "two" is given as unique key so it also can't have null or duplicate values.
So the number of rows in table will depend on the attribute having minimum number of values i.e "two" here. So the number of rows in table "test" are 5.

→ In this case query (a) will return 10 rows, query (b) will return 7 rows and query (c) will return 17 rows because of “or” condition given in it.
Case II: When result of queries (a) & (b) have the same row.
→ This case result in minimum no. of rows possible for given table.

→ In this case maximum 10 rows will be resulted.
Option (C) is most suitable, because 10 is minimum no. of rows possible so option (A) & (B) can’t be correct choice.
And maximum no. of rows possible is 17 so option (D) is also not correct choice.
Hence answer is option (C).

A distributed system is a system whose components are located on different networked computers, which communicate and coordinate their actions by passing messages to one another. The components interact with one another in order to achieve a common goal.
Since the components are located on different networked computers so we can say that the hardware are loosely coupled and since they are communicating and coordinating their actions then we can say that software are tightly coupled and the communication is taking place via message passing.
Hence option(C) is the correct answer.

Natural join of table R & S results into

For such questions,
➜ You should perform multiplication and addition operation between each class matrix and given equations in options.
➜ Option which divides the class into two regions i.e., (+ve & -ve) regions is the correct answer.
Class C1:

Option(D) is incorrect because In black box testing, the test cases are decided from the specifications or the requirements.
White box testing is concerned about the Internal functionality of the module are tested that is why it tests the code.

Option(A) is correct because “Requirement verification and validation” is one of the activities in the requirements phase.
Option(B) is correct because we can make a prototype model of a software based upon the customer's basic requirements then the initially developed model can be improved until all customer requirements get fulfilled.
Option(C) is incorrect because “Modelling-oriented approach” is not one of the methods for specifying the functional specifications
Option(D) is correct because “Function points” is one of the most commonly used size metric for requirements.

If n=0
A=ε
If n=1
A=1
If n=2
A=011
If n=3
A=0111
If n=4
A=001111
So, A={ε,1,011,0111,001111,...}
Hence, options-(C) is not an example of a string in (A)