Register
Filter

Answers by utk0203

0 votes
1
ISRO-DEC2017-54
A strictly binary tree with $10$ leaves cannot have more than $19$ nodes has exactly $19$ nodes has exactly $17$ nodes has exactly $20$ nodes
A strictly binary tree with $10$ leavescannot have more than $19$ nodeshas exactly $19$ nodeshas exactly $17$ nodeshas exactly $20$ nodes
2 votes
7
ME-test
The number of ways in which 4 boys and 3 girls can be seated in a row such that girls and boys are alternate is :: Answer given by ME is $4!*3! = 144$, but i think $\binom 5 3*4!*3!$ Should be correct.
The number of ways in which 4 boys and 3 girls can be seated in a row such that girls and boys are alternate is ::Answer given by ME is $4!*3! = 144$, but i think $\bino...
1 votes
8
GATE CSE 1988 | Question: 10ib
Consider the following grammar: $S \rightarrow S$ $S \rightarrow SS \mid a \mid \epsilon$ Indicate the shift-reduce and reduce-reduce conflict (if any) in the various states of the $\text{LR(0)}$ parser.
Consider the following grammar:$S \rightarrow S$$S \rightarrow SS \mid a \mid \epsilon$Indicate the shift-reduce and reduce-reduce conflict (if any) in the various states...
0 votes
9
Regular Languages
If L1 contains finite number of strings and L2 is a CFL then $L1\cap L2$ is ____ (A) Regular (B) CSL (C) CFL (D) None of these
If L1 contains finite number of strings and L2 is a CFL then $L1\cap L2$ is ____(A) Regular(B) CSL(C) CFL(D) None of these
0 votes
10
doubt
Which of the following is RE / NOT RE ? I.<M>|M is a TM that accepts all even numbers. II.<M>|M is a TM that does not accept all even numbers. II.<M>|M is a TM rejects all even numbers.
Which of the following is RE / NOT RE ?I.<M>|M is a TM that accepts all even numbers.II.<M>|M is a TM that does not accept all even numbers.II.<M>|M is a TM rejects all e...
1 votes
11
tm has more than 7 states
l = { <M> | M is a TM and M has more than 7 states } Is this decidable /undecidable/R.E /non R.e.??
l = { <M | M is a TM and M has more than 7 states }Is this decidable /undecidable/R.E /non R.e.??
0 votes
14
GATE CSE 1989 | Question: 4-vii
In the graph shown above, the depth-first spanning tree edges are marked with a $’ T’$. Identify the forward, backward, and cross edges.
In the graph shown above, the depth-first spanning tree edges are marked with a $’ T’$. Identify the forward, backward, and cross edges.
0 votes
15
MIT QUIZ
plz explain otherwise i ll memorize it..
plz explain otherwise i ll memorize it..
1 votes
16
MadeEasy Test Series: Programming & DS - Hashing
Suppose we used a hash function H(n) to hash ‘n’ distinct elements (keys) into an array T of length ‘m’. What is the expected number of colliding pairs of elements, if we used simple uniform hashing?
Suppose we used a hash function H(n) to hash ‘n’ distinct elements (keys) into an array T of length ‘m’. What is the expected number of colliding pairs of element...