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 Onika
0
answers
1
Testbook Chapter Test on Finite Automata (CT: 19)
Which of the following statements is/are true? The language denoted by the regular expression (ϕ*)* is ϵ The language denoted by the regular expression a ϕ is ϕ The regular expression for the language L={vuv|v,u∈{a,b}*,|v|≤3 } is L=(a ... it will still denote an empty set, right? Whereas, epsilon (ϵ) is not an empty set. And option 4 is True, right?
Which of the following statements is/are true?The language denoted by the regular expression (ϕ*)* is ϵThe language denoted by the regular expression a ϕ is ϕThe regu...
390
views
commented
Jan 6, 2023
Theory of Computation
finite-automata
theory-of-computation
+
–
1
answer
2
regular expressions
{(a* b)a } intersection {a*b*}, is this considered a regular language ? or not and how do i know ?
{(a* b)a } intersection {a*b*}, is this considered a regular language ? or not and how do i know ?
287
views
commented
Nov 25, 2022
Theory of Computation
theory-of-computation
regular-language
+
–
1
answer
3
Safe State | Deadlock Avoidance | Bankers Algorithm | OS | MSQ
MSQ Which of the following statements is/are TRUE? If safe state exists, deadlock can be avoided if resources are allocated properly If safe state exists, deadlock is never possible in future Unsafe state always leads to ... safe state exists, deadlock is possible, if resources are poorly allocated Unsafe state may lead to a deadlock
MSQ Which of the following statements is/are TRUE?If safe state exists, deadlock can be avoided if resources are allocated properlyIf safe state exists, deadlock is never...
1.1k
views
commented
Nov 20, 2022
Operating System
deadlock-prevention-avoidance-detection
operating-system
resource-allocation
normal
+
–
2
answers
4
gateforum
434
views
commented
Nov 2, 2022
Computer Networks
gateforum-test-series
computer-networks
sliding-window
+
–
2
answers
5
CRC
451
views
commented
Oct 31, 2022
Computer Networks
crc-polynomial
+
–
0
answers
6
CBRT Computer Engineering Paper
133
views
commented
Oct 11, 2022
Others
non-gate
+
–
0
answers
7
Computer Networks
Given answer (FROM PW) 4th = 5 5th = c I don’t understand 4th question properly. For the 5th I am getting c and d as answer. Explanation. Since 2 bit is used for subnet mask: then total 4 subnet possible: 1 = 152.158.0.0 to 152.158.63.255 2 = 152.158.64.0 to 152.158.127.255 3 = 152.158.128.0 to 152.158.191.255 4 = 152.158.192.0 to 152.158.255.255 Let me know where I am wrong.
Given answer (FROM PW) 4th = 55th = cI don’t understand 4th question properly.For the 5th I am getting c and d as answer.Explanation.Since 2 bit is used for subnet mas...
336
views
commented
Oct 9, 2022
Computer Networks
computer-networks
test-series
+
–
1
answer
8
In the network 200.10.11.144/27, the fourth octet (in decimal) of the last IP address of the network which can be assigned to a host is (A) 158 (B) 255 (C) 222 (D) 223
722
views
commented
Oct 9, 2022
1
answer
9
Computer Networks
Question from PW Answer given is a Somebody please explain.
Question from PWAnswer given is aSomebody please explain.
264
views
commented
Oct 8, 2022
Computer Networks
computer-networks
test-series
+
–
2
answers
10
is this argument valid: {P->Q , Q->R}-> R'
1.2k
views
commented
Oct 5, 2022
Mathematical Logic
mathematical-logic
+
–
1
answer
11
Applied Test Series
Consider a hypothetical 32-bit microprocessor having 32-bit instructions composed of two fields : the first byte contains the opcode and the remainder is an immediate operand or an operand address. What is the maximum directly addressable memory capacity (in Megabytes)? consider memory as byte addressable.
Consider a hypothetical 32-bit microprocessor having 32-bit instructions composed of two fields : the first byte contains the opcode and the remainder is an immediate ope...
386
views
commented
Jan 21, 2022
CO and Architecture
co-and-architecture
+
–
2
answers
12
Self Doubt
Why is the vertex connectivity of a graph always less than or equal to its edge connectivity?
Why is the vertex connectivity of a graph always less than or equal to its edge connectivity?
495
views
answered
Jan 5, 2022
Graph Theory
graph-theory
graph-connectivity
+
–
1
answer
13
Testbook Test Series
276
views
answered
Jan 5, 2022
CO and Architecture
testbook-test-series
+
–
3
answers
14
Applied Mock Test
Host A is connected to host B with a 100 Mbps link that has a 200 ms one-way latency and transmission delay of 10 sec. How much data can A send to B before B’s first acknowledgement reaches A?
Host A is connected to host B with a 100 Mbps link that has a 200 ms one-way latency and transmission delay of 10 sec. How much data can A send to B before B’s first ac...
458
views
answered
Jan 4, 2022
Computer Networks
test-series
computer-networks
data-link-layer
+
–
1
answer
15
ACE academy Test series : Computer networks
At a transmission rate of 20Mbps and propagation speed of 2*10^8m/s. How many meters of the cable is one-bit delay in an Ethernet interface equivalent?
At a transmission rate of 20Mbps and propagation speed of 2*10^8m/s. How many meters of the cable is one-bit delay in an Ethernet interface equivalent?
321
views
answered
Dec 25, 2021
Computer Networks
computer-networks
ace-test-series
ethernet
+
–
6
answers
16
confusion -- computer networks
Do we actually need ip and Mac addresses both at same time for the computer for communication? Why we not use Mac instead of ip address since Mac is also the unique address globally? Why we not use ip instead of Mac Since both are unique but why we use both for computer networkws?
Do we actually need ip and Mac addresses both at same time for the computer for communication?Why we not use Mac instead of ip address since Mac is also the unique addres...
689
views
answered
Dec 25, 2021
Computer Networks
computer-networks
subnetting
network-addressing
network-layer
+
–
0
answers
17
Testbook Test Series
209
views
commented
Dec 12, 2021
Linear Algebra
testbook-test-series
+
–
1
answer
18
Applied Grand Test 2
Three processes P1, P2 and P3 arrive at time zero. The total time spent by the process in the system is 10ms, 20ms, and 30ms respectively. They spent the first 20% of their execution time doing I/O and the rest 80% in CPU processing. What is the percentage utilization of CPU using FCFS scheduling algorithm?
Three processes P1, P2 and P3 arrive at time zero. The total time spent by the process in the system is 10ms, 20ms, and 30ms respectively. They spent the first 20% of the...
5.8k
views
commented
Nov 24, 2021
Operating System
test-series
operating-system
process-scheduling
+
–
2
answers
19
#Selfdoubt How L-attributed semantic rules are evaluated? Whether they are evaluated simultaneously during parsing?
If the grammar has only S-attributed semantic definitions, in a top down parser we will add the semantic action at the end of production and it will we executed when we...
857
views
answered
Nov 22, 2021
Compiler Design
compiler-design
syntax-directed-translation
+
–
2
answers
20
GATE Overflow Test Series | Mock GATE | Test 5 | Question: 43
Suppose we are given an algorithm $'X'$ that find the median in time $\Theta(n^2)$, where $n$ is the number of inputs. Now consider a QuickSort implementation where we first find median using the above algorithm $'X'$, then use this median as pivot. What ... QuickSort? $\Theta(n^2)$ $\Theta(n \log n)$ $O(n \log n)$ $\Theta(n^2 \log n)$
Suppose we are given an algorithm $’X’$ that find the median in time $\Theta(n^2)$, where $n$ is the number of inputs. Now consider a QuickSort implementation where w...
383
views
answered
Nov 12, 2021
Algorithms
go2025-mockgate-5
algorithms
quick-sort
time-complexity
2-marks
+
–
3
answers
21
QUICK SORT- SELF DOUBT
In quick sort for sorting of n Numbers, the 75th greatest Element is selected as pivot using $O(n^2)$ time complexity algorithm than what is the worst case time complexity of quick sort. O($n^2$) O($n^3$) O(nlogn) O(n)
In quick sort for sorting of n Numbers, the 75th greatest Element is selected as pivot using $O(n^2)$ time complexity algorithm than what is the worst case time complexit...
3.5k
views
answered
Nov 12, 2021
Algorithms
algorithms
divide-and-conquer
quick-sort
+
–
3
answers
22
Merge Sort
Consider the following statement: S1: Merge sort on linked list take O(n log n) time to sort input of length n. S2: Merge sort on linked list give better space complexity then on array. S3: Inplace merge sort on array will take O(n2) time. Which of the following is correct? a)S1 b)S1 and S2 c)S1,S2,S3 d) None
Consider the following statement:S1: Merge sort on linked list take O(n log n) time to sort input of length n.S2: Merge sort on linked list give better space complexity t...
3.8k
views
answered
Nov 12, 2021
DS
merge-sort
time-complexity
+
–
1
answer
23
merge sort
given n elements merge them into one sorted list using merge procedure then what is the time complexity for this ? explain with example
given n elements merge them into one sorted list using merge procedure then what is the time complexity for this ?explain with example
437
views
commented
Nov 12, 2021
Algorithms
sorting
merge-sort
time-complexity
+
–
1
answer
24
Testbook Test Series: Algorithms - Asymptotic Analysis
a , c , d all three are right answer please explain if i am wrong.
a , c , d all three are right answer please explain if i am wrong.
349
views
answered
Nov 11, 2021
Algorithms
testbook-test-series
algorithms
asymptotic-notation
+
–
1
answer
25
Applied Test Series
A final exam is a discrete mathematics course consisting of 20 true-false questions, each worth 3 points and 10 multiple choice questions, each worth 4 points. Suppose that the probability that a student gives a correct answer to a true-false question is ... student gives a correct answer to a multiple choice question is 0.8. What is student expected score on the final exam___
A final exam is a discrete mathematics course consisting of 20 true-false questions, each worth 3 points and 10 multiple choice questions, each worth 4 points. Suppose th...
552
views
answered
Nov 11, 2021
Probability
test-series
engineering-mathematics
probability
expectation
+
–
2
answers
26
Applied Test Series
A large bowl contains 15 balls that are identical except for their colors 6 are colored red, 5 are colored blue and 4 are colored green. What is the probability that two balls selected at random from the bowl have the same color_____
A large bowl contains 15 balls that are identical except for their colors 6 are colored red, 5 are colored blue and 4 are colored green. What is the probability that two ...
387
views
answered
Nov 11, 2021
Probability
test-series
engineering-mathematics
probability
+
–
1
answer
27
Applied Test Series
There are 4 parts of an encyclopedia which are available in a library which are arranged on the shelf along with other books on a shelf which add up to a total 25 books, if the books are arranged randomly then the number of ways in which the encyclopedia is in the correct order is (the parts need not be beside each other)____
There are 4 parts of an encyclopedia which are available in a library which are arranged on the shelf along with other books on a shelf which add up to a total 25 books, ...
333
views
answered
Nov 11, 2021
Combinatory
test-series
engineering-mathematics
discrete-mathematics
combinatory
+
–
3
answers
28
Applied Test Series
The number of possible ways in which 5 identical helicopters can take off given that we are having 5 helipads.____
The number of possible ways in which 5 identical helicopters can take off given that we are having 5 helipads.____
494
views
answered
Nov 11, 2021
Combinatory
test-series
engineering-mathematics
discrete-mathematics
combinatory
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register