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 vishal8492
0
votes
1
answer
1
Cache Associative memory
A cache is having 64KB capacity 128 byte lines and is 4-way set associative the sytem containing the cache uses 32 bit address. How many sets does the cache have ?
A cache is having 64KB capacity 128 byte lines and is 4-way set associative the sytem containing the cache uses 32 bit address. How many sets does the cache have ?
5.3k
views
asked
Jan 29, 2017
CO and Architecture
co-and-architecture
cache-memory
+
–
0
votes
1
answer
2
Turing Recognizable Languages
Okay , So R is RE , L is Regular language. 1) Definitely true , RE not closed under complement. 2) Regular union Non regular language ? Could be possbile. Not too sure. 3) L interesection R' is not RE ? Not sure 4) ?? Not sure 5) ?? Not sure Can you help with these ?
Okay , So R is RE , L is Regular language.1) Definitely true , RE not closed under complement.2) Regular union Non regular language ? Could be possbile. Not too sure.3) L...
337
views
asked
Dec 13, 2016
Theory of Computation
decidability
theory-of-computation
regular-language
+
–
0
votes
1
answer
3
Number of states in DFA divisible by 8
Number of states for DFA which is divisble by 8 , I mostly try to identify by using number of distinct states. In this case , it would be 8 ; but minimized dfa would be less ? I read somewhere , the unique states sould be 4 and so ... but is this right ? And can someone explain , what is meant by unique states ? Do we have fixed formula for such problems ?
Number of states for DFA which is divisble by 8 , I mostly try to identify by using number of distinct states.In this case , it would be 8 ; but minimized dfa would be le...
2.8k
views
asked
Dec 7, 2016
Theory of Computation
finite-automata
number-of-dfa
+
–
1
votes
2
answers
4
Regular Expression to DFA
Having hard time , to understand why (A) isn't the answer ? Looking at DFA it looks , 2* is good starting state ; then there are two paths 0 first path good enough ; for second path 1 is necessary what about 2 ; shouldn't it be 2* as it's 0 or more occurences. Am I solving it wrong ? Is this incorrect approach to look at the question ?
Having hard time , to understand why (A) isn't the answer ? Looking at DFA it looks , 2* is good starting state ; then there are two paths 0 first path good enough ; for ...
911
views
asked
Dec 6, 2016
Theory of Computation
theory-of-computation
regular-expression
regular-language
finite-automata
+
–
1
votes
2
answers
5
Regular Expression to CFG
So , 1 is mandatory in Regular expression ; and both of above grammar allows strings without 1 to be genearated. So , I expected None of above to be answer. What Am I missing here ? Consider for (A) Production = A0 -> A1 A1-> 0
So , 1 is mandatory in Regular expression ; and both of above grammar allows strings without 1 to be genearated.So , I expected None of above to be answer. What Am I mis...
1.7k
views
asked
Dec 6, 2016
Theory of Computation
theory-of-computation
regular-expression
context-free-language
context-free-grammar
regular-language
+
–
5
votes
4
answers
6
CFL or not ?
I'm having problems with identifying CFL languages a lot recently.I understand L1 is not , but how come L2 is ? Understood 1 stack is enough but aren't there two comparisons ? Or that doesn't matter you can do any number of comparisons ? ... comparisons are needed n<k and k<2n. Any other fixed formula , to identify class of language which acts as easy guideline ?
I'm having problems with identifying CFL languages a lot recently.I understand L1 is not , but how come L2 is ? Understood 1 stack is enough but aren't there two comparis...
3.3k
views
asked
Dec 4, 2016
Theory of Computation
theory-of-computation
context-free-language
dcfl
+
–
0
votes
3
answers
7
CFL or not
It seemed like , this is textbook example of non-CFL language ; will require 2 comparisons . That means no complement exist was the answer , I was expecting. Why answer given is CFL , am I missing something ?
It seemed like , this is textbook example of non-CFL language ; will require 2 comparisons . That means no complement exist was the answer , I was expecting. Why answer g...
605
views
asked
Dec 4, 2016
Theory of Computation
theory-of-computation
context-free-language
finite-automata
dcfl
+
–
1
votes
2
answers
8
DCFL or CFL ?
Isn't WxWr DCFL as X acts as marker so DCFL should be right choice , why is it categorized as CFL and not DCFL?
Isn't WxWr DCFL as X acts as marker so DCFL should be right choice , why is it categorized as CFL and not DCFL?
1.4k
views
asked
Dec 2, 2016
Theory of Computation
finite-automata
dcfl
context-free-language
theory-of-computation
+
–
2
votes
2
answers
9
Matrix Invertibility
Let A be (3×3) real matrix. Suppose 1 & -1 are two of three Eigen values of A and 18 is one of the Eigen values of A2+3A. Then [ A ] A is invertible as well as A2 + 3A is invertible [ B ] A^2+3A is invertible but A is not invertible [ C ] A is invertible but A^2+3A is not invertible [ D ] Both A & A^2+3A are not invertible
Let A be (3×3) real matrix. Suppose 1 & -1 are two of three Eigen values of A and 18 is one of the Eigen values of A2+3A. Then [ A ] A is invertible as well as A2 ...
674
views
asked
Nov 7, 2016
Linear Algebra
matrix
linear-algebra
+
–
2
votes
4
answers
10
Solve Recurrence Equation T(n) = 2T(n/4) + √3
I've been struggling to come to exact solution for this. Master's theorem is not applicable and likely way to get to answer is Recursion tree. Which is giving me Theta(n) as an answer. Steps : => 1) T(n) = 2T(n/4) + √3 2) ... .. = n/2 Which is incorrect , Answer given is ( √n log n ) , would appreciate if someone could shed light how so ?
I've been struggling to come to exact solution for this. Master's theorem is not applicable and likely way to get to answer is Recursion tree. Which is giving me Theta(n)...
5.1k
views
asked
Oct 11, 2016
Algorithms
algorithms
recurrence-relation
time-complexity
+
–
1
votes
2
answers
11
Correct symbolical representation of statement => "All Birds are beautiful"
Correct symbolical representation of statement => "All Birds are beautiful" ? Now , here the logical way to approach seems like necessary condition. Since All birds are beautiful , can be equivalent to , ... , with when to choose conjunction vs implication and how the above form is closer to sentential form.
Correct symbolical representation of statement = "All Birds are beautiful" ?Now , here the logical way to approach seems like necessary condition.Since All birds are bea...
1.0k
views
asked
Sep 25, 2016
Mathematical Logic
propositional-logic
+
–
0
votes
0
answers
12
Translate to sentential form. (V(x) {Pink(x) ^ Building(x) -> Wonderful(x) } )
(V(x) {Pink(x) ^ Building(x) -> Wonderful(x) } ) => Intuitively it seems like , (I) If building is pink then it is wonderful , but other form given is => (II) All pink buildings are wonderful. ... ) {Pink(x) ^ Building(x) -> Wonderful(x) } ) without any quantifier ? Or both are valid transalations here ?
(V(x) {Pink(x) ^ Building(x) - Wonderful(x) } )= Intuitively it seems like ,(I) If building is pink then it is wonderful ,but other form given is =>(II) All pink buildin...
267
views
asked
Sep 25, 2016
1
votes
1
answer
13
Series Convergence
I'm having hard time understanding how following series converges ; 1 + 2/5 + 3/5^2 + 4/5^3 + 5/5^4 + ............ infinity
I'm having hard time understanding how following series converges ; 1 + 2/5 + 3/5^2 + 4/5^3 + 5/5^4 + ............ infinity
566
views
asked
Aug 22, 2015
Linear Algebra
number-series
+
–
0
votes
4
answers
14
In stop and wait protocol , every 4th packet is lost.Find number of packets ?
In stop and wait protocol , every 4th packet is lost.If 8 packets are being sent, Find number of packets ? Answer given is : 10 Shouldn't Acknowledgements considered as well , in such case answer should be 18 , Right ?
In stop and wait protocol , every 4th packet is lost.If 8 packets are being sent, Find number of packets ?Answer given is : 10 Shouldn't Acknowledgements considered as we...
4.5k
views
asked
Aug 10, 2015
1
votes
3
answers
15
The least number of cables required to connect 8 computers to 4 printers to guarantee that 4 computers can directly access 4 different printers.
The least number of cables required to connect 8 computers to 4 printers to guarantee that 4 computers can directly access 4 different printers.At any given time 4 comput...
5.4k
views
asked
Jul 20, 2015
Combinatory
combinatory
+
–
0
votes
2
answers
16
Counting switching functions
By using 16 bit binary in BCD , how many switching functions can exist ? Now , since this is BCD anything above 1001 is invalid. Considering 16 bits : 1001 1001 1001 1001 Above is number of possible combinations : 0 - 9999 There are 10^4 possible combinations. Number of switching functions : 2^(10^4) Answer given is (10^4). Am I missing something obvious ?
By using 16 bit binary in BCD , how many switching functions can exist ?Now , since this is BCD anything above 1001 is invalid. Considering 16 bits : 1001 1001 1001 1001A...
671
views
asked
Jul 15, 2015
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
