5 votes
4 answers
1
I/p - Sorted array of n elementO/p- find any two elements a and b such that (a+b)>1000if lenear search is possible then go to Binary Search and Find time complexity ..?
1 votes
2 answers
2
22) S1: A formula is valid iff its complement is not satisfiable S2: A formula is satisfiable iff its complement is not valid.Which statement is/are true? a) Only S1 ...
1 votes
2 answers
3
Check whether given language is Regular or not?WXWR / W,X∈(0,1)+
0 votes
3 answers
5
Consider the grammar G given byS→0SA2S→0122A→A21A→11Test whether (a)00112∈L(G) and(b)001122∈L(G)
0 votes
2 answers
6
Consider an undirected graph G with 100 nodes. What is the maximum number of edges to be included in G so that graph is connected?(a) 2451(b) 4851(c) 4950(d) 9990