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
Answers 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
0
votes
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
0
votes
2
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

735
views
heap
binaryheap
datastructures
0
votes
3
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

575
views
mergesort
timecomplexity
0
votes
4
#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

126
views
graphtheory
0
votes
5
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
+1
vote
6
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
0
votes
7
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
0
votes
8
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
votes
9
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
0
votes
10
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

200
views
general
selfdoubt
0
votes
11
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.
answered
Feb 20, 2019
in
Theory of Computation

761
views
theoryofcomputation
peterlinz
peterlinzedition4
finiteautomata
+1
vote
12
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
0
votes
13
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

417
views
coandarchitecture
0
votes
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.
answered
Jan 22, 2019
in
Mathematical Logic

151
views
propositionallogic
discretemathematics
mathematicallogic
firstorderlogic
engineeringmathematics
+1
vote
15
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

163
views
operatingsystem
resourceallocation
madeeasybooklet
0
votes
16
UPPCL AE 2018:45
answered
Jan 8, 2019
in
CO and Architecture

47
views
uppcl2018
0
votes
17
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

77
views
digitallogic
paralleladder
combinationalcircuits
0
votes
18
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

998
views
ugcnetnov2017ii
mathematicallogic
discretemathematics
0
votes
19
Closure Properties
What is difference between Σ* and L* ? Which is true ? S1 : Σ* – {ϵ} = Σ+ S2 : L* – {ϵ} = L+ .
answered
Dec 24, 2018
in
Theory of Computation

367
views
theoryofcomputation
closureproperty
regularlanguages
+1
vote
20
MadeEasy Subject Test 2019: Theory Of Computation  Finite Automata
answered
Dec 19, 2018
in
Theory of Computation

141
views
madeeasytestseries
theoryofcomputation
finiteautomata
+1
vote
21
Made easy test series
What we do if graph is complete with 5 vertices and weight are 1,2,3,4,5,6,7,8,9 and 10. than find maximum possible weight that a minimum weight spanning tree of G have..???
answered
Dec 14, 2018
in
Algorithms

305
views
minimumspanningtrees
+1
vote
22
Conversion of NFA to DFA
convert the following NFA to DFA
answered
Dec 14, 2018
in
Theory of Computation

280
views
theoryofcomputation
finiteautomata
nfadfa
0
votes
23
MadeEasy Subject Test 2019: Programming & DS  Binary Tree
four vertices {A,B,C,D} is given which has only vertex D as a leaf total number of binary tree are possible when every binary tree has four node!
answered
Dec 13, 2018
in
DS

305
views
madeeasytestseries
datastructures
binarytree
+7
votes
24
ME Test Series
Four vertices (A,B,C,D) is given which have only vertex D as a leaf. Total number of binary trees possible when every binary tree has four nodes is ________
answered
Dec 13, 2018
in
Programming

122
views
0
votes
25
ME test series
If the broadcast address of the subnet is given as 163.93.63.255, which of the following mask cannot suit the above address? A) 255.255.240.0 B) 255.255.248.0 C) 255.255.128.0 D) Both (a) and (b)
answered
Dec 13, 2018
in
Computer Networks

93
views
+1
vote
26
ME Test Series
The minimum number of comparisons required to find the $65^{th}$ smallest element in a minheap is equal to _____
answered
Dec 13, 2018
in
DS

43
views
+1
vote
27
aai question 2018
In a full binary tree of height 10 the number of nodes with degree 0,1 and 2 will be ______ , ______,and _____ respectively Note:Consider height of a tree as the number of nodes in the longest path from root node to any leaf node. A. 511, 1 , 511 B.511 , 0 , 512 C.512 , 0 , 511 C.512 , 1, 510
answered
Dec 13, 2018
in
Programming

88
views
+2
votes
28
aai 2018
Which of the following is the time complexity to find the determinant of an upper triangular matrix of order n*n? O(n^2.5) O(n) O(n^2) O(1)
answered
Dec 13, 2018
in
DS

105
views
Page:
1
2
3
next »
52,345
questions
60,513
answers
201,931
comments
95,356
users