Register
Filter

Recent questions without an upvoted answer

1 votes
1 answer
19951
Time complexity
Worst case time complexity of following code? Please explain in detail. void function(int n) { int count = 0; 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("*"); } }
Worst case time complexity of following code? Please explain in detail.void function(int n) { int count = 0; for (int i=0; i<n; i++) for (int j=i; j< i*i; j++) if (j%i ==...
User Avatar
0 votes
0 answers
19952
MadeEasy Test Series: Databases - B Tree
Suppose size of block 1000 bytes search key of 12 bytes, pointer size 8 bytes. How many maximum records in DB file which can index by dense B+ tree of 2 levels? given ans is 2499 but I am getting 2450
Suppose size of block 1000 bytes search key of 12 bytes, pointer size 8 bytes. How many maximum records in DB file which can index by dense B+ tree of 2 levels?given ans ...
User Avatar
1 votes
0 answers
19955
Practice: Deadlock
Deadlock Question
Deadlock Question
User Avatar
0 votes
0 answers
19956
Made Easy Test Series
Consider the following relational schema R(ABCDE) with: Functional Dependency: {A → B, C → D, BD → E, E → C} The number of given FD’s violate 3NF?
Consider the following relational schema R(ABCDE) with:Functional Dependency: {A → B, C → D, BD → E, E → C}The number of given FD’s violate 3NF?
User Avatar
0 votes
0 answers
19957
C programing
User Avatar
0 votes
0 answers
19958
test series
Total number of AND gates present inside a 6-bit carry look ahead generator circuit is
Total number of AND gates present inside a 6-bit carrylook ahead generator circuit is
User Avatar
2 votes
1 answer
19959
Identify the language
$L = \{ wcww^r |\ w,c\ \epsilon\ ( a + b\ )^* \}$ Identify the language.
$L = \{ wcww^r |\ w,c\ \epsilon\ ( a + b\ )^* \}$Identify the language.
User Avatar
0 votes
1 answer
19960
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...
User Avatar
2 votes
1 answer
19961
Doubt in CSL and CFL
$a) \{\ 0^i\ 1^j\ 2^k\ \ | where\ i\ \neq j\ or\ j\ \neq k\ \}$ $b) \{\ 0^i\ 1^j\ 2^k\ \ | where\ i\ \neq j\ and\ j\ \neq k\ \}$ a) CFL(union of two OR-ed comparisons ) b) CSL( Double comaprison ) Am I correct?
$a) \{\ 0^i\ 1^j\ 2^k\ \ | where\ i\ \neq j\ or\ j\ \neq k\ \}$$b) \{\ 0^i\ 1^j\ 2^k\ \ | where\ i\ \neq j\ and\ j\ \neq k\ \}$a) CFL(union of two OR-ed compa...
User Avatar
0 votes
0 answers
19962
Isro gate nielit
Please explain the answer as much details as possible
Please explain the answer as much details as possible
User Avatar
1 votes
0 answers
19964
Simple doubt in Reg Exp of TOC
why $bb^*$ is $b^*$ and not $b^+$? Ref: $a^*(bb^*a + a)a^*\\=a^*(bb^*+\epsilon)aa^*\\=a^*b^*aa^*\\=a^*b^*a^*a$
why $bb^*$ is $b^*$ and not $b^+$?Ref:$a^*(bb^*a + a)a^*\\=a^*(bb^*+\epsilon)aa^*\\=a^*b^*aa^*\\=a^*b^*a^*a$
User Avatar
0 votes
0 answers
19965
Self Doubt
Can someone explain the 3rd line of proof. a^i = a^i operation a^(j-i) ?
Can someone explain the 3rd line of proof. a^i = a^i operation a^(j-i) ?
User Avatar
–1 votes
0 answers
19967
tautology
User Avatar
0 votes
1 answer
19969
context free grammar
(a^i)(b^j)(c^m)(d^n) where i+j=m+n what will be the CFG for this
(a^i)(b^j)(c^m)(d^n) where i+j=m+n what will be the CFG for this
User Avatar
0 votes
1 answer
19972
2 phase locking
how does a 2 phase locking protocol cause deadlock ? and why is it conflict serializable
how does a 2 phase locking protocol cause deadlock ?and why is it conflict serializable
User Avatar
0 votes
0 answers
19973
Set Theory
User Avatar
0 votes
2 answers
19974
Programming doubt
What will be output if you will compile and execute the following c code? #include<stdio.h> int main(){ char c=125; c=c+10; printf("%d",c); return 0; } (A) 135 (B) 115 (C) -121 (D) -8 (E) Compiler error
What will be output if you will compile and execute the following c code? #include<stdio.h>int main(){char c=125;c=c+10;printf("%d",c); return 0;}(A) 135(B) 115(C) -121(D...
User Avatar
0 votes
3 answers
19975
MadeEasy Test Series: Digital Logic - Adder
A 1-bit full adder circuit takes 5 ns to generate the carry-out bit and 10 ns for the sum-bit. When 4, 1-bit full adders are cascaded, the maximum rate of additions per second will be _______ × 107.
A 1-bit full adder circuit takes 5 ns to generate the carry-out bit and 10 ns for the sum-bit. When 4, 1-bit full adders are cascaded, the maximum rate of additions per s...
User Avatar
0 votes
0 answers
19976
Tree data structure
How many binary trees are possible with given preorder:- ABCD And given postorder:- cdba
How many binary trees are possible with given preorder:- ABCDAnd given postorder:- cdba
User Avatar
0 votes
0 answers
19977
DFA and Reg Exp
$ L = \{ wxwy \ | \ \ x,y,w \ \ \epsilon\ ( a + b )^+ \} $ Draw the DFA and also write the Reg exp for the above language.
$ L = \{ wxwy \ | \ \ x,y,w \ \ \epsilon\ ( a + b )^+ \} $Draw the DFA and also write the Reg exp for the above language.
User Avatar
0 votes
0 answers
19978
data structure
what is complexity 1)to convert infix to prefix 2) to convert infix to postfix 3)convert infix to prefix using stack plz someone tell?
what is complexity1)to convert infix to prefix 2) to convert infix to postfix 3)convert infix to prefix using stackplz someone tell?
User Avatar
2 votes
1 answer
19980
OS, GATE2018
User Avatar
Page: