Recent questions tagged isi2011-pcb-cs

792
views
0 answers
4 votes
For the function given by the Karnaugh map shown below, you can change at most one $1$ or one $0$ entry to a DON'T CARE. Determine ... simplest two-level AND-OR realization. Assume both uncomplemented and complemented inputs are available.
1.4k
views
2 answers
9 votes
Assume a machine has $4$ registers (one of which is the accumulator $A$) and the following instruction set.$\text{LOAD}$ and $\text{STORE}$ are indirect ... each of the above instructions (along with operands) to be encoded in $8$ bits.
1.3k
views
2 answers
15 votes
One of your classmates has suggested the following modified version of a standard scheme for solving the $2$-process critical section problem (CSP).shared char want[2 ... scheme so that it becomes a correct solution to the $2$-process CSP.
2.2k
views
4 answers
17 votes
Suppose we have a relation $R(A, B, C, D, E)$ with the functional dependencies:$A \rightarrow D, B \rightarrow C, D \rightarrow E, CE \rightarrow B$.If ... functional dependencies onto the schema $ABC$, what will the key(s) for $ABC$ be?
813
views
2 answers
2 votes
Consider relations $R(A, B)$ and $S(B, C)$. Find a propositional formula $\phi$ ... bowtie S))$R \cap ({\rho_T(A)}(\pi_C(S)) \times \pi_B(S))$
393
views
0 answers
2 votes
Recall that a typical URL has the following form. It starts with a protocol specifier, followed by a colon (:) and two forward slashes (/), followed by a ... a host / domain / file / directory name, write a regular expression for URLs.
1.1k
views
2 answers
6 votes
Let $L$ be the set of strings over $\{0, 1\}$ containing an unequal number of $0$s and $1$s. Prove that$L$ is not regular.$L^2$ is regular.
630
views
2 answers
1 votes
A vertex cover of a graph $G = (V, E)$ is a set of vertices $V' \subseteq V$ such that for any edge $(u, v) \in E$, either $u$ ... a linear time algorithm to find the minimum vertex cover of a given tree $T$. Establish its correctness.
634
views
0 answers
2 votes
Let $T = (V, E)$ be a tree, and let $v \in V$ be any vertex of $T$.The $\text{eccentricity}$ of $v$ is the maximum distance from $v$ to any other vertex in $T$ ... .e. $C \cap \mathcal{C} = \not{O}$ and $|C| = |\mathcal{C}| = 2)$.
800
views
4 answers
3 votes
Solve the following recurrence ($n$ is a natural number):$T(n) = \begin{cases} 7T(n\div3)+n^2 & ;n>2 \\ 1 & ;n \leq 2. \end{cases}$
929
views
2 answers
2 votes
You are given $k$ sorted lists, each containing $m$ integers in ascending order. Assume that (i) the lists are stored as singly-linked lists with one ... storage?Analyse the time complexity of your algorithm for each of the above two cases.
854
views
2 answers
3 votes
There are $n$ students of a class standing in a line. The students have to arrange themselves in ascending order on the basis of their roll numbers. This ... an expression for the number of swaps needed by your algorithm in the worst case.
478
views
0 answers
1 votes
The function $divby3$ given below is intended to check whether a given number is divisible by 3. It assumes that the argument $(number)$ is a string ... number of ALU operations used by your function, the more marks you will get.
To see more, click for the full list of questions or popular tags.