Search Previous Year Questions

Interrupt generated by memory parity error does not belong to program – related interrupt category.

Explanation:

Memory parity errors are due to hardware failure or external elements. It means that one or more stored data values carries a different value when it’s recalled than when it was stored. Parity errors are caused by data corruption. Parity errors can bring back invalid commands for the computer.

Cardinality ratio:

It is a concept that describes binary relationship set and its types. (Binary relationship is that which connects two entities). Number of relationship instances in which the entity can participate is defined as cardinality ratio.

Four type of cardinality ratio can be possible:

1. One to one

2. One to many  

3. Many to one         

4. Many to many

Cardinality ratio is about the maximum number of entities of one entity set that are associated with the maximum number of entities of other set.

Participation: It specifies the minimum number of relationship instances that an entity can participate in.

Partial participation specifies that each entity in the entity set may or may not participate in the relationship instance. It is also called as optional participation.

Completion order in case of FCFS: P3 P2 P1

Completion order in case of round- robin: P3 P1 P2

Concept:

Secure shell protocol is a method for secure remote login from one computer to another. It provides the communication security and integrity with strong encryption.

Explanation:

It is a secure alternative to non – protected login protocols and insecure file transfer methods. It is a cryptographic network protocol. It provides a secure client/server communication and can be used for secure transfer of files and e-mails also.

So, given statement 2) SSH cannot be used for file transfer and e-mail tasks is false.

CLR is an asynchronous input pin.

If CLR = 1, all flip flop outputs become 0.

\(\overline {CLR} = 0\) 

As output of NAND gate is to CLR which is negative triggered i.e.

\(\overline {CLR = CB} \)  

A is not as input here,

\(\overline {CLR} = \overline {CB\bar A} \) 

i.e. \(CLR = CB\bar A\)

in term of binary representation, it is CLR = 110

i.e. counter will count from 0 to 5 and at 6^th clock flip flop output will be cleared.

So, it is a MOD – 6 counter.

Average time to read or write n bits in a non – random access memory is :

T_n = T_a + n/r

where,

T_n = Average time to read or write n bits

T_a = average access time

n = number of bits

r = transfer rate in bits per second

Language over the set A = {a, b} consisting of all words beginning with one or more a’s and followed by the same number of b’s is number of a’s equal to number of b’s beginning with a.

Consider all the options one by one:

Option 1:   L = {a^mb^m :m > 0}

It represents the required language. Number of a’s are equal to number of b’s where language always begins with a.

Option 2:  L = {a, ab, ab², …}

In this, number of a’s are not equal to number of b’s

Option 3:  L = {a^m bⁿ: m > 0, n > 0}

It also represents a language in which we have no relation between number of a and number of b.

Option 4:  L = {b^mabⁿ : m ≥ 0, n ≥ 0}

This language is starting with b which is not required. So, it is incorrect.

Option 1: This statement is correct.

A sine wave with a phase of 180° starts at time 0 with zero amplitude and amplitude is decreasing. Sin wave is the most fundamental form of periodic analog signal.

Option 2: This statement is false.

Frequency is the rate of change with respect to time. Change in a short span of time means high frequency.

Option 3:  This statement is true. Bipolar encoding is a type of return – to – zero line code where two non-zero values are used. Three voltage levels are: positive, negative and zero.

Option 4: This statement is false.

Infrared signals can be used for short – range communication in a closed area using line of sight propagation.

Radix sort algorithm performs digit to digit sort starting from least significant digit to most significant digit.

In radix sort algorithm, if we consider an array

We have to find the (a[i]/divisor) % 10.

If we have to get individual digit of each number n of the list and n is a positive decimal integer.

Then i^th digit from right of the number n is:

\(\left\lfloor {\frac{n}{{{{10}^{i - 1}}}}} \right\rfloor % 10\) 

Suppose we have the number 542. Then we have to find the 3^rd digit from the right end is :

\(\left\lfloor {\frac{{542}}{{{{10}^{3 - 1}}}}} \right\rfloor % 10\)  = 5

Concept:

NP complete problem is a class of computational problems for which no efficient solution algorithm has been found. No polynomial time algorithm is there for NP complete problem.

NP complete problem examples:

Travelling salesman problem, Hamiltonian cycle problem, clique problem, Subset set problem, CNF – Satisfiability problem.