Recent questions tagged descriptive

0 votes

0 answers

1351

Kurose and Ross Edition 6 Exercise 1 Question R14 (Page No 68)
Why will two ISPs at the same level of the hierarchy often peer with each other? How does an IXP earn money?

Why will two ISPs at the same level of the hierarchy often peer with eachother? How does an IXP earn money?

316 views

ajaysoni1924 asked Apr 9, 2019

0 votes

0 answers

1352

Kurose and Ross Edition 6 Exercise 1 Question R12 (Page No 68)
What advantage does a circuit-switched network have over a packet-switched network? What advantages does TDM have over FDM in a circuit-switched network?

What advantage does a circuit-switched network have over a packet-switched network? What advantages does TDM have over FDM in a circuit-switched network?

399 views

ajaysoni1924 asked Apr 9, 2019

0 votes

1 answer

1353

Kurose and Ross Edition 6 Exercise 1 Question R11 (Page No 68)
Suppose there is exactly one packet switch between a sending host and a receiving host. The transmission rates between the sending host and the switch and between the switch and the receiving host are R1 and R2, respectively. ... -to-end delay to send a packet of length L? (Ignore queuing, propagation delay, and processing delay.)

Suppose there is exactly one packet switch between a sending host and a receiving host. The transmission rates between the sending host and the switch and between the swi...

444 views

ajaysoni1924 asked Apr 9, 2019

0 votes

1 answer

1354

ISI2017-PCB-CS-8-b
Consider a simple code $\mathcal{C}$ for error detection and correction. Each codeword in $\mathcal{C}$ consists of $2$ data bits $[d_1, d_0]$ followed by check bits $[c_2, c_1, c_0]$ ... . Write down all the codewords for $\mathcal{C}$ Determine the minimum Hamming distance between any two distinct codewords of $\mathcal{C}$

