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 Jason GATE
User Jason GATE
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Jason GATE
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
6
answers
1
GATE20022.25
From the following instance of a relation schema $R(A,B,C)$ ... not functionally determine $C$ $B$ does not functionally determine $C$ $A$ does not functionally determine $B$ and $B$ does not functionally determine $C$
commented
Jan 2, 2018
in
Databases

3.4k
views
gate2002
databases
functionaldependencies
2
answers
2
C Programming
What is the o/p of following code? #include <stdio.h> int main(void) { int arr[5]={1,2,3,4,5}; int i; for(i=2;i<=5;i++) printf("%d ",arr[i*10]); return 0; }
commented
Jun 20, 2017
in
Programming

182
views
programminginc
output
1
answer
3
Gujarat PGCET papers
Is there any source that I can refer to for the PGCET (NonGate) exam papers with answers/solutions held by Gujarat for admissions in ME or MTech?
commented
Jun 15, 2017
in
Others

6.9k
views
2
answers
4
Discrete Maths Graph theory
What are the necessary and sufficient conditions for Euler path and Circuit in directed graph?
commented
Jun 15, 2017
in
Mathematical Logic

307
views
graphtheory
discretemathematics
graphconnectivity
2
answers
5
geeksforgeeks
Which of the following is true? (GATE CS 2000) (a) h(n) is 0(f(n)) (b) h(n) is 0(g(n)) (c) g(n) is not 0(f(n)) (d) f(n) is 0(g(n))
commented
Jun 15, 2017
in
Algorithms

146
views
1
answer
6
T(n)=3T(n/4)+cn^2 using recursion tree method.
answered
Jun 9, 2017
in
Algorithms

3.5k
views
0
answers
7
[Discrete Maths] Predicate logic
Are the following statements same? 1. Everybody loves exactly one person. 2.There is exactly one person whom everybody loves
commented
Jun 9, 2017
in
Mathematical Logic

99
views
mathematicallogic
firstorderlogic
propositionallogic
discretemathematics
4
answers
8
GATE2017121
Consider the Karnaugh map given below, where $X$ represents "don't care" and blank represents $0$. Assume for all inputs $\left ( a,b,c,d \right )$, the respective complements $\left ( \bar{a}, \bar{b}, \bar{c}, \bar{d} \right )$ are also available. The above logic is implemented using $2$input $\text{NOR}$ gates only. The minimum number of gates required is ____________ .
commented
May 4, 2017
in
Digital Logic

4.5k
views
gate20171
digitallogic
kmap
numericalanswers
normal
1
answer
9
Correct order of semaphores
answered
May 4, 2017
in
Operating System

164
views
semaphore
operatingsystem
1
answer
10
Efficiency in ethernet
Consider a 10 Mbps Ethernet LAN that has stations attached to a 2.5 km long coaxial cable.Given that the transmission speed is 2.3*10^8 m/s, the packet size is 128 bytes out of which 30 bytes are overhead,find the effective transmission rate ... for the calculation of the effective transmission rate I should consider just the date bytes(not the overhead) i.e 12830=98 bytes.
commented
Mar 4, 2017
in
Computer Networks

909
views
ethernet
computernetworks
csmacd
5
answers
11
GATE2017138
Consider the following languages over the alphabet $\sum = \left \{ a, b, c \right \}$. Let $L_{1} = \left \{ a^{n}b^{n}c^{m}m,n \geq 0 \right \}$ and $L_{2} = \left \{ a^{m}b^{n}c^{n}m,n \geq 0 \right \}$. Which of the following are contextfree languages? $L_{1} \cup L_{2}$ $L_{1} \cap L_{2}$ I only II only I and II Neither I nor II
commented
Feb 19, 2017
in
Theory of Computation

3.5k
views
gate20171
theoryofcomputation
contextfreelanguage
normal
11
answers
12
GATE2017122
Consider the language $L$ given by the regular expression $(a+b)^{*} b (a+b)$ over the alphabet $\{a,b\}$. The smallest number of states needed in a deterministic finitestate automaton (DFA) accepting $L$ is ___________ .
answered
Feb 18, 2017
in
Theory of Computation

5.8k
views
gate20171
theoryofcomputation
finiteautomata
numericalanswers
minimalstateautomata
8
answers
13
GATE2017137
Consider the contextfree grammars over the alphabet $\left \{ a, b, c \right \}$ given below. $S$ and $T$ are nonterminals. $G_{1}:S\rightarrow aSb \mid T, T \rightarrow cT \mid \epsilon$ ... $L\left ( G_{1} \right )\cap L(G_{2})$ is Finite Not finite but regular ContextFree but not regular Recursive but not contextfree
answered
Feb 18, 2017
in
Theory of Computation

3.5k
views
gate20171
theoryofcomputation
contextfreelanguage
identifyclasslanguage
normal
6
answers
14
GATE2017127
A multithreaded program $P$ executes with $x$ number of threads and uses $y$ number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are nonreentrant, i.e., if a thread holds a lock $l$, then it cannot reacquire lock $l$ without releasing it. If a thread ... are: $x = 1, y = 2$ $x = 2, y = 1$ $x = 2, y = 2$ $x = 1, y = 1$
commented
Feb 15, 2017
in
Operating System

9.5k
views
gate20171
operatingsystem
processsynchronization
normal
1
answer
15
GATE 2017  1 (Control flow)
The question was like this ; if e1 then e2 else e3 is statement, and e1,e2,e3 correspond to expressions. This statement has 2 control paths What are the total number of control paths if there are 10 if statements?
answered
Feb 13, 2017
in
Compiler Design

765
views
compilerdesign
1
answer
16
Introduction to Automata and Compiler Design chapter1
I know this is trivial but verify !
commented
Feb 6, 2017
in
Theory of Computation

84
views
language
1
answer
17
Introduction to Automata and Compiler Design Chapter 1
IF I TAKE L={a^p  where p is prime}......
commented
Feb 6, 2017
in
Theory of Computation

103
views
countable
language
1
answer
18
Euler Path
Which of the following Graph has Euler Path but is not an Euler Graph? A. K1,1 B.K2,10 C.K2,11 D.K10,11.
commented
Feb 1, 2017
in
Graph Theory

387
views
graphtheory
eulergraph
eulerpath
4
answers
19
GATE200770
Match the following: ... $\text{P  1, Q  4, R  2, S  5}$ $\text{P  2, Q  4, R  1, S  3}$
commented
Jan 28, 2017
in
Computer Networks

2.6k
views
gate2007
computernetworks
networklayering
networkprotocols
easy
1
answer
20
The Relation is ?
Suppose there is a set L ,set of lines and there is a Relation R, R={<L1,L2> ϵ R if L1  L2  L1,L2 ϵ L }. Relation R is, _______________. 1. Reflexive 2.Symmetric 3.Antisymmetric 4.Asymmetric 5.Transitive. Explanation in simple words with Example will be appreciated. Thanks.
commented
Jan 26, 2017
in
Set Theory & Algebra

230
views
discretemathematics
settheory&algebra
relations
2
answers
21
Whether languages regular or not
L1 ={ a^pb^q  p+q>=10^6} L2= { a^mb^n  mn>=10^6} i m not getting this can someone help me with this
commented
Jan 25, 2017
in
Theory of Computation

354
views
theoryofcomputation
regularlanguages
3
answers
22
GATE20112
A layer$4$ firewall (a device that can look at all protocol headers up to the transport layer) CANNOT block entire $\text{HTTP}$ traffic during $9:00PM$ and $5:00AM$ block all $\text{ICMP}$ traffic stop incoming traffic from specific $\text{IP}$ address but allow ... to the same IP address block $\text{TCP}$ traffic from a specific user on a multiuser system during $9:00PM$ to $5:00AM$
commented
Jan 25, 2017
in
Computer Networks

6.1k
views
gate2011
computernetworks
networksecurity
firewall
normal
2
answers
23
If L=(a+b)* and R=a*b*a* then L intersection R=?
We know, here R subset L so by formula R intersection L= R, but for any string R=L( both language are same) R intersection L can be R or L? Correct me!
answered
Jan 25, 2017
in
Theory of Computation

