Dark Mode

Recent questions tagged isi2014-pcb-cs

2 votes

0 answers

1

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. Each data packet is $256$ bits long, including $32$ bits of header. The token is of $8$ bits. What is the effective data rate of the network assuming the stations always have packets to transmit?

go_editor asked in Computer Networks May 31, 2016

689 views

1 vote

1 answer

2

ISI2014-PCB-CS-7a
Consider a uniprocessor system with four processes having the following arrival and burst times: ... $2$ units each. In this case, what will be the turnaround time of $P1$? Justify your answer

go_editor asked in Operating System May 31, 2016

645 views

1 vote

2 answers

3

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 distinct shortest paths exist between two routers $R(i_1, j_1)$ ... how many of these distinct shortest paths will be node disjoint, i.e., with no common node except the source and the destination? Justify your answer.

go_editor asked in Computer Networks May 31, 2016

740 views

2 votes

0 answers

4

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 system maintains a $B+$ tree index ... two queries will be preferred by the query optimizer for minimum cost of execution. The cost of query execution is primarily dependent on the number of disk accesses.

go_editor asked in Databases May 31, 2016

581 views

1 vote

2 answers

5

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 not found in the cache, $100$ clock cycles are needed to get it from off-chip ... $20 \%$ of the total execution time, respectively. Calculate the overall speed-up of $P$ when it is executed on the new machine.

go_editor asked in CO and Architecture May 31, 2016

710 views

8 votes

5 answers

6

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? Justify your answer.

go_editor asked in Theory of Computation May 31, 2016

1.9k views

16 votes

2 answers

7

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$ is in the language because it contains one instance of $10$ and one instance of $01$ as well.

go_editor asked in Theory of Computation May 31, 2016

1.9k views

1 vote

1 answer

8

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$.

go_editor asked in Algorithms May 31, 2016

687 views

1 vote

1 answer

9

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 the median of $C$ as efficiently as you can.

go_editor asked in Algorithms May 31, 2016

716 views

14 votes

2 answers

10

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 to merge $H_1$ and $H_2$ to a new max-heap $H$ of size $2n$.

go_editor asked in DS May 31, 2016

1.6k views

2 votes

1 answer

11

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 tree in Figure 1, the sibling pairs are (2, 3) and (6, 7). Design an $O(n)$ time algorithm that prints all the sibling pairs of $B$.

go_editor asked in DS May 31, 2016

528 views

1 vote

1 answer

12

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 breaking along the lines between the squares. We obviously want to do it with the minimum ... m as inputs and print the line numbers along the length and the breadth according to your strategy of breaking the chocolate.

go_editor asked in Algorithms May 31, 2016

588 views

To see more, click for the full list of questions or popular tags.

Recent questions tagged isi2014-pcb-cs