Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Raushank2
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Raushank2
5
votes
4
answers
1
Binary Search
I/p - Sorted array of n element O/p- find any two elements a and b such that (a+b)>1000 if lenear search is possible then go to Binary Search and Find time complexity ..?
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 ..?
2.6k
views
asked
Jun 28, 2017
Algorithms
algorithms
binary-search
time-complexity
+
–
1
votes
2
answers
2
thegatebook
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 b) Only S2 c) both S1 and S2 d) none
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 ...
776
views
asked
May 3, 2017
Mathematical Logic
propositional-logic
mathematical-logic
+
–
1
votes
2
answers
3
Check for Regular Language
Check whether given language is Regular or not? WXWR / W,X∈(0,1)+
Check whether given language is Regular or not?WXWR / W,X∈(0,1)+
625
views
asked
Apr 18, 2017
Theory of Computation
theory-of-computation
regular-language
+
–
0
votes
1
answer
4
GATE preparation
I'll be finishing my BE next month(May,17). I'm confused, should I go for a job or take a drop of one year to prepare for GATE. As I have not appeared for GATE this year cuz I've not made any preparation.But I tried to solve both of ... confused about Should I take a drop of one year for GATE? If yes, then what should be the strategy as my basics are not very clear
I'll be finishing my BE next month(May,17). I'm confused, should I go for a job or take a drop of one year to prepare for GATE. As I have not appeared for GATE this year...
413
views
asked
Apr 8, 2017
GATE
general
+
–
0
votes
3
answers
5
Theory of Computation
Consider the grammar G given by S→0SA2 S→012 2A→A2 1A→11 Test whether (a)00112∈L(G) and (b)001122∈L(G)
Consider the grammar G given byS→0SA2S→0122A→A21A→11Test whether (a)00112∈L(G) and(b)001122∈L(G)
986
views
asked
Apr 8, 2017
Theory of Computation
theory-of-computation
+
–
0
votes
2
answers
6
JNUEE-2016
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
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
854
views
asked
Apr 3, 2017
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register