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 Angkit
0
votes
1
How to find missing integer from an array on n elements
279
views
answered
Jun 14, 2018
Algorithms
algorithm-design
+
–
0
votes
2
algorithm
In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown as x/yx/y, where x is discovery time stamp and y is finishing time stamp It shows which of the following depth first forest? {a,b,e} {c,d,f,g,h} {a,b,e} {c,d,h} {f,g} {a,b,e} {f,g} {c,d} {h} {a,b,c,d} {e,f,g} {h}
In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown as x/yx/y, where x is discovery time stamp and y is finishin...
2.3k
views
answered
May 10, 2018
Algorithms
depth-first-search
graph-algorithms
graph-search
+
–
0
votes
3
Peter Linz Edition 4 Exercise 2.1 Question 21 (Page No. 48)
Let L be the language accepted by the automaton $L = ${$(a^{n})b:n≥0$}. Find a dfa that accepts the language $L^{2} - L$.
Let L be the language accepted by the automaton $L = ${$(a^{n})b:n≥0$}. Find a dfa that accepts the language $L^{2} - L$.
766
views
answered
May 5, 2018
Theory of Computation
theory-of-computation
regular-language
peter-linz
peter-linz-edition4
finite-automata
grammar
+
–
1
votes
4
IISc CDS (MTech-R)
Number of distinct simple graphs possible, given 8 vertices and not considering self loops?
Number of distinct simple graphs possible, given 8 vertices and not considering self loops?
821
views
answered
May 3, 2018
Graph Theory
iisc
cds
mtechr
graph-theory
written-test
+
–
0
votes
5
Can there be more than one action associated with the production in a syntax directed translation ?
In SDT , can there be more than one action associated since we can have more than one semantic rule associated with a production so can we have more than one semantic action as well ?
In SDT , can there be more than one action associated since we can have more than one semantic rule associated with a production so can we have more than one semantic act...
730
views
answered
Apr 18, 2018
Compiler Design
compiler-design
syntax-directed-translation
+
–
4
votes
6
what is the difference between the flow control mechanism provided by data link layer and transport layer ?
1.3k
views
answered
Apr 15, 2018
Computer Networks
computer-networks
transport-layer
+
–
1
votes
7
GATE CSE 2008 | Question: 5
In the Karnaugh map shown below, $X$ denotes a don’t care term. What is the minimal form of the function represented by the Karnaugh map? $\bar{b}.\bar{d} + \bar{a}.\bar{d}$ $\bar{a}.\bar{b} + \bar{b}.\bar{d} + \bar{a}.b.\bar{d}$ $\bar{b}.\bar{d} + \bar{a}.b.\bar{d}$ $\bar{a}.\bar{b} + \bar{b}.\bar{d} + \bar{a}.\bar{d}$
In the Karnaugh map shown below, $X$ denotes a don’t care term. What is the minimal form of the function represented by the Karnaugh map?$\bar{b}.\bar{d} + \bar{a}.\bar...
7.1k
views
answered
Mar 27, 2018
Digital Logic
gatecse-2008
digital-logic
k-map
easy
+
–
0
votes
8
test_series
why A 3NF table which does not have multiple overlapping candidate keys is said to be in BCNF? https://dba.stackexchange.com/questions/81310/what-exactly-is-overlapping-candidate-key https://gateoverflow.in/150945/normal-form I read above two links , They went bouncer. ... in BCNF because E is not S.K. But how can Overlapping of ABC & ACE stopping this relation from becoming BCNF ?
why A 3NF table which does not have multiple overlapping candidate keys is said to be in BCNF?https://dba.stackexchange.com/questions/81310/what-exactly-is-overlapping-ca...
794
views
answered
Mar 17, 2018
Databases
databases
database-normalization
+
–
4
votes
9
Averages
The average of $20$ numbers is zero.Of them, at the most, how many may be greater than zero? $10$ $19$ $17$ $9$
The average of $20$ numbers is zero.Of them, at the most, how many may be greater than zero?$10$$19$$17$$9$
1.3k
views
answered
Mar 5, 2018
Quantitative Aptitude
quantitative-aptitude
averages
+
–
3
votes
10
Birthday Paradox
There are 60 persons in a room.We have choosen 10 person at random. What is the probability that exactly 2 person among them have same birthday?
There are 60 persons in a room.We have choosen 10 person at random. What is the probability that exactly 2 person among them have same birthday?
741
views
answered
Mar 2, 2018
Probability
probability
birthday
+
–
1
votes
11
Regular language
Is L2 regular?
Is L2 regular?
336
views
answered
Mar 2, 2018
Theory of Computation
theory-of-computation
regular-language
finite-automata
+
–
1
votes
12
Doubt regarding deletion from a B-tree
After deleting an element from a B-tree,I could rearrange the tree in several ways,that would still complies to the rules of B-trees.But,we are supposed to follow a certain set of rules for rearranging the tree after deleting an element. Why is that ?
After deleting an element from a B-tree,I could rearrange the tree in several ways,that would still complies to the rules of B-trees.But,we are supposed to follow a certa...
470
views
answered
Mar 2, 2018
Databases
databases
b-tree
descriptive
+
–
0
votes
13
test_Series
I think option c and d are exchanged
I think option c and d are exchanged
274
views
answered
Mar 2, 2018
0
votes
14
TIFR CSE 2015 | Part B | Question: 6
Let $B$ consist of all binary strings beginning with a $1$ whose value when converted to decimal is divisible by $7$. $B$ can be recognized by a deterministic finite state automaton. $B$ can be recognized by a non-deterministic ... not by a deterministic push-down automaton. $B$ cannot be recognized by any push down automaton, deterministic or non-deterministic.
Let $B$ consist of all binary strings beginning with a $1$ whose value when converted to decimal is divisible by $7$.$B$ can be recognized by a deterministic finite state...
2.0k
views
answered
Feb 13, 2018
Theory of Computation
tifr2015
theory-of-computation
regular-language
+
–
0
votes
15
test series
Non-deterministic turing machine, with writing capability is equivalent to. Non-deterministic Push down automata Deterministic Push down automata Finite automata Linear bounded automata
Non-deterministic turing machine, with writing capability is equivalent to. Non-deterministic Push down automata Deterministic Push down automata Finite automata Linear...
261
views
answered
Feb 10, 2018
0
votes
16
Classification of compound propositions
One way of classification of compound prepositions on the basis of their truth values as per Kenneth H Rosen is Tautology Contradiction Contingency Then in which classification validity and satisfiability are used?
One way of classification of compound prepositions on the basis of their truth values as per Kenneth H Rosen is TautologyContradictionContingency Then in which classifica...
1.0k
views
answered
Feb 10, 2018
Mathematical Logic
propositional-logic
+
–
1
votes
17
top down parsing
why top down parser uses left most derivation? is it mandatory or we can change it by modifying the algo?
why top down parser uses left most derivation? is it mandatory or we can change it by modifying the algo?
457
views
answered
Feb 10, 2018
Compiler Design
compiler-design
parsing
descriptive
+
–
3
votes
18
1.Programming
int main() { char str[10]="GATE2018"; int length=strlen(str); str[length]='\0'; for(i=0;str[i];i++) printf("%c",str[i]); return 0; } Find the output?
int main() { char str[10]="GATE2018"; int length=strlen(str); str[length]='\0'; for(i=0;str[i];i++) printf("%c",str[i]); return 0; }Find the output?
449
views
answered
Oct 17, 2017
Programming in C
programming-in-c
programming
+
–
0
votes
19
computer programing book arihant
i=0; j=--i ; printf( i++ + --i + i-- + j-- + --i + i); the output??
i=0;j= i ;printf( i++ + i + i + j + i + i);the output??
248
views
answered
Oct 11, 2017
Programming in C
programming-in-c
+
–
1
votes
20
self_doubt #what is the meaning of this symbole
323
views
answered
Oct 11, 2017
Mathematical Logic
self-doubt
+
–
0
votes
21
self doubt general
ARE MORNING AND AFTERNOON SLOT SELECTION IN OUR HANDS IN GATE EXAM OR THEY WILL SELECT IT FOR US ? WHEN WILL WE COME TO KNOW
ARE MORNING AND AFTERNOON SLOT SELECTION IN OUR HANDS IN GATE EXAM OR THEY WILL SELECT IT FOR US ?WHEN WILL WE COME TO KNOW
424
views
answered
Oct 10, 2017
Written Exam
general
+
–
1
votes
22
signed
signed 1's compliment notation (-3)10 = ??
signed 1's compliment notation (-3)10 = ??
447
views
answered
Oct 10, 2017
0
votes
23
Regular expressions
Are regular expressions (a+b)* and (a*b*)* over alphabet set {a,b} same? If not, which strings are acceptable in one and not in other...
Are regular expressions (a+b)* and (a*b*)* over alphabet set {a,b} same?If not, which strings are acceptable in one and not in other...
639
views
answered
Sep 30, 2017
Theory of Computation
theory-of-computation
regular-expression
+
–
1
votes
24
PRECEDENCE GRAPH
I am getting answer 3 if i am wrong please let me correct.
I am getting answer 3 if i am wrong please let me correct.
400
views
answered
Jun 21, 2017
0
votes
25
FA with complement
Consider this FA: How many strings will be there in the complement of the language accepted by this Finite Automata? (a) Infinite (b) 2 (c) 3 (d) 0
Consider this FA:How many strings will be there in the complement of the language accepted by this Finite Automata?(a) Infinite(b) 2(c) 3(d) 0
2.0k
views
answered
Jun 20, 2017
4
votes
26
stack
how many stack are require to implement a queue ??????????????? how many queue are require to implement a stack????????????????????? explain plz
how many stack are require to implement a queue ???????????????how many queue are require to implement a stack????????????????????? explain plz
573
views
answered
Jun 20, 2017
DS
stack
+
–
2
votes
27
Loop Invariant -CLR
What is loop invariant in general term ? PS: Insertion Sort has loop invariant . We have three things in loop invariant : a. Initialization b.Maintenance c.Termination
What is loop invariant in general term ? PS: Insertion Sort has loop invariant . We have three things in loop invariant :a. Initializationb.Maintenancec.Termination
859
views
answered
Jun 19, 2017
Algorithms
algorithms
loop-invariants
+
–
8
votes
28
Self doubt in Binary search Algo
The average successful search time taken by binary search on a sorted array of $10$ items? $2.6$ $2.7$ $2.8$ $2.9$ Answer is $2.9$ My doubt:- But when I am using $log_2n$ for $n = 10$ it is not equal to $2.9$, and $log_210 = 3.3219$ ?
The average successful search time taken by binary search on a sorted array of $10$ items?$2.6$$2.7$$2.8$$2.9$Answer is $2.9$My doubt:- But when I am using $log_2n$ for $...
11.2k
views
answered
Jun 6, 2017
Algorithms
algorithms
binary-search
time-complexity
+
–
0
votes
29
K map minimization and Dont cares
It might be silly thing, but I am confused here, In K-Map minimization, suppose there are don't care terms. When we want to get minimal SOP, we assume don't care to be 1 and will get the switching expression. Suppose for the same ... separately for SOP and POS. Don't care terms which are used to get SOP are not used to get POS and vice-versa.
It might be silly thing, but I am confused here,In K-Map minimization, suppose there are don't care terms. When we want to get minimal SOP, we assume don't care to be 1 a...
778
views
answered
May 31, 2017
Digital Logic
digital-logic
k-map
+
–
3
votes
30
BFS algorithm simple question
BFS algo is applied on graph as well as Binary tree. So, is it different for both graph and Binary tree? As on youtube some people showing BFS on graph and some on Binary tree. Kindly clarify, thanks!
BFS algo is applied on graph as well as Binary tree. So, is it different for both graph and Binary tree?As on youtube some people showing BFS on graph and some on Binary ...
960
views
answered
May 29, 2017
Algorithms
algorithms
breadth-first-search
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register