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

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by Devwritt
User Devwritt
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Devwritt
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
6
answers
1
GATE2005IT7
Which of the following expressions is equivalent to $(A \oplus B) \oplus C$ $(A + B + C) (\bar A +\bar B +\bar C)$ $(A + B + C) (\bar A +\bar B + C)$ $ABC + \bar A (B \oplus C) + \bar B(A \oplus C)$ None of these
answered
Jul 2
in
Digital Logic

2.7k
views
gate2005it
digitallogic
normal
booleanalgebra
2
answers
2
Tree question
In delete operation of BST, we need inorder successor (or predecessor) of a node when the node to be deleted has both left and right child as nonempty. Which of the following is true about inorder successor needed in delete operation? Inorder Successor ... Inorder successor may be an ancestor of the node Inorder successor is always either a leaf node or a node with empty right child
commented
Jun 21
in
DS

1.2k
views
datastructures
tree
3
answers
3
Max Heap
The number of ways in which the numbers 1, 2, 3, 4, 5 can be inserted into binary heap. Such that resulted binary heap is max heap ________.
answered
Jun 17
in
DS

742
views
heap
binaryheap
datastructures
2
answers
4
Merge Sort
Consider the following statement: S1: Merge sort on linked list take O(n log n) time to sort input of length n. S2: Merge sort on linked list give better space complexity then on array. S3: Inplace merge sort on array will take O(n2) time. Which of the following is correct? a)S1 b)S1 and S2 c)S1,S2,S3 d) None
answered
Jun 16
in
DS

594
views
mergesort
timecomplexity
1
answer
5
#geeksfoegeeks #gate #2017 #mocktest
Let G be a simple graph with 20 vertices and 8 components. If we delete a vertex in G, then number of components in G should lie between ____. (A) 8 and 20 (B) 8 and 19 (C) 7 and 19 (D) 7 and 20 Answer is (C) but i think also possible (B). anyone explain?
answered
Jun 11
in
Programming

130
views
graphtheory
2
answers
6
MadeEasy Test Series: Algorithms  Heap
Consider M1 and M2 be two complete binary tree which satisfy maxheap property, each of size ‘n’. What is the time complexity to combine both M1 and M2 such that combine tree will be min heap tree? O (n log n) O (n) O (n2) O (n2 log n)
commented
Jun 11
in
DS

426
views
madeeasytestseries
datastructures
heap
timecomplexity
3
answers
7
Binary tree Madeeasytestseries
The minimum size that an array may require to store a binary tree with n nodes $2^{\left \lceil(log_2(n+1)) \right \rceil 1}$ $2n1$ $2nn+1$ $n+1$
answered
Jun 10
in
DS

1.1k
views
binarytree
arrays
madeeasytestseries
2
answers
8
MadeEasy Test Series: Programming & DS  Trees
assume the preorder tŕaversal of binary tree is "abc" how many total different binary trees are possible whose postorder traversal.is "cba" with the given preorder traversal.?? how to find it ?
answered
Jun 9
in
Programming

309
views
madeeasytestseries
datastructures
trees
treetraversal
4
answers
9
GATE20197
If $L$ is a regular language over $\Sigma = \{a,b\} $, which one of the following languages is NOT regular? $L.L^R = \{xy \mid x \in L , y^R \in L\}$ $\{ww^R \mid w \in L \}$ $\text{Prefix } (L) = \{x \in \Sigma^* \mid \exists y \in \Sigma^* $such that$ \ xy \in L\}$ $\text{Suffix }(L) = \{y \in \Sigma^* \mid \exists x \in \Sigma^* $such that$ \ xy \in L\}$
commented
Nov 25, 2019
in
Theory of Computation

3.9k
views
gate2019
theoryofcomputation
regularlanguages
7
answers
10
GATE20011.16
Let $f(n) = n^2 \log n$ and $g(n) = n(\log n)^{10}$ be two positive functions of $n$. Which of the following statements is correct? $f(n) = O(g(n)) \text{ and } g(n) \neq O(f(n))$ $g(n) = O(f(n)) \text{ and } f(n) \neq O(g(n))$ $f(n) \neq O(g(n)) \text{ and } g(n) \neq O(f(n))$ $f(n) =O(g(n)) \text{ and } g(n) = O(f(n))$
answered
Nov 1, 2019
in
Algorithms

4.4k
views
gate2001
algorithms
asymptoticnotations
timecomplexity
normal
4
answers
11
GATE20001.6
The number $43$ in $2's$ complement representation is $01010101$ $11010101$ $00101011$ $10101011$
answer edited
Sep 27, 2019
in
Digital Logic

4.3k
views
gate2000
digitallogic
numberrepresentation
easy
4
answers
12
GATE2015127
Consider the following relation: ... , Performance P WHERE S.Roll_No= P.Roll_No GROUP BY S.STUDENT_Name The numbers of rows that will be returned by the SQL query is_________________.
answer edited
Sep 18, 2019
in
Databases

5.3k
views
gate20151
databases
sql
normal
numericalanswers
3
answers
13
UGCNETJune2012III: 33
Which one of the following statements is incorrect? The number of regions corresponds to the cyclomatic complexity Cyclomatic complexity for a flow graph $G$ is $V(G)=NE+2$, where E is the number of edges and N is the number of nodes in flow graph. Cyclomatic ... a flow graph $G$ is $V(G)=P+1$, where P is the number of predicate nodes contained in the flow graph G.
answer edited
Sep 11, 2019
in
IS&Software Engineering

