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
Recent activity by Deepak Poonia
5
answers
1
GATE CSE 2002 | Question: 15
A university placement center maintains a relational database of companies that interview students on campus and make job offers to those successful in the interview. The schema of the database is given below: ... students were offered jobs, the name of the degree and the average offered salary of students in this degree program.
commented
in
Databases
11 hours
ago
4.1k
views
gatecse-2002
databases
normal
descriptive
relational-algebra
sql
2
answers
2
Kenneth Rosen Edition 6th Exercise 1.1 Question 15 (Page No. 18)
For each of these sentences, determine whether an inclusive or, or an exclusive or, is intended. Explain your answer. Coffee or tea comes with dinner. A password must have at least three digits or be at least eight characters long. ... is a course in number theory or a course in cryptography. You can pay using U.S. dollars or euros.
commented
in
Mathematical Logic
1 day
ago
5.2k
views
mathematical-logic
discrete-mathematics
kenneth-rosen
descriptive
1
answer
3
NIELIT Scientist B 2020 November: 84
Given the truth table of a Binary Operation \$ as follows: $ ... 1 }\\ \hline \end{array}$ Identify the matching Boolean Expression. $X \$ ┐ Y$ $┐ X \$ Y$ $┐ X \$ ┐ Y$ none of the options
recategorized
in
Mathematical Logic
1 day
ago
167
views
nielit-scb-2020
mathematical-logic
propositional-logic
discrete-mathematics
1
answer
4
Kenneth Rosen Edition 6th Exercise 1.1 Question 4 (Page No. 16)
Let p and q be the propositions p : I bought a lottery ticket this week. q : I won the million dollar jackpot. Express each of these propositions as an English sentence. $\neg p$ $p \vee q$ $p \rightarrow q$ $p \wedge q$ $p \leftrightarrow q$ $\neg p \rightarrow \neg q$ $\neg p \wedge \neg q$ $\neg p \vee (p \wedge q)$
commented
in
Mathematical Logic
6 days
ago
2.8k
views
kenneth-rosen
mathematical-logic
1
answer
5
Null Qunatification Rule
What is the meaning of NULL Quantification Rule in Predicate Calculus ?
commented
in
Mathematical Logic
6 days
ago
2.2k
views
discrete-mathematics
propositional-logic
3
answers
6
GATE CSE 2001 | Question: 20
Consider a disk with the $100$ tracks numbered from $0$ to $99$ rotating at $3000$ rpm. The number of sectors per track is $100$ and the time to move the head between two successive tracks is $0.2$ millisecond. Consider a set of disk ... at track $0$ and the elevator algorithm is used to schedule disk requests, what is the worse case time to complete all the requests?
commented
in
Operating System
Nov 24
8.2k
views
gatecse-2001
operating-system
disk
normal
descriptive
6
answers
7
GATE CSE 1999 | Question: 2-18, ISRO2008-46
Raid configurations of the disks are used to provide Fault-tolerance High speed High data density (A) & (B)
commented
in
Operating System
Nov 24
8.1k
views
gate1999
operating-system
disk
easy
isro2008
3
answers
8
GATE CSE 1998 | Question: 25-a
Free disk space can be used to keep track of using a free list or a bit map. 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 than the bit map.
commented
in
Operating System
Nov 16
3.8k
views
gate1998
operating-system
disk
descriptive
2
answers
9
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
477
views
tanenbaum
operating-system
file-system
memory-management
descriptive
3
answers
10
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
answer edited
in
Theory of Computation
Nov 13
974
views
decidability
theory-of-computation
recursive-and-recursively-enumerable-languages
turing-machine
1
answer
11
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
commented
in
Graph Theory
Nov 9
131
views
tifr2022
graph-theory
graph-matching
4
answers
12
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
4
answers
13
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)$
comment edited
in
Databases
Oct 28
614
views
ugcnetcse-july2018-paper2
databases
rdbms
2
answers
14
GATE CSE 1989 | Question: 3-iii
Which of the following problems are undecidable? Membership problem in context-free languages. Whether a given context-free language is regular. Whether a finite state automation halts on all inputs. Membership problem for type $0$ languages.
comment edited
in
Theory of Computation
Oct 28
8.0k
views
gate1989
normal
theory-of-computation
decidability
multiple-selects
6
answers
15
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
5
answers
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.
answer edited
in
Databases
Oct 25
10.0k
views
gate1990
normal
databases
database-normalization
multiple-selects
3
answers
17
GATE IT 2008 | Question: 61
Let $R (A, B, C, D)$ be a relational schema with the following functional dependencies : $A → B$, $B → C$, $C → D$ and $D → B$. The decomposition of $R$ into $(A, B), (B, C), (B, D)$ gives a ... a lossless join, but is not dependency preserving does not give a lossless join, but is dependency preserving does not give a lossless join and is not dependency preserving
comment edited
in
Databases
Oct 25
29.3k
views
gateit-2008
databases
database-normalization
normal
5
answers
18
GATE CSE 2021 Set 1 | Question: 33
Consider the relation $R(P,Q,S,T,X,Y,Z,W)$ with the following functional dependencies. $PQ\rightarrow X;\quad P\rightarrow YX;\quad Q\rightarrow Y; \quad Y\rightarrow ZW$ Consider the decomposition of the relation $R$ into the ... $D_2$ is a lossless decomposition Both $D_1$ and $D_2$ are lossless decompositions Both $D_1$ and $D_2$ are lossy decompositions
answer edited
in
Databases
Oct 25
6.1k
views
gatecse-2021-set1
databases
database-normalization
2-marks
5
answers
19
GATE CSE 2003 | Question: 53
A single tape Turing Machine $M$ has two states $q0$ and $q1$, of which $q0$ is the starting state. The tape alphabet of $M$ is $\{0, 1, B\}$ and its input alphabet is $\{0, 1\}$. The symbol $B$ is the blank symbol used to indicate end of an input ... halt on any string in $(00+1)^*$ $M$ halts on all strings ending in a $0$ $M$ halts on all strings ending in a $1$
comment edited
in
Theory of Computation
Oct 21
9.4k
views
gatecse-2003
theory-of-computation
turing-machine
normal
6
answers
20
GATE CSE 2019 | Question: 15
For $\Sigma = \{a ,b \}$, let us consider the regular language $L=\{x \mid x = a^{2+3k} \text{ or } x=b^{10+12k}, k \geq 0\}$. Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for $L$ ? $3$ $5$ $9$ $24$
comment edited
in
Theory of Computation
Oct 19
25.6k
views
gatecse-2019
theory-of-computation
pumping-lemma
1-mark
2
answers
21
GATE CSE 1990 | Question: 3-vii
It is undecidable whether: An arbitrary Turing machine halts after $100$ steps. A Turing machine prints a specific letter. A Turing machine computes the products of two numbers None of the above.
answer edited
in
Theory of Computation
Oct 18
9.8k
views
gate1990
normal
theory-of-computation
decidability
multiple-selects
10
answers
22
GATE CSE 2019 | Question: 35
Consider the first order predicate formula $\varphi$: $\forall x [ ( \forall z \: z | x \Rightarrow (( z=x) \vee (z=1))) \rightarrow \exists w ( w > x) \wedge (\forall z \: z | w \Rightarrow ((w=z) \vee (z=1)))]$ Here $a \mid b$ denotes ... of all integers Which of the above sets satisfy $\varphi$? $S_1$ and $S_2$ $S_1$ and $S_3$ $S_2$ and $S_3$ $S_1, S_2$ and $S_3$
answer edited
in
Mathematical Logic
Oct 15
14.7k
views
gatecse-2019
engineering-mathematics
discrete-mathematics
mathematical-logic
first-order-logic
2-marks
3
answers
23
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
4
answers
24
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
1
answer
25
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
1
answer
26
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
answer
27
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
answer
28
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
1
answer
29
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
1
answer
30
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
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 ☺️☺️....