Latest Posts

Q. The instruction pipeline of a RISC processor has the following stages: Instruction Fetch (IF), Instruction Decode (ID), Operand Fetch (OF), Perform Operation (PO) and Writeback (WB). The IF, ID, OF and WB stages take 1 clock cycle each for every instruction. Consider a sequence of 100 ...

Q. Consider the minterm list form of a Boolean function 𝐹 given below. 𝐹(𝑃, 𝑄, 𝑅, 𝑆) = ∑ 𝑚(0, 2, 5, 7, 9, 11) + 𝑑(3, 8, 10, 12, 14) Here, 𝑚 denotes a minterm and 𝑑 denotes a don’t care term. The number of essential prime implicants of the function 𝐹 is_______. Ans: 3 Sol: Essential ...

Q. Consider the weights and values of items listed below. Note that there is only one unit of each item. Item numberWeight (in Kgs)Value (in Rupees)11060272834204224 The task is to pick a subset of these items such that their total weight is no more than 11 Kgs and their total value is ...

Q. Consider the following undirected graph G: Choose a value for x that will maximize the number of minimum weight spanning trees (MWSTs) of G. The number of MWSTs of G for this value of x is Ans: 4 Sol: To maximize the number of minimum weight spanning trees of G, the value of x ...

Q. The number of possible min-heaps containing each value from {1, 2, 3, 4, 5, 6, 7}exactly once is Ans: 80 Sol: Set minimum element as root (i.e 1), now 6 are remaining and left subtree will have 3 elements, each left subtree combination can be permuted in 2! ways. Total ways to design ...

Q. Consider the following program written in pseudo-code. Assume that x and y are integers. The number of times that the print statement is executed by the call Count(1024,1024) is_______. Ans: 10230

Q. Consider Guwahati (G) and Delhi (D) whose temperatures can be classified as high (𝐻), medium (𝑀) and low (𝐿). Let 𝑃(𝐻𝐺) denote the probability that Guwahati has high temperature. Similarly, 𝑃(𝑀𝐺) and 𝑃(𝐿𝐺) denotes the probability of Guwahati having medium and low temperatures respectively. ...

Q. Let G be a graph with 100! vertices, with each vertex labelled by a distinct permutation of the numbers 1,2, … , 100. There is an edge between vertices 𝑢 and 𝑣 if and only if the label of 𝑢 can be obtained by swapping two adjacent numbers in the label of 𝑣. Let 𝑦 denote the degree of a vertex ...

Q. Consider the following four relational schemas. For each schema, all non-trivial functional dependencies are listed. The underlined attributes are the respective primary keys. Schema I: Registration (rollno, courses) Field ‘courses’ is a set-valued attribute containing the set of courses ...

Q. Consider the relations r(A, B) and s(B, C), where s.B is a primary key and r.B is a foreign key referencing s.B. Consider the query Q:   𝑟 ⋈ (𝜎𝐵<5(𝑠)) Let LOJ denote the natural left outer-join operation. Assume that r and s contain no null values. Which one of the following queries ...