Express T(n) in terms of the harmonic number Hn = $$\sum\limits_{t = 1}^n {1/i,n \ge 1} $$ where T(n) satisfies the recu

Match the pairs in the following: List - I (a) Straseen's matrix multiplication algorithm (b) Kruskal's minimum spanning

Match the pairs in the following: List - I (a) Heap construction (b) Constructing hash table witn linear probing (c) AVL

Match the following: List - I (a) Lexical Analysis (b) Code Optimization (c) Code Generation (d) Abelian Group L

Match the followings: Group-I (a) Pointer data type (b) Activation Record (c) Repeat -Until (d) Coercion Group-II

A block -set associative cache memory consists of $$128$$ blocks divided into four block sets. The main memory consists

State the Both's algorithm for multiplication of two numbers, Draw a block diagram for the implementation of the Booth's

Fill in the blanks: In the two bit full-adder/sub tractor unit shown in Fig., when the switch is in position $$2.$$ $$

For the synchronous counter shown in fig. write the truth table of $${Q_0},\,\,{Q_1}$$ and $${Q_2}$$ after each pulse st

Two $$NAND$$ gates having open collector outputs are tied together as shown in fig. The logic function $$Y,$$ implemente

Consider the number given by the decimal expression. $${16^3} \times 9 + {16^2} \times 7 + 16 \times 5 + 3$$ The number

Show with the help of a block diagram represent Boolean function: $$f=AB+BC+CA$$ can be realized using only $$4:1$$ mul

Find the minimum product of sums of the following expression $$f = ABC + \overline A \,\overline B \,\overline C .$$

A graph is planar if and only if,

Indicate which of the following well-formed formula are valid:

In a two -level virtual memory, the memory access time for main memory, $${t_M} = {10^{ - 8}}\sec $$ and the memory acce

Match the pairs in the following Question. $$\eqalign{ & \,\,\,\,\,\,\,\,\,\,\,\,\,\,\,List:\,{\rm I} \cr &amp

State whether the following statements are TRUE or FALSE with reason. Transferring data in blocks from the main memory t

Under paged memory management scheme simple lock and key memory protection arrangement may still be required if the $$.

State whether the following statements are TRUE or FALSE with reason. The Link-load -and-go loading scheme required less

State whether the following statement are TRUE or FALSE with reason. The data transfer between memory and $${\rm I}/O$$

A certain moving arm disk-storage device has the following specifications: Number of tracks per surface $$=4004$$ Track

Assuming the current disk cylinder to be $$50$$ and the sequence for the cylinders to be $$1, 36, 49, 65, 53, 1, 2, 3, 2

The highest-response ratio next scheduling policy favours $$.......$$ jobs, but it also limits the waiting time of $$ ..

Semaphore operations are atomic because they are implemented within the OS

Match the pairs in the following: List - I (A) Pointer data type (B) Activation record (C) Repeat-until (D) Coercion Lis

Match the pairs in the following: List - I (A) Small talk (B) LISP (C) Prolog (D) VAL List - II (p) Logic programming (q

It is decidable whether:

Recursive languages are:

Let $${R_1}$$ and $${R_2}$$ be regular sets defined over the alphabet $$\sum \, $$ then:

State whether the following statement is TRUE / FALSE. A minimal $$DFA$$ that is equivalent to an $$NFDA$$ with $$n$$ m

State whether the following statement is TRUE / FALSE. Regularity is preserved under the operation of string reversal.

State whether the following statement is TRUE / FALSE. All subjects of regular sets are regular.

State whether the following statement is TRUE / FALSE. The intersection of two $$CFL's$$ is also $$CFL.$$

State whether the following statement is TRUE / FALSE. A is recursive if both a and its complement are accepted by Turin

State whether the following statement is TRUE / FALSE. The problem is to whether a Turing Machine M accepts input $$w$$