0 votes
41
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...
1 votes
42
0 votes
43
a melay machine has no terminal state means?
0 votes
44
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??
0 votes
45
Is every EPSILON-NFA a DFA given the fact that every NFA is a DFA and every NFA is EPSILON-NFA
2 votes
46
#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
2 votes
47
Where is reduce-reduce conflict here?Plz explainS→SS→SS∣a∣ϵ
–1 votes
48
How many comparisons are there for finding any second element that is neither minimum or maximum.10 5 50 70 80 2 3
2 votes
49
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
0 votes
50
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 ...
5 votes
53
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 ________...
0 votes
54
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
2 votes
55
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 votes
56
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 × ...
0 votes
57
If there are two graphs G1 and G2 and both are Isomorphic to each other...Is G1 subset of G2?
0 votes
58
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...
2 votes
59
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?
0 votes
60
what is the maximum difference between height of two nodes of AVL treea.1b.2c.3d.none
0 votes
61
#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
62
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
63
Total no of edges =1225Maximum degree of vertex =3find no of vertices ?
0 votes
65
Which one of the following in-place sorting algorithms needs the minimum number of swaps?Insertion SortQuick SortHeap SortSelection Sort
0 votes
66
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
67
WHAT IS DNF Disjunctive normal form IN BOOLEAN ALGEBRA?
1 votes
68
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
69
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 | ε