Register

Recent questions tagged isi2014-pcb-cs

2 2 votes
0 0 answers
1.1k
1.1k views
ISI2014-PCB-CS-7b
A heavily loaded $1$ km long, $10$ Mbps token ring network has a propagation speed of $200$ meter per micro-second. Fifty stations are uniformly spaced around the ring. E...
User Avatar
1 1 vote
1 1 answer
1.1k
1.1k views
ISI2014-PCB-CS-7a
Consider a uniprocessor system with four processes having the following arrival and burst times:$$\begin{array}{|c|c|c|l|} \hline&\text{Arrival Time}&\text{CPU Burst Time...
User Avatar
1 1 vote
2 2 answers
1.1k
1.1k views
ISI2014-PCB-CS-6b
In a LAN, $n^2$ routers are connected in an $n \times n$ mesh such that $R(i, j)$ represents a router in the $i$-th row and $j$-th column of the mesh.Find how many distin...
User Avatar
2 2 votes
0 0 answers
828
828 views
ISI2014-PCB-CS-6a
Two queries equivalent to each other are specified for a relation $R(A, B, C, D, E, F)$. The queries are:$\pi_{A,B,C}(\sigma B>500(R))$$\sigma B>500(\pi_{A,B,C}(R))$The s...
User Avatar
1 1 vote
2 2 answers
1.2k
1.2k views
ISI2014-PCB-CS-5
The average memory access time for a microprocessor with first level cache is $3$ clock cycles.If data is present in the cache, it is found in $1$ clock cycle.If data is ...
User Avatar
9 9 votes
5 answers 5 answers
3.6k
3.6k views
ISI2014-PCB-CS-4b
Consider the following statement:$\text{ For all languages }L \subseteq \{0, 1\}^*, \text{ if }L^* \text{ is regular then L is regular.}$Is the above statement true? Just...
User Avatar
19 19 votes
2 answers 2 answers
3.4k
3.4k views
ISI2014-PCB-CS-4a
Construct a deterministic finite automaton accepting the following language: $\{w \in \{0, 1\}^*: w \text{ has an equal number of 01’s and 10’s }\}$. For example, $101$ i...
User Avatar
1 1 vote
1 1 answer
1.1k
1.1k views
ISI2014-PCB-CS-3b
Let $G = (V, E)$ be an undirected weighted graph with all edge weights being positive. Design an efficient algorithm to find the maximum spanning tree of $G$.
User Avatar
1 1 vote
1 1 answer
1.0k
1.0k views
ISI2014-PCB-CS-3a
Let $A$ and $B$ be two arrays, each containing $n$ distinct integers. Each of them is sorted in increasing order. Let $C = A \cup B$. Design an algorithm for computing t...
User Avatar
14 14 votes
2 answers 2 answers
2.5k
2.5k views
ISI2014-PCB-CS-2b
Let $H_1$ and $H_2$ be two complete binary trees that are heaps as well. Assume $H_1$ and $H_2$ are max-heaps, each of size $n$. Design and analyze an efficient algorithm...
User Avatar
3 3 votes
3 3 answers
962
962 views
ISI2014-PCB-CS-2a
Let $B$ be a rooted binary tree of $n$ nodes. Two nodes of $B$ are said to be a sibling pair if they are the children of the same parent. For example, given the binary tr...
User Avatar
1 1 vote
1 1 answer
934
934 views
ISI2014-PCB-CS-1
Assume you have a chocolate bar containing a number of small identical squares arranged in a rectangular pattern. Our job is to split the bar into small squares by breaki...
User Avatar
To see more, click for the full list of questions or popular tags.