The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Answers by rajatmyname
User rajatmyname
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User rajatmyname
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
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
answered
Mar 11
in
Mathematical Logic

75
views
propositionallogic
discretemathematics
mathematicallogic
0
votes
2
Relations and functions
answered
Mar 9
in
Mathematical Logic

66
views
0
votes
3
Relations
answered
Mar 7
in
Set Theory & Algebra

22
views
0
votes
4
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.
answered
Mar 7
in
Set Theory & Algebra

98
views
0
votes
5
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?
answered
Mar 4
in
Mathematical Logic

111
views
0
votes
6
UGCNETjune2009ii25
The prepositional formula given by the tree: is: (A) ˄˅x2˅x1¬x1¬x1 (B) (x2˅¬x2)˄(x1˅x2) (C) (¬x1˅x2)˄(¬x1˅x2) (D) None
answered
Feb 21
in
Mathematical Logic

115
views
ugcnetjune2009ii
0
votes
7
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 ?
answered
Feb 7
in
Algorithms

346
views
spacecomplexity
algorithms
heap
heapsort
0
votes
8
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
answered
Sep 26, 2018
in
Algorithms

136
views
greedyalgorithm
0
votes
9
#Test series
answered
Sep 23, 2018
in
Algorithms

36
views
+2
votes
10
timecomplexcity
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.
answered
Sep 22, 2018
in
Algorithms

66
views
timecomplexity
algorithms
asymptoticnotations
0
votes
11
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,n1,k)+f(a,n1,k1); return a[n][k]; } a)theta(m) b)theta(m^2) c)theta(2^m) d)O(1) }
answered
Sep 18, 2018
in
Algorithms

61
views
dynamicprogramming
algorithms
0
votes
12
Time complexity of code given
answered
Sep 18, 2018
in
Algorithms

104
views
#time
timecomplexity
asymptoticnotations
0
votes
13
Closure Properties Table
https://gateoverflow.in/?qa=blob&qa_blobid=8929616163903734815
answered
Aug 28, 2018
in
Theory of Computation

2.2k
views
closureproperty
theoryofcomputation
0
votes
14
Group theory
Let (g,*) be a group of order p where p is a prime number then number of proper subgroup is?
answered
Jul 27, 2018
in
Set Theory & Algebra

40
views
0
votes
15
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 BellmanFord algorithm correctly computes shortest path lengths from a given ... The FloydWarshall algorithm correctly computes shortest path lengths between every pair of vertices. Which of the following is correct?
answered
May 14, 2018
in
Algorithms

53
views
0
votes
16
Sorting
answered
Mar 10, 2018
in
Algorithms

83
views
0
votes
17
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??
answered
Feb 3, 2018
in
Theory of Computation

86
views
madeeasytestseries
theoryofcomputation
turingmachine
0
votes
18
Grammer
Can I give any grammer for the language L = { anbncn / n>=1} Like this
answered
Feb 2, 2018
in
Theory of Computation

81
views
theoryofcomputation
grammar
0
votes
19
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?
answered
Jan 31, 2018
in
Theory of Computation

180
views
theoryofcomputation
0
votes
20
ace test toc
Can anyone please explain method to solve such example which contains equivalence classes.
answered
Jan 31, 2018
in
Theory of Computation

47
views
50,645
questions
56,601
answers
195,849
comments
102,206
users