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 Anjan
0
votes
1
answer
1
Minimal DFA
Minimum states if L is Language that accepts (a+b)* (aaa+aab) are ____ My ans : 4 states given ans : 5 states
Minimum states if L is Language that accepts (a+b)* (aaa+aab) are ____My ans : 4 states given ans : 5 states
1.9k
views
asked
Jan 31, 2018
Theory of Computation
theory-of-computation
minimal-state-automata
+
–
2
votes
0
answers
2
#Practise Class of Languages
$xwxw^r |\ w,x \in (a,b)^*$ $wxw^{r}x |\ w,x \in (a,b)^*$
$xwxw^r |\ w,x \in (a,b)^*$$wxw^{r}x |\ w,x \in (a,b)^*$
367
views
asked
Jan 31, 2018
Theory of Computation
theory-of-computation
regular-language
+
–
3
votes
0
answers
3
ER diagram
Minimum number of tables required for above diagram ________
Minimum number of tables required for above diagram ________
1.7k
views
asked
Jan 30, 2018
Databases
databases
er-diagram
+
–
0
votes
0
answers
4
DS001
In an weighted, directed connected graph, the shortest path between every pair of nodes in graph is computed most efficiently in terms of running time complexity, is given by which of the following algorithm? a)DFS algorithm b)Dijkstra’s algorithm c)Bellman-ford algorithm d)Floyd-Warshall algorithm
In an weighted, directed connected graph, the shortest path between every pair of nodes in graph is computed most efficiently in terms of running time complexity, is give...
1.3k
views
asked
Jan 30, 2018
Programming in C
data-structures
+
–
1
votes
0
answers
5
Compiler001
: Attribute evaluation can be done in LR parsing. (T/F) Synthesized attributes can be evaluated by _________ Inherited attributes are evaluate by _________
:Attribute evaluation can be done in LR parsing. (T/F) Synthesized attributes can be evaluated by _________Inherited attributes are evaluate by _________
410
views
asked
Jan 26, 2018
Compiler Design
compiler-design
+
–
5
votes
0
answers
6
r's complement practise
10's complement of $5690$ 10's complement of $(5690)_8$ 8's complement of $(6250)_8$ 8's complement of $(6250)_{16}$
10's complement of $5690$10's complement of $(5690)_8$8's complement of $(6250)_8$8's complement of $(6250)_{16}$
1.3k
views
asked
Jan 26, 2018
Digital Logic
digital-logic
number-representation
+
–
1
votes
0
answers
7
#toc001
Both the languages have x,y belongs {0,1} then what type of languages are both L1={x ∣x has an equal number of a's and b's} L2={xy | #a's in x = #b's in y} For L1 i think it is CFL , on a's push onto the stack on seeing b pop from stack, finally stack empty accept the lang. For L2 how to find middle of string where x is ending and y is starting....??
Both the languages have x,y belongs {0,1} then what type of languages are both L1={x ∣x has an equal number of a's and b's}L2={xy | #a's in x = #b's in y}For L1 i thin...
238
views
asked
Jan 25, 2018
Theory of Computation
theory-of-computation
identify-class-language
+
–
2
votes
0
answers
8
Digital001
Above circuit acts as 1)D FF 2)T FF
Above circuit acts as 1)D FF 2)T FF
269
views
asked
Jan 25, 2018
Digital Logic
digital-logic
+
–
2
votes
1
answer
9
Limits
Find the value of above limit. How to approach with this type of infinity power infinity problems ?? im thinking like first we should convert this to 1 power infinity problem and then solve?? is it correct ?? please solve above que
Find the value of above limit.How to approach with this type of infinity power infinity problems ??im thinking like first we should convert this to 1 power infinity prob...
634
views
asked
Jan 25, 2018
Mathematical Logic
calculus
limits
engineering-mathematics
+
–
1
votes
0
answers
10
#SSA001
The minimum number of temporary variables to convert it into SSA is _________. a + b × c + d – e – a + b × c Assume order of precedence from highest to lowest as: ×, + and –. Consider associativity for + and × are not important but – is left associative. My ans : 5
The minimum number of temporary variables to convert it into SSA is _________.a + b × c + d – e – a + b × cAssume order of precedence from highest to lowest as: ×,...
507
views
asked
Jan 25, 2018
Compiler Design
static-single-assignment
+
–
2
votes
1
answer
11
#combinatorics
In how many different ways can a set A of 3n elements be partitioned into 3 subsets of equal number of elements? My approach : The number of permutations of n objects with n1 identical objects of type 1, n2 identical objects of type 2, , and n3 identical objects of type is n!/n1!n2 ... )!/6* (n!)^3 How did again 6 come in denominator , why is he arranging again in 6 i..e., 3! ways ??
In how many different ways can a set A of 3n elements be partitioned into 3 subsets of equal number of elements?My approach :The number of permutations of n objects with...
426
views
asked
Jan 25, 2018
Mathematical Logic
combinatory
discrete-mathematics
+
–
2
votes
1
answer
12
SOP and POS
Consider the following kmap minimum number of NAND/NOR gates to implement the above kmap.
Consider the following kmap minimum number of NAND/NOR gates to implement the above kmap.
1.1k
views
asked
Jan 21, 2018
Digital Logic
digital-logic
k-map
+
–
1
votes
0
answers
13
DCFL01
What is DCFL U Regular ? Every Regular lang is DCFL , That means DCFL U DCFL = not DCFL ? since DCFL's are not closed under union
What is DCFL U Regular ?Every Regular lang is DCFL ,That means DCFL U DCFL = not DCFL ?since DCFL's are not closed under union
367
views
asked
Jan 19, 2018
Theory of Computation
theory-of-computation
dcfl
+
–
1
votes
0
answers
14
Compiler01
True/false: 1)There exists a LL(1) grammar for every regular language. 2)If grammar is Left and Right Recusirve , then it is ambiguous. My Ans: 1)If regular lang is ambiguous,then it can't be LL(1) ... 2)Not sure
True/false:1)There exists a LL(1) grammar for every regular language.2)If grammar is Left and Right Recusirve , then it is ambiguous. My Ans:1)If regular lang is ambiguou...
325
views
asked
Jan 18, 2018
Compiler Design
compiler-design
+
–
1
votes
1
answer
15
BST01
In deleting the root element of a BST, we have to replace root with _________ a)Inorder successor b)Inorder predecessor c)Both a and b
In deleting the root element of a BST, we have to replace root with _________a)Inorder successorb)Inorder predecessorc)Both a and b
362
views
asked
Jan 17, 2018
DS
data-structures
binary-search-tree
+
–
1
votes
0
answers
16
Programming01
Consider below code My ans : mech,g,mech Given ans : mech,g,civil third printf statement is somwhat confusing .. please explain
Consider below code My ans : mech,g,mech Given ans : mech,g,civilthird printf statement is somwhat confusing ..please explain
313
views
asked
Jan 17, 2018
Programming in C
programming-in-c
pointers
+
–
2
votes
1
answer
17
Digital01
MOD Value ? FF clears at $Q_{3}Q_{2}Q_{1}$ = 110 So mod value is 6 ...??
MOD Value ?FF clears at $Q_{3}Q_{2}Q_{1}$ = 110 So mod value is 6 ...??
978
views
asked
Jan 17, 2018
Digital Logic
digital-logic
digital-counter
+
–
1
votes
0
answers
18
Linear Algebra
If $I$ is the unit matrix of order $n$ , where $k!=0$ is a constant then $adj \ kI$ is
If $I$ is the unit matrix of order $n$ , where $k!=0$ is a constant then $adj \ kI$ is
471
views
asked
Jan 11, 2018
Linear Algebra
engineering-mathematics
linear-algebra
+
–
2
votes
0
answers
19
Counter
Find the Mod Value for the counter My ans is MOD-5 counter but given is MOD-3 please explain ....
Find the Mod Value for the counter My ans is MOD-5 counter but given is MOD-3 please explain ....
773
views
asked
Jan 10, 2018
Digital Logic
digital-logic
digital-counter
+
–
1
votes
0
answers
20
#of BST
Find number of BST's possible with 6 nodes numbered 1,2,3,4,5 and 6 having 6 as root and height of 4 ? please explain in detail ...
Find number of BST's possible with 6 nodes numbered 1,2,3,4,5 and 6 having 6 as root and height of 4 ?please explain in detail ...
335
views
asked
Jan 9, 2018
DS
data-structures
binary-search-tree
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register