1.9k
views
ugcnetjune2012iii
is&softwareengineering
softwaremetric
3
answers
14
propositional logic
which of the following is tautology? (¬P^(P>q))>¬q ¬(p>q)>¬q [(¬p^q)^[q>(p>q)]]>¬r Both (B) and(C) please explain in detail how to check for especially for condition (C) Because “r” is only in RHS but not in LHS of this implication.
commented
Mar 19, 2019
in
Mathematical Logic

152
views
propositionallogic
discretemathematics
mathematicallogic
firstorderlogic
engineeringmathematics
2
answers
15
ISRO200948
The cubic polynomial $y(x)$ which takes the following values: $y(0)=1, y(1)=0, y(2)=1$ and $y(3)=10$ is $x^3 +2x^2 +1$ $x^3 +3x^2 1$ $x^3 +1$ $x^3 2x^2 +1$
answered
Mar 11, 2019
in
Numerical Methods

1k
views
isro2009
polynomials
0
answers
16
Minimum number of NAND Gates
Minimum number of NAND Gates for the functions F = AC’ + ACE + ACE’ + A’CD’ + A’D’E’ F = (B’ + D’)(A’+C’+D)(A+B’+C’+D)(A’+B+C’+D’)
commented
Mar 6, 2019
in
Digital Logic

837
views
digitallogic
nand
4
answers
17
ISRO201780
The time complexity of computing the transitive closure of a binary relation on a set of $n$ elements is known to be a. $O(n\log n)$ b. $O\left( n^{3/2}\right)$ c. $O( n^3 )$ d. $O(n)$
answered
Feb 25, 2019
in
Algorithms

3.2k
views
isro2017
relations
algorithms
timecomplexity
2
answers
18
ISRO201777
If $L$ and $P$ are two recursively enumerable languages then they are not closed under Kleene star $L^*$ of $L$ Intersection $L \cap P$ Union $L \cup P$ Set difference
edited
Feb 25, 2019
in
Theory of Computation

3.6k
views
isro2017
sets
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
closureproperty
1
answer
19
Self Doubt
How to prepare for BARC exam and how many marks required to confirm interview call from the previous cutoff’s. Thankyou.
answered
Feb 21, 2019
in
Others

202
views
general
selfdoubt
1
answer
20
Peter Linz Edition 4 Exercise 2.1 Question 9 (Page No. 48)
Consider the set of strings on {$0,1$} defined by the requirements below. For each, construct an accepting dfa. (a) Every $00$ is followed immediately by a $1$. For example, the strings $101, 0010, 0010011001$ ... strings of length four or greater in which the leftmost three symbols are the same, but different from the rightmost symbol.
answer edited
Feb 20, 2019
in
Theory of Computation

768
views
theoryofcomputation
peterlinz
peterlinzedition4
finiteautomata
2
answers
21
ACE CBT 2018
Identify valid statements pertaining to switching S1: Computer networks are based on packet switching. S2: Packet switching increases the available throughput. (A) Both S1 and S2 (B) S1 only (C) S2 only (D) Neither S1 nor S2
answered
Jan 24, 2019
in
Computer Networks

121
views
computernetworks
gate2018analysis
1
answer
22
Pipeline Efficiency
A pipeline has a speedup factor of 5 and operating at 70% efficiency. How many stages are there in the pipeline?
answered
Jan 22, 2019
in
CO and Architecture

421
views
coandarchitecture
1
answer
23
MadeEasy Workbook: Operating System  Resource Allocation
A. X=40,Y=20 B.X=50,Y=10 C.X=30,Y=20 D. X=20,Y=30
answered
Jan 15, 2019
in
Operating System

164
views
operatingsystem
resourceallocation
madeeasybooklet
0
answers
24
MadeEasy Workbook: Operating System  Page Replacement
Assume there are 5 frames and consider the following reference string find the number of page faults using NRU page replacement algorithm. 3,2,3, 0,8,4,2,5,0,9,8,3,2
commented
Jan 15, 2019
in
Operating System

109
views
madeeasybooklet
operatingsystem
pagereplacement
1
answer
25
UPPCL AE 2018:45
answered
Jan 8, 2019
in
CO and Architecture

47
views
uppcl2018
1
answer
26
UPPCL AE 2018:21
commented
Jan 5, 2019
in
CO and Architecture

130
views
uppcl2018
1
answer
27
Digital Logic Made Easy
Consider the following circuit: It outputs x+y It outputs yx It outputs x+1 It outputs y+1
answered
Jan 4, 2019
in
Digital Logic

78
views
digitallogic
paralleladder
combinationalcircuits
1
answer
28
UGCNETNov2017II: 09
Negation of the proposition ⱻ x H(x) is: 1) ⱻ x ¬H(x) 2) Ɐ x ¬H(x) 3) Ɐ x H(x) 4) ¬ x H(x)
answered
Jan 2, 2019
in
Mathematical Logic

1k
views
ugcnetnov2017ii
mathematicallogic
discretemathematics
1
answer
29
Closure Properties
What is difference between Σ* and L* ? Which is true ? S1 : Σ* – {ϵ} = Σ+ S2 : L* – {ϵ} = L+ .
commented
Dec 26, 2018
in
Theory of Computation

375
views
theoryofcomputation
closureproperty
regularlanguages
0
answers
30
Conflict serializability
Is this statement"every conflict serializable schedule is also view serializable but viceviceversa is not true" is true?
commented
Dec 26, 2018
in
Databases

177
views
transactionandconcurrency
conflictserializable
52,375
questions
60,582
answers
202,000
comments
95,401
users