Register
Filter

Answers by Vishal_kumar98

2 votes
2
#graph #degreeofgraph
Every simple, undirected, connected and acyclic graph with 50 vertices has at least two vertices of degree one.
Every simple, undirected, connected and acyclic graph with 50 vertices has at least two vertices of degree one.
1 votes
3
Self doubt
Does bandwidth gets divided in tdma? How does bandwidth gets affected in fdma, tdma, cdma
Does bandwidth gets divided in tdma?How does bandwidth gets affected in fdma, tdma, cdma
1 votes
4
What is an external quality of the software product? Why is it important to measure and evaluate the external quality of software product?
What is an external quality of the software product? Why is it important to measure and evaluate the external quality of software product? provide some examples
1 votes
5
paging
Can anyone diagrammatically explain what is the difference between Page size vs Page table entry size in a page table?
Can anyone diagrammatically explain what is the difference between Page size vs Page table entry size in a page table?
2 votes
10
Casecading rollback in WD and WW
Is the possibility of cascading rollbacks more in Wound and Wait or in Wait Die?
Is the possibility of cascading rollbacks more in Wound and Wait or in Wait Die?
0 votes
11
COMPILER design
Is S->aS left recursive grammer?
Is S->aS left recursive grammer?
1 votes
12
starvation in strict timestamping
Is starvation possible in strict timestamping?
Is starvation possible in strict timestamping?
2 votes
13
Context Free Grammar
Find context-free grammars for the following language The complement of the language L = belongs {a^n, b^n}
Find context-free grammars for the following languageThe complement of the language L = belongs {a^n, b^n}
3 votes
14
Attributes in syntax directed translation
Attributes are said to be of two type, synthesised and inherited. What actually is an attribute? Why an attribute exist, how to define it?
Attributes are said to be of two type, synthesised and inherited. What actually is an attribute? Why an attribute exist, how to define it?
4 votes
15
Computer Network
Anyone Explain What is meant by Hop with the help of diagram ?
Anyone Explain What is meant by Hop with the help of diagram ?
3 votes
16
#selfDoubt
How can Silly Window Syndrome cause Thrashing?
How can Silly Window Syndrome cause Thrashing?
2 votes
17
Cormen Edition 3 Exercise 1.1 Question 4 (Page No. 11)
How are the shortest-path and traveling-salesman problems given above similar? How are they different?
How are the shortest-path and traveling-salesman problems given above similar? How are they different?
3 votes
18
Context Free Grammar, Theory of computation
how shall we prove or verify that { ( a^n!) , n>=0 } is not a CFG. I tried applying pumping lemma but got stuck.
how shall we prove or verify that { ( a^n!) , n>=0 } is not a CFG.I tried applying pumping lemma but got stuck.
3 votes
20
Programming Question
An object whose contents cannot be changed once the object is created is called: (a) Immutable object (b) Mutable object (c) Smart object (d) Rich object
An object whose contents cannot be changed once the object is created is called:(a) Immutable object(b) Mutable object(c) Smart object(d) Rich object
3 votes
21
doubt.
What is the difference between frame & fragmented packet?
What is the difference between frame & fragmented packet?
1 votes
22
KENNITH ROSEN LATTICE
Find a compatible total order for the divisibility relation on the set {1, 2, 3, 6, 8, 12, 24, 36}.
Find a compatible total order for the divisibility relationon the set {1, 2, 3, 6, 8, 12, 24, 36}.
0 votes
23
unacademy combat
what will be time complexity of this program? void function(int n) { int count = 0; for (int i=0; i<n; i++) { for (int j=1; j< i*i; j++) { if (j%i == 0) { for (int k=0; k<j; k++) printf("*"); } } } }
what will be time complexity of this program?void function(int n){ int count = 0; for (int i=0; i<n; i++) { for (int j=1; j< i*i; j++) { ...
1 votes
24
self doubt
Does the window size parameter in TCP header means segment size?
Does the window size parameter in TCP header means segment size?
2 votes
26
Cormen Edition 3 Exercise 3.1 Question 3 (Page No. 53)
Explain why the statement, “The running time of algorithm A is at least $O(n^2),$” is meaningless.
Explain why the statement, “The running time of algorithm A is at least $O(n^2),$” is meaningless.
1 votes
27
Self Doubt on serializable
If a schedule is not conflict-serializable. Is it serializable?
If a schedule is not conflict-serializable. Is it serializable?
2 votes
28
Computer Networks: Wild Card
What is wild card host and mask? What is its significance?
What is wild card host and mask? What is its significance?
Page: