Register
Filter

Answers by tech_beardo

1 votes
1
complexity of a function
Find the complexity of the below function: function (int n){ for (int i=0;i<n;i++) for (int j=i;j<i*i;j++) if(j%i==0){ for(int k=0;k<j;k++) printf("*"); } }
Find the complexity of the below function:function (int n){for (int i=0;i<n;i++) for (int j=i;j<i*i;j++) if(j%i==0){ for(int k=0;k<j;k++) ...
0 votes
6
Minimal DFA
Number of states in Minimal DFA that accepts Language L=$\left \{ ab^* a^* \cup (ab)^* ba\right \}$
Number of states in Minimal DFA that accepts Language L=$\left \{ ab^* a^* \cup (ab)^* ba\right \}$
0 votes
8
Introduction to theory of computing by "Michael sipser" 3rd edition page no:37
A minimal DFA diagram for the language A = {w| w contains at least one 1 and an even number of 0s follow the last 1}?
A minimal DFA diagram for the language A = {w| w contains at least one 1 and an even number of 0s follow the last 1}?
0 votes
10
Doubt-DFA
what is the grammar generated by the complement of this DFA and what is the type?
what is the grammar generated by the complement of this DFA and what is the type?
0 votes
12
doubt in coa
is it 5 or 4 ..?? some places i am finding it as 4 (number of cycles) and in some places it is given as 5(number of slots)..please confirm
is it 5 or 4 ..?? some places i am finding it as 4 (number of cycles) and in some places it is given as 5(number of slots)..please confirm
0 votes
14
RegulaR Expression
Find the regular expression No 2 a's and 2 b's should come together?
Find the regular expression No 2 a's and 2 b's should come together?
0 votes
15
ME Test Series
Unix I-node has block size 8 KB and file possible with triple indirect is 128 GB. Number of bits disk block address contain is _________.
Unix I-node has block size 8 KB and file possible with triple indirect is 128 GB. Number of bits disk block address contain is _________.
0 votes
16
AVL tree
The number of different orders are possible for elements 1, 2, 3, 4, 5, 6, 7 to be inserted in to empty AVL tree such that no rotation will be done and element ‘4’ is root are ________.
The number of different orders are possible for elements 1, 2, 3, 4, 5, 6, 7 to be inserted in to empty AVL tree such that no rotation will be done and element ‘4’ is...
0 votes
17
made-easy
A 3 bit down counter is used to control the output of the multiplexer as shown in the figure. The counter is intially at (101)2 then output of multiplexer will follow the sequence i m getting I2,0,I1,0 is it correct?
A 3 bit down counter is used to control the output of the multiplexer as shown in the figure. The counter is intially at (101)2 then output of multiplexer will follow the...
0 votes
18
DIGITAL LOGIC
Is this expression correct?
Is this expression correct?
0 votes
22
Test Series
The value of -43 in 2’s complement is? Options: 1.21 2.43 3.-21 4.None of the above
The value of -43 in 2’s complement is?Options:1.212.433.-214.None of the above
0 votes
23
SELF DOUBT
Suppose the domain set of an attribute consists of signed 3 digit numbers. What is the percentage of reduction in storage space of this attribute if it is stored as an integer rather than in character form? PLEASE EXPLAIN WHAT THIS QUESTION MEANS AND SOLUTION
Suppose the domain set of an attribute consists of signed 3 digit numbers. What is the percentage of reduction in storage space of this attribute if it is stored as an in...
0 votes
24
Made-easy-test-series
A) D flip-flop B) T flip-flop C) sequence detector D)2-bit counter
A) D flip-flopB) T flip-flopC) sequence detectorD)2-bit counter
1 votes
25
c type casting
what is the meaning of k= (char *) (i*j) it will return k =(char *) (300)
what is the meaning of k= (char *) (i*j)it will return k =(char *) (300)
0 votes
27
ME MOCK 2
We are given a C function, mystery() as follows. void mystery(int m, int n) { while(m<=n) { m++; n--; } } Let X be the number of times the comparission inside the while loop ( i.e., m<=n ) is performed, when mystery(127,255) is called. Then the value of X is _______________
We are given a C function, mystery() as follows. void mystery(int m, int n) { while(m<=n) { m++; n ; } }Let X be the number of times the comparission inside the while loo...
0 votes
28
algo questions
in case of comparision sort max possible is n(n-1)/2
in case of comparision sort max possible is n(n-1)/2
Page: