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
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
4
answers
1
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
in
Theory of Computation

2.4k
views
gate2019
theoryofcomputation
regularlanguages
6
answers
2
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
in
Algorithms

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

3k
views
gate2000
digitallogic
numberrepresentation
easy
4
answers
4
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 17
in
Databases

3.9k
views
gate20151
databases
sql
normal
numericalanswers
3
answers
5
UGCNETJune2012III33
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 complexity ... for 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 10
in
IS&Software Engineering

1.4k
views
ugcnetjune2012iii
is&softwareengineering
softwaremetric
3
answers
6
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
in
Mathematical Logic

107
views
propositionallogic
discretemathematics
mathematicallogic
firstorderlogic
engineeringmathematics
2
answers
7
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 10
in
Numerical Methods

953
views
isro2009
polynomials
0
answers
8
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
in
Digital Logic

420
views
digitallogic
nand
4
answers
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
in
Algorithms

2.9k
views
isro2017
relations
algorithms
timecomplexity
2
answers
10
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
in
Theory of Computation

3k
views
isro2017
sets
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
closureproperty
1
answer
11
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
in
Others

149
views
general
selfdoubt
1
answer
12
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
in
Theory of Computation

362
views
theoryofcomputation
peterlinz
finiteautomata
1
answer
13
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
in
Computer Networks

83
views
computernetworks
gate2018analysis
1
answer
14
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
in
CO and Architecture

78
views
coandarchitecture
1
answer
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
in
Operating System

102
views
operatingsystem
resourceallocation
madeeasybooklet
0
answers
16
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
in
Operating System

83
views
madeeasybooklet
operatingsystem
pagereplacement
1
answer
17
UPPCL AE 2018:45
answered
Jan 8
in
CO and Architecture

41
views
uppcl2018
1
answer
18
UPPCL AE 2018:21
commented
Jan 5
in
CO and Architecture

105
views
uppcl2018
1
answer
19
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
in
Digital Logic

60
views
digitallogic
paralleladder
combinationalcircuits
1
answer
20
UGCNETNov2017II09
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
in
Mathematical Logic

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

225
views
theoryofcomputation
closureproperty
regularlanguages
0
answers
22
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

84
views
transactionandconcurrency
conflictserializable
0
answers
23
Conflict serialziability
How the option c is correct for the given schedules?
retagged
Dec 26, 2018
in
Databases

36
views
transactionandconcurrency
1
answer
24
MadeEasy Subject Test 2019: Theory Of Computation  Finite Automata
answered
Dec 19, 2018
in
Theory of Computation

120
views
madeeasytestseries
theoryofcomputation
finiteautomata
2
answers
25
DFA doubt
DFA in which 01 and 10 have equal number of occurrences
commented
Dec 14, 2018
in
Theory of Computation

158
views
finiteautomata
theoryofcomputation
#dfa
1
answer
26
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

173
views
minimumspanningtrees
1
answer
27
Conversion of NFA to DFA
convert the following NFA to DFA
answered
Dec 14, 2018
in
Theory of Computation

141
views
theoryofcomputation
finiteautomata
nfa
2
answers
28
ME test series DFA states
The number of states in minimal DFA for strings starting with $ab^{2}$ and ending with $b$ over the alphabet $\left \{ a,b \right \}$ is__________. // doubt: minimal string should be $ abb $ right?
commented
Dec 14, 2018
in
Theory of Computation

74
views
theoryofcomputation
numberofstates
minimalstateautomata
1
answer
29
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 ________
commented
Dec 13, 2018
in
Programming

99
views
1
answer
30
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

138
views
madeeasytestseries
datastructure
binarytree
1
answer
31
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

68
views
1
answer
32
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

36
views
1
answer
33
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

38
views
1
answer
34
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

54
views
1
answer
35
MadeEasy Test Series 2019: Programming & DS  Arrays
Given a 2D array A[40….95, 40...95] in lower triangular representation, size of each element is 1 Byte Array implemented in row major order, base address is 1000 Address of A[66][50] ?
answer edited
Dec 13, 2018
in
DS

98
views
madeeasytestseries
datastructure
arrays
1
answer
36
MadeEasy Subject Test 2019: Operating System  File System
Unix Inode has block size 8 KB and file possible with triple indirect is 128 GB.Number of bits disk block address contain is?
answered
Dec 12, 2018
in
Operating System

117
views
madeeasytestseries
operatingsystem
filesystem
3
answers
37
CE_1_GA_GATE2018
Each of the letters arranged as below represents a unique integer from 1 to 9. The letters are positioned in the figure such that (A × B × C), (B × G × E) and (D × E × F) are equal. Which integer among the following choices cannot be represented by the letters A, B, C, D, E, F or G? (A)4 (B)5 (C)6 (D)9 Please explain with proper reason.
answered
Dec 12, 2018
in
Verbal Ability

429
views
generalaptitude
gate2018
1
answer
38
Self Doubt
Which of the following ALWAYS gives MINIMUM average waiting time and minimum average Turn around time SJF (Non preemptive) SRTF (Preemptive)
answered
Dec 11, 2018
in
Operating System

40
views
operatingsystem
cpuscheduling
1
answer
39
ACE TEST SERIES QUESTION
answered
Dec 11, 2018
in
CO and Architecture

36
views
1
answer
40
construct of Deterministic Finite Automata (DFA) from following regular expression (0+1)*(00+11) (0+1)*
answered
Dec 10, 2018
in
Theory of Computation

557
views
50,644
questions
56,505
answers
195,557
comments
101,057
users