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 Magma
0
votes
0
answers
1
MadeEasy Subject Test 2019: Theory of Computation - Finite Automata
Consider the following NFA M , over the alphabet {a} let L(M) be the language accepted by the NFA M . let $M'$ ... $L (M' ) - L(M)) = phi$ $L (M' ) \cup L(M)) = phi$
Consider the following NFA M , over the alphabet {a}let L(M) be the language accepted by the NFA M . let $M'$ denote the machine obtained by the final and non final sta...
540
views
asked
Jan 15, 2019
Theory of Computation
theory-of-computation
finite-automata
made-easy-test-series
+
–
0
votes
0
answers
2
MadeEasy Full Length Test 2018: Graph Theory - Counting
The Number of Labelled possible graph given below ? what I did was → we doesn't remove any of the edge out of 4 = $\binom{4}{0}$ [Because a Graph is sub-graph of itself] we can remove any of one edge out of 4 = $\binom{4}{1}$ we can remove any ... out of 4 = $\binom{4}{2}$ similarly , $\binom{4}{3}$ , $\binom{4}{4 }$ then , add of the them
The Number of Labelled possible graph given below ? what I did was →we doesn’t remove any of the edge out of 4 = $\binom{4}{0}$ [Because a Graph is sub-graph of ...
811
views
asked
Jan 15, 2019
Graph Theory
graph-theory
discrete-mathematics
counting
made-easy-test-series
+
–
0
votes
0
answers
3
MadeEasy Subject Test 2019: Digital Logic - Booths Algorithm
Consider the following 8 bit multiplication process (-121) X (-113) . What is the recorded multiplier in the multiplication.
Consider the following 8 bit multiplication process (-121) X (-113) . What is the recorded multiplier in the multiplication.
1.7k
views
asked
Jan 15, 2019
Digital Logic
digital-logic
booths-algorithm
made-easy-test-series
+
–
0
votes
0
answers
4
MadeEasy Subject Test 2019: Digital Logic - Digital Counter
Initially all flips-flops in the circuit are cleared to zero , what is the mod value of the counter ___________ I got – > 3 sorry for the poor image quality
Initially all flips-flops in the circuit are cleared to zero , what is the mod value of the counter ___________I got – 3 sorry for the poor image quality
654
views
asked
Jan 14, 2019
Digital Logic
digital-logic
digital-counter
made-easy-test-series
+
–
0
votes
0
answers
5
MadeEasy Test Series 2019: Probability - Probability
Number of ways we can distribute 5 red balls , 5 white balls and 5 blue balls into 3 different boxes ?
Number of ways we can distribute 5 red balls , 5 white balls and 5 blue balls into 3 different boxes ?
580
views
asked
Jan 14, 2019
Probability
probability
engineering-mathematics
made-easy-test-series
+
–
0
votes
0
answers
6
Compiler Designing
Which of the following features cannot captures by CFG ? Syntax of if – then- else statement Whether the variable is declared before its use Matching nested parenthesis None of these
Which of the following features cannot captures by CFG ? Syntax of if – then- else statementWhether the variable is declared before its useMatching nested parenthesisN...
283
views
asked
Jan 9, 2019
Compiler Design
compiler-design
+
–
3
votes
0
answers
7
TOC Doubt
Every undecidable language is not recognized by TM ?? Statement is True / False
Every undecidable language is not recognized by TM ??Statement is True / False
499
views
asked
Jan 9, 2019
Theory of Computation
theory-of-computation
+
–
0
votes
0
answers
8
ACE_DOUBT
Help me in this ….
Help me in this ….
491
views
asked
Jan 9, 2019
Databases
ace-test-series
+
–
0
votes
1
answer
9
CO DOUBT
Certain CPU uses expanding op-code . It has 16 bit instructions with 6-bit addresses . It has maximum 192 one-address Instructions. Then number of 2-addresses instructions are supported by the system is __________________
Certain CPU uses expanding op-code . It has 16 bit instructions with 6-bit addresses . It has maximum 192 one-address Instructions.Then number of 2-addresses instructions...
376
views
asked
Jan 8, 2019
CO and Architecture
co-and-architecture
instruction-format
+
–
1
votes
1
answer
10
Probability
Suppose we want to pick two numbers from {1,2……,100} randomly . The probability that sum of the two numbers is divisible by 5 is _________________
Suppose we want to pick two numbers from {1,2……,100} randomly . The probability that sum of the two numbers is divisible by 5 is _________________
2.7k
views
asked
Jan 8, 2019
Probability
probability
+
–
0
votes
0
answers
11
Self Doubt
Which of the following parser resolves the shift over reduce conflict ??
Which of the following parser resolves the shift over reduce conflict ??
247
views
asked
Jan 8, 2019
Compiler Design
compiler-design
+
–
0
votes
0
answers
12
Graph_Self Doubt
Let G be a simple graph with 11 vertices . if degree of each vertex is atleast 3 and atmost 5 , then the number of edges in G should lie between I got 16 and 28
Let G be a simple graph with 11 vertices . if degree of each vertex is atleast 3 and atmost 5 , then the number of edges in G should lie between I got 16 and 28
1.2k
views
asked
Jan 8, 2019
Graph Theory
discrete-mathematics
+
–
0
votes
0
answers
13
MadeEasy Test Series: Digital Logic - Flip Flop
359
views
asked
Jan 2, 2019
Digital Logic
made-easy-test-series
flip-flop
digital-logic
+
–
1
votes
0
answers
14
MadeEasy Test Series: Digital Logic - Flip Flop
A traffic signal cycles from RED to YELLOW, YELLOW to GREEN and GREEN to RED. In each cycle RED is turned for 100 seconds, YELLOW is turned for 40 seconds and GREEN is turned for 80 seconds. The traffic has to be implemented using FSM. The only input to ... >0 >1 → ..->7 3 different states → no of flip flops required = 2 4+ 2 = 6 FF required
A traffic signal cycles from RED to YELLOW, YELLOW to GREEN and GREEN to RED. In each cycle RED is turned for 100 seconds, YELLOW is turned for 40 seconds and GREEN is tu...
1.5k
views
asked
Jan 2, 2019
Digital Logic
made-easy-test-series
flip-flop
digital-logic
+
–
0
votes
0
answers
15
MADE_EASY
The Counter is .. Decade counter Asynchronous counter johnson counter Ring counter My question is there’s any easy to solve such type of question ?? of I have to just by-hearted the wave-forms ??
The Counter is ..Decade counter Asynchronous counterjohnson counterRing counter My question is there’s any easy to solve such type of question ??of I have to just by-h...
323
views
asked
Jan 2, 2019
Digital Logic
made-easy-test-series
+
–
0
votes
0
answers
16
DOUBT ON MINIMAL SPANNING TREE
II. if an edge (u,v) is contained in some minimum spanning tree, then it is a light edge crossing some cut of the graph. III. If (u,v) is a light edge connecting CC(connected component) to some other component in the forest of graph ... spanning tree. didn't understand the part light edge crossing some cut of the graph can someone explain me with the diagram ??
II. if an edge (u,v) is contained in some minimum spanning tree, then it is a light edge crossing some cut of the graph.III. If (u,v) is a light edge connecting CC(conne...
533
views
asked
Dec 28, 2018
Algorithms
self-doubt
minimum-spanning-tree
+
–
0
votes
1
answer
17
Testbook Test Series: Algorithms - Recurrence
…………………………..
…………………………..
653
views
asked
Dec 27, 2018
Algorithms
testbook-test-series
algorithms
recurrence-relation
+
–
0
votes
1
answer
18
Testbook Test Series: Programming & DS - Hashing
How to solve such kind of questions ? Can anybody tell what's is the concept behind this ?? someone provide me link so that I read it and understand the actual concept
How to solve such kind of questions ? Can anybody tell what's is the concept behind this ?? someone provide me link so that I read it and understand the actual concept
519
views
asked
Dec 27, 2018
DS
testbook-test-series
data-structures
hashing
+
–
1
votes
0
answers
19
TestBook_P&DS
The following C function takes two ASCII strings and determines whether one is an anagram of the other. An anagram of a string s is a string obtained by permuting the letters in s. int anagram (char *a, char *b){ int count [128], j; for (j = 0; j < 128; j++) count[j]=0; j = 0; while (a[ ... [j]]++ 3 A: count [a[j++]]++ and B: count[b[j]]-- 4 A: count[a[j]]++ and B: count [b[j++]]--
The following C function takes two ASCII strings and determines whether one is an anagram of the other. An anagram of a string s is a string obtained by permuting the let...
459
views
asked
Dec 26, 2018
Programming in C
testbook-test-series
+
–
0
votes
1
answer
20
Testbook Test Series: Programming & DS - Programming In C
Please someone explain me properly
Please someone explain me properly
587
views
asked
Dec 26, 2018
Programming in C
testbook-test-series
programming
programming-in-c
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register