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
Answers by rajatmyname
0
votes
1
Propositional Logic
Which of the following is the best English translation for All humans eat alligator Alligator eats only human Every Alligator Eats Human Only Alligator eats Human
Which of the following is the best English translation for All humans eat alligatorAlligator eats only humanEvery Alligator Eats HumanOnly Alligator eats Human
442
views
answered
Mar 11, 2019
Mathematical Logic
propositional-logic
discrete-mathematics
mathematical-logic
+
–
0
votes
2
Relations and functions
388
views
answered
Mar 9, 2019
0
votes
3
Questions regarding Asymmetric relations. See Deatils.
Hello fellow folks, anyone may please explain these below questions - Ques 1 - Relation Proper Subset ( ⊂ ) is it Asymmetric on set of all sets? Ques 2 - Relation Subset ( ⊆ ) is it Asymmetric on set of all sets? ... Asymmetric on set of all sets? Kindly explain them in a simplified and with an illustrated example. Thank you in anticipation.
Hello fellow folks, anyone may please explain these below questions -Ques 1 - Relation Proper Subset ( ⊂ ) is it Asymmetric on set of all sets?Ques 2 - Relation Subset ...
429
views
answered
Mar 7, 2019
0
votes
4
relations and functions
A binary relation R on Z × Z is defined as follows: (a, b) R (c, d) iff a = c or b = d Consider the following propositions: 1. R is reflexive. 2. R is symmetric. 3. R is antisymmetric. Which one of the above statements is True?
A binary relation R on Z × Z is defined as follows: (a, b) R (c, d) iff a = c or b = dConsider the following propo...
639
views
answered
Mar 4, 2019
0
votes
5
UGC NET CSE | June 2009 | Part 2 | Question: 25
The prepositional formula given by the tree : is : ˄˅x2˅x1¬x1¬x1 (x2˅¬x2)˄(x1˅x2) (¬x1˅x2)˄(¬x1˅x2) None
The prepositional formula given by the tree :is :˄˅x2˅x1¬x1¬x1 (x2˅¬x2)˄(x1˅x2) (¬x1˅x2)˄(¬x1˅x2) None
589
views
answered
Feb 21, 2019
Mathematical Logic
ugcnetcse-june2009-paper2
propositional-logic
+
–
0
votes
6
Space Complexity of Build Max Heap
Since Heapify is a recursive function, its space complexity is $O(logn)$ because of the stack space required for recursion. I also read that space complexity of heapsort is $O(1)$ beause of the explanation here - https://gateoverflow.in/79909/ ... complexity of build heap is $O(logn)$ then heapsorts complexity should also be the same . What am I missing here ?
Since Heapify is a recursive function, its space complexity is $O(logn)$ because of the stack space required for recursion.I also read that space complexity of heapsort i...
4.8k
views
answered
Feb 7, 2019
Algorithms
space-complexity
algorithms
binary-heap
heap-sort
+
–
0
votes
7
Greedy Method Algorithm
Single source shortest path problems can be implemented by greedy algorithms using A. Singly linked list B. Min heap C. AVL tree D. All of the above
Single source shortest path problems can be implemented by greedy algorithms usingA. Singly linked listB. Min heapC. AVL treeD. All of the above
1.4k
views
answered
Sep 26, 2018
Algorithms
greedy-algorithm
+
–
2
votes
8
time-complexcity
for(i=0;i<n;i++) for(j=0;j<i;j++) for(k=0;k<j;k++) what is the time complexity of above psudo code? explain.
for(i=0;i<n;i++) for(j=0;j<i;j++) for(k=0;k<j;k++) what is the time complexity of above psudo code?explain.
470
views
answered
Sep 21, 2018
Algorithms
time-complexity
algorithms
asymptotic-notation
+
–
0
votes
9
dynamic prgramming
Given a two dimensional array A with n rows and k columns initialized to -1 . what is the time complexity of the function f(A,m,m)? int f(int **a,int n,int k) { if ((n<=k)||(k<=1)) return 1; if(a[n][k]==-1) a[n][k]=f(a,n-1,k)+f(a,n-1,k-1); return a[n][k]; } a)theta(m) b)theta(m^2) c)theta(2^m) d)O(1) }
Given a two dimensional array A with n rows and k columns initialized to -1 . what is the time complexity of the function f(A,m,m)?int f(int a,int n,int k){ if ((n<=...
469
views
answered
Sep 18, 2018
Algorithms
dynamic-programming
algorithms
+
–
0
votes
10
Time complexity of code given
974
views
answered
Sep 18, 2018
Algorithms
algorithms
sorting
time-complexity
numerical-answers
test-series
+
–
1
votes
11
Group theory
Let (g,*) be a group of order p where p is a prime number then number of proper subgroup is?
Let (g,*) be a group of order p where p is a prime number then number of proper subgroup is?
386
views
answered
Jul 27, 2018
0
votes
12
madeeasy
Consider the following statements with respect to a directed graph G in which edges can have positive or negative edge length but that has no negative cycles: S1 : The Bellman-Ford algorithm correctly computes shortest path lengths from a given ... The Floyd-Warshall algorithm correctly computes shortest path lengths between every pair of vertices. Which of the following is correct?
Consider the following statements with respect to a directed graph G in which edges can have positive or negative edge length but that has no negative cycles:S1 : The Be...
371
views
answered
May 14, 2018
Algorithms
graph-algorithms
shortest-path
made-easy-test-series
+
–
0
votes
13
Sorting
542
views
answered
Mar 9, 2018
Algorithms
sorting
heap-sort
test-series
+
–
0
votes
14
MadeEasy Test Series: Theory Of Computation - Turing Machine
Consider the Turing machine when the input is still left and the turing machine halts will it accept it by halting or will it process the entire input left??
Consider the Turing machine when the input is still left and the turing machine halts will it accept it by halting or will it process the entire input left??
396
views
answered
Feb 3, 2018
Theory of Computation
made-easy-test-series
theory-of-computation
turing-machine
+
–
0
votes
15
Grammer
Can I give any grammer for the language L = { anbncn / n>=1} Like this----
Can I give any grammer for the language L = { anbncn / n>=1} Like this
611
views
answered
Feb 1, 2018
Theory of Computation
theory-of-computation
grammar
+
–
0
votes
16
Theory of computation
The minimal finite automata accepting the set of all strings over 0,1 starting with 1 that interpreted as a binary representation of an integer are congruent to 0 modulo 5 has ___ states. What is this language?
The minimal finite automata accepting the set of all strings over 0,1 starting with 1 that interpreted as a binary representation of an integer are congruent to 0 modulo ...
2.1k
views
answered
Jan 30, 2018
Theory of Computation
theory-of-computation
+
–
0
votes
17
ace test toc
Can anyone please explain method to solve such example which contains equivalence classes.
Can anyone please explain method to solve such example which contains equivalence classes.
557
views
answered
Jan 30, 2018
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
