2 votes
31
What is the time complexity to count the number of leaf nodes in a tree? I am getting O(nlogn) but answer is O(n) please anybody explain in detail
1 votes
32
is null production allowed in all type of grammar
–2 votes
33
What wud be THE DFA for the following expression ?0*1* + 1*0*
3 votes
41
4 votes
42
#include<stdio.h>int main(){char *s = "Geeks Quiz";int n = 7;printf("%.*s", n, s);return 0;}
2 votes
43
3 votes
44
In an operating system, indivisibility of operation means:Operation is interruptableRace Condition may occurprocessor can not be premptedAll of the above
1 votes
45
describe in details