The technique for using one set of addresses inside a network and remapping those addresses to a different set of addresses that are seen outside the local network on the Internet is called

Consider the relation R(X, Y, Z, W, V) in which X, Y, Z, W, and V are the attributes and the following set of functional dependencies

A = { {X, Y} → {Z, W},  {X, W, V} → {Y, Z}  }

Which of the following is the trivial functional dependency in A+, where A+ is closure of A?

Which of the following statements is/are true?

Which of the following statement is/are True?

A hash table of length(m) 11 uses open addressing and linear probing. After inserting 9 values into an empty hash table, the table is as shown below.

Which one of the following hash function will distribute elements as shown in above hash table. 

An entity EMPLOYEE in an E-R diagram with a single value attribute (Emp_Id) where Emp_Id is a primary key for relation, multi-value attribute(Emp_Phone) as well as composite value attributes(Emp_Name, Emp_Address) as shown in below diagram. A minimum number of tables are required to represent this relational model is/are______?

Consider a cache memory with L lines in which cache is divided into S sets each set is containing K lines. This set associative mapping is reduce to associative mapping when

What all is TRUE about STACK data structure?

Which one is the correct translation of the following statement into mathematical logic?

“None of my friends are perfect.”

Consider the following Relational table has two attributes P and Q, where P is the primary key and Q is the foreign key referencing P with on-delete cascade.

The set of all tables that must be additionally deleted to preserve referential integrity when the table (4, 2) is deleted is

Considering LR(0) SLR, LR and LALR parsing which will have unequal number of states in LR item DFA?

Consider the hashing table with ‘m’ slots and ‘n’ keys. If the expected number of probes in an unsuccessful search is 5, the expected number of probes in successful search is________

(Up to 2 decimals)

If the characteristic roots of $\left[\begin{array}{cc}3& 7\\ 2& 5\end{array}\right]$ are λ₁ and λ₂ the characteristic root of $\left[\begin{array}{cc}5& -7\\ -2& 3\end{array}\right]$ are

Which of the following is/are false about Relational Database Model?

The conditional probability of event A given event B is defined as:

In the demand paging memory, a page table is held in registers. If it takes 1000 ms to service a page fault and if the memory access time is 20 ms, what is the effective access time for a page fault rate of 0.01?

What is the size of the physical address space in a paging system which has a page table containing 64 entries of 11 bit each (including valid/invalid bit) and a page size of 512 bytes?

Which of the following is a Greedy algorithm ?

In a circularly linked list organization, insertion of a record involves the modification of 

If transaction T1 reads a change made by transaction T2, then T1 commits only after T2 commits. This property of a transaction schedule is known as:

Let L₁ ≤_m L₂ denote the language L₁ is mapping reducible (many to one reducible) to language L₂. Which of the following options is/are correct(s)?  

Given the following binary number in 32-bit (single precision) IEEE-754 format:

11000100010101100000000000000000

The decimal value closest to this floating-point number is

Consider a Unix node which maintains 16 direct blocks pointer, 2 single indirect, 4 double indirect and 8 triple indirect block pointers. Disk block size if 8 KB and disk address is 32 bits. The maximum possible size of file is ____ TB (up to 1 decimal places).

What shall be the 2’s complement represented of -24 in a 16 bit computer?

Consider two relations P and Q. Let M is a primary key of relation Q and N is the foreign key of relation P. N refers to M. Let A be a set of all values of column M and B be a set of all non-NULL values of column N. Which of the following statement is correct ? (Suppose A and B holds in all instances of P and Q)

Which of the following are Incorrect about routing algorithms?

Count the number of TRUE statements about Linked Lists.

1. Time complexity of deleting the last node in a Linked List is O(n).
2. Time complexity of adding a new node in the beginning in a Linked List is O(1).
3. Linked Lists store elements in contiguous memory locations.
4. Time complexity of adding a new node after a specific node in a Linked List is O(n).
5. Linked Lists are dynamic in nature because its size can be increased at runtime.
6. Time complexity of deleting a node in the beginning of a Linked List is O(n).
7. Time complexity of deleting a node after a specific node in a Linked List is O(n).
8. Binary search is not preferred on Linked List because the it is done in O(n) time.

Which one of the following is TRUE?

Let us consider a relation A as {1, 2, 3}.

a). Number of reflexive relations on A X A = $2^{(n^2-n)}$

b). Number of symmetric relations on A x A = $2^{\frac{n(n+1)}{2}}$

c). Number of antisymmetric relations on A x A = $2^n\times 3^{\frac{(n^2-n)}{2}}$

Which of the following statement(s) is/are TRUE?

A reference to the instruction cache is implied by each instruction fetch, and 20% of all instructions make use of data memory.

Implementation of the cache is as follows:

L1 data and instruction caches are directly linked to the CPU.
The L1 instruction cache has an average miss rate of 5%.
In the L1 data cache, the average miss rate was 15%.
The missed penalty in both situations is 10 clock cycles.

What is the overall miss penalty in clock cycles?

Consider the following recursive C function that takes two arguments

unsigned int rer (unsigned int n, unsigned int r) {

if (n > 0) return (n%r + rer (n/r, r));

else return 0;

}

What is the return value of the function rer when it is called as rer (513, 2)?

Consider 10 KBPS IO device interfaced to 32–bit CPU in cycle stealing mode of DMA. Whenever 16 word data is available in the buffer, it is transferred to main memory. Machine cycle time is 100 micro seconds . How much % of CPU time is consumed in this operation?

Consider the following statements:

S₁ : ∀x P(x) ∨ ∀xQ(x) and ∀x(P(x) ∨ Q(x)) are not logically equivalent.

S₂ : ∃x P(x) ∧ ∃x Q(x) and ∃x (P(x) ∧ Q(x)) are not logically equivalent

Which of the following statements is/are correct?     

Consider two relational tables:

Employee:  

Company : 

Where Emp_id in company relation references to Emp_id in Employee relation.

How many numbers of rows are possible in output of the below query? 

(SELECT *FROM Employee E, Company C where E.Emp_id < > C.Emp_id and E.Emp_id % C.Emp_id) intersect (SELECT *FROM Employee E Left outer join Company C on E.Emp_id % C.Emp_id OR E.Emp_name = ‘Mahesh’ OR C. Company_name = ‘HP’ or ‘Apple’)

Consider a pipelined processor operating at 2 GHZ with 5 stages, Instruction fetch (IF), Instruction decode (ID), Execute (EX), Memory access (MEM), and write back (WB). Each stage of the pipeline, except the EX stage, takes one cycle. The EX takes one cycle for ADD and SUB, three cycles for MUL, two cycles for DIV Instruction.

Consider the following instructions:

l₁ : ADD R₁, R₂, R₃ ;           R₁ ← R₂ + R₃

l₂ : SUB R₃, R2, R1 ;          R3 ← R2 - R1

I₃ : MUL R₄, R₁, R₂ ;           R4 ← R5 * R2

l4 : DIV R₃, R₄, R₃ ;                      R3 ← R4 / R₃ 

Find, the number of true data dependences in the above code and the execution time using operand forwarding technique respectively is______.

Consider the following 6 concurrent processes where the semaphore is initialized to zero.
A: down(s); cs; up (s);
B: down(s); cs; up (s);
C: down (s); cs; up(s);
D: up(s); cs; down(s);
E: up(s); cs; down(s);
F: up(s); cs;down(s);
What is the maximum value of s?

Let A, B, C, and D be boolean variables. Choose the correct options that is/are not equivalent to the boolean expression given below.

$ABC+\overline{\left(\overline{A}+C\right)\left(\overline{A}+B+D\right)}+BC\left(\overline{A}C+A+\overline{C}\right)+AB\overline{C}$

In a J-K flip flop, when J = 1 and K = 1 then it will be considered as:

Which of the following grammer is/are Context free grammer?

Consider 4 matrices Q, R, S and T with dimensions 13 × 12, 12 × 30, 30 × 15 and 15 × 18 respectively. What is the least number of scalar multiplications needed to find the product QRST using the basic matrix multiplication method?

Consider a Turing machine M given below that accepts the language.

L = {bⁿaⁿ⁺¹ |n ≥ 1}

B in ‘M’ represents Blank symbol.

What will be the missing part/transition for P and Q respectively in the given Turing machine? 

What will be the time complexity for the following recurrence relation?
T(n)=8T(n^1/2)+(log n)² if n>2
= 1,Otherwise

[A] is a square matrix which is neither symmetric nor skew-symmetric and [A]T is its transpose. The sum and difference of these matrices are defined as [S] = [A] + [A]T and [D] = [A] - [A]T, respectively. Which of the following statements is true?

To derive the string length 4, How many minimum productions are required for Chomsky normal form ?

Find the value of X + Y - Z ?

Suppose that the rotating disk head is moving with 200 tracks numbered from 0 to 199 and is currently serving a request at track 65. Disk queue requests are as follows: 93, 173, 132, 20, 35, 150, 100, 175 and 55.Which of the following statements satisfies these requests for the SSTF (Shortest Seek Time First) algorithm?

A router uses the following routing table:

A packet bearing an estimation address 144.16.68.117 arrives at the router. On which interface will it be forwarded?

Consider the following 3-address code given below.

1.   i = 1

2.   if <= goto 4

3.   goto 9

4.   r₁ = a * b

5.   r₂ = r₁ + c

6.   x = r₂

7.   j = j + 1

8.   goto 2

9.   k = k * 2

The number of nodes in the control flow graph (a), Number of edges in the control flow graph (b), Number of basic blocks in the control flow graph (c), and Number of the basic control blocks in the control flow graph (d). So find "dcba". (Hint: suppose a = 1, b = 2, c = 3 and d = 4 so answer will be 4321)

Which of the following statements is/are true?

Match the following for the given control flow graph.

Basic Block                                                      IN and OUT

(P)  B₀                                                               (i)   {a + b}, {φ}

(Q) B₁                                                               (ii)  {φ}, {a + b}

(R) B₂                                                               (iii) {a + b}, {a + b}

(S)  B₃

(T)  B₄

Consider cache memory having hit ratios for read and write operations as 60% and 80% respectively. Cache access time is 40ns. Main memory access time is 400 ns. When there is a miss in cache memory, then 4–word block is copied from main memory to cache. CPU generates 60% read requests and 40% write requests. What is the bandwidth (million words/second) using write through cache?

Read the following statements about 0/1 Knapsack problem.

Note:

Where n is the number of items and W is the weight of the Knapsack .

Which of the following statements are true?

Box A contains 2 black and 3 red balls while box B contains 3 black and 4 red balls. Out of these two boxes one is selected at random and the probability of choosing box A is double that of box B. If a red ball is drawn from the selected box, then the probability that it has come from box B is

The truth table of AB flip flop is given below:

If JK flip flop is converted into AB flip flop then what are the values of J and K respectively in terms of A, B, and Q_n?

For the given IP address: 150.32.4.1/22, which of the following cannot be valid host IDs on the LAN interface attached to the router?