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 »
New record of over 6.77 crore Income Tax Returns (ITRs) filed till 31st July, 2023: The Income-tax Department has witnessed a remarkable surge in the filing of Income Tax Returns (ITRs) for Assessment Year (AY) 2023-24. The department thanks taxpayers and tax professionals for their prompt compliance, which has resulted in a new record of
New record of over 6.77 crore Income Tax Returns (ITRs) filed till 31st July, 2023 Read More »
India’s Manufacturing PMI Eases to 3-Month Low in July Amid Inflationary Pressure: The manufacturing sector in India saw a minor slowdown in July, with the Purchasing Managers’ Index (PMI) dipping to 57.7 from 57.8 in June and 58.7 in May. However, the figure still indicates expansion in the sector. The buoyant demand, both domestic and
India’s Manufacturing PMI Eases to 3-Month Low in July Amid Inflationary Pressure 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
PM conferred Lokmanya Tilak National Award in Pune: The Lokmanya Tilak National Award was presented to India’s Prime Minister, Shri Narendra Modi, during a ceremony commemorating Lokmanya Tilak’s 103rd death anniversary in Pune, Maharashtra. The prestigious award, instituted by the Tilak Smarak Mandir Trust in 1983, aims to honor the lasting legacy of Lokmanya Tilak.
PM conferred Lokmanya Tilak National Award in Pune Read More »
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, …
Consider the first order predicate formula 𝜑 ∀𝑥 [(∀𝑧 𝑧|𝑥 ⇒ ((𝑧 = 𝑥) ∨ (𝑧 = 1))) ⇒ Read More »
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.
