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:… Read More

Let G be a simple undirected graph. Let TD be a depth first search tree of G. Let TB be a breadth first search tree… Read More

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… Read More

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… Read More

Let N be the set of natural numbers. Consider the following sets, P: Set of Rational numbers (positive and negative) Q: Set of functions from… Read More

The number of possible min-heaps containing each value from {1, 2, 3, 4, 5, 6, 7} exactly once is _______. Note –This was Numerical Type… Read More

Let G be a graph with 100! vertices, with each vertex labelled by a distinct permutation of the numbers 1, 2, …, 100. There is… Read More

Consider the following C program: #include <stdio.h> void fun1(char *s1, char *s2) {   char *temp;   temp = s1;   s1 = s2;   s2 = temp; }… Read More

Consider the minterm list form of a Boolean function F given below. F(P, Q, R, S) = Σm(0, 2, 5, 7, 9, 11) + d(3,… Read More