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

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exam Category
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Answers by nikunj
User nikunj
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User nikunj
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+3
votes
1
Dining philosophers problem
In dining philosophers Algorithm the minimum number of forks or chopsticks to avoid deadlock is (assume there are 5 philosophers) a. 5 b. 6 c. 10 d. None of these
answered
Sep 13
in
Operating System

209
views
operatingsystem
0
votes
2
Finite Automata to Regular Expression.Can this be solved further?
answered
Sep 13
in
Theory of Computation

149
views
finiteautomata
regularexpressions
theoryofcomputation
0
votes
3
GATE200933
The enter_CS() and leave_CS() functions to implement critical section of a process are realized using testandset instruction as follows: void enter_CS(X) { while(testandset(X)); } void leave_CS(X) { X = 0; } In the above solution, X is a ... process can enter CS at the same time Which of the above statements are TRUE? I only I and II II and III IV only
answered
Sep 10
in
Operating System

2.4k
views
gate2009
operatingsystem
processsynchronization
normal
0
votes
4
GATE2014235
Let $\langle M \rangle$ be the encoding of a Turing machine as a string over $\Sigma=\left\{0,1\right\}$. Let $$L=\left\{\langle M \rangle \mid M \text{ is a Turing machine}\\\ ... .$$ Then $L$ is decidable and recursively enumerable undecidable but recursively enumerable undecidable and not recursively enumerable decidable but not recursively enumerable
answered
Sep 7
in
Theory of Computation

3.1k
views
gate20142
theoryofcomputation
turingmachine
normal
+1
vote
5
GATE19872h
State whether the following statements are TRUE or FALSE: Regularity is preserved under the operation of string reversal.
answered
Sep 7
in
Theory of Computation

137
views
gate1987
regularlanguages
theoryofcomputation
0
votes
6
Regular or CFL
L={w length of w is odd and its middle symbol is 0, wε{0,1}* } Reg or CFL?
answered
Sep 6
in
Theory of Computation

70
views
theoryofcomputation
+1
vote
7
CFL or not
L={ wε(a+b)*  #a  #b <=10 } CFL or Reg ?
answered
Sep 6
in
Theory of Computation

46
views
theoryofcomputation
0
votes
8
PDA =FA+1stack??
we know that PDA = FA+1stack so why we use the stack data structure in PDA, we have much more data structure like linked liste,queue, array or tree/hashing???
answered
Sep 1
in
Theory of Computation

40
views
pushdownautomata
0
votes
9
GATE19903viii
Choose the correct alternatives (More than one may be correct). Let $R_{1}$ and $R_{2}$ be regular sets defined over the alphabet $\Sigma$ Then: $R_{1} \cap R_{2}$ is not regular. $R_{1} \cup R_{2}$ is regular. $\Sigma^{*}R_{1}$ is regular. $R_{1}^{*}$ is not regular.
answered
Aug 31
in
Theory of Computation

365
views
gate1990
normal
theoryofcomputation
regularlanguages
+1
vote
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 aSbT, T\rightarrow cT\in$ $G_{2}:S\rightarrow bSaT, T\rightarrow cT\in$ The language $L\ ... )$ is (A) Finite. (B) Not finite but regular. (C) ContextFree but not regular. (D) Recursive but not contextfree.
answered
Aug 31
in
Theory of Computation

1.2k
views
gate20171
theoryofcomputation
contextfreelanguage
identifyclasslanguage
normal
0
votes
11
GATE200955
Consider the following relational schema: $\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ $\text{Parts}(\underline{\text{pid:integer}}, \text{ pname:string, color:string})$ $\text{ ... all suppliers who have supplied only nonblue part. Find the names of all suppliers who have not supplied only blue parts.
answered
Aug 30
in
Databases

2.8k
views
gate2009
databases
sql
subqueries
normal
+3
votes
12
GATE200668
Consider the relation enrolled (student, course) in which (student, course) is the primary key, and the relation paid (student, amount) where student is the primary key. Assume no null values and no foreign keys or ... which Query3 returns strictly fewer rows than Query2 There exist databases for which Query4 will encounter an integrity violation at runtime
answered
Aug 30
in
Databases

1.9k
views
gate2006
databases
sql
normal
+3
votes
13
GATE2011_32
Consider a database table T containing two columns $\text{X}$ and $\text{Y}$ each of type $\text{integer}$. After the creation of the table, one record $\text{(X=1, Y=1)}$ is inserted in the table. Let $\text{MX}$ and $\text{MY}$ denote the ... query after the steps mentioned above are carried out? SELECT Y FROM T WHERE X=7; (A) 127 (B) 255 (C) 129 (D) 257
answered
Aug 30
in
Databases

891
views
gate2011
databases
sql
normal
0
votes
14
GATE2014321
What is the optimized version of the relation algebra expression $\pi_{A1}(\pi_{A2}(\sigma_{F1}(\sigma_{F2}(r))))$, where $A1, A2$ are sets of attributes in $r$ with $A1 \subset A2$ and $F1,F2$ are Boolean expressions based on the attributes in $r$? $\pi_{A1}(\sigma_{ ... F2)}(r))$ $\pi_{A2}(\sigma_{(F1 \wedge F2)}(r))$ $\pi_{A2}(\sigma_{(F1 \vee F2)}(r))$
answered
Aug 30
in
Databases

649
views
gate20143
databases
relationalalgebra
easy
+2
votes
15
GATE2007IT65
Consider a selection of the form $\sigma_{A\leq 100} (r)$, where $r$ is a relation with 1000 tuples. Assume that the attribute values for A among the tuples are uniformly distributed in the interval [0, 500]. Which one of the following options is the best estimate of the number of tuples returned by the given selection query ? 50 100 150 200
answered
Aug 30
in
Databases

1.3k
views
gate2007it
databases
relationalcalculus
probability
uniformdistribution
normal
0
votes
16
GATE2006IT61
In a database file structure, the search key field is 9 bytes long, the block size is 512 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest possible order of a nonleaf node in a B+ tree implementing this file structure is 23 24 34 44
answered
Aug 30
in
Databases

897
views
gate2006it
databases
btree
normal
–1
vote
17
GATE2004IT78
Consider two tables in a relational database with columns and rows as follows: Table: Student Roll_no Name Dept_id 1 ABC 1 2 DEF 1 3 GHI 2 4 JKL 3 Table: Department Dept_id Dept_name 1 A 2 B 3 C Roll_no is the primary key of the Student table ... i and ii will fail i will fail but ii will succeed i will succeed but ii will fail Both i and ii will succeed
answered
Aug 30
in
Databases

896
views
gate2004it
databases
sql
normal
0
votes
18
GATE2007IT28
Consider a hash function that distributes keys uniformly. The hash table size is 20. After hashing of how many keys will the probability that any new key hashed collides with an existing one exceed 0.5. 5 6 7 10
answered
Aug 29
in
DS

2.3k
views
gate2007it
datastructure
hashing
probability
normal
0
votes
19
GATE2006IT71
An array $X$ of $n$ distinct integers is interpreted as a complete binary tree. The index of the first element of the array is $0$. The index of the parent of element $X[i], i \neq 0$, is? $\left \lfloor \dfrac i 2 \right \rfloor$ $\left \lceil \ ... 1}{2} \right \rceil$ $\left \lceil \dfrac i 2 \right \rceil$ $\left \lceil \dfrac i 2 \right \rceil  1$
answered
Aug 29
in
DS

1k
views
gate2006it
datastructure
binarytree
normal
–1
vote
20
GATE200956
Consider the following relational schema: $\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ $\text{Parts}(\underline{\text{pid:integer}}, \text{ pname:string, color:string})$ $\text{Catalog}(\underline {\ ... The schema is in 3NF but not in BCNF The schema is in 2 NF but not in 3NF The schema is not in 2NF
answered
Aug 28
in
Databases

1.9k
views
gate2009
databases
sql
databasenormalization
normal
0
votes
21
GATE20153_25
Consider a binary tree T that has 200 leaf nodes. Then the number of nodes in T that have exactly two children are ______.
answered
Aug 28
in
DS

2k
views
gate20153
datastructure
binarytree
normal
numericalanswers
0
votes
22
GATE19882xvi
Write the adjacency matrix representation of the graph given in below figure.
answered
Dec 19, 2016
in
Graph Theory

132
views
gate1988
descriptive
graphtheory
adjacencymatrix
0
votes
23
cardinality ratio
answered
Dec 19, 2016
in
Databases

73
views
acetestseries
databases
28,834
questions
36,686
answers
90,617
comments
34,640
users