170
views
theoryofcomputation
regularlanguages
settheory&algebra
1
answer
24
When analyzing a recurrence of the form T(n) = a T(nb) + θ(nc),
When analyzing a recurrence of the form T(n) = a T(nb) + θ(nc), under which of the following conditions can we conclude that “most of the work occurs at the leaves of the recursion tree”? c <logb a c = logb a c > logb a None of these
commented
Jan 23, 2017
in
Algorithms

111
views
algorithms
recurrence
0
answers
25
Counter
commented
Jan 22, 2017
in
Digital Logic

97
views
2
answers
26
number systems
answered
Jan 22, 2017
in
Digital Logic

249
views
numberrepresentation
digitallogic
5
answers
27
GATE2004IT64
A process executes the following segment of code : for(i = 1; i <= n; i++) fork (); The number of new processes created is $n$ $((n(n + 1))/2)$ $2^n  1$ $3^n  1$
commented
Jan 21, 2017
in
Operating System

2.7k
views
gate2004it
operatingsystem
fork
easy
3
answers
28
IMP. DBMS doubt !!
What does different types of lines mean here? Provide some ref. if you can
commented
Jan 18, 2017
in
Databases

191
views
databases
2
answers
29
Which one of the following languages is regular
answer edited
Jan 13, 2017
in
Theory of Computation

266
views
theoryofcomputation
regularexpressions
1
answer
30
AVL Tree
What are we suppose to take? LR  2 rotations. RL 2 rotations. OR LR  1 rotation. RL 1 rotation. Kindly Solve and Verify the Total Numbers of Rotations Performed.
comment edited
Jan 9, 2017
in
DS

176
views
avltree
datastructure
4
answers
31
GateForum Test Series: Graph Theory  Graph Coloring
The Chromatic Number of Cycle Graph with 7 vertices _____
asked
Jan 9, 2017
in
Graph Theory

383
views
gateforumtestseries
engineeringmathematics
discretemathematics
graphtheory
graph
graphcoloring
1
answer
32
Virtual Gate Test Series: Databases  Sql query
answer selected
Jan 9, 2017
in
Databases

103
views
databases
sql
virtualgatetestseries
1
answer
33
Calicut Gate Academy Test Series
The Java language is: A context free language A context sensitive language A regular language Parsable fully only by a Turing machine
answered
Jan 8, 2017
in
Theory of Computation

110
views
testseries
theoryofcomputation
calicutgateacademytestseries
1
answer
34
Number of nodes
I am getting option (D). But answer is given as (B). Please check.
answered
Jan 8, 2017
in
Theory of Computation

51
views
1
answer
35
doubt
Which of the following regular expression generates the set of all strings not containing ‘baa’ as a substring over input alphabet {a, b}? (a) a*(b*a)* (b) a*b*ab (c) a*baba* (d) a*(ba+b)* i think an answer would be both B & D but an answer is given D
answered
Jan 8, 2017
in
Theory of Computation

244
views
theoryofcomputation
2
answers
36
Virtual Gate Test Series: Theory Of Computation  DFA
Number of states in the $\text{DFA}$ accepting the language $L=\{a^{n}b^{n}1\leq n\leq 3\}$ over $\sum=\{a,b\}.$
asked
Jan 8, 2017
in
Theory of Computation

135
views
theoryofcomputation
finiteautomata
numberofstates
virtualgatetestseries
0
answers
37
Virtual Gate Test Series: Computer Networks  Round Trip Time
But I am getting 5.427 as Answer. And unfortunately that is given incorrect. Kindly Explain. Thnks.
asked
Jan 8, 2017
in
Computer Networks

111
views
computernetworks
roundtriptime
virtualgatetestseries
1
answer
38
MadeEasy Test Series: Databases  Relational Algebra
#plz check 3rd statement:
answered
Jan 8, 2017
in
Databases

153
views
madeeasytestseries
databases
relationalalgebra
2
answers
39
Difference between record & block pointer
What is the difference between record & block pointer and any resource with diagram to know more about it? Keys and records are same or not ?
answered
Jan 8, 2017
in
Databases

1.2k
views
databases
1
answer
40
Avl vs btree
I know advantages of btree. But after reading that I want to ask in what aspect Avl trees are useful over b tree? Give some example please.
answered
Jan 8, 2017
in
Databases

394
views
databases
btree
50,644
questions
56,516
answers
195,580
comments
101,143
users