Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User Deepak Poonia
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Deepak Poonia
1
vote
1
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 24 (Page No. 334)
Free disk space can be kept track of using a free list or a bitmap. Disk addresses require $D$ bits. For a disk with $B$ blocks, $F$ of which are free, state the condition under which the free list uses less space ... For $D$ having the value $16$ bits, express your answer as a percentage of the disk space that must be free.
answered
in
Operating System
Nov 16
475
views
tanenbaum
operating-system
file-system
memory-management
descriptive
6
votes
2
decidability
A = { <M> | M is a DFA that accepts some string with more 1s than 0s }. Then A is - a) undecidable b) recursive enumerable c) decidable d) none of the above
answered
in
Theory of Computation
Nov 13
974
views
decidability
theory-of-computation
recursive-and-recursively-enumerable-languages
turing-machine
0
votes
3
TIFR CSE 2022 | Part B | Question: 6
We are given a graph $G$ along with a matching $M$ and a vertex cover $C$ in it such that $|M|=|C|$. Consider the following statements: $M$ is a maximum matching in $G$. $C$ is a minimum vertex cover in $G$. $G$ is a bipartite graph. Which of ... $(1)$ and $(2)$ are correct All the three statements $(1), (2),$ and $(3)$ are correct
answered
in
Graph Theory
Nov 9
131
views
tifr2022
graph-theory
graph-matching
3
votes
4
UGC NET CSE | January 2017 | Part 3 | Question: 9
Let $pk(R)$ denotes primary key of relation $R$. A many-to-one relationship that exists between two relations $R_1$ and $R_2$ can be expressed as follows: $pk(R_2)\rightarrow pk(R_1)$ $pk(R_1)\rightarrow pk(R_2)$ $pk(R_2)\rightarrow R_1 \cap R_2$ $pk(R_1)\rightarrow R_1 \cap R_2$
answered
in
Databases
Oct 28
726
views
ugcnetcse-jan2017-paper3
databases
relational-algebra
1
vote
5
UGC NET CSE | July 2018 | Part 2 | Question: 67
A many-to-one relationship exists between entity sets $r_1$ and $r_2$. How will it be represented using functional dependencies if $Pk(r)$ denotes the primary key attribute of relation $r$? $Pk(r_1) \rightarrow Pk(r_2)$ ... $Pk(r_2) \rightarrow Pk(r_1) \text{ or } Pk(r_1) \rightarrow Pk(r_2)$
answered
in
Databases
Oct 28
614
views
ugcnetcse-july2018-paper2
databases
rdbms
0
votes
6
GATE CSE 2007 | Question: 62, UGCNET-June2014-II: 47
Which one of the following statements is $\text{FALSE}$? Any relation with two attributes is in $\text{BCNF}$ A relation in which every key has only one attribute is in $\text{2NF}$ A prime attribute can be transitively dependent on ... a $\text{3 NF}$ relation A prime attribute can be transitively dependent on a key in a $\text{BCNF}$ relation
answered
in
Databases
Oct 25
18.3k
views
gatecse-2007
databases
database-normalization
normal
ugcnetcse-june2014-paper2
0
votes
7
GATE CSE 1994 | Question: 1.18
Which of the following features cannot be captured by context-free grammars? Syntax of if-then-else statements Syntax of recursive procedures Whether a variable has been declared before its use Variable names of arbitrary length
answered
in
Compiler Design
Sep 17
8.0k
views
gate1994
compiler-design
grammar
normal
3
votes
8
GATE CSE 2008 | Question: 51
Match the following: $\small{\begin{array}{|ll|ll|}\hline \text{E.} & \text{Checking that identifiers are declared before their use} & \text{P.} & \text{$L \: = \: \left\{a^nb^mc^nd^m \mid n\: \geq1, m \geq 1\right\}$} \\\hline \text{F.} & \text{Number of formal ... $\text{E-R, F-P, G-Q, H-S}$ $\text{E-P, F-R, G-S, H-Q}$
answered
in
Theory of Computation
Sep 17
11.1k
views
gatecse-2008
normal
theory-of-computation
grammar
2
votes
9
GATE CSE 1988 | Question: 15
Consider the DFA $M$ and NFA $M_{2}$ as defined below. Let the language accepted by machine $M$ be $L$. What language machine $M_{2}$ accepts, if $F2=A?$ $F2=B?$ $F2=C?$ $F2=D?$ $M=(Q, \Sigma, \delta, q_0, F)$ $M_{2}=(Q2, \Sigma, \delta_2, q_{00}, F2)$ ... $D=\{\langle p, q, r \rangle \mid p,q \in Q; r \in F\}$
answered
in
Theory of Computation
Sep 15
1.3k
views
gate1988
descriptive
theory-of-computation
finite-automata
difficult
2
votes
10
Peter Linz Edition 4 Exercise 1.2 Question 10 (Page No. 28)
Prove or disprove the following claims. (a) $(L_1 ∪ L_2)^R = L_1^R ∪ L_2^R$ for all languages $L_1$ and $L_2$. (b) $(L^R)^* = (L^*)^R$ for all languages $L$.
answered
in
Theory of Computation
Aug 30
213
views
peter-linz
peter-linz-edition4
theory-of-computation
proof
1
vote
11
Peter Linz Edition 4 Exercise 1.2 Question 8 (Page No. 28)
Prove that $(L_1L_2)^R=L_2^RL_1^R$ for all languages $L_1$ and $L_2$.
answered
in
Theory of Computation
Aug 30
145
views
peter-linz
peter-linz-edition4
theory-of-computation
proof
1
vote
12
Peter Linz Edition 4 Exercise 1.2 Question 2 (Page No. 27)
The reverse of a string can be defined more precisely by the recursive rules $a^R=a$, $(wa)^R=aw^R$, for all $a∈Σ$, $w∈Σ^*$. Use this to prove that$(uv)^R=v^Ru^R$, for all $u,v∈Σ^+$.
answered
in
Theory of Computation
Aug 11
135
views
peter-linz
peter-linz-edition4
theory-of-computation
proof
0
votes
13
Peter Linz Edition 4 Exercise 1.2 Question 1 (Page No. 27)
Use induction on $n$ to show that $|u^n|=n|u|$ for all strings $u$ and all $n$.
answered
in
Theory of Computation
Aug 11
117
views
peter-linz
peter-linz-edition4
theory-of-computation
proof
0
votes
14
GO 2022 Discrete Mathematics
Hi Sir, I would like to know if I need to go through some additional material other than K .H .Rosen text book + GATE previous papers for scoring in the test series effectively. Please help me .Please provide any contact number so that I can call you. Thank You, Prasad
answered
in
GATE
Jun 5
105
views
12
votes
15
GATE CSE 1991 | Question: 03,xii
If $F_1$, $F_2$ and $F_3$ are propositional formulae such that $F_1 \land F_2 \rightarrow F_3$ and $F_1 \land F_2 \rightarrow \sim F_3$ are both tautologies, then which of the following is true: Both $F_1$ and $F_2$ are tautologies The conjunction $F_1 \land F_2$ is not satisfiable Neither is tautologous Neither is satisfiable None of the above
answered
in
Mathematical Logic
Apr 20
5.6k
views
gate1991
mathematical-logic
normal
propositional-logic
multiple-selects
22
votes
16
GATE CSE 1990 | Question: 3-ii
Indicate which of the following statements are true: A relational database which is in $3$NF may still have undesirable data redundancy because there may exist: Transitive functional dependencies Non-trivial functional dependencies ... dependencies involving prime attributes only on the left-side. Non-trivial functional dependencies involving only prime attributes.
answered
in
Databases
Mar 20
10.0k
views
gate1990
normal
databases
database-normalization
multiple-selects
2
votes
17
Theory of Computation
"A DFA can simulate NFA" Anyone, please explain this statement in detail.
answered
in
Theory of Computation
Mar 18
301
views
theory-of-computation
finite-automata
7
votes
18
GATE CSE 2022 | Question: 9
Consider the following threads, $\text{T}_{1}, \text{T}_{2},$ and $\text{T}_{3}$ executing on a single processor, synchronized using three binary semaphore variables, $\text{S}_{1}, \text{S}_{2},$ and $\text{S}_{3},$ operated upon using standard $\textsf{wait}()$ ... $\text{S}_{1} = 0; \text{S}_{2} = 1; \text{S}_{3} = 1$
answered
in
Operating System
Feb 23
3.7k
views
gatecse-2022
operating-system
process-synchronization
semaphore
1-mark
5
votes
19
GATE CSE 2022 | Question: 13
Which of the following statements is/are $\text{TRUE}?$ Every subset of a recursively enumerable language is recursive. If a language $\textit{L}$ and its complement $\overline{\textit{L}}$ are both recursively enumerable, then $\textit{L}$ must be recursive. ... $\textit{L}_{1} \cap \textit{L}_{2}$ must be deterministic context-free.
answered
in
Theory of Computation
Feb 16
4.2k
views
gatecse-2022
theory-of-computation
identify-class-language
recursive-and-recursively-enumerable-languages
multiple-selects
1-mark
17
votes
20
GATE CSE 2022 | Question: 22
The number of arrangements of six identical balls in three identical bins is _____________ .
answered
in
Combinatory
Feb 16
2.5k
views
gatecse-2022
numerical-answers
combinatory
balls-in-bins
1-mark
10
votes
21
GATE CSE 2022 | Question: 17
Which of the following statements is/are $\text{TRUE}$ for a group $\textit{G}?$ If for all $x,y \in \textit{G}, \; (xy)^{2} = x^{2} y^{2},$ then $\textit{G}$ is commutative. If for all $x \in \textit{G}, \; x^{2} = 1,$ then ... $2,$ then $\textit{G}$ is commutative. If $\textit{G}$ is commutative, then a subgroup of $\textit{G}$ need not be commutative.
answered
in
Set Theory & Algebra
Feb 16
2.0k
views
gatecse-2022
set-theory&algebra
group-theory
multiple-selects
1-mark
4
votes
22
GATE CSE 2022 | Question: 39
Consider a simple undirected weighted graph $\textit{G},$ all of whose edge weights are distinct. Which of the following statements about the minimum spanning trees of $\textit{G}$ is/are $\text{TRUE}?$ The edge with the second smallest weight is ... always be part of any minimum spanning tree of $\textit{G}.$ $\textit{G}$ can have multiple minimum spanning trees.
answered
in
Algorithms
Feb 16
4.6k
views
gatecse-2022
algorithms
spanning-tree
minimum-spanning-tree
multiple-selects
2-marks
10
votes
23
GATE CSE 2022 | Question: 27
Consider a simple undirected unweighted graph with at least three vertices. If $\textit{A}$ is the adjacency matrix of the graph, then the number of $3–$cycles in the graph is given by the trace of $\textit{A}^{3}$ $\textit{A}^{3}$ divided by $2$ $\textit{A}^{3}$ divided by $3$ $\textit{A}^{3}$ divided by $6$
answered
in
Graph Theory
Feb 15
1.9k
views
gatecse-2022
graph-theory
graph-connectivity
2-marks
9
votes
24
GATE CSE 2022 | Question: 38
Consider the following languages: $L_{1} = \{ ww | w \in \{a,b\}^{\ast} \}$ $L_{2} = \{a^{n} b^{n} c^{m} | m,n \geq 0 \}$ $L_{3} = \{a^{m} b^{n} c^{n} | m,n \geq 0 \}$ Which of the following statements is/are $\text{FALSE}?$ ... $L_{2}$ is context-free. $L_{2}, L_{3}$ and $L_{2} \cap L_{3}$ all are context-free. Neither $L_{1}$ nor its complement is context-free.
answered
in
Theory of Computation
Feb 15
3.1k
views
gatecse-2022
theory-of-computation
context-free-language
multiple-selects
2-marks
8
votes
25
GATE CSE 2022 | Question: 36
Which of the following is/are undecidable? Given two Turing machines $\textit{M}_{1}$ and $\textit{M}_{2},$ decide if $\textit{L(M}_{1}) = \textit{L(M}_{2}).$ Given a Turing machine $\textit{M},$ decide if $\textit{L(M)}$ is ... $\textit{M},$ decide if $\textit{M}$ takes more than $1073$ steps on every string.
answered
in
Theory of Computation
Feb 15
2.4k
views
gatecse-2022
theory-of-computation
turing-machine
decidability
multiple-selects
2-marks
9
votes
26
GATE CSE 2022 | Question: 37
Consider the following languages: $L_{1} = \{ a^{n} wa^{n} | w \in \{a,b\}^{\ast}\}$ $L_{2} = \{wxw^{R} | w, x \in \{a,b\}^{*}, |w|, |x| > 0 \}$ Note that $w^{R}$ is the reversal of the string $w.$ Which of the following is/are ... $L_{2}$ are context-free. $L_{1}$ is regular and $L_{2}$ is context-free. $L_{1}$ and $L_{2}$ are context-free but not regular.
answered
in
Theory of Computation
Feb 15
1.7k
views
gatecse-2022
theory-of-computation
identify-class-language
context-free-language
multiple-selects
2-marks
8
votes
27
GATE CSE 2022 | GA Question: 5
A palindrome is a word that reads the same forwards and backwards. In a game of words, a player has the following two plates painted with letters. From the additional plates given in the options, which one of the combinations of additional plates would allow ... player should use all the five plates exactly once. The plates can be rotated in their plane. A. B. C. D.
answered
in
Spatial Aptitude
Feb 15
1.6k
views
gatecse-2022
spatial-aptitude
rotation
1-mark
Page:
1
2
3
4
5
6
...
14
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent Blog Comments
Please upload 4th Mock Test, due date was 4th Dec.
The counts of answered, marked etc in the exam...
Tests have been sent and all tests will be...
Maximum age limit changed from 35 yrs. to 28...
Hmm, sir totally getting your point ☺️☺️....