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 sumitr
1
votes
1
answer
1
Algorithm Time Complexity-Self Doubt
What is the best case and worst case of the algorithm? And when will best case and worst case will happen?? int main() { for(i=1 ; i<=n ; i++) { if(n%i == 0) { for(j=1 ; j<=n ; j++) { printf("Hello"); } } } }
What is the best case and worst case of the algorithm? And when will best case and worst case will happen??int main() { for(i=1 ; i<=n ; i++) { if(n%i == 0) { for(j=1 ; j...
1.3k
views
asked
Apr 10, 2019
Algorithms
algorithms
time-complexity
self-doubt
+
–
3
votes
0
answers
2
Kenneth Rosen Edition 7 Exercise 2.2 Question 49 (Page No. 137)
Find ${\displaystyle \bigcup _{i=1}^{\infty }A_{i}} and \bigcup_{i=1}^{\infty} A_{i}$ if for every positive integer i, a) Ai = {i, i + 1, i + 2, . . .}. b) Ai = {0, i}. c) Ai = (0, i), that is, the set of real numbers x with 0 < x < i. d) Ai = (i,∞), that is, the set of real numbers x with x > i.
Find ${\displaystyle \bigcup _{i=1}^{\infty }A_{i}} and \bigcup_{i=1}^{\infty} A_{i}$ if for every positive integer i,a) Ai = {i, i + 1, i + 2, . . .}.b) Ai = {0, i}.c) A...
535
views
asked
Mar 17, 2019
Set Theory & Algebra
kenneth-rosen
discrete-mathematics
+
–
0
votes
1
answer
3
Kenneth Rosen Edition 6th Exercise 1.3 Question 23 (Page No. 48)
what is the approach of solving this question? Q.Translate in two ways each of these statements into logical expressions using predicates, quantifiers, and logical connectives. First, let the domain consist of the students in your class ... has been in a movie. e) No student in your class has taken a course in logic programming.
what is the approach of solving this question?Q.Translate in two ways each of these statements into logicalexpressions using predicates, quantifiers, and logicalconnectiv...
6.9k
views
asked
Feb 21, 2019
Mathematical Logic
kenneth-rosen
discrete-mathematics
propositional-logic
+
–
0
votes
1
answer
4
#Self Doubt #programming-in-c What will be time complexity of the program?
What will be time complexity of the program? Explain?? #include<stdio.h> int main(){ int i,count=0; for(i=1 ; i<=n ; i++) { for(i=1 ; i<=$n^4$ ; i++) for(i=1 ; i<=$n^3$ ; i++){ count++; printf("%d\n",count); } } }
What will be time complexity of the program? Explain??#include<stdio.h>int main(){ int i,count=0; for(i=1 ; i<=n ; i++) { for(i=1 ; i<=$n^4$ ; i++) ...
442
views
asked
Jul 10, 2018
Programming in C
programming-in-c
time-complexity
+
–
0
votes
1
answer
5
pushdown-automata
486
views
asked
Apr 23, 2018
Theory of Computation
theory-of-computation
pushdown-automata
dpda
self-doubt
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register