Consider a simple code $\mathcal{C}$ for error detection and correction. Each codeword in $\mathcal{C}$ consists of $2$ data bits $[d_1, d_0]$ followed by check bits $[c_...

775 views

akash.dinkar12 asked Apr 8, 2019

1 votes

1 answer

1355

ISI2017-PCB-CS-7-b
Define a Boolean function $F(X_1, X_2, X_3, X_4, X_5, X_6)$ of six variables such that $\\ \begin{array}{llll} F & = & 1, & \text{when three or more input variables are at logic 1} \\ { } & = & 0, & \text{otherwise} \end{array} $ How many essential prime implicants does $F$ have? Justify they are essential.

Define a Boolean function $F(X_1, X_2, X_3, X_4, X_5, X_6)$ of six variables such that$\\ \begin{array}{llll} F & = & 1, & \text{when three or more input variables are a...

642 views

akash.dinkar12 asked Apr 8, 2019

1 votes

1 answer

1356

ISI2017-PCB-CS-5(b)
Consider a paging system with the page table stored in memory. If a memory reference takes $200$ nanoseconds, how long does a paged memory reference take? If we add a Translation Lookaside Buffer (TLB) and $75$ percent of all page-table references are ... memory reference time? Assume that finding a page-table entry in the TLB takes $20$ nanoseconds, if the entry is present.

Consider a paging system with the page table stored in memory. If a memory reference takes $200$ nanoseconds, how long does a paged memory reference take? If we add a Tra...

8.4k views

akash.dinkar12 asked Apr 8, 2019

0 votes

0 answers

1357

ISI2017-PCB-CS-3-b
Consider the following relations: $\text{STD_CHOICES } (\underline{\text{Student_ID}}, \underline{\text{Course_ID}}, \text{Semester})$ and $\text{COURSE_ASSIGN} (\underline{\text{Teacher_ID}}, \underline{\text{Course_ID}}, \underline{\text{Semester}})$. The ... the ID for all the students who have not been taught by the same teacher in more than one course across all semesters.

Consider the following relations:$\text{STD_CHOICES } (\underline{\text{Student_ID}}, \underline{\text{Course_ID}}, \text{Semester})$ and$\text{COURSE_ASSIGN} (\underline...

766 views

akash.dinkar12 asked Apr 8, 2019

1 votes

1 answer

1358

ISI2017-PCB-CS-2(b)
Write a $C$ program to fins all permutations of a string (having at most 6 characters). For example, a string of $3$ characters like $“abc"$ has 6 possible permutations: $“abc", “acb", “bca", “bac", “cab", “cba".$

Write a $C$ program to fins all permutations of a string (having at most 6 characters). For example, a string of $3$ characters like $“abc"$ has 6 possible permutations...

506 views

akash.dinkar12 asked Apr 8, 2019

1 votes

1 answer

1359

ISI2017-PCB-CS-1(b)
Show that if the edge set of the graph $G(V,E)$ with $n$ nodes can be partitioned into $2$ trees, then there is at least one vertex of degree less than $4$ in $G$.

Show that if the edge set of the graph $G(V,E)$ with $n$ nodes can be partitioned into $2$ trees, then there is at least one vertex of degree less than $4$ in $G$.

888 views

akash.dinkar12 asked Apr 8, 2019

0 votes

0 answers

1360

Cormen Edition 3 Exercise 22.1 Question 8 (Page No. 593)
Suppose that instead of a linked list, each array entry $adj[u]$ is a hash table containing the vertices $v$ for which $(u,v) \in E$. If all edge lookups are equally likely, what is the expected ... alternate data structure for each edge list that solves these problems. Does your alternative have disadvantages compared to the hash table ?

Suppose that instead of a linked list, each array entry $adj[u]$ is a hash table containing the vertices $v$ for which $(u,v) \in E$. If all edge lookups are equally like...

252 views

akash.dinkar12 asked Apr 7, 2019

0 votes

0 answers

1361

Cormen Edition 3 Exercise 22.1 Question 6 (Page No. 593)
Most graph algorithms that take an adjacency-matrix representation as input require time $\Omega(V^2)$,but there are some exceptions. Show how to determine whether a directed graph $G$ contains a universal link $-$ a vertex with in-degree $|V-1|$ and out-degree $0$ in time $O(V)$ , given an adjacency matrix for $G$.

Most graph algorithms that take an adjacency-matrix representation as input require time $\Omega(V^2)$,but there are some exceptions. Show how to determine whether a dire...

267 views

akash.dinkar12 asked Apr 7, 2019

0 votes

0 answers

1362

Cormen Edition 3 Exercise 22.1 Question 5 (Page No. 593)
The square of a directed graph $G=(V,E)$ is the graph $G^2=(V,E^2)$ such that $(u,v) \in E^2$ if and only $G$ contains a path with at most two edges between $u$ and $v$ .Describe efficient algorithms for computing $G^2$ and $G$ for both the adjacency list and adjacency-matrix representations of G. Analyze the running times of your algorithms.

The square of a directed graph $G=(V,E)$ is the graph $G^2=(V,E^2)$ such that $(u,v) \in E^2$ if and only $G$ contains a path with at most two edges between $u$ and $v$ ....

288 views

akash.dinkar12 asked Apr 7, 2019

0 votes

1 answer

1363

Cormen Edition 3 Exercise 22.1 Question 4 (Page No. 593)
Given an adjacency-list representation of a multi graph $G=(V,E)$, describe an $O(V+E)$ time algorithm to compute the adjacency-list representation of the equivalent undirected graph $G'=(V,E')$ , where $E'$ is ... the edges in $E$ with all multiple edges between two vertices replaced by a single edge and with all self-loops removed.

Given an adjacency-list representation of a multi graph $G=(V,E)$, describe an $O(V+E)$ time algorithm to compute the adjacency-list representation of the “equivalent�...

1.1k views

akash.dinkar12 asked Apr 7, 2019

1 votes

1 answer

1364

Cormen Edition 3 Exercise 22.1 Question 3 (Page No. 592)
The transpose of a directed graph $G=(V,E)$ is the graph $G^T=(V,E^T)$, where $E^T=\{(v,u) \in V * V :(u,v) \in E \ \}$ .Thus ,$G^T$ is $G$ with all its edges reversed . Describe ... algorithms for computing $G^T$ from $G$,for both the adjacency list and adjacency matrix representations of $G$. Analyze the running times of your algorithms.

The transpose of a directed graph $G=(V,E)$ is the graph $G^T=(V,E^T)$, where $E^T=\{(v,u) \in V * V :(u,v) \in E \ \}$ .Thus ,$G^T$ is $G$ with all its edges reversed . ...

4.4k views

akash.dinkar12 asked Apr 7, 2019

0 votes

1 answer

1365

Cormen Edition 3 Exercise 22.1 Question 2 (Page No. 592)
Give an adjacency-list representation for a complete binary tree on $7$ vertices. Give an equivalent adjacency-matrix representation. Assume that vertices are numbered from $1\ to\ 7$ as in a binary heap.

Give an adjacency-list representation for a complete binary tree on $7$ vertices. Give an equivalent adjacency-matrix representation. Assume that vertices are numbered fr...

1.2k views

akash.dinkar12 asked Apr 7, 2019

0 votes

1 answer

1366

Cormen Edition 3 Exercise 22.1 Question 1 (Page No. 592)
Given an adjacency-list representation of a directed graph, how long does it take to compute the out-degree of every vertex ? How long does it take to compute the in-degrees ?

Given an adjacency-list representation of a directed graph, how long does it take to compute the out-degree of every vertex ? How long does it take to compute the in-degr...

361 views

akash.dinkar12 asked Apr 7, 2019

0 votes

0 answers

1367

Morris Mano Edition 3 Exercise 9 Question 1 (Page No. 392)
Explain the difference between synchronous and asynchronous sequential circuits. Define fundamental mode operation. Explain the difference between stable and unstable states. what is the difference between an internal state or a total state?

Explain the difference between synchronous and asynchronous sequential circuits.Define fundamental mode operation.Explain the difference between stable and unstable state...

418 views

ajaysoni1924 asked Apr 7, 2019

0 votes

0 answers

1368

Ullman (TOC) Edition 3 Exercise 6.2 Question 8 (Page No. 242)
A $PDA$ is called restricted if on any transition it can increase the height of the stack by at most one symbol.That is for any rule $\delta(q,a,Z)$ contains $(p,\gamma),$ it must be that $|\gamma|\leq 2.$ Show that if $P$ is a $PDA,$then there is a restricted $PDA$ $P_{3},$such that $L(P)=L(P_{3}).$

A $PDA$ is called restricted if on any transition it can increase the height of the stack by at most one symbol.That is for any rule $\delta(q,a,Z)$ contains $(p,\gamma),...

552 views

admin asked Apr 6, 2019

0 votes

0 answers

1369

Ullman (TOC) Edition 3 Exercise 6.2 Question 7 (Page No. 242)
How that if $P$ is a $PDA,$ then there is a $PDA$ $P_{2}$ with only two stack symbols such that $L(P_{2}=L(P).$ Hint$:$ Binary-code the stack alphabet of $P$

How that if $P$ is a $PDA,$ then there is a $PDA$ $P_{2}$ with only two stack symbols such that $L(P_{2}=L(P).$ Hint$:$ Binary-code the stack alphabet of $P$

162 views

admin asked Apr 6, 2019

1 votes

0 answers

1370

Ullman (TOC) Edition 3 Exercise 6.2 Question 6 (Page No. 242)
Suppose th $PDA, $ $P=(\{q,p\},\{0,1\},\{Z_{0},X\},\delta,q,Z_{0}.\{p\})$ has the following transition function$:$ $\delta(q,0,Z_{0})=\{(q,XZ_{0})\}$ $\delta(q,0,X)=\{(q,XX)\}$ $\delta(q,1,X)=\{(q,X)\}$ ... $PDA$ $P_{2}$ such that $L(P_{2})=N(P)$ i.e., $P_{2}$ accepts by final state what $P$ accepts by empty stack.

Suppose th $PDA, $ $P=(\{q,p\},\{0,1\},\{Z_{0},X\},\delta,q,Z_{0}.\{p\})$ has the following transition function$:$$\delta(q,0,Z_{0})=\{(q,XZ_{0})\}$$\delta(q,0,X)=\{(q...

233 views

admin asked Apr 6, 2019

0 votes

0 answers

1371

Ullman (TOC) Edition 3 Exercise 4.3 Question 5 (Page No. 155)
Give an algorithm to tell for two regular languages $L_{1}$ and $L_{2}$ over the same alphabet $\sum,$ whether there is any string in $\sum^{*}$ that is in neither $L_{1}$ nor $L_{2}.$

Give an algorithm to tell for two regular languages $L_{1}$ and $L_{2}$ over the same alphabet $\sum,$ whether there is any string in $\sum^{*}$ that is in neither $L_{1}...

210 views

admin asked Apr 6, 2019

0 votes

0 answers

1372

Ullman (TOC) Edition 3 Exercise 4.3 Question 4 (Page No. 155)
Give an algorithm to tell whether two regular languages $L_{1}$ and $L_{2}$ have at least one string in common.

Give an algorithm to tell whether two regular languages $L_{1}$ and $L_{2}$ have at least one string in common.

158 views

admin asked Apr 6, 2019

0 votes

0 answers

1373

Ullman (TOC) Edition 3 Exercise 4.3 Question 3 (Page No. 155)
Suppose $L$ is a regular language with alphabet $\sum.$ Give an algorithm to tell whether $L=\sum^{*},i.e,$ all strings over it's alphabet.

Suppose $L$ is a regular language with alphabet $\sum.$ Give an algorithm to tell whether $L=\sum^{*},i.e,$ all strings over it's alphabet.

290 views

admin asked Apr 6, 2019

0 votes

0 answers

1374

Ullman (TOC) Edition 3 Exercise 4.3 Question 2 (Page No. 155)
Give an algorithm to tell whether a regular language $L$ contains at least $100$ strings.

Give an algorithm to tell whether a regular language $L$ contains at least $100$ strings.

211 views

admin asked Apr 6, 2019

0 votes

0 answers

1375

Ullman (TOC) Edition 3 Exercise 4.3 Question 1 (Page No. 155)
Give an algorithm to tell whether a regular language $L$ is infinite. Hint$:$Use the pumping lemma to show that if the language contains any string whose length is above a certain lower limit, then the language must be infinite.

Give an algorithm to tell whether a regular language $L$ is infinite. Hint$:$Use the pumping lemma to show that if the language contains any string whose length is above ...

261 views

admin asked Apr 6, 2019

0 votes

0 answers

1376

Morris Mano Edition 3 Exercise 7 Question 36 (Page No. 305)
A computer uses RAM chips of $1024 \times 1$ capacity. how many chips are needed and how should there address line should be connected to provide a memory capacity of 1024 bytes. how many chips are needed to provide a memory capacity of 16K bytes? Explain in the words how chips are connected.

A computer uses RAM chips of $1024 \times 1$ capacity.how many chips are needed and how should there address line should be connected to provide a memory capacity of 1024...

342 views

ajaysoni1924 asked Apr 6, 2019

0 votes

0 answers

1377

Morris Mano Edition 3 Exercise 7 Question 6 (Page No. 303)
What is the difference between serial and parallel transfer? Explain how to convert serial data to parallel and parallel to serial. what type of registers is needed?

What is the difference between serial and parallel transfer? Explain how to convert serial data to parallel and parallel to serial. what type of registers is needed?

175 views

ajaysoni1924 asked Apr 6, 2019

1 votes

0 answers

1378

Cormen Edition 3 Exercise 6.1 Question 7 (Page No. 154)
Show that, with the array representation for storing an $n$-element heap, the leaves are the nodes indexed by $\lfloor n/2\rfloor +1$,$\lfloor n/2\rfloor +2,…,n$

Show that, with the array representation for storing an $n$-element heap, the leaves are the nodes indexed by $\lfloor n/2\rfloor +1$,$\lfloor n/2\rfloor +2,…,n$

293 views

akash.dinkar12 asked Apr 5, 2019

0 votes

2 answers

1379

Cormen Edition 3 Exercise 6.1 Question 6 (Page No. 154)
Is the array with values $23,17,14; 6,13,10,1,5,7,12$ a max-heap ?

Is the array with values $23,17,14; 6,13,10,1,5,7,12$ a max-heap ?

1.4k views

akash.dinkar12 asked Apr 5, 2019

0 votes

1 answer

1380

Cormen Edition 3 Exercise 6.1 Question 5 (Page No. 154)
Is an array that is in sorted order a min-heap ?

Is an array that is in sorted order a min-heap ?

359 views

akash.dinkar12 asked Apr 5, 2019

Page:

« prev
1
...
41
42
43
44
45
46
47
48
49
50
51
...
91
next »