Register
Filter

Answers by Raushank2

0 votes
1
turing machine
5 votes
2
ISRO-2017
Q.A strictly binary tree with 10 leaves A) cannot have more than 19 nodes B) has exactly 19 nodes C)has exactly 17 nodes D) has exactly 20 nodes
Q.A strictly binary tree with 10 leavesA) cannot have more than 19 nodesB) has exactly 19 nodesC)has exactly 17 nodesD) has exactly 20 nodes
3 votes
3
#DBMS What will be the Minimum Number of Tuples?
Say we have two relations R (a,b,c) and S (b,d,e). Now, R has 200 tuples and S has 300 tuples. What will be Minimum number of tuples when we do R ⋈ S ( ⋈ = Natural Join)?
Say we have two relations R (a,b,c) and S (b,d,e).Now, R has 200 tuples and S has 300 tuples. What will be Minimum number of tuples when we do R ⋈ S ( ⋈ = Natural Joi...
0 votes
4
programming
output?
output?
2 votes
5
test series
To merge two lists of size m and n, how many comparisons we need to perform in the worst case and best case respectively ? a) m+n-1 and m+n-1 b)m+n+1 and max(m,n) c)max(m,n) and min(m,n) d)m+n-1 and min(m,n) can someone give the worst case and best case with examples ?
To merge two lists of size m and n, how many comparisons we need to perform in the worst case and best case respectively ?a) m+n-1 and m+n-1b)m+n+1 and max(m,n)c)max(m,n)...
0 votes
6
GRAPH THEORY
Let G be an undirected graph on n nodes. Any two of the following statements implies the third. Is it true or False? 1. G is connected. 2. G doesn't have cycles. 3. G contain n-1 edges.
Let G be an undirected graph on n nodes. Any two of the following statements implies the third. Is it true or False?1. G is connected.2. G doesn't have cycles.3. G contai...
0 votes
8
Regular Language
Given two languages L1 = Φ and L2 = {a}. What is the representation of L1L2*UL1*?
Given two languages L1 = Φ and L2 = {a}. What is the representation of L1L2*UL1*?
1 votes
9
Computer Network
Can anyone explain both the question don't give any random answer
Can anyone explain both the question don't give any random answer
0 votes
11
TOC find the language generated by grammer
Find the language generated by grammar ,where S and A are non terminals and 0 is terminal S->0A A->0 | SS
Find the language generated by grammar ,where S and A are non terminals and 0 is terminal S->0AA->0 | SS
0 votes
12
TOC Grammer
S-> aSb What will the above grammar generates?Is it empty set?
S- aSbWhat will the above grammar generates?Is it empty set?
0 votes
13
Turing Decidable Languages
Are Turing decidable languages are closed under Complementation, Reversal, Homomorphism, Inverse Homomorphism and Substitution?
Are Turing decidable languages are closed under Complementation, Reversal, Homomorphism, Inverse Homomorphism and Substitution?
1 votes
14
Asymptotic time complexity
If f(n)=O(g(n)). && g(n) != O(f(n)) g(n) = O(h(n)). && h(n) = O(g(n)) Check following statement are true/false? 1. f(n)+h(n)=theta(g(n)) 2. f(n)*h(n)=theta(g(n)*h(n)) 3. g(n)*f(n)=big omega(h(n)*f(n)) 4. h(n)+g(n) = O(f(n))
If f(n)=O(g(n)). && g(n) != O(f(n))g(n) = O(h(n)). && h(n) = O(g(n))Check following statement are true/false?1. f(n)+h(n)=theta(g(n))2. f(n)*h(n)=theta(g(n)*h(n))3. g...
1 votes
15
TOC NFA
Is it possible to convert NFA with e-moves to NFA without e-moves ?I have read that using e-closure we can convert the NFA with e-moves to DFA.But can we also convert NFA with e-moves to NFA without e-moves?
Is it possible to convert NFA with e-moves to NFA without e-moves ?I have read that using e-closure we can convert the NFA with e-moves to DFA.But can we also convert NFA...
–1 votes
16
TOC CFL Language
Check if the following is CFL? {a^m b^n | (m/n)=10 } Can we do this with pda?
Check if the following is CFL?{a^m b^n | (m/n)=10 }Can we do this with pda?
0 votes
18
normalization
https://gateoverflow.in/?qa=blob&qa_blobid=6062310458167884954
https://gateoverflow.in/?qa=blob&qa_blobid=6062310458167884954
0 votes
19
digital logic
To implement a 5 bit binary adder, the minimum number of half adders required is ______________
To implement a 5 bit binary adder, the minimum number of half adders required is ______________
1 votes
20
Insertion Sort
How to get Time Complexity of finding the number of inversions in an array?
How to get Time Complexity of finding the number of inversions in an array?
0 votes
21
Optimal Merge Pattern
What will be the time complexity to obtain optimal merge pattern to merge files using greedy technique?
What will be the time complexity to obtain optimal merge pattern to merge files using greedy technique?
0 votes
22
Recurrance Relation-Recursion Tree
T(n) = T(n/3)+T(2n/3)+n What is the solution of Above Given recurrence relation? Give full method to solve this
T(n) = T(n/3)+T(2n/3)+n What is the solution of Above Given recurrence relation?Give full method to solve this
0 votes
23
Data Structures AVL Tree
Which sequence If inserted in AVL tree will cause No adjustment in tree? a) 1 2 3 4 5 b) 5 4 3 2 1 c) 3 2 4 1 5 d) 4 3 1 2 5
Which sequence If inserted in AVL tree will cause No adjustment in tree? a) 1 2 3 4 5 ...
1 votes
24
thegatebook
22) S1: A formula is valid iff its complement is not satisfiable S2: A formula is satisfiable iff its complement is not valid. Which statement is/are true? a) Only S1 b) Only S2 c) both S1 and S2 d) none
22) S1: A formula is valid iff its complement is not satisfiable S2: A formula is satisfiable iff its complement is not valid.Which statement is/are true? a) Only S1 ...
7 votes
25
GATE CSE 1994 | Question: 1.19, ISRO2016-31
Algorithm design technique used in quicksort algorithm is? Dynamic programming Backtracking Divide and conquer Greedy method
Algorithm design technique used in quicksort algorithm is?Dynamic programmingBacktrackingDivide and conquerGreedy method
1 votes
27
it's related to c programming input and output questions
4. Which of the following is not a valid variable name declaration and why? a) float PI = 3.14; b) double PI = 3.14; c) int PI = 3.14; d) #define PI 3.14
4. Which of the following is not a valid variable name declaration and why?a) float PI = 3.14;b) double PI = 3.14;c) int PI = 3.14;d) #define PI 3.14
1 votes
29
self doubt
Is IIITB better than IIITA for mtech (IT)?
Is IIITB better than IIITA for mtech (IT)?