Register
Filter

Answers by Angkit

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?
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$
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?
0 votes
13
test_Series
I think option c and d are exchanged
I think option c and d are exchanged
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...
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 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?
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?
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??
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
1 votes
22
signed
signed 1's compliment notation (-3)10 = ??
signed 1's compliment notation (-3)10 = ??
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...
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.
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
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
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
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 $...
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 ...
Page: