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 h4kr
2
answers
1
homework-6
301
views
answered
Mar 5, 2023
Unknown Category
homework-6
+
–
1
answer
2
DBMS
can we make weak entity type as composite attribute of another weak entity type?
can we make weak entity type as composite attribute of another weak entity type?
408
views
commented
Feb 4, 2023
Databases
databases
relations
+
–
0
answers
3
Can DCFL be ambiguous?
Can DCFL be ambiguous?
Can DCFL be ambiguous?
475
views
commented
Feb 2, 2023
Theory of Computation
theory-of-computation
dcfl
ambiguous
+
–
0
answers
4
DMA stealing mode, where does extra 40ns come from?
Consider a disk with 4000 RPM rotational speed. The disk has 1K sectors on each track with 1k capacity of each sector. The disk is operating on the cycle stealing mode of DMA. It takes 50 nsec to transfer the 16 B data from disk to ... to DMA? This is the question here is the solution Can you tell where the 40ns which I have circled comes from??
Consider a disk with 4000 RPM rotational speed. The disk has 1K sectors on each track with 1k capacity of each sector. The disk is operating on the cycle stealing mode of...
336
views
asked
Jan 31, 2023
CO and Architecture
co-and-architecture
+
–
1
answer
5
Number of possible permutations that can be obtained using stack for input seq
Number of possible permutations that can be obtained using stack if the input sequence is 1, 2, 3, 4, 5 (in the order) is
Number of possible permutations that can be obtained using stack if the input sequence is 1, 2, 3, 4, 5 (in the order) is
680
views
commented
Jan 31, 2023
Algorithms
algorithms
stack
+
–
1
answer
6
What is the magnitude of Adj(A) and Adj(Adj(A)) ?
What is the magnitude of Adj(A) and Adj(Adj(A)) ?
What is the magnitude of Adj(A) and Adj(Adj(A)) ?
485
views
asked
Jan 28, 2023
Set Theory & Algebra
discrete-mathematics
+
–
1
answer
7
How many NAND gates required?
279
views
asked
Jan 21, 2023
Digital Logic
digital-logic
combinational-circuit
+
–
1
answer
8
Variance of X in envelope question
Three letters are placed into three addressed envelopes randomly. A random variable X denotes the number of letters placed into corresponding envelopes. The variance of X is __________.
Three letters are placed into three addressed envelopes randomly. A random variable X denotes the number of letters placed into corresponding envelopes. The variance of X...
638
views
asked
Jan 15, 2023
Probability
probability
discrete-mathematics
+
–
1
answer
9
Please draw the huffman diagram for the following question
513
views
commented
Jan 12, 2023
Algorithms
huffman-code
algorithms
+
–
2
answers
10
Is it also CSL?
Is the following Language, L = {xxxx | x ∈ {0, 1}*} CSL or not? I saw a explanation say that it’s REC, but it didn’t say anything about it not being CSL and I used to think strings like {xx | x ∈ {0, 1}*} are CSL where the same strings keep repeating [like x here]. So is it CSL and please do also tell is there a rule to figure that out?
Is the following Language, L = {xxxx | x ∈ {0, 1}*} CSL or not? I saw a explanation say that it’s REC, but it didn’t say anything about it not being CSL and I used ...
799
views
answer selected
Jan 12, 2023
Theory of Computation
theory-of-computation
context-sensitive
recursive-and-recursively-enumerable-languages
+
–
0
answers
11
What are the total number of topological ordering?
353
views
asked
Jan 10, 2023
Algorithms
topological-sort
algorithms
+
–
1
answer
12
Difference between no of states of synchronous vs asynchronous counters
What are the no of states b/w synchronous vs asynchronous counters
What are the no of states b/w synchronous vs asynchronous counters
281
views
answered
Jan 10, 2023
Digital Logic
digital-logic
synchronous-asynchronous-circuits
+
–
1
answer
13
No of page levels involved?
Consider a virtual memory system where, physical memory = 4GB page size = 4KB, page table entry size = 4B and 45-bit virtual address. Assume every page table exactly fits into a single page. If page table entry size is 4B then how many levels of page tables would be required.
Consider a virtual memory system where, physical memory = 4GB page size = 4KB, page table entry size = 4B and 45-bit virtual address. Assume every page table exactly f...
1.7k
views
asked
Jan 2, 2023
Operating System
operating-system
virtual-memory
+
–
1
answer
14
What is time complexity?
What is the correct time complexity in $\theta()$ ?
What is the correct time complexity in $\theta()$ ?
477
views
answer selected
Dec 30, 2022
Algorithms
time-complexity
algorithms
+
–
1
answer
15
What is the solution?
I think the answer must be 500200ns
I think the answer must be 500200ns
332
views
asked
Dec 29, 2022
Operating System
operating-system
virtual-memory
probability
effective-memory-access
made-easy-test-series
+
–
0
answers
16
Choosing prime implicants in K-maps
I got a K-map with the following boolean function: F(A,B,C,D) = ΠM[3,4,6,9,11,14]+ Σd[0,7,8,10,13,15] In the following K-map following prime-implicants are considered: But I can chose ($\bar{A}$+$\bar{D}$) instead of ($\bar{A}$+$B$) like: So now ... $\bar{C}$+$\bar{D}$)($A$+$C$+$D$) So we get different f in the two cases or am I making a mistake somewhere?
I got a K-map with the following boolean function: F(A,B,C,D) = ΠM[3,4,6,9,11,14]+ Σd[0,7,8,10,13,15]In the following K-map following prime-implicants are considered:Bu...
464
views
edited
Dec 29, 2022
Digital Logic
prime-implicants
digital-logic
k-map
+
–
1
answer
17
acacademy
CFG is not closed under complementation , but REC is?
CFG is not closed under complementation , but REC is?
397
views
retagged
Dec 28, 2022
Theory of Computation
theory-of-computation
+
–
0
answers
18
gateforum
156
views
retagged
Dec 28, 2022
Compiler Design
compiler-design
theory-of-computation
+
–
0
answers
19
gate academy
I think S1 is false because, for n=0, no 0’s will be added in stack, but in the transition to the next state (q2->q3) there is one mandatory 1 canceling out 0 in stack which will be absent in case of n=0. But solutions say S1 is true.
I think S1 is false because, for n=0, no 0’s will be added in stack, but in the transition to the next state (q2->q3) there is one mandatory 1 canceling out 0 in stack...
334
views
retagged
Dec 28, 2022
Theory of Computation
theory-of-computation
dpda
virtual-gate-test-series
+
–
0
answers
20
gateforum
340
views
retagged
Dec 28, 2022
Compiler Design
compiler-design
gateforum-test-series
+
–
0
answers
21
gateforum
433
views
retagged
Dec 28, 2022
Mathematical Logic
gateforum-test-series
discrete-mathematics
mathematical-logic
+
–
0
answers
22
cache miss question
In $T_{Read Avg}$, shouldn’t it be $T_{Read Avg}$ = (10*0.9) + 0.1*(10+100), because it must be checking the cache in case of cache miss too, right?
In $T_{Read Avg}$, shouldn’t it be $T_{Read Avg}$ = (10*0.9) + 0.1*(10+100), because it must be checking the cache in case of cache miss too, right?
557
views
commented
Dec 27, 2022
CO and Architecture
co-and-architecture
cache-memory
multilevel-cache
+
–
1
answer
23
All reflexive relations are anti-symmetric
Is the statement true that all reflexive relations are anti-symmetric?
Is the statement true that all reflexive relations are anti-symmetric?
374
views
commented
Dec 27, 2022
Set Theory & Algebra
relations
discrete-mathematics
+
–
3
answers
24
Difference b/w cache & TLB
What is the difference b/w cache & TLB? TLB is stored in cache too right? TLB helps in addressing like a faster version of page table while speaking of cache, it directly stores the process page directly right?
What is the difference b/w cache & TLB? TLB is stored in cache too right? TLB helps in addressing like a faster version of page table while speaking of cache, it directly...
583
views
asked
Dec 27, 2022
CO and Architecture
co-and-architecture
+
–
0
answers
25
Is it CFL or CSL?
Is {$a^nb^nc^n$ | $n>=0$} CSL? After comparing both a and b, stack would be empty. So it can’t be CFL. So it is CSL or recursive. And does this language require more than 1 stack? Please tell how would check for the grammer of this language even if it is in CSL. Thank you
Is {$a^nb^nc^n$ | $n>=0$} CSL? After comparing both a and b, stack would be empty. So it can’t be CFL. So it is CSL or recursive. And does this language require more th...
290
views
asked
Dec 23, 2022
Theory of Computation
theory-of-computation
context-free-language
context-sensitive
pushdown-automata
+
–
0
answers
26
How to approach this question
311
views
asked
Dec 21, 2022
Programming in C
programming-in-c
+
–
1
answer
27
Who manages what? (ACID peoperties)
Which manager manages each of the ACID properties? I found that transaction processing (TP) manager manages Isolation from wikipedia, meanwhile I read from another source that it is managed by concurrency control manager. Also what about the other ... which managers control them? Can you please list down the managers of the properties or any sources know to you?
Which manager manages each of the ACID properties? I found that transaction processing (TP) manager manages Isolation from wikipedia, meanwhile I read from another source...
555
views
asked
Dec 19, 2022
Databases
rdbms
databases
+
–
0
answers
28
Since it is already in 3NF, why decompose further?
Since the schema is already in 3NF we can keep the relations to 1, cant we? If you think the answer is different please explain how
Since the schema is already in 3NF we can keep the relations to 1, cant we? If you think the answer is different please explain how
367
views
commented
Dec 15, 2022
Databases
databases
+
–
1
answer
29
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?
532
views
edited
Dec 9, 2022
Computer Networks
computer-networks
sliding-window
go-back-n
selective-repeat
+
–
1
answer
30
complementation of language
I have a language L = {ε,a}. What will be $L^{C}$? Will it be Φ or {aa, aaa, aaaa, ...} ?
I have a language L = {ε,a}. What will be $L^{C}$? Will it be Φ or {aa, aaa, aaaa, ...} ?
338
views
answer selected
Dec 9, 2022
Theory of Computation
theory-of-computation
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register