Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged isi2011-pcb-cs
792
views
0
answers
4
votes
ISI2011-PCB-CS-6b
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.
go_editor
792
views
go_editor
asked
Jun 3, 2016
Digital Logic
digital-logic
descriptive
isi2011-pcb-cs
k-map
+
–
1.4k
views
2
answers
9
votes
ISI2011-PCB-CS-6a
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.
go_editor
1.4k
views
go_editor
asked
Jun 3, 2016
CO and Architecture
co-and-architecture
descriptive
isi2011-pcb-cs
machine-instruction
+
–
1.3k
views
2
answers
15
votes
ISI2011-PCB-CS-5c
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.
go_editor
1.3k
views
go_editor
asked
Jun 3, 2016
Operating System
isi2011-pcb-cs
descriptive
operating-system
process-synchronization
normal
+
–
2.2k
views
4
answers
17
votes
ISI2011-PCB-CS-5b
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?
go_editor
2.2k
views
go_editor
asked
Jun 3, 2016
Databases
descriptive
isi2011-pcb-cs
databases
database-normalization
+
–
813
views
2
answers
2
votes
ISI2011-PCB-CS-5a
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))$
go_editor
813
views
go_editor
asked
Jun 3, 2016
Databases
descriptive
isi2011-pcb-cs
databases
relational-algebra
+
–
393
views
0
answers
2
votes
ISI2011-PCB-CS-4c
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.
go_editor
393
views
go_editor
asked
Jun 3, 2016
Theory of Computation
descriptive
isi2011-pcb-cs
regular-expression
+
–
1.1k
views
2
answers
6
votes
ISI2011-PCB-CS-4a
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.
go_editor
1.1k
views
go_editor
asked
Jun 3, 2016
Theory of Computation
descriptive
isi2011-pcb-cs
theory-of-computation
regular-language
+
–
630
views
2
answers
1
votes
ISI2011-PCB-CS-3c
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.
go_editor
630
views
go_editor
asked
Jun 3, 2016
Graph Theory
descriptive
isi2011-pcb-cs
graph-theory
vertex-cover
+
–
634
views
0
answers
2
votes
ISI2011-PCB-CS-3b
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)$.
go_editor
634
views
go_editor
asked
Jun 3, 2016
Graph Theory
descriptive
isi2011-pcb-cs
graph-theory
graph-connectivity
+
–
800
views
4
answers
3
votes
ISI2011-PCB-CS-3a
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}$
go_editor
800
views
go_editor
asked
Jun 3, 2016
Algorithms
descriptive
isi2011-pcb-cs
algorithms
recurrence-relation
+
–
929
views
2
answers
2
votes
ISI2011-PCB-CS-2
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.
go_editor
929
views
go_editor
asked
Jun 3, 2016
Algorithms
descriptive
isi2011-pcb-cs
algorithms
sorting
+
–
854
views
2
answers
3
votes
ISI2011-PCB-CS-1b
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.
go_editor
854
views
go_editor
asked
Jun 3, 2016
Algorithms
isi2011-pcb-cs
descriptive
algorithms
sorting
+
–
478
views
0
answers
1
votes
ISI2011-PCB-CS-1a
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.
go_editor
478
views
go_editor
asked
Jun 3, 2016
Digital Logic
descriptive
isi2011-pcb-cs
number-representation
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register