Q. Let πΊ be any connected, weighted, undirected graph. Which of the above two statements is/are TRUE? (A) I only (B) II only (C) Both I and II (D) Neither I nor II Ans: Β Both I and II
Let πΊ be any connected, weighted, undirected graph. Read More Β»
Q. There are n unsorted arrays: A1, A2, β¦, An. Assume that n is odd. Each of A1, A2, β¦, An contains n distinct elements. There are no common elements between any two arrays. The worst-case time complexity of computing the median of the medians of A1, A2, β¦, An is (A) O(n) (B) O(n
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
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, β¦
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
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
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.
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 Β»
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
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
