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 vishal8492
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
+
–
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
+
–
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
+
–
4
answers
4
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
commented
Dec 7, 2016
Theory of Computation
theory-of-computation
context-free-language
dcfl
+
–
2
answers
5
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
+
–
2
answers
6
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
+
–
2
answers
7
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
commented
Dec 5, 2016
Theory of Computation
finite-automata
dcfl
context-free-language
theory-of-computation
+
–
3
answers
8
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
answer selected
Dec 4, 2016
Theory of Computation
theory-of-computation
context-free-language
finite-automata
dcfl
+
–
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 ...
673
views
asked
Nov 7, 2016
Linear Algebra
matrix
linear-algebra
+
–
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
commented
Oct 11, 2016
Algorithms
algorithms
recurrence-relation
time-complexity
+
–
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
answer selected
Sep 26, 2016
Mathematical Logic
propositional-logic
+
–
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
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
commented
Aug 22, 2015
Linear Algebra
number-series
+
–
1
answer
14
why is the below code compile time error and not run time error ?
#include<stdio.h> int f(); int main() { f(); return 0; }
#include<stdio.h int f(); int main() { f(); return 0; }
626
views
answered
Aug 11, 2015
Programming in C
programming-in-c
+
–
4
answers
15
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
commented
Aug 11, 2015
2
answers
16
dgital
Which of the following multiplier pattern of boothe algo gives better performance and how: 1..01111111110 2..1111100011111 3..011111011111 4..111111111000
Which of the following multiplier pattern of boothe algo gives better performance and how:1..011111111102..11111000111113..0111110111114..111111111000
899
views
commented
Aug 6, 2015
1
answer
17
For each function f (n) and time t in the following table, determine the largest size n of a problem that can be solved in time t , assuming that the algorithm to solve the problem takes f (n) microseconds.
please explain the method.
5.3k
views
answered
Aug 5, 2015
Algorithms
algorithms
time-complexity
+
–
1
answer
18
A relation R(ABCDE) with FD set f = {A -> BC, C -> DE, D -> E} and the decomposition d = { R1(ABCD), R2(DE)}. Is this decomposition dependency preserving?
The answer given is YES. But how is the dependency C - DE preserved in this decomposition?
4.8k
views
commented
Aug 3, 2015
Databases
databases
database-normalization
+
–
2
answers
19
Determine if the given solution for critical section problem is correct
1.4k
views
comment edited
Aug 2, 2015
Operating System
process-synchronization
+
–
1
answer
20
set theory
difference between {} , ∅ , {∅} ???
difference between {} , ∅ , {∅} ???
840
views
commented
Aug 2, 2015
Set Theory & Algebra
set-theory&algebra
set-theory
+
–
3
answers
21
Can priority inversion be solved using sleep and wake approach and avoiding busy wait?
Can priority inversion be solved using sleep and wake approach and avoiding busy wait?
Can priority inversion be solved using sleep and wake approach and avoiding busy wait?
991
views
answered
Jul 30, 2015
DS
operating-system
process-synchronization
+
–
1
answer
22
Starvation is possible or not?
615
views
commented
Jul 28, 2015
Operating System
process-synchronization
+
–
3
answers
23
How to implement the given using only 2 semaphores?
520
views
answered
Jul 28, 2015
Operating System
semaphore
process-synchronization
+
–
2
answers
24
Bottom up and top down parser's ?
q. 23 : can anyone explain why both statements are false? I thought option B is correct?
q. 23 : can anyone explain why both statements are false? I thought option B is correct?
879
views
answered
Jul 26, 2015
Compiler Design
compiler-design
parsing
gateforum-test-series
+
–
1
answer
25
Postfix expression for the following image ?
q.26 : I do not understand the output . Why are real , integer and to coming?
q.26 : I do not understand the output . Why are real , integer and to coming?
557
views
answered
Jul 26, 2015
DS
data-structures
stack
infix-prefix
+
–
1
answer
26
Regular or Context Free Grammar?
Consider the following statement: if (expression) statement else statement Which of the following describe the above statement? A). Regular grammar B). Context free grammar C). Both (A) and (B) D). None of these
Consider the following statement:if (expression) statement else statement Which of the following describe the above statement?A). Regular grammarB). Context free grammarC...
1.8k
views
commented
Jul 26, 2015
Compiler Design
compiler-design
regular-grammar
context-free-grammar
+
–
3
answers
27
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
answer selected
Jul 23, 2015
Combinatory
combinatory
+
–
15
answers
28
GATE CSE 2015 Set 2 | Question: 40
The number of onto functions (surjective functions) from set $X = \{1, 2, 3, 4\}$ to set $Y=\{a,b,c\}$ is ______.
The number of onto functions (surjective functions) from set $X = \{1, 2, 3, 4\}$ to set $Y=\{a,b,c\}$ is ______.
19.5k
views
commented
Jul 21, 2015
Set Theory & Algebra
gatecse-2015-set2
set-theory&algebra
functions
normal
numerical-answers
+
–
5
answers
29
GATE CSE 2015 Set 1 | Question: 26
$\sum\limits_{x=1}^{99}\frac{1}{x(x+1)}$ = ______.
$\sum\limits_{x=1}^{99}\frac{1}{x(x+1)}$ = ______.
8.2k
views
commented
Jul 21, 2015
Combinatory
gatecse-2015-set1
combinatory
normal
numerical-answers
summation
+
–
16
answers
30
GATE CSE 2015 Set 3 | Question: 5
The number of $4$ digit numbers having their digits in non-decreasing order (from left to right) constructed by using the digits belonging to the set $\{1, 2, 3\}$ is ________.
The number of $4$ digit numbers having their digits in non-decreasing order (from left to right) constructed by using the digits belonging to the set $\{1, 2, 3\}$ is ___...
15.6k
views
commented
Jul 20, 2015
Combinatory
gatecse-2015-set3
combinatory
normal
numerical-answers
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register