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
Answers by Pranavpurkar
0
votes
1
#madeeasy
is it ok to mark both and at least option in the case of MSQ, on my view in this question first option will always be true so marking the second is correct?
is it ok to mark both and at least option in the case of MSQ, on my view in this question first option will always be true so marking the second is correct?
402
views
answered
Feb 1, 2023
Programming in C
programming-in-c
made-easy-test-series
query
+
–
0
votes
2
TCP question
Consider the slow start phase for a congestion control in a TCP connection. Initially, the window size is 4 MSS and the threshold is 36 MSS. After which transmission window size reached the threshold limit? 3 4 5 7
Consider the slow start phase for a congestion control in a TCP connection. Initially, the window size is 4 MSS and the threshold is 36 MSS. After which transmission wind...
507
views
answered
Jan 31, 2023
Computer Networks
computer-networks
tcp
+
–
0
votes
3
Computer Organization and Architecture
Consider two cache organization which are byte addressable.In both cache organization cache size is 64 KB with 32-byte block.The first cache organization is direct mapped while the other is 4-way set associative.Physical address is of size ... latency of OR gate is 1 is.Find sum the latency of the direct mapped organization and set associative organization?
Consider two cache organization which are byte addressable.In both cache organization cache size is 64 KB with 32-byte block.The first cache organization is direct mapped...
286
views
answered
Jan 31, 2023
CO and Architecture
co-and-architecture
+
–
4
votes
4
TestBook testseries linkedList question
What does the following routine do on doubly linked list. M is some middle node address and N is a newly inserted node address. N → lptr = M ; N → rtptr = M → rptr ; N → lptr → rptr = N ; N → rptr → lptr = N ; Inserts a node to Right of M Left of M Right Most Left Most
What does the following routine do on doubly linked list. M is some middle node address and N is a newly inserted node address.N → lptr = M ;N → rtptr = M → rptr ;N...
867
views
answered
Jan 31, 2023
DS
data-structures
linked-list
+
–
0
votes
5
An Introduction to Formal Languages and Automata,6th edition,Exercise 2.3 Q2.
Convert the nfa in Exercise 13, Section 2.2, into an equivalent dfa.
Convert the nfa in Exercise 13, Section 2.2, into an equivalent dfa.
698
views
answered
Jan 30, 2023
Theory of Computation
theory-of-computation
peter-linz
finite-automata
+
–
0
votes
6
#selfdoubt
how many topological sort possible for above graph?directions like this question https://gateoverflow.in/39669/gate-cse-2016-set-1-question-11
how many topological sort possible for above graph?directions like this question https://gateoverflow.in/39669/gate-cse-2016-set-1-question-11
437
views
answered
Jan 30, 2023
Programming in C
programming
topological-sort
directed-acyclic-graph
+
–
0
votes
7
TestBook testseries question to find max weight of MST
A complete graph G with 5 nodes has positive weight edges, each node has a distinct weight with an integer value and maximum weight is equal to number of edges in G. What can be the maximum weight of minimum spanning tree for graph G?
A complete graph G with 5 nodes has positive weight edges, each node has a distinct weight with an integer value and maximum weight is equal to number of edges in G.What ...
426
views
answered
Jan 30, 2023
Algorithms
algorithms
minimum-spanning-tree
testbook-test-series
+
–
0
votes
8
GATE CSE 2014 Set 2 | Question: 7
Let $k=2^n$. A circuit is built by giving the output of an $n$-bit binary counter as input to an $n\text{-to-}2^n$ bit decoder. This circuit is equivalent to a $k$-bit binary up counter. $k$-bit binary down counter. $k$--bit ring counter. $k$-bit Johnson counter.
Let $k=2^n$. A circuit is built by giving the output of an $n$-bit binary counter as input to an $n\text{-to-}2^n$ bit decoder. This circuit is equivalent to a $k$-bit bi...
19.8k
views
answered
Jan 5, 2023
Digital Logic
gatecse-2014-set2
digital-logic
normal
digital-counter
+
–
1
votes
9
What is the solution?
I think the answer must be 500200ns
I think the answer must be 500200ns
324
views
answered
Jan 1, 2023
Operating System
operating-system
virtual-memory
probability
effective-memory-access
made-easy-test-series
+
–
2
votes
10
#Self doubt
Since Dealock --> No Progress then Does Progess --> No Deadlock bcoz contrapositive should be true.
Since Dealock No Progressthen Does Progess No Deadlockbcoz contrapositive should be true.
237
views
answered
Jan 1, 2023
Operating System
operating-system
process-synchronization
+
–
1
votes
11
Theory of Computation | Automata
L= {$a^nb^nc^nd^n; n\geq 0$} Given Language is a CSL TRUE FALSE
L= {$a^nb^nc^nd^n; n\geq 0$} Given Language is a CSLTRUEFALSE
698
views
answered
Dec 12, 2022
Theory of Computation
theory-of-computation
context-sensitive
+
–
3
votes
12
Self doubt
How to do this Boolean multiplication? And which Boolean law is applicable here ? ( P' + Q ) ( Q' + P )
How to do this Boolean multiplication? And which Boolean law is applicable here ?( P' + Q ) ( Q' + P )
363
views
answered
Dec 9, 2022
Mathematical Logic
self-doubt
digital-logic
boolean-algebra
+
–
0
votes
13
Solution is 2 or 3?
Should the solution for the above question be 2 or 3?
Should the solution for the above question be 2 or 3?
520
views
answered
Dec 9, 2022
Computer Networks
computer-networks
sliding-window
go-back-n
selective-repeat
+
–
2
votes
14
unacademy aimt 2023 mock 1
A floppy disk has 40 cylinders. When storing a file on the floppy disk, the operating system (probably the floppy device driver) often attempts to put the blocks of the file in cylinders that are close to one another (if this can be ... seconds per cylinder moved, the rotational latency is 20 milli-seconds on average, and the transfer time is 15 milliseconds per block?
A floppy disk has 40 cylinders. When storing a file on the floppy disk, the operating system (probably the floppy device driver) often attempts to put the blocks of the f...
434
views
answered
Dec 8, 2022
Operating System
operating-system
file-system
normal
unacademy-test-series
+
–
1
votes
15
Turing machine question
I saw question where I saw this format being used: L1 = {<M> | L(M) = ϕ} What does exactly <M> mean and why is L(M) = ϕ, mentioned afterwards. Isn’t L() stands for language for something? If the language is equivalent to null, it contains nothing. Then what does it exactly mean?
I saw question where I saw this format being used:L1 = {<M | L(M) = ϕ}What does exactly <M mean and why is L(M) = ϕ, mentioned afterwards. Isn’t L() stands for langua...
740
views
answered
Dec 7, 2022
Theory of Computation
theory-of-computation
turing-machine
test-series
+
–
2
votes
16
# propositional logic
Why “This statement is true” is proposition while “This statement is false” is liar paradox? Aren’t both statements supposed to be liar paradox ?
Why“This statement is true” is proposition while “This statement is false” is liar paradox?Aren’t both statements supposed to be liar paradox ?
536
views
answered
Dec 7, 2022
Mathematical Logic
mathematical-logic
propositional-logic
+
–
0
votes
17
GATE CSE 2013 | Question: 28
Consider the following sequence of micro-operations. MBR ← PC MAR ← X PC ← Y Memory ← MBR Which one of the following is a possible operation performed by this sequence? Instruction fetch Operand fetch Conditional branch Initiation of interrupt service
Consider the following sequence of micro-operations.MBR ← PC MAR ← X PC ← Y Memory ← MBRWhich one of the following is a possible operation performed by this seque...
15.2k
views
answered
Dec 6, 2022
CO and Architecture
gatecse-2013
co-and-architecture
microprogramming
normal
+
–
2
votes
18
DSA
Given two max heap, one of size n and other m. Calculate the time complexity of merging them to get a max heap.
Given two max heap, one of size n and other m. Calculate the time complexity of merging them to get a max heap.
908
views
answered
Dec 5, 2022
DS
binary-heap
time-complexity
merging
+
–
1
votes
19
Ace academy handout
Please solve and explain this question, like explaining to a 2nd-grade student. Answer is 128 KB, for verification.
Please solve and explain this question, like explaining to a 2nd-grade student. Answer is 128 KB, for verification.
375
views
answered
Dec 4, 2022
Operating System
operating-system
memory-management
paging
+
–
1
votes
20
TOC | Made Easy Test Series | Q.13
Consider the following statement S: $\left \{ a^{n}b^{n+k}|n\geq 0,k\geq 1 \right \} \cup \left \{a^{n+k}b^{n}|n\geq 0,k\geq 3 \right \}$ is DCFL The above statement is: TRUE FALSE
Consider the following statementS: $\left \{ a^{n}b^{n+k}|n\geq 0,k\geq 1 \right \} \cup \left \{a^{n+k}b^{n}|n\geq 0,k\geq 3 \right \}$ is DCFLThe above statement is:TRU...
352
views
answered
Dec 4, 2022
Theory of Computation
made-easy-test-series
theory-of-computation
test-series
dcfl
+
–
2
votes
21
I/O Modes | Process State Transition | COA & OS
MSQ A ‘Running’ process is surely put into ‘Blocked/Wait’ state during while requesting for an I/O, in which of the following I/O modes? Synchronous I/O Asynchronous I/O Interrupt Driven I/O DMA
MSQA ‘Running’ process is surely put into ‘Blocked/Wait’ state during while requesting for an I/O, in which of the following I/O modes?Synchronous I/OAsynchronous...
800
views
answered
Dec 2, 2022
CO and Architecture
operating-system
process-scheduling
co-and-architecture
dma
interrupts
input-output
multiple-selects
+
–
1
votes
22
Calculate the effective access time.
A demand paging system provides a TLB (15 ns access time), cache memory (25 ns access time), main memory (75 ns access time, NOT including the cache miss ) and 5 ms to service a page fault. The page table is found in the TLB 70% ... memory location is found in the cache 70% of the time and in main memory 20% of the time. Calculate the effective access time.
A demand paging system provides a TLB (15 ns access time), cache memory (25 ns access time), main memory (75 ns access time, NOT including the cache “miss”) and 5 ms ...
2.5k
views
answered
Dec 1, 2022
Operating System
operating-system
effective-memory-access
+
–
0
votes
23
#gate_applied_course
When the event for which a thread is blocked occurs, the thread will no longer be blocked and will be moved to the ready queue. why?
When the event for which a thread is blocked occurs, the thread will no longer be blocked and will be moved to the ready queue. why?
526
views
answered
Nov 30, 2022
1
votes
24
gate academy, all india mock test 2019
697
views
answered
Nov 29, 2022
Compiler Design
compiler-design
viable-prefix
gate-academy-test-series
+
–
1
votes
25
ME Demo Test Q13
Consider the following statement: S : {$a^{n}b^{n+k} | n\geq 0,k\geq 1$} $\cup$ {$a^{n+k}b^{n} | n\geq 0,k\geq 3$} Which of the following is TRUE about S? (Also explain HOW) S is Regular, but not DCFL S is CFL, but not DCFL S is DCFL, but not Regular None of these
Consider the following statement:S : {$a^{n}b^{n+k} | n\geq 0,k\geq 1$} $\cup$ {$a^{n+k}b^{n} | n\geq 0,k\geq 3$}Which of the following is TRUE about S? (Also explain HOW...
288
views
answered
Nov 28, 2022
Theory of Computation
theory-of-computation
dcfl
+
–
0
votes
26
theory Regular Langauge
Write a regular expression for all strings of 0’s and 1’s in which the total number of zeros to the right of each 1 is even.
Write a regular expression for all strings of 0’s and 1’s in which the total number of zeros to the right of each 1 is even.
241
views
answered
Nov 28, 2022
Theory of Computation
theory-of-computation
strings
regular-expression
+
–
0
votes
27
theory regular langauge
Write a regular expression for all strings of 0’s and 1’s in which there is an even number of 0’s between any two 1’s.
Write a regular expression for all strings of 0’s and 1’s in which there is an even number of 0’s between any two 1’s.
681
views
answered
Nov 28, 2022
Theory of Computation
theory-of-computation
strings
regular-expression
+
–
0
votes
28
Compiler Design self Doubt
"Every Regular Grammar has a Right linear grammar and this is LL(1)" What is meaning of this statement exactly and does it hold always? My Assumptions: If a grammar is right linear grammar then it can be parser by LL(1) ->I ... right linear grammar. But this is not suffice to make grammar LL(1). Correct if I assumed anything wrong with some intutive answer.
"Every Regular Grammar has a Right linear grammar and this is LL(1)"What is meaning of this statement exactly and does it hold always?My Assumptions:If a grammar is right...
357
views
answered
Nov 25, 2022
Compiler Design
compiler-design
ll-parser
parsing
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register