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
Questions by MayankSharma
0
votes
1
answer
1
Cache
What happens on write miss in a write back cache? First write in main memory then bring the block to cache (dirty bit = 0) or First bring the block to cache then write it (dirty bit = 1).
What happens on write miss in a write back cache?First write in main memory then bring the block to cache (dirty bit = 0) orFirst bring the block to cache then write it (...
852
views
asked
Sep 14, 2018
CO and Architecture
co-and-architecture
cache-memory
general-topic-doubt
+
–
1
votes
1
answer
2
Miss latency and miss penalty
Are miss latency & miss penalty same in cache?if no then what's the difference???
Are miss latency & miss penalty same in cache?if no then what's the difference???
2.5k
views
asked
Aug 29, 2018
CO and Architecture
co-and-architecture
cache-memory
+
–
1
votes
1
answer
3
Functionally complete
F(x, y, z) =x + y'z' It's functionally complete according to normal procedure to implement NOT & OR or AND from it. But from this short trick. https://www.google.co.in/amp/s/www.geeksforgeeks.org/gate-gate-cs-2015-set-1-question-49/amp It's preserving 1.so it can't be functionally complete. I must be wrong but I could not identify it.
F(x, y, z) =x + y'z' It's functionally complete according to normal procedure to implement NOT & OR or AND from it. But from this short trick.https://www.google.co.in/amp...
914
views
asked
Aug 10, 2018
Digital Logic
functional-completeness
digital-logic
+
–
0
votes
1
answer
4
OS Kernel
Please explain each point. My assumptions are; 1.kernel must save the register values.It should be FALSE as it can be the case if the process is terminated.Thus, no need to save. 2.kernel must close the files. Explain this point in both the cases(the ... has not dealt with registers earlier.Thus, no need to restore. 4.kernel must save the content of memory onto disk. Explain this too.
Please explain each point.My assumptions are;1.kernel must save the register values.It should be FALSE as it can be the case if the process is terminated.Thus, no need to...
1.3k
views
asked
Jun 21, 2018
Operating System
operating-system
kernel
process
+
–
0
votes
1
answer
5
Discrete mathematics C.L.Liu Solutions
Can I have solutions of ELEMENTS OF DISCRETE MATHEMATICS by C.L.Liu Solutions. Pls help
Can I have solutions of ELEMENTS OF DISCRETE MATHEMATICS by C.L.Liu Solutions. Pls help
4.5k
views
asked
Mar 9, 2018
Mathematical Logic
discrete-mathematics
+
–
0
votes
0
answers
6
Composition of function
"f:A->B & g:C->D are 2 functions then for their composition B should be equal to C." But if B is not equal to C then composition is possible or not? Eg:A={1,2,} B={3,4} C={4,5} D={6,7} then can fog be computed Or not? f={(1,3), (2,4)} g={(4,6),(5,7)} gof={(2,6)} is it true or not? I hope my question could be understood:)
"f:A->B & g:C->D are 2 functions then for their composition B should be equal to C."But if B is not equal to C then composition is possible or not? Eg:A={1,2,} B={3,4} C...
375
views
asked
Mar 3, 2018
2
votes
1
answer
7
OS memory management
Wkt Only one program can be in one partition in MFT so what about MVT... How many programs can be in one partition in MVT?
Wkt Only one program can be in one partition in MFT so what about MVT...How many programs can be in one partition in MVT?
542
views
asked
Nov 28, 2017
0
votes
1
answer
8
Compiler
First {a} =? First{a, b} =? First{a, b, c} =? First {a, $} =? Where a, b, c are terminals.
First {a} =?First{a, b} =?First{a, b, c} =?First {a, $} =?Where a, b, c are terminals.
360
views
asked
Nov 18, 2017
Compiler Design
compiler-design
parsing
first-and-follow
descriptive
+
–
1
votes
1
answer
9
Theory-of-computation DFA
Design a minimal DFA accepting L={w ; atleast one 'a' in w is not immediately followed by 'b'}
Design a minimal DFA accepting L={w ; atleast one 'a' in w is not immediately followed by 'b'}
529
views
asked
Oct 3, 2017
Theory of Computation
theory-of-computation
finite-automata
minimal-state-automata
+
–
1
votes
2
answers
10
Regular expressions
Are regular expressions (a+b)* and (a*b*)* over alphabet set {a,b} same? If not, which strings are acceptable in one and not in other...
Are regular expressions (a+b)* and (a*b*)* over alphabet set {a,b} same?If not, which strings are acceptable in one and not in other...
647
views
asked
Sep 30, 2017
Theory of Computation
theory-of-computation
regular-expression
+
–
0
votes
1
answer
11
TOC peter linz (6 edition)
Find DFA for the following language $L=\left \{ ba^n : n>=1,n\neq 4 \right \}$
Find DFA for the following language$L=\left \{ ba^n : n>=1,n\neq 4 \right \}$
1.9k
views
asked
Sep 23, 2017
Theory of Computation
theory-of-computation
peter-linz
+
–
0
votes
0
answers
12
Aptitude book
Which book is better for gate cs aptitude RS AGRAWAL or ARUN SHARMA?
Which book is better for gate cs aptitude RS AGRAWAL or ARUN SHARMA?
368
views
asked
Sep 23, 2017
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register