Register
Filter

Answers by joshi_nitish

0 votes
61
Algorithms
what is the maximum difference between height of two nodes of AVL tree a.1 b.2 c.3 d.none
what is the maximum difference between height of two nodes of AVL treea.1b.2c.3d.none
0 votes
62
Programming And DS
#include<stdio.h> void foo(int*) int main() { int i=10; foo((&i)++); } void foo(int*p) { printf(%d\n",*p); } A)10 B)Some garbage value C) Compile time Error D)Segmentation Fault/Code Crash
#include<stdio.h void foo(int*) int main() { int i=10; foo((&i)++); } void foo(int*p) { printf(%d\n",*p); }A)10 B)Some garbage value C) Compile time Error D)Segmentat...
1 votes
63
maths
In how many ways three girls and nine boys can be seated int two vans each having numbered seats ,3 in the front and and 4 at the back ? How many arrangements are possible if 3 girls sit together in back row on adjacent seats?
In how many ways three girls and nine boys can be seated int two vans each having numbered seats ,3 in the front and and 4 at the back ?How many arrangements are possible...
0 votes
64
nptel exam ada
Total no of edges =1225 Maximum degree of vertex =3 find no of vertices ?
Total no of edges =1225Maximum degree of vertex =3find no of vertices ?
0 votes
66
ISRO2017-15
Which one of the following in-place sorting algorithms needs the minimum number of swaps? Insertion Sort Quick Sort Heap Sort Selection Sort
Which one of the following in-place sorting algorithms needs the minimum number of swaps?Insertion SortQuick SortHeap SortSelection Sort
0 votes
67
ISRO2017-49
The number of swappings needed to sort the numbers $8 , 22, 7, 9, 31, 5, 13$ in ascending order using bubble sort is $11$ $12$ $13$ $10$
The number of swappings needed to sort the numbers $8 , 22, 7, 9, 31, 5, 13$ in ascending order using bubble sort is$11$$12$$13$$10$
0 votes
68
keneth r rosen
WHAT IS DNF Disjunctive normal form IN BOOLEAN ALGEBRA?
WHAT IS DNF Disjunctive normal form IN BOOLEAN ALGEBRA?
1 votes
69
Minimization of DFA
DFA for Every 'a' followed by 'b'. The second one is correct but I want to know if the first one is correct or not? If not please share an example.
DFA for Every 'a' followed by 'b'. The second one is correct but I want to know if the first one is correct or not? If not please share an example.
1 votes
70
Consider the following grammar. How many back tracks are required to generate the string aab from the above grammar?
Consider the following grammar. How many back tracks are required to generate the string aab from the above grammar?S → aB | aAbA → bAb | aB → aB | ε
0 votes
73
Discrete Mathematics Thegatebook
22)Which one is the correct S1: A formula is valid iff its complement is not satisfiable S2: A formula is satisfiable iff its complement is not valid. a) Only S1 b) Only S2 c) both S1 and S2 d) none
22)Which one is the correctS1: A formula is valid iff its complement is not satisfiableS2: A formula is satisfiable iff its complement is not valid.a) Only S1 b) Only S2 ...
0 votes
75
Gate 2010,,Quetion number 26,,
Torque exerted on a flywheel over a cycle is listed in the table .flywheel energy (in j per unit cycle) using simpson's rule is
Torque exerted on a flywheel over a cycle is listed in the table .flywheel energy (in j per unit cycle) using simpson's rule is
Page: