Register
Filter

Questions by saptarshiDey

1 votes
2 answers
1
BFS traversal path
What will be the path from A-H if BFS is used in the following graph?
What will be the path from A-H if BFS is used in the following graph?
0 votes
0 answers
2
A language is cfl or not
L = {a^(p+q) b^(p+q) a^p , p,q>=0} Which one of the following is true about L? L is a regular L is CFL but not regular L is not a CFL
L = {a^(p+q) b^(p+q) a^p , p,q>=0}Which one of the following is true about L?L is a regularL is CFL but not regularL is not a CFL
0 votes
1 answer
3
Time Complexity of Code snippet
What will be the worst case time complexity for the following code segment? int count=0,N; for(i=0;i<N*2;i++){ for(j=0;j<i/3;i++){ for(k=0;k<j*j;k++){ count++; } } } Options: O(N^4) O(N^3) O(N^2) O(N)
What will be the worst case time complexity for the following code segment?int count=0,N; for(i=0;i<N*2;i++){ for(j=0;j<i/3;i++){ for(k=0;k<j*j;k++){ count++; } } }Option...
0 votes
0 answers
4
Complementary Number Systems
If N = 670 in base 9 system. Then find the radix complement of N.
If N = 670 in base 9 system. Then find the radix complement of N.
1 votes
1 answer
5
Complementation of a Language of a L
If L is any Language and L' be its complement. L is CFL. Which of these two statements is true: 1. For any value of L, L' is not in CFL 2. There exists atleast one value of L for which L' is not in CFL
If L is any Language and L' be its complement. L is CFL. Which of these two statements is true:1. For any value of L, L' is not in CFL2. There exists atleast one value of...