Register holds both data and instruction temporarily within the CPU .
Note that Accumulator holds only data and not the instruction.

C++ supports multiple inheritance whereas java does not.

A tree does not contain a cycle. A tree with n vertices contains n-1 edges. And every tree is a graph.

A. Minimal spanning tree is a greedy algorithm.
B. Binary Search algorithm is a divide and conquer strategy.
C. Depth first search algorithm is a backtracking method.
D. Optimization is a NLP method.

1 is false because unambiguous grammar need not have the same leftmost and rightmost derivation.
4 is false because the correct statement is an ambiguous grammar can never be LR(K) for any k.

paging does not suffers from external fragmentation because space allocated to a process need not be contiguous. But paging suffers from internal fragmentation because on an average half of the last page of process gets wasted.

Redundancy in the resulting set of relations decomposed BCNF is zero.

Both the end user and the application layer interact with the software applications.

External sorting is a term for a class of sorting algorithms that can handle massive amounts of data. External sorting is required when the data being sorted do not fit into the main memory of a computing device (usually RAM) and instead they must reside in the slower external memory (usually a hard drive). External sorting typically uses a hybrid sort-merge strategy. In the sorting phase, chunks of data small enough to fit in main memory are read, sorted, and written out to a temporary file. In the merge phase, the sorted sub-files are combined into a single larger file.

Blowfish,IDEA,AES all are private key or symmetric key encryption algorithms.

Disk ,Tape ,ROM are all permanent storage memory.

All of the above statements are the characteristics of RISC processor.

BFS uses Queue data structure. DFS uses Stack data structure.

0/1-knapsack problem is a dynamic programming paradigm.

Type checking is normally done during syntax-directed translation.

System call is a mechanism used by a program to request service from OS.

There is no common attribute in the R1 and R2. So the given decomposition is not lossless join. But they are dependency preserving because A → B is covered by R1 and C → D is covered by R2.

Registers results in fastest access.

Interrupt-driven I/O is a type of I/O transfer that relies completely on both software and hardware.

Stack data structure is used to implement recursion.

Eight-queens problems can be solved by all the three methods of brute force method, backtracking method,breadth first search method. But the Backtracking method is the best.

Linker does not need absolute address of internal symbol because absolute address is calculated by loader and not linker. Linker needs relocatable addresses to calculate another relocatable addresses.

No sharing of resources

All of the above are examples of transaction systems.

10BASE2 uses thin coaxial cable while 10BASE5 uses thick cable.

In the context of the operating system ,a privileged instruction can only be executed by the kernel on behalf of the requesting process .

A wait-for graph in computer science is a directed graph used for deadlock detection in operating systems and relational database systems. ... The wait-for-graph scheme is not applicable to a resource allocation system with multiple instances of each resource type

1,2 and 4 is a solution to critical section problem.
But access matrix is not the solution to crtical section problem ,instead it is a security model of protection state in computer system. It is represented as a matrix. Access matrix is used to define the rights of each process executing in the domain with respect to each object. The rows of matrix represent domains and columns represent objects. Each cell of matrix represents set of access rights which are given to the processes of domain means each entry(i, j) defines the set of operations that a process executing in domain Di can invoke on object Oj.

Logic programming is a computer programming paradigm in which program statements express facts and rules about problems within a system of formal logic

Algorithms + Data Structures = Programs is a 1976 book written by Niklaus Wirth covering some of the fundamental topics of computer programming, particularly that algorithms and data structures are inherently related. For example, if one has a sorted list one will use a search algorithm optimal for sorted lists.

The device operating at highest speed should be given the highest priority. So among the given devices hard disk operates at the highest speed and should get the highest priority..

Indirect addressing is used for pointers.
Immediate addressing is used for constants.
Auto Decrement addressing is used for loops.

Now by traversing the tree we get the infix expression as, (a+b)*c

The standard recursive approach for Sudoku (pick a cell, enumerate all values, and recurse) is a great example of backtracking, which is the paradigm that best describes this algorithm.

Heap allocation is required for language that supports dynamic data structure.
Stack allocation is required for language that supports recursion.

If your system has to swap pages with a higher rate that major chunk of CPU time is spent in swapping then this state is known as thrashing. So effectively during thrashing, the CPU spends less time in some actual productive work and more time in swapping.

The major advantage of the B+ tree (and B-trees in general) over binary search trees is that they play well with caches. If you have a binary search tree whose nodes are stored in more or less random order in memory, then each time you follow a pointer, the machine will have to pull in a new block of memory into the processor cache, which is dramatically slower than accessing memory already in cache.
The B+-tree and the B-tree work by having each node store a huge number of keys or values and have a large number of children. They are typically packed together in a way that makes it possible for a single node to fit nicely into cache (or, if stored on disk, to be pulled from the disk in a single read operation). You then have to do more work to find a key within the node or determine which child to read next, but because all memory accesses done on a single node can be done without going back to disk, the access times are very small. This means that even though in principle a BST might be better in terms of number of memory accesses, the B+-tree and the B-tree can perform better in terms of the runtime of those memory accesses.

The major advantage of the B+ tree (and B-trees in general) over binary search trees is that they play well with caches. If you have a binary search tree whose nodes are stored in more or less random order in memory, then each time you follow a pointer, the machine will have to pull in a new block of memory into the processor cache, which is dramatically slower than accessing memory already in cache.
The B+-tree and the B-tree work by having each node store a huge number of keys or values and have a large number of children. They are typically packed together in a way that makes it possible for a single node to fit nicely into cache (or, if stored on disk, to be pulled from the disk in a single read operation). You then have to do more work to find a key within the node or determine which child to read next, but because all memory accesses done on a single node can be done without going back to disk, the access times are very small. This means that even though in principle a BST might be better in terms of number of memory accesses, the B+-tree and the B-tree can perform better in terms of the runtime of those memory accesses.

Early Ethernet implementations, up to and including 10Base-T, all used the Manchestor encoding.

All of the given models are models of software development life cycles.

Auxiliary storage is any storage that is made available to the system through input/output channels. This term refers to any addressable storage that is not within the system memory (RAM). These storage devices hold data and programs for future use and are considered nonvolatile storage that retains information even when power is not available. They trade slower read/write rates for increased storage capacity.
Auxiliary storage may also be referred to as secondary storage.
So all the given options are auxiliary memory.

Seek time is directly proportional to the no. of cylinders crossed.
Hence 4 is the correct option.

Relocation is the process of assigning load addresses for position-dependent code and data of a program and adjusting the code and data to reflect the assigned addresses.

= Hit ratio * cache access time + miss ration * (cache access time + memory access time)
= 0.8 * 5ns + 0.2(5+100)
= 4+ 21
= 25NS

The protocol achieves its goal even in many cases of temporary system failure (involving either process, network node, communication, etc. failures), and is thus widely used

All of the given options are the application of network layer of OSI model.Many more applications of network layer includes switching,fragmentation,etc.

Mount mechanisms allow the binding together of different file namespaces to form a single hierarchical namespace. The Unix operating system uses this mechanism. A special entry, known as a mount point, is created at some position in the local file namespace that is bound to the root of another file name space. From the users point of view a mount point is indistinguishable from a local directory entry and may be traversed using standard path names once mounted. File access is therefore location transparent for the user but not for the system administrator. The kernel maintains a structure called a mount table which maps mount points to appropriate file systems. Whenever a file access path crosses a mount point, this is intercepted by the kernel, which then obtains the required service from the remote server.

Monitor is a solution for critical section problems.
A monitor is a synchronization construct that allows threads to have both mutual exclusion and the ability to wait (block) for a certain condition to become false. Monitors also have a mechanism for signaling other threads that their condition has been met

Confidentiality-No other person can look into the information.Only for whom it is intended can look into it.
Integrity-No one can change the information. Authentication-It guarantees the identity of the sender. Non-repudiation-Nonrepudiation refers to the ability to ensure that a party to a contract or a communication cannot deny the authenticity of their signature on a document or the sending of a message that they originated. To repudiate means to deny.
Hence all are the security requirement.

In computer science jargon , kilo means 2^10 or 1024.

True, unless the interrupt is enabled,even if there will be an interrupt ,the CPU will not be able to process interrupts.
False ,because loop may contain more than one instruction.And the rule is that single instruction cannot be interrupted till they complete.
False, because a processor checks for the interrupts before fetching new instructions.
False.even edge triggered interrupts are possible.

Stack and queue are linear data structure, but tree is a non linear data structure.

Greedy method,Divide and conquer , Dynamic programming are the designing paradigm but functional programming is not any designing paradigms.

Functional programming languages are specially designed to handle symbolic computation and list processing applications. Functional programming is based on mathematical functions. Some of the popular functional programming languages include: Lisp, Python, Erlang, Haskell, Clojure,APL,, etc.

Operating System allocates the resources to the processes which requires it.

SQL is used to communicate with a database. According to ANSI (American National Standards Institute), it is the standard language for relational database management systems. SQL statements are used to perform tasks such as update data on a database, or retrieve data from a database.

In any 2-Dimensional plane if we connect two points (x0, y0) and (x1, y1), we get a line segment. But in the case of computer graphics we can not directly join any two coordinate points, for that we should calculate intermediate points coordinate and put a pixel for each intermediate point, of the desired color with help of functions like putpixel(x, y, K) in C, where (x,y) is our co-ordinate and K denotes some color. For using graphics functions, our system output screen is treated as a coordinate system where the coordinate of the top-left corner is (0, 0) and as we move down our y-ordinate increases and as we move right our x-ordinate increases for any point (x, y).
Now, for generating any line segment we need intermediate points and for calculating them we have many algorithms like DDA ,Bresenham's< midpoint algorithm.

The RSA algorithm is named after Ron Rivest, Adi Shamir and Len Adleman, who invented it in 1977. The RSA algorithm can be used for both public key encryption and digital signatures. Its security is based on the difficulty of factoring large integers.

The speed of early printers was measured in units of characters per minute (cpm) for character printers, or lines per minute (lpm) for line printers. Modern printers are measured in pages per minute (ppm).

A friend function of a class is defined outside that class' scope but it has the right to access all private and protected members of the class.

The maximum depth that a tree of N nodes can have is N,when the tree is skewed.

do-while loop in C is always executed at least once, because in this control structure first the loop is executed and then condition is checked ,which is not the case in for loop or while loop.

Top down parser uses leftmost derivation while parsing an input, while bottom-up parser uses reverse of rightmost derivation while parsing an input.

3NF normal form is considered adequate for normal relational database design. A relational database table is often described as “normalized” if it is in the Third Normal Form because most of the 3NF tables are free of insertion, update, and deletion anomalies

Remote Procedure Call (RPC) is a protocol that one program can use to request a service from a program located in another computer on a network without having to understand the network's details. A procedure call is also sometimes known as a function call or a subroutine call. RPC uses the client-server model.

The idea was introduced in the late 1940s by John von Neumann, who proposed that a program be electronically stored in binary-number format in a memory device so that instructions could be modified by the computer as determined by intermediate computational result

The DMA is most probably used when the performance of a system is to be increased.

since the value of x is 3 so case 3 will be executed and then break will make the execution to get out of the loop and C will be in the variable ‘c’.

worst case time complexity of mergesort is O(nlogn).

O-notation is less than or equal to.
Θ-notation is equal to.
Ω-notation is greater than or equal to.

Full form of BNF is Backus Naur Form ,which is a notation technique for context-free grammars .So clearly option 2 is the correct answer.

The output of a lexical analyzer is a stream of token which is given as input to syntax analyzer.

Multiprogramming means the ability to put aor place more than one process in the main memory.

We can't just simply say that Relational algebra has the same power as relational calculus,because relational calculus has some unsafe state . So the correct statement will be Relational algebra has the same power as safe relational calculus.

is false.The correct statement will be the transport layer accepts the message from session layer and passes it to the network layer.

Full form of DES is Data Encryption Standard.

A processor needs software interrupt to Obtain system services which need execution of the privileged instructions

In quick sort whether the inputs are in descending order or ascending order, it will have the worst case comparisons and will be equal no. of comparisons.

The time complexity is said to be exponential when it is of the form (k^N) ,where k is some constant. Hence option 2 is the correct answer.

If two finite state machines are equivalent then they will accept the same language .They miht have different no. of states or edges.

An operating system (OS) is system software that manages computer hardware, software resources, and provides common services for computer programs

B-tree is a form of secondary index.
Domain calculus is a non-procedural query language or declarative language.
Functional dependency is related to closure of set of attributes.
Natural join is relational algebraic operations.

The main purpose of encryption is to provide data confidentiality or data security.

3 is false because a message encrypted with the private key can be decrypted only with the corresponding public key in asymmetric key cryptography but in symmetric key cryptography a message encrypted with the private key can be decrypted only with the same private key.