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 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
0
votes
1
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; }
answered
Jun 19, 2017
in
Programming

182
views
programminginc
output
+1
vote
2
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))
answered
Jun 14, 2017
in
Algorithms

146
views
+1
vote
3
Discrete Maths Graph theory
What are the necessary and sufficient conditions for Euler path and Circuit in directed graph?
answered
Jun 14, 2017
in
Mathematical Logic

307
views
graphtheory
discretemathematics
graphconnectivity
0
votes
4
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?
answered
Jun 14, 2017
in
Others

6.9k
views
0
votes
5
T(n)=3T(n/4)+cn^2 using recursion tree method.
answered
Jun 9, 2017
in
Algorithms

3.5k
views
0
votes
6
Correct order of semaphores
answered
May 4, 2017
in
Operating System

164
views
semaphore
operatingsystem
+14
votes
7
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 ____________ .
answered
Feb 18, 2017
in
Digital Logic

4.5k
views
gate20171
digitallogic
kmap
numericalanswers
normal
+6
votes
8
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
+28
votes
9
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
answered
Feb 18, 2017
in
Theory of Computation

3.5k
views
gate20171
theoryofcomputation
contextfreelanguage
normal
+6
votes
10
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
+11
votes
11
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 14, 2017
in
Theory of Computation

3.5k
views
gate20171
theoryofcomputation
contextfreelanguage
identifyclasslanguage
normal
+2
votes
12
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
vote
13
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
+8
votes
14
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
answered
Jan 23, 2017
in
Theory of Computation

356
views
theoryofcomputation
regularlanguages
+1
vote
15
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
answered
Jan 22, 2017
in
Algorithms

111
views
algorithms
recurrence
0
votes
16
number systems
answered
Jan 22, 2017
in
Digital Logic

249
views
numberrepresentation
digitallogic
0
votes
17
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
vote
18
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
+2
votes
19
Which one of the following languages is regular
answered
Jan 8, 2017
in
Theory of Computation

266
views
theoryofcomputation
regularexpressions
+2
votes
20
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
0
votes
21
MadeEasy Test Series: Databases  Relational Algebra
#plz check 3rd statement:
answered
Jan 8, 2017
in
Databases

153
views
madeeasytestseries
databases
relationalalgebra
+4
votes
22
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
0
votes
23
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
0
votes
24
MadeEasy Subject Test: Databases  Sql
Please explain how??
answered
Jan 8, 2017
in
Databases

77
views
madeeasytestseries
databases
sql
0
votes
25
DBMS8
answered
Jan 8, 2017
in
Databases

42
views
+1
vote
26
Normalization
Which of the following statements best describes the main reasons for normalizingrrelational database ? a)To achieve physical data independence b) To remove data anamolies(insertion , update , deletion , anomalies) c)To save space on disk 1) a,b,c 2)a and b 3) a and c 4)b and c
answered
Jan 8, 2017
in
Databases

918
views
+3
votes
27
GATE2016149
Consider a computer system with ten physical page frames. The system is provided with an access sequence $(a_{1}, a_{2},....,a_{20}, a_{1}, a_{2},...a_{20})$, where each $a_{i}$ is a distinct virtual page number. The difference in the number of page faults between the lastinfirstout page replacement policy and the optimal page replacement policy is_________.
answered
Jan 7, 2017
in
Operating System

6.2k
views
gate20161
operatingsystem
pagereplacement
normal
numericalanswers
+15
votes
28
GATE19981.29
Which of the following is an example of a spooled device? The terminal used to enter the input data for the C program being executed An output device used to print the output of a number of jobs The secondary memory device in a virtual storage system The swapping area on a disk used by the swapper
answered
Jan 7, 2017
in
Operating System

1.4k
views
gate1998
operatingsystem
iohandling
easy
+4
votes
29
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$
answered
Jan 7, 2017
in
Operating System

2.7k
views
gate2004it
operatingsystem
fork
easy
+4
votes
30
GATE201519
The following two functions $P1$ and $P2$ that share a variable $B$ with an initial value of $2$ ... $B$ can possibly take after the execution is______________________.
answered
Jan 7, 2017
in
Operating System

2.9k
views
gate20151
operatingsystem
processsynchronization
normal
numericalanswers
+12
votes
31
GATE2004IT67
In a particular Unix OS, each data block is of size $1024$ bytes, each node has $10$ direct data block addresses and three additional addresses: one for single indirect block, one for double indirect block and one for triple indirect block. Also, each block can contain ... following is approximately the maximum size of a file in the file system? $512$ MB $2$ GB $8$ GB $16$ GB
answered
Jan 7, 2017
in
Operating System

2.3k
views
gate2004it
operatingsystem
filesystem
normal
+2
votes
32
Normalization
answered
Jan 6, 2017
in
Databases

72
views
+1
vote
33
Er Diagram
Consider the following entity relation diagram If A has 50 entities,B has 20 entities and C has 200 entities. what is the maximum number of triples of entities that could be in the relationship Set R ? (A) 50 (B) 100 (C) 1000 (D) 10,000 ans is A,C(given) please explain how??
answered
Jan 2, 2017
in
Databases

1.2k
views
databases
erdiagram
testseries
gatebook_dbms
0
votes
34
Let a, b and c be the number of entities in entity sets A, B, and C, respectively
answered
Jan 2, 2017
in
Databases

355
views
databases
Page:
1
2
next »
50,645
questions
56,542
answers
195,693
comments
101,534
users