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
Answers by ♥_Less
3
votes
1
MadeEasy Test Series: Combinatory - Permutations And Combinations
MY SOLUTION : Fix the root then next level 2 elements ( 2! possibilities) next level 4 elements( 4! possibilities) last level 2 elements ( 2! possibilities) total possibility = 2! * 4! * 2! = 2 * 24 * 2 = 96 what ... that if node of above graph is filled with these elements it satisfies max heap property a)96 b)896 c)2688 d) none
MY SOLUTION :Fix the rootthen next level 2 elements ( 2! possibilities)next level 4 elements( 4! possibilities)last level 2 elements ( 2! possibilities)total possibility ...
3.8k
views
answered
Jan 25, 2018
Combinatory
combinatory
made-easy-test-series
+
–
4
votes
2
TEST SERIES
PLZ EXPLAIN?
PLZ EXPLAIN?
509
views
answered
Jan 25, 2018
DS
data-structures
binary-heap
numerical-answers
made-easy-test-series
+
–
0
votes
3
MADE EASY TEST SERIES
Consider a clocked sequential circuit as shown in the figure below. Assuming initial state to be Q1 Q0 = 00 For an input sequence X = 1010, the respective output sequence will be _______.
Consider a clocked sequential circuit as shown in the figure below. Assuming initial state to be Q1 Q0 = 00For an input sequence X = 1010, the respective output sequence ...
2.3k
views
answered
Dec 14, 2017
0
votes
4
Grammars
HI Mates, Is it true or false..? If yes or no please explain..? Every Regular set has a LR(1) Grammar....?
HI Mates, Is it true or false..? If yes or no please explain..?Every Regular set has a LR(1) Grammar....?
321
views
answered
Nov 30, 2017
Theory of Computation
theory-of-computation
grammar
+
–
0
votes
5
Self doubt in TOC
Suppose in question we are given the language is Turing Recognizable , can I consider it a CFL or Regular?
Suppose in question we are given the language is Turing Recognizable , can I consider it a CFL or Regular?
863
views
answered
Nov 30, 2017
Theory of Computation
theory-of-computation
regular-language
decidability
context-free-language
turing-machine
+
–
1
votes
6
Self doubt in decidability in TOC
Suppose in question we are given the language is Turing Decidable , can I consider it a CFL or Regular?
Suppose in question we are given the language is Turing Decidable , can I consider it a CFL or Regular?
652
views
answered
Nov 29, 2017
Theory of Computation
theory-of-computation
regular-language
decidability
turing-machine
+
–
1
votes
7
TOC closure property doubt
If a language L1 is given as anbn and L2 is given as {a,b}* , then the language L1 - L2 will be : regular or CFL and why ? My doubt is that since L2 is a regular language and L1 is CFL and L2 will contain all strings in L1, so ... ). Complement of regular is regular and intersection of CFL with regular is closed and the language will be CFL. Which one is right and why ?
If a language L1 is given as anbn and L2 is given as {a,b}* , then the language L1 - L2 will be : regular or CFL and why ?My doubt is that since L2 is a regular language...
557
views
answered
Nov 29, 2017
Theory of Computation
theory-of-computation
closure-property
context-free-language
regular-language
+
–
2
votes
8
Fragmentation
Which of the following statements is/ are true about the fragmentation which is done at network layer. (I) The offset of 1st fragment is always offset of parent. (II) The MF of last fragment is always same MF of parent. I think I is true and II is false: Explanation for II :- Host ... MF = 1 packet 1.3 <20,40> MF = 0 packet 1.3's MF != MF of packet 1 In A-R1. is it correct.
Which of the following statements is/ are true about the fragmentation which is done at network layer.(I) The offset of 1st fragment is always offset of parent.(II) The M...
3.8k
views
answered
Nov 16, 2017
Computer Networks
computer-networks
fragmentation
network-layering
+
–
0
votes
9
2's complement addition of two negative numbers
Please give me an example of adding two negative numbers using 2's complement number system. Let's say: -7 + (-6)
Please give me an example of adding two negative numbers using 2's complement number system.Let's say:-7 + (-6)
3.9k
views
answered
Oct 7, 2017
Digital Logic
digital-logic
turing-machine
theory-of-computation
number
+
–
0
votes
10
TURING MACHINE
1.4k
views
answered
Oct 7, 2017
Theory of Computation
theory-of-computation
turing-machine
+
–
4
votes
11
Ace Test Series 2018: Compiler Design - Parsing
Consider the following context-free grammar S → SS + | SS*| a It is a)LL(1) b)LR(0) c)Both d)none
Consider the following context-free grammarS → SS + | SS*| aIt isa)LL(1)b)LR(0)c)Bothd)none
1.9k
views
answered
Oct 3, 2017
Compiler Design
theory-of-computation
ace-test-series
compiler-design
parsing
lr-parser
ll-parser
+
–
5
votes
12
token count for shorthand operators
How many tokens are there in the following statement: x >> = 2; In general, are shorthand operators counted as a single token as ">>=" or double as ">>" and "=". Or anything else?
How many tokens are there in the following statement:x > = 2; In general, are shorthand operators counted as a single token as ">>=" or double as ">>" and "=". Or anythin...
1.3k
views
answered
Oct 2, 2017
Compiler Design
compiler-tokenization
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
