Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
joshi_nitish
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by joshi_nitish
0
votes
41
trees in data structure
Q-We are given set of n distinct elements and an unlabled binary tree with n nodes how many ways we can populate the tree with given set so that it becomes binary search tree ?
Q-We are given set of n distinct elements and an unlabled binary tree with n nodes how many ways we can populate the tree with given set so that it becomes binary search...
541
views
answered
Jun 27, 2017
Programming in C
tree
+
–
1
votes
42
mathematics
Consider the set H of all 3 × 3 matrices of the type where a, b, c, d, e and f are real numbers and abc ≠ 0. Under the matrix multiplication operation, the set H is a group a monoid but not a group C a semigroup but not a monoid D neither a group nor a semigroup
Consider the set H of all 3 × 3 matrices of the type where a, b, c, d, e and f are real numbers and abc ≠ 0. Under the matrix multiplication operation, the set H is a...
711
views
answered
Jun 27, 2017
Linear Algebra
engineering-mathematics
+
–
0
votes
43
melay machine
a melay machine has no terminal state means?
a melay machine has no terminal state means?
489
views
answered
Jun 27, 2017
Theory of Computation
theory-of-computation
+
–
0
votes
44
Programming
int sum(int array[ ] , int n){ int sum=0; for (int i=0:i<n;i++{ sum=sum+array[i]; } return sum; What will be the space complexity for above code??
int sum(int array[ ] , int n){int sum=0;for (int i=0:i<n;i++{sum=sum+array[i];}return sum;What will be the space complexity for above code??
385
views
answered
Jun 23, 2017
0
votes
45
TOC RL and FA
Is every EPSILON-NFA a DFA given the fact that every NFA is a DFA and every NFA is EPSILON-NFA
Is every EPSILON-NFA a DFA given the fact that every NFA is a DFA and every NFA is EPSILON-NFA
748
views
answered
Jun 23, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
2
votes
46
Predict the output
#include <stdio.h> void f(int); int main() { int a=4; f(a); return 0; } void f(int n) { if(n>0) { f(--n); printf("%d", n); f(--n); } } Explain how function calls take place
#include <stdio.h void f(int); int main() { int a=4; f(a); return 0; } void f(int n) { if(n>0) { f( n); printf("%d", n); f( n); } }Explain how function calls take place
1.2k
views
answered
Jun 23, 2017
Programming in C
programming-in-c
recursion
+
–
2
votes
47
Doubt
Where is reduce-reduce conflict here?Plz explain S→S S→SS∣a∣ϵ
Where is reduce-reduce conflict here?Plz explainS→SS→SS∣a∣ϵ
506
views
answered
Jun 21, 2017
Compiler Design
compiler-design
parsing
lr-parser
descriptive
+
–
–1
votes
48
Finding the second element neither minimum nor maximum
How many comparisons are there for finding any second element that is neither minimum or maximum. 10 5 50 70 80 2 3
How many comparisons are there for finding any second element that is neither minimum or maximum.10 5 50 70 80 2 3
1.1k
views
answered
Jun 21, 2017
Algorithms
algorithms
time-complexity
sorting
+
–
2
votes
49
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
1.9k
views
answered
Jun 20, 2017
0
votes
50
Computer Architecture and Organisation
Consider the following program segment: Assume that memory is word addressable with word size 32 bits. Program is loaded into memory location (3000)10 onwards. The value of PC at the end of execution of above program is ________.
Consider the following program segment: Assume that memory is word addressable with word size 32 bits. Program is loaded into memory location (3000)10 onwards. The value ...
757
views
answered
Jun 17, 2017
4
votes
51
Arun sharma
In a carrom board game competition, m boys n girls (m > n > 1) of a school participate in which every student has to play exactly one game with every other student. Out of the total games played, it was found that in 221 games one player was a boy and the other player ... of the statements given above is/are correct? (a) I only (b) II only (c) Both I and II (d) Neither I nor II.
In a carrom board game competition, m boys n girls (m n 1) of a school participate inwhich every student has to play exactly one game with every other student. Out of t...
1.6k
views
answered
May 22, 2017
0
votes
52
just asking
#include<stdio.h> #include<string.h> int main() { int f[1000]; int n,i; f[-1]=0; f[0]=1; printf("enter n"); scanf("%d",&n); if(n==0) printf("%d",0); else if(n==1) printf("%d",1); else { for(i=0;i<n-1;i++){ f[i+1]=f[i-1]+f[i]; } printf("%d",f[i]); } } what is answer if we give n value 2 and tell hw this answer got?
#include<stdio.h>#include<string.h>int main(){ int f[1000];int n,i;f[-1]=0;f[0]=1;printf("enter n");scanf("%d",&n);if(n==0)printf("%d",0);else if(n==1)printf("%d",1);e...
274
views
answered
May 21, 2017
5
votes
53
Test by Bikram | Programming | Test 2 | Question: 10
Suppose the following declarations are in effect : $\text{int }a[ \: ] = \{5,15,34,54,14,2,52,72 \}$; $\text{int }*p = \&a[1] , *q = \&a[5]$; The value of $q - p$ is ________.
Suppose the following declarations are in effect :$\text{int }a[ \: ] = \{5,15,34,54,14,2,52,72 \}$;$\text{int }*p = \&a , *q = \&a[5]$;The value of $q - p$ is ________...
377
views
answered
May 20, 2017
Programming in C
tbb-programming-2
numerical-answers
+
–
0
votes
54
Mathematics: Gate 2016 EE set-2
A 3X3 matrix P is such that, P^3 = P. Then the eigenvalues of P are: 1) 1, 1, -1 2) 1, 0.5 + j0.866, 0.5 - j0.866 3) 1, -0.5 + j0.866, -0.5 - j0.866 4) 0, 1, -1
A 3X3 matrix P is such that, P^3 = P. Then the eigenvalues of P are:1) 1, 1, -12) 1, 0.5 + j0.866, 0.5 - j0.8663) 1, -0.5 + j0.866, -0.5 - j0.8664) 0, 1, -1
5.3k
views
answered
May 19, 2017
Linear Algebra
gate2016-ee-2
linear-algebra
eigen-value
+
–
2
votes
55
2 - connected graph
For a regular graph how much large the value of degree (for each vertices) should be such that the graph is $2$ ... 3 regular and not 2- connected although $d \geq 2$ is satisfied. Why this $d \geq 2$ is trivial and not working in some cases ?
For a regular graph how much large the value of degree (for each vertices) should be such that the graph is $2$ - connected. (vertex wise).I did in this way :$\begin{alig...
1.3k
views
answered
May 19, 2017
Graph Theory
graph-theory
graph-connectivity
+
–
1
votes
56
Arun sharma
25. Find the number of ways in which the letters of the word MACHINE can be arranged so that the vowels may occupy only odd positions. (a) 4! × 4! (b) 7P3 × 4! (c) 7P4 × 3! (d) none of these
25. Find the number of ways in which the letters of the word MACHINE can be arranged so that thevowels may occupy only odd positions.(a) 4! × 4! (b) 7P3 × 4!(c) 7P4 × ...
553
views
answered
May 18, 2017
0
votes
57
Isomorphism and subgraph
If there are two graphs G1 and G2 and both are Isomorphic to each other...Is G1 subset of G2?
If there are two graphs G1 and G2 and both are Isomorphic to each other...Is G1 subset of G2?
1.8k
views
answered
May 18, 2017
Graph Theory
graph-theory
+
–
0
votes
58
basic aptitude
12 chairs are arranged in a row and are numbered 1 to 12 4 men have to be seated in these chairs so that the chairs numbered 1 and 8 should be occupied and no two men occupy adjacent chairs. Find the number of ways the task can be done. A. 360 B. 384 C. 432 D. 470
12 chairs are arranged in a row and are numbered 1 to 12 4 men have to be seated in these chairs so that the chairs numbered 1 and 8 should be occupied and no two men occ...
1.3k
views
answered
May 15, 2017
2
votes
59
CSL and Regular language
if L1 = { anbncn | n>= 0 } and L2 = { anbmck | k,n,m>=0} L1 is CSL and L2 is regular. Now L3 = L1.(L2)*. Is L3 is regualar or CSL?
if L1 = { anbncn | n>= 0 } and L2 = { anbmck | k,n,m>=0}L1 is CSL and L2 is regular.Now L3 = L1.(L2)*.Is L3 is regualar or CSL?
3.1k
views
answered
May 15, 2017
Theory of Computation
theory-of-computation
context-sensitive
regular-language
+
–
0
votes
60
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
524
views
answered
May 15, 2017
DS
data-structures
avl-tree
+
–
0
votes
61
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...
307
views
answered
May 15, 2017
1
votes
62
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...
454
views
answered
May 14, 2017
Combinatory
combinatory
+
–
0
votes
63
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 ?
361
views
answered
May 13, 2017
Graph Theory
graph-theory
graph-connectivity
numerical-answers
+
–
0
votes
64
Ace Test Series: Programming & DS - Binary Tree
336
views
answered
May 9, 2017
DS
ace-test-series
data-structures
binary-tree
+
–
0
votes
65
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
4.8k
views
answered
May 7, 2017
Algorithms
isro2017
algorithms
sorting
+
–
0
votes
66
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$
7.8k
views
answered
May 7, 2017
Algorithms
isro2017
algorithms
sorting
+
–
0
votes
67
keneth r rosen
WHAT IS DNF Disjunctive normal form IN BOOLEAN ALGEBRA?
WHAT IS DNF Disjunctive normal form IN BOOLEAN ALGEBRA?
366
views
answered
May 7, 2017
Mathematical Logic
boolean-algebra
+
–
1
votes
68
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.7k
views
answered
May 7, 2017
1
votes
69
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 | ε
5.4k
views
answered
May 5, 2017
Compiler Design
compiler-design
context-free-grammar
parsing
numerical-answers
normal
+
–
Page:
« prev
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register