Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Rahul Jain25
8
votes
1
answer
41
Groups theory
Let $G:$ be a group. $a^5=e,\quad aba^{-1}=b^2,\quad a,b,\in G$ Then which of the following is an order of $b$? $31$ $32$ $30$ $2$
Let $G:$ be a group.$a^5=e,\quad aba^{-1}=b^2,\quad a,b,\in G$Then which of the following is an order of $b$?$31$$32$$30$$2$
943
views
asked
Oct 11, 2016
Set Theory & Algebra
set-theory&algebra
group-theory
+
–
2
votes
2
answers
42
DMGT question
1.8k
views
asked
Oct 10, 2016
Mathematical Logic
discrete-mathematics
mathematical-logic
first-order-logic
+
–
7
votes
2
answers
43
Graph connectivity
Consider the following statements $S1:2,3,3,3,3,3,4$ is a graphic sequence $S2:$ A connected graph with $10$ vertices and $16$ edges without having a cycle of length $3$, is a planar graph. Both $S1$ and $S2$ are true $S1$ is false but $S2$ is true $S2$ is false but $S1$ is true Both $S1$ and $S2$ are false
Consider the following statements$S1:2,3,3,3,3,3,4$ is a graphic sequence$S2:$ A connected graph with $10$ vertices and $16$ edges without having a cycle of length $3$, i...
1.1k
views
asked
Oct 10, 2016
Graph Theory
graph-theory
graph-connectivity
euler-graph
+
–
1
votes
1
answer
44
Graphs
377
views
asked
Oct 10, 2016
Graph Theory
graph-theory
cycle
euler-graph
+
–
0
votes
0
answers
45
Toc+ Time complexity
215
views
asked
Oct 9, 2016
Theory of Computation
time-complexity
theory-of-computation
+
–
3
votes
1
answer
46
Complement CSL
1.8k
views
asked
Oct 9, 2016
Theory of Computation
theory-of-computation
context-free-language
context-sensitive
+
–
0
votes
1
answer
47
toc
610
views
asked
Oct 9, 2016
Theory of Computation
theory-of-computation
context-free-language
+
–
1
votes
2
answers
48
Regular+CFG
1.4k
views
asked
Oct 9, 2016
Theory of Computation
theory-of-computation
regular-language
context-free-language
context-free-grammar
bad-question
+
–
0
votes
0
answers
49
Grammar Simplification
606
views
asked
Oct 9, 2016
Theory of Computation
theory-of-computation
grammar
context-free-language
+
–
0
votes
1
answer
50
Toc+ Finitness+Cfg
525
views
asked
Oct 8, 2016
Theory of Computation
theory-of-computation
context-free-language
+
–
3
votes
1
answer
51
Hashing+Probaility
809
views
asked
Oct 8, 2016
DS
hashing
probability
uniform-hashing
binomial-distribution
+
–
2
votes
1
answer
52
Hashing
602
views
asked
Oct 8, 2016
DS
algorithms
hashing
data-structures
probability
+
–
2
votes
1
answer
53
Programming stack
676
views
asked
Oct 7, 2016
Programming in C
stack
+
–
0
votes
1
answer
54
Algorithm
2.1k
views
asked
Oct 7, 2016
Algorithms
algorithms
quick-sort
+
–
4
votes
1
answer
55
Programming
736
views
asked
Oct 7, 2016
Programming in C
programming-in-c
array
+
–
5
votes
2
answers
56
Algorithms
1.2k
views
asked
Oct 7, 2016
Algorithms
algorithms
time-complexity
+
–
4
votes
1
answer
57
DS+ Algorithm test
941
views
asked
Oct 7, 2016
Programming in C
hashing
linear-probing
data-structures
+
–
1
votes
2
answers
58
Algorithm Time compleity
608
views
asked
Oct 7, 2016
Algorithms
algorithms
recurrence-relation
time-complexity
master-theorem
test-series
+
–
4
votes
1
answer
59
DS test
631
views
asked
Oct 6, 2016
DS
data-structures
stack
test-series
+
–
9
votes
1
answer
60
DS+Permutation
An item that is read as input can either be pushed to the stack and later popped and printed or printed directly. Number of print permutations that can be obtained using stack, if the input sequence is $1, 2, 3, 4, 5$ in that order is __________.
An item that is read as input can either be pushed to the stack and later popped and printed or printed directly. Number of print permutations that can be obtained using ...
1.5k
views
asked
Oct 6, 2016
DS
data-structures
stack
combinatory
+
–
Page:
« prev
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register