Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by LRU
1
answer
1
Self Made Question
Consider a connected undirected graph G with n vertices, where n > 4. Suppose that G has the property that every vertex has a degree of at least n/2, i.e., deg(v) ≥ n/2 for all vertices v in G. Prove that G must contain a cycle of length at most 3n/4.
Consider a connected undirected graph G with n vertices, where n 4. Suppose that G has the property that every vertex has a degree of at least n/2, i.e., deg(v) ≥ n/2 ...
339
views
asked
Apr 14, 2023
Graph Theory
graph-theory
bipartite-graph
self-doubt
+
–
1
answer
2
Self Made Question
Let G be a bipartite graph with vertex sets V1 and V2, where |V1| = 12 and |V2| = 18. Suppose that G has a perfect matching, which is a set of edges that covers all vertices in G. What is the minimum number of colors needed to properly color G such that no adjacent vertices share the same color, and how does it relate to the chromatic number of G? Justify your answer.
Let G be a bipartite graph with vertex sets V1 and V2, where |V1| = 12 and |V2| = 18. Suppose that G has a perfect matching, which is a set of edges that covers all verti...
267
views
asked
Apr 14, 2023
Graph Theory
graph-theory
bipartite-graph
numerical-answers
+
–
1
answer
3
Self Made Question
Consider a bipartite graph G with vertex sets V1 and V2, where |V1| = 10 and |V2| = 15. What is the minimum number of colors needed to properly color G such that no adjacent vertices share the same color? Justify your answer and explain how it is related to the chromatic number of G.
Consider a bipartite graph G with vertex sets V1 and V2, where |V1| = 10 and |V2| = 15. What is the minimum number of colors needed to properly color G such that no adjac...
209
views
asked
Apr 14, 2023
Graph Theory
graph-theory
bipartite-graph
numerical-answers
+
–
1
answer
4
Conditional Probability
English and American spelling are rigour and rigor, respectively. A man staying at Al Rashid hotel writes this word, and a letter taken at random from his spelling is found to be a vowel. If 40 percent of the English-speaking men at the hotel are English and 60 percent are American, what is the probability that the writer is an Englishman?
English and American spelling are rigour and rigor, respectively. A man staying at Al Rashid hotel writes this word, and a letter taken at random from his spelling is fou...
749
views
answer selected
Nov 25, 2022
Probability
conditional-probability
probability
engineering-mathematics
+
–
1
answer
5
Probability Distribution
Let X have a Poisson distribution with parameter λ = 1. What is the probability that X ≥ 2 given that X ≤ 4?
Let X have a Poisson distribution with parameter λ = 1. What is the probability that X ≥ 2 given that X ≤ 4?
1.4k
views
asked
Nov 25, 2022
Probability
probability
engineering-mathematics
poisson-distribution
+
–
2
answers
6
Applied Test Series
A link has a transmission speed of 500 × 10^6 bpsec. Assume acknowledgment has negligible transmission delay, and it's one way propagation delay is 2 sec. Also assumes that the processing delays at nodes are also negligible. If data packet size is 107 bits, then the efficiency of Go-Back-7 protocol is _______ (in %) [Correct upto two places of decimals].
A link has a transmission speed of 500 × 10^6 bpsec. Assume acknowledgment has negligible transmission delay, and it's one way propagation delay is 2 sec. Also assumes t...
689
views
answer selected
Nov 13, 2022
Computer Networks
test-series
computer-networks
data-link-layer
go-back-n
+
–
0
answers
7
CLRS
A long distance runner wants to carry only a single water bottle along the route and she can run k miles on one bottle of water. Before the race, she is given a map of all n watering stops (i.e. mile markers of these stops). Assume that the distance ... is the number of miles runner can run on a bottle of water Output: Sequence S of watering stops for the runner minimizing number of stops
A long distance runner wants to carry only a single water bottle along the route and she can run k miles on one bottle of water. Before the race, she is given a map of al...
270
views
asked
Oct 8, 2022
Algorithms
algorithms
graph-algorithm
time-complexity
+
–
1
answer
8
Self Doubt.
What is the relation between Theory of computation & Fuzzy logic?
What is the relation between Theory of computation & Fuzzy logic?
299
views
answered
Oct 5, 2022
Unknown Category
theory-of-computation
fuzzy-set
+
–
1
answer
9
Basic computer instructor
Which one is measure of software complexity? Ans:- number of lines of code (LOC) I want to proof this quest answer, please
Which one is measure of software complexity?Ans:- number of lines of code (LOC)I want to proof this quest answer, please
451
views
answered
Sep 20, 2022
Others
is&software-engineering
+
–
1
answer
10
Self doubt.
What is the function of router within same network?
What is the function of router within same network?
217
views
answered
Sep 19, 2022
Computer Networks
computer-networks
routers-bridge-hubs-switches
+
–
1
answer
11
please solve
322
views
answered
Sep 16, 2022
Theory of Computation
compiler-design
parsing
lr-parser
+
–
1
answer
12
Kenneth.H.Rosen
I’m using standard book(kenneth.H.Rosen) for my GATE preparation. And I have a doubt regarding syllabus or propositional logic. Do I have to study the topic “Proofs” for GATE?
I’m using standard book(kenneth.H.Rosen) for my GATE preparation. And I have a doubt regarding syllabus or propositional logic. Do I have to study the topic “Proofs�...
1.6k
views
commented
Feb 20, 2022
1
answer
13
CSE EXAM 2022
Kindly Solve it.
Kindly Solve it.
325
views
commented
Feb 12, 2022
Computer Networks
computer-networks
+
–
1
answer
14
Applied Test Series
Three quantities P, Q and R are such that PQ = KR, where K is a constant. When P is kept constant, Q varies directly as R; when Q is kept constant, P varies directly as R and when R is kept constant, P varies directly as Q. Initially, P was at 25 and P : Q : R was 1 : 9 : 25. Find the value of P when Q equals 81 at constant R.
Three quantities P, Q and R are such that PQ = KR, where K is a constant. When P is kept constant, Q varies directly as R; when Q is kept constant, P varies directly as R...
892
views
answer selected
Feb 8, 2022
Quantitative Aptitude
test-series
general-aptitude
quantitative-aptitude
+
–
2
answers
15
admission through Gate query
How do I use the previous year's GATE score for the current year for admissions? I completed B.tech in CSE in 2021 and I appeared for Gate 2021 CS and secured AIR1717 with a score of 619 and around 48 marks. I took a drop and reappeared for ... colleges and options would be available for me? What is the best college I can get with this score? What should I do next?
How do I use the previous year's GATE score for the current year for admissions?I completed B.tech in CSE in 2021 and I appeared for Gate 2021 CS and secured AIR1717 with...
1.0k
views
commented
Feb 6, 2022
Written Exam
admissions
+
–
3
answers
16
Made Easy Test Series
Consider the following statements: S1 : Direct mapped caches do not need a cache block replacement policy, whereas fully associative cache need. S2 : Direct mapped cache, may produce more misses if programs refers to memory words that occupy a same tag value. Which of the following options is correct?
Consider the following statements:S1 : Direct mapped caches do not need a cache block replacement policy, whereas fully associative cache need. S2 : Direct mapped cache, ...
771
views
answer selected
Jan 31, 2022
CO and Architecture
made-easy-test-series
computer-architecture
cache-memory
+
–
0
answers
17
Self-doubt
DFS and BFS are equal in expressive power??? I(Independent on performances)??
DFS and BFS are equal in expressive power??? I(Independent on performances)??
477
views
commented
Jan 27, 2022
1
answer
18
Applied Grand Test 10
The Netherlands is one of the world leaders in the production and sale of tulips. Suppose the heights of the tulips in the green house of rotterdams fantastic flora follow a continuous uniform distribution with lower bound of 7 inches and upper bound ... greater than 10 inches may be selected. What is the probability that a randomly selected tulip is tall enough to pick ____
The Netherlands is one of the world leaders in the production and sale of tulips. Suppose the heights of the tulips in the green house of rotterdams fantastic flora follo...
500
views
asked
Jan 27, 2022
Probability
test-series
engineering-mathematics
probability
uniform-distribution
+
–
1
answer
19
Applied Test Series
Consider the following sequence of instructions Add #20,R0,R1 Mul #3,R2,R3 And # ... fetch(other stages also) requires only one clock cycle. Number of cycles required to complete the given sequence of instructions are_____
Consider the following sequence of instructions Add #20,R0,R1 Mul #3,R2,R3 And #$3A,R2,R4 Add R0, R2, R5 In all instructions, the destination operand is given last. Init...
890
views
answer selected
Jan 25, 2022
CO and Architecture
test-series
computer-architecture
pipelining
+
–
1
answer
20
Applied Test Series: CN
Which of the following options is/are false? If the maximum value sequence number in the GBN is n, then the maximum sender window is n-1. The size of fragments in IPv4 packet fragmentation payload is always divisible by 8 except the last fragment. DF bit is ... IPV4 packet is different. They have provided the ans as 1, 3 and 4. Can someone explain me how option 3 is false?
Which of the following options is/are false?If the maximum value sequence number in the GBN is n, then the maximum sender window is n-1.The size of fragments in IPv4 pack...
372
views
commented
Jan 25, 2022
Computer Networks
test-series
computer-networks
+
–
9
answers
21
GATE CSE 2015 Set 1 | Question: 54
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is_______________.
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is_______________.
24.6k
views
commented
Jan 25, 2022
Graph Theory
gatecse-2015-set1
graph-theory
graph-connectivity
normal
graph-planarity
numerical-answers
+
–
2
answers
22
GATE CSE 2021 Set 2 | Question: 12
Let $L_1$ be a regular language and $L_2$ be a context-free language. Which of the following languages is/are context-free? $L_1 \cap \overline{L_2} \\$ $\overline{\overline{L_1} \cup \overline{L_2}} \\$ $L_1 \cup (L_2 \cup \overline{L_2}) \\$ $(L_1 \cap L_2) \cup (\overline{L_1} \cap L_2)$
Let $L_1$ be a regular language and $L_2$ be a context-free language. Which of the following languages is/are context-free?$L_1 \cap \overline{L_2} \\$$\overline{\overlin...
9.9k
views
commented
Jan 24, 2022
Theory of Computation
gatecse-2021-set2
multiple-selects
theory-of-computation
identify-class-language
1-mark
+
–
2
answers
23
Gate CSE Mock Test Series | Unacademy 2022
A sender uses the stop and wait ARQ protocol for reliable transmission of frames. Frames are of size 100 bytes and the transmission rate at the sender is 20 Kbps. Size of an acknowledgement is 10 bytes and the transmission rate at the receiver is 8 Kbps. The ... data meaning 1msec → $\frac{100}{70}$ Bytes of data hence 1sec → $\frac{10}{7}X1000$ = 1428.57
A sender uses the stop and wait ARQ protocol for reliable transmission of frames. Frames are of size 100 bytes and the transmission rate at the sender is 20 Kbps. Size of...
713
views
answered
Jan 24, 2022
Computer Networks
computer-networks
stop-and-wait
throughput
+
–
2
answers
24
Made Easy Test Series
Consider a pipeline consist of 5 stages named as IF, ID, OF, EX and WB with the respective stage delays of 2 ns, 6 ns, 5 ns, 8 ns and 1 ns. The alternative pipeline y' contain the same number of stages but EX stage is divided into 2 ... the program contain 20% of the instructions which are memory based instructions, what is the ratio of speed-up of x to speed-up of y?
Consider a pipeline consist of 5 stages named as IF, ID, OF, EX and WB with the respective stage delays of 2 ns, 6 ns, 5 ns, 8 ns and 1 ns. The alternative pipeline ‘y...
701
views
answer selected
Jan 24, 2022
CO and Architecture
made-easy-test-series
computer-architecture
pipelining
+
–
0
answers
25
GATE Applied Mock Test
3 -1 1 2
3-112
567
views
commented
Jan 24, 2022
Probability
probability
normal-distribution
random-variable
variance
+
–
1
answer
26
Gate Applied Test Series
Question→ Given a system with 3 processes where each process requires at least 2 resources to complete their execution, then the largest number of resources which will guarantee a deadlock is ___ Answer Given is: 1
Question→ Given a system with 3 processes where each process requires at least 2 resources to complete their execution, then the largest number of resources which will ...
720
views
commented
Jan 22, 2022
Operating System
operating-system
deadlock-prevention-avoidance-detection
+
–
7
answers
27
GATE CSE 2018 | Question: 37
A lexical analyzer uses the following patterns to recognize three tokens $T_1, T_2$, and $T_3$ over the alphabet $\{a, b, c\}$. $T_1: a?(b \mid c)^\ast a$ $T_2: b?(a \mid c)^\ast b$ ... the string $bbaacabc$ is processed by the analyzer, which one of the following is the sequence of tokens it outputs? $T_1T_2T_3$ $T_1T_1T_3$ $T_2T_1T_3$ $T_3T_3$
A lexical analyzer uses the following patterns to recognize three tokens $T_1, T_2$, and $T_3$ over the alphabet $\{a, b, c\}$.$T_1: a?(b \mid c)^\ast a$$T_2: b?(a \mid c...
21.2k
views
comment edited
Jan 21, 2022
Compiler Design
gatecse-2018
compiler-design
lexical-analysis
normal
2-marks
+
–
3
answers
28
GATE CSE 2020 | Question: 54
Consider a database implemented using $\text{B+}$ tree for file indexing and installed on a disk drive with block size of $\text{4 KB}$. The size of search key is $\text{12 bytes}$ ... that each record fits into one disk block. The minimum number of disk accesses required to retrieve any record in the database is _______
Consider a database implemented using $\text{B+}$ tree for file indexing and installed on a disk drive with block size of $\text{4 KB}$. The size of search key is $\text{...
22.3k
views
commented
Jan 21, 2022
Databases
gatecse-2020
numerical-answers
databases
b-tree
indexing
2-marks
+
–
1
answer
29
Made Easy Test Series Engineering Maths
Dear Friends can any body tell me limit exists at 1 or not? as According to me the limit exists at 1 as both gives -1 at 1 but in madeeasy it’s given that the limit doesn’t exists...
Dear Friends can any body tell me limit exists at 1 or not? as According to me the limit exists at 1 as both gives -1 at 1 but in madeeasy it’s given that the limit doe...
350
views
commented
Jan 20, 2022
0
answers
30
Made-Easy Test Series
Consider source X and destination Z is connected through an intermediate network Y. X sends a message of 260 bytes of application data to Z. TCP layer at source X prefixes 40 byte header to the message and then IP layer attach 40 byte header. Data link ... are correctly delivered. (Consider 40 bytes IP header at each network). a)400 bytes b)384 bytes c)360 bytes d)424 bytes
Consider source X and destination Z is connected through an intermediate network Y. X sends a message of 260 bytes of application data to Z. TCP layer at source X prefixe...
488
views
commented
Jan 20, 2022
Computer Networks
computer-networks
network-layer
fragmentation
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register