August 2023

Consider the following grammar and the semantic actions to support the inherited type declaration attributes. Let 𝑋1, 𝑋2, 𝑋3, 𝑋4, 𝑋5, and 𝑋6 be the placeholders

Consider the following grammar and the semantic actions to support the inherited type declaration attributes. Let 𝑋1, 𝑋2, 𝑋3, 𝑋4, 𝑋5, and 𝑋6 be the placeholders

Q. Consider the following grammar and the semantic actions to support the inherited type declaration attributes. Let 𝑋1, 𝑋2, 𝑋3, 𝑋4, 𝑋5, and 𝑋6 be the placeholders for the non- terminals D, T, L or L1 in the following table: Production rule Semantic action D β†’ T L 𝑋1.type = 𝑋2.type T β†’ int T.type

Consider the following grammar and the semantic actions to support the inherited type declaration attributes. Let 𝑋1, 𝑋2, 𝑋3, 𝑋4, 𝑋5, and 𝑋6 be the placeholders Read More Β»

Consider the first order predicate formula πœ‘ βˆ€π‘₯ [(βˆ€π‘§ 𝑧|π‘₯ β‡’ ((𝑧 = π‘₯) ∨ (𝑧 = 1))) β‡’

Consider the first order predicate formula πœ‘ βˆ€π‘₯ [(βˆ€π‘§ 𝑧|π‘₯ β‡’ ((𝑧 = π‘₯) ∨ (𝑧 = 1))) β‡’

Q. Consider the first order predicate formula πœ‘: βˆ€π‘₯ [(βˆ€π‘§ 𝑧|π‘₯ β‡’ ((𝑧 = π‘₯) ∨ (𝑧 = 1))) β‡’ βˆƒπ‘€ (𝑀 > π‘₯) 𝖠 (βˆ€π‘§ 𝑧|𝑀 β‡’ ((𝑀 = 𝑧) ∨ (𝑧 = 1)))] Here β€˜π‘Ž|𝑏’ denotes that β€˜π‘Ž divides 𝑏’, where π‘Ž and 𝑏 are integers. Consider the following sets: S1.Β Β Β Β Β Β  {1,2,3, …

Consider the first order predicate formula πœ‘ βˆ€π‘₯ [(βˆ€π‘§ 𝑧|π‘₯ β‡’ ((𝑧 = π‘₯) ∨ (𝑧 = 1))) β‡’ Read More Β»

Consider the following sets. Set of all recursively enumerable languages over the alphabet {0,1}

Consider the following sets. Set of all recursively enumerable languages over the alphabet {0,1}

Q. Consider the following sets: S1.       Set of all recursively enumerable languages over the alphabet {0,1} S2.Β Β Β Β Β Β  Set of all syntactically valid C programs S3.Β Β Β Β Β Β Β Β Set of all languages over the alphabet {0,1} S4.       Set of all non-regular languages over the alphabet {0,1} Which of the above sets are uncountable? (A) S1 and S2 (B) S3

Consider the following sets. Set of all recursively enumerable languages over the alphabet {0,1} Read More Β»

Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long

Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long

Q. Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word addressible. The page size is 8 kB and the word size is 4 bytes. The Translation Look-aside Buffer (TLB) in the address translation path has 128 valid entries. At

Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long Read More Β»

Let the set of functional dependencies F = {QR β†’ S, R β†’ P, S β†’ Q} hold on a relation schema X = (PQRS).

Let the set of functional dependencies F = {QR β†’ S, R β†’ P, S β†’ Q} hold on a relation schema X = (PQRS). X is not in BCNF. Suppose X is decomposed into two schemas Y and Z

Q. Let the set of functional dependencies F = {QR β†’ S, R β†’ P, S β†’ Q} hold on a relation schema X = (PQRS). X is not in BCNF. Suppose X is decomposed into two schemas Y and Z, where Y = (PR) and Z = (QRS). Consider the two statements given below.

Let the set of functional dependencies F = {QR β†’ S, R β†’ P, S β†’ Q} hold on a relation schema X = (PQRS). X is not in BCNF. Suppose X is decomposed into two schemas Y and Z Read More Β»

Which one of the following languages over Ξ£ = {π‘Ž, 𝑏} is NOT context-free?

Which one of the following languages over Ξ£ = {π‘Ž, 𝑏} is NOT context-free?

Q. Which one of the following languages over Ξ£ = {π‘Ž, 𝑏} is NOT context-free? (A) {𝑀𝑀𝑅 |𝑀 ∈ {π‘Ž, 𝑏}βˆ—} (B) {π‘€π‘Žπ‘›π‘π‘›π‘€π‘… |𝑀 ∈ {π‘Ž, 𝑏}βˆ—, 𝑛 β‰₯ 0} (C) {π‘€π‘Žπ‘›π‘€π‘…π‘π‘› |𝑀 ∈ {π‘Ž, 𝑏}βˆ—, 𝑛 β‰₯ 0} (D) {π‘Žπ‘›π‘π‘– | 𝑖 ∈ {𝑛, 3𝑛, 5𝑛}, 𝑛 β‰₯ 0} Ans: {wanwRbn ⏐ w ∈ {a,

Which one of the following languages over Ξ£ = {π‘Ž, 𝑏} is NOT context-free? Read More Β»

Suppose that in an IP-over-Ethernet network, a machine X wishes to find the MAC address of another machine Y in its subnet. Which one of the following techniques can be used for this?

Suppose that in an IP-over-Ethernet network, a machine X wishes to find the MAC address of another machine Y in its subnet. Which one of the following techniques can be used for this?

Q. Suppose that in an IP-over-Ethernet network, a machine X wishes to find the MAC address of another machine Y in its subnet. Which one of the following techniques can be used for this? A. X sends an ARP request packet to the local gateway’s IP address which then finds the MAC address of Y

Suppose that in an IP-over-Ethernet network, a machine X wishes to find the MAC address of another machine Y in its subnet. Which one of the following techniques can be used for this? Read More Β»

Consider three machines M, N, and P with IP addresses 100.10.5.2, 100.10.5.5, and 100.10.5.6 respectively.

Consider three machines M, N, and P with IP addresses 100.10.5.2, 100.10.5.5, and 100.10.5.6 respectively.

Q. Consider three machines M, N, and P with IP addresses 100.10.5.2, 100.10.5.5, and 100.10.5.6 respectively. The subnet mask is set to 255.255.255.252 for all the three machines. Which one of the following is true? (A) M, N, and P all belong to the same subnet (B) Only M and N belong to the same

Consider three machines M, N, and P with IP addresses 100.10.5.2, 100.10.5.5, and 100.10.5.6 respectively. Read More Β»

Scroll to Top