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 King Suleiman
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by King Suleiman
1
vote
1
GATE CSE 2016 Set 2 | Question: 28
Consider a set $U$ of $23$ different compounds in a chemistry lab. There is a subset $S$ of $U$ of $9$ compounds, each of which reacts with exactly $3$ compounds of $U$. Consider the following statements: Each compound in U \ S reacts ... \ S reacts with an even number of compounds. Which one of the above statements is ALWAYS TRUE? Only I Only II Only III None.
answered
in
Set Theory & Algebra
Jan 24, 2020
12.5k
views
gatecse-2016-set2
set-theory&algebra
difficult
set-theory
7
votes
2
GATE CSE 2015 Set 2 | Question: GA-7
Four branches of a company are located at $\text{M, N, O}$ and $\text{P. M}$ is north of $\text{N}$ at a distance of $4\;\text{km; P}$ is south of $\text{O}$ at a distance of $2\;\text{km; N}$ is southeast of $\text{O}$ by $1\;\text{km}$. What is the distance between $\text{M}$ and $\text{P}$ in $\text{km}$? $5.34$ $6.74$ $28.5$ $45.49$
answered
in
Analytical Aptitude
Dec 29, 2019
9.9k
views
gatecse-2015-set2
analytical-aptitude
normal
direction-sense
1
vote
3
GATE CSE 2016 Set 2 | Question: 50
A file system uses an in-memory cache to cache disk blocks. The miss rate of the cache is shown in the figure. The latency to read a block from the cache is $1$ ms and to read a block from the disk is $10$ ms. Assume that the cost ... in multiples of $10$ MB. The smallest cache size required to ensure an average read latency of less than $6$ ms is _________ MB.
answered
in
CO and Architecture
Nov 22, 2019
11.3k
views
gatecse-2016-set2
co-and-architecture
cache-memory
normal
numerical-answers
2
votes
4
GATE CSE 2017 Set 1 | Question: 11
Consider the $C$ struct defined below: struct data { int marks [100]; char grade; int cnumber; }; struct data student; The base address of student is available in register $R1$. The field student.grade can be accessed efficiently using: Post-increment ... mode, $X(R1)$, where $X$ is an offset represented in $2's$ complement $16\text{-bit}$ representation
answered
in
CO and Architecture
Nov 15, 2019
11.4k
views
gatecse-2017-set1
co-and-architecture
addressing-modes
4
votes
5
GATE CSE 2017 Set 1 | Question: 49
Consider a RISC machine where each instruction is exactly $4$ bytes long. Conditional and unconditional branch instructions use PC-relative addressing mode with Offset specified in bytes to the target location of the branch instruction. Further the Offset is ... $i,$ then the decimal value of the Offset is ____________ .
answered
in
CO and Architecture
Nov 14, 2019
11.1k
views
gatecse-2017-set1
co-and-architecture
normal
numerical-answers
instruction-execution
1
vote
6
GATE CSE 2018 | Question: 43
Let $G$ be a graph with $100!$ vertices, with each vertex labelled by a distinct permutation of the numbers $1, 2,\ldots, 100.$ There is an edge between vertices $u$ and $v$ if and only if the label of $u$ can be obtained by swapping two adjacent ... denote the degree of a vertex in $G$, and $z$ denote the number of connected components in $G$. Then, $y+10z=$ ______.
answered
in
Algorithms
Aug 26, 2019
16.1k
views
gatecse-2018
algorithms
graph-algorithms
numerical-answers
2-marks
1
vote
7
GATE CSE 2016 Set 2 | Question: 02
Let $f(x)$ be a polynomial and $g(x)=f'(x)$ be its derivative. If the degree of $(f(x)+f(-x))$ is $10$, then the degree of $(g(x) - g(-x))$ is __________.
answered
in
Calculus
Aug 25, 2019
8.2k
views
gatecse-2016-set2
calculus
normal
numerical-answers
differentiation
0
votes
8
GATE CSE 2014 Set 2 | Question: 51
A cycle on $n$ vertices is isomorphic to its complement. The value of $n$ is _____.
answered
in
Graph Theory
Aug 21, 2019
14.4k
views
gatecse-2014-set2
graph-theory
numerical-answers
normal
graph-isomorphism
non-gate
5
votes
9
GATE CSE 2014 Set 2 | Question: 36
Let $L_1=\{w\in\{0,1\}^*\mid w$ $\text{ has at least as many occurrences of }$ $(110)'\text{s as }$ $(011)'\text{s} \}$. Let $L_2=\{w \in\{0,1\}^*\ \mid w$ $ \text{ has at least as many occurrences of }$ ... is TRUE? $L_1$ is regular but not $L_2$ $L_2$ is regular but not $L_1$ Both $L_1$ and $L_2$ are regular Neither $L_1$ nor $L_2$ are regular
answered
in
Theory of Computation
Jul 23, 2019
19.7k
views
gatecse-2014-set2
theory-of-computation
normal
regular-language
4
votes
10
GATE CSE 2012 | Question: 46
Consider the set of strings on $\{0,1\}$ in which, every substring of $3$ symbols has at most two zeros. For example, $001110$ and $011001$ are in the language, but $100010$ is not. All strings of length less than $3$ are also in the language. A partially ...
answered
in
Theory of Computation
Jul 23, 2019
10.6k
views
gatecse-2012
theory-of-computation
finite-automata
normal
2
votes
11
GATE CSE 2010 | Question: 41
Let $w$ be any string of length $n$ in $\{0,1\}^*$. Let $L$ be the set of all substrings of $w$. What is the minimum number of states in non-deterministic finite automation that accepts $L$? $n-1$ $n$ $n+1$ $2^{n-1}$
answered
in
Theory of Computation
Jul 23, 2019
19.8k
views
gatecse-2010
theory-of-computation
finite-automata
normal
minimal-state-automata
0
votes
12
GATE CSE 2009 | Question: 16, ISRO2017-12
Which one of the following is FALSE? There is a unique minimal DFA for every regular language Every NFA can be converted to an equivalent PDA. Complement of every context-free language is recursive. Every nondeterministic PDA can be converted to an equivalent deterministic PDA.
answered
in
Theory of Computation
Jul 23, 2019
12.8k
views
gatecse-2009
theory-of-computation
easy
isro2017
pushdown-automata
1
vote
13
GATE CSE 2009 | Question: 27
Given the following state table of an FSM with two states $A$ and $B$ ... length of an input string which will take the machine to the state $A=0,B=1$ with $output=1$. $3$ $4$ $5$ $6$
answered
in
Theory of Computation
Jul 23, 2019
10.2k
views
gatecse-2009
theory-of-computation
finite-automata
normal
3
votes
14
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
Jul 23, 2019
11.5k
views
gatecse-2008
normal
theory-of-computation
grammar
0
votes
15
GATE CSE 2008 | Question: 52
Match the following NFAs with the regular expressions they correspond to: P Q R S $\epsilon + 0\left(01^*1+00\right)^*01^*$ $\epsilon + 0\left(10^*1+00\right)^*0$ $\epsilon + 0\left(10^*1+10\right)^*1$ $\epsilon + 0\left(10^*1+10\right)^*10^*$ $P-2, Q-1, R-3, S-4$ $P-1, Q-3, R-2, S-4$ $P-1, Q-2, R-3, S-4$ $P-3, Q-2, R-1, S-4$
answered
in
Theory of Computation
Jul 23, 2019
10.0k
views
gatecse-2008
theory-of-computation
finite-automata
normal
0
votes
16
GATE IT 2008 | Question: 34
Consider a CFG with the following productions. $S \to AA \mid B$ $A \to 0A \mid A0 \mid 1$ $B \to 0B00 \mid 1$ $S$ is the start symbol, $A$ and $B$ ... $\{0, 1\}$ containing at least two $0$'s
answered
in
Theory of Computation
Jul 23, 2019
12.5k
views
gateit-2008
theory-of-computation
context-free-language
normal
7
votes
17
GATE CSE 2007 | Question: 7
Which of the following is TRUE? Every subset of a regular set is regular Every finite subset of a non-regular set is regular The union of two non-regular sets is not regular Infinite union of finite sets is regular
answered
in
Theory of Computation
Jul 23, 2019
13.1k
views
gatecse-2007
theory-of-computation
easy
regular-language
2
votes
18
GATE CSE 2007 | Question: 29
A minimum state deterministic finite automaton accepting the language $L=\{w\mid w \in \{0, 1\}^*,$ number of $0$s and $1$s in $w$ are divisible by $3$ and $5$, respectively $\}$ has $15$ states $11$ states $10$ states $9$ states
answered
in
Theory of Computation
Jul 23, 2019
8.8k
views
gatecse-2007
theory-of-computation
finite-automata
normal
minimal-state-automata
1
vote
19
GATE CSE 2007 | Question: 31
Which of the following languages is regular? $\left\{ww^R \mid w \in \{0, 1\}^+\right\}$ $\left\{ww^Rx \mid x,w \in \{0, 1\}^+\right\}$ $\left\{wxw^R \mid x, w \in \{0, 1\}^+\right\}$ $\left\{xww^R \mid x, w \in \{0, 1\}^+\right\}$
answered
in
Theory of Computation
Jul 23, 2019
11.8k
views
gatecse-2007
theory-of-computation
normal
regular-language
4
votes
20
GATE CSE 1995 | Question: 1.10
Consider a grammar with the following productions $S \rightarrow a \alpha b \mid b \alpha c \mid aB$ $S \rightarrow \alpha S\mid b$ $S \rightarrow \alpha b b\mid ab$ $S \alpha \rightarrow bd b\mid b$ The above grammar is: Context free Regular Context sensitive $LR(k)$
answered
in
Compiler Design
Jul 20, 2019
15.4k
views
gate1995
compiler-design
grammar
normal
1
vote
21
GATE CSE 2016 Set 1 | Question: GA03
Archimedes said, "Give me a lever long enough and a fulcrum on which to place it, and I will move the world." The sentence above is an example of a ____________ statement. figurative collateral literal figurine
answered
in
Verbal Aptitude
Jul 16, 2019
4.2k
views
gatecse-2016-set1
verbal-aptitude
normal
english-grammar
9
votes
22
GATE CSE 2019 | Question: 11
Consider the following two statements about database transaction schedules: Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable. Timestamp-ordering concurrency control protocol with Thomas' Write Rule can generate view serializable ... the above statements is/are TRUE? I only II only Both I and II Neither I nor II
answered
in
Databases
Jul 16, 2019
13.8k
views
gatecse-2019
databases
transaction-and-concurrency
1-mark
0
votes
23
GATE CSE 2014 Set 2 | Question: 30
Consider a join (relation algebra) between relations $r(R)$ and $s(S)$ using the nested loop method. There are $3$ ... $s(S)$ is more than $0.5$. join selection factor between $r(R)$ and $s(S)$ is less than $0.5$.
answered
in
Databases
Jul 16, 2019
16.8k
views
gatecse-2014-set2
databases
normal
joins
0
votes
24
GATE CSE 2014 Set 2 | Question: 54
SQL allows duplicate tuples in relations, and correspondingly defines the multiplicity of tuples in the result of joins. Which one of the following queries always gives the same answer as the nested query shown below: select * from R where a in (select S.a from S) select R. ... a from S) as S1 where R.a=S1.a select R.* from R,S where R.a=S.a and is unique R
answered
in
Databases
Jul 16, 2019
15.2k
views
gatecse-2014-set2
databases
sql
normal
1
vote
25
GATE CSE 2012 | Question: 15
Which of the following statements are TRUE about an SQL query? P : An SQL query can contain a HAVING clause even if it does not have a GROUP BY clause Q : An SQL query can contain a HAVING clause only if it has a GROUP BY clause R : All attributes used ... Not all attributes used in the GROUP BY clause need to appear in the SELECT clause P and R P and S Q and R Q and S
answered
in
Databases
Jul 16, 2019
33.6k
views
gatecse-2012
databases
easy
sql
ambiguous
3
votes
26
GATE CSE 2009 | Question: 56
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{2NF}$ but not in $\text{3NF}$ The schema is not in $\text{2NF}$
answered
in
Databases
Jul 16, 2019
21.9k
views
gatecse-2009
databases
sql
database-normalization
normal
0
votes
27
GATE CSE 2006 | Question: 67
Consider the relation account (customer, balance) where the customer is a primary key and there are no null values. We would like to rank customers according to decreasing balance. The customer with the largest balance gets rank $1.$ Ties are not broke but ranks are skipped: if ... of the above statements are correct? $2$ and $5$ $1$ and $3$ $1$ and $4$ $3$ and $5$
answered
in
Databases
Jul 15, 2019
16.4k
views
gatecse-2006
databases
sql
normal
4
votes
28
GATE CSE 2005 | Question: 73
In a packet switching network, packets are routed from source to destination along a single path having two intermediate nodes. If the message size is $24$ bytes and each packet contains a header of $3$ bytes, then the optimum packet size is: $4$ $6$ $7$ $9$
answered
in
Computer Networks
Jul 5, 2019
32.8k
views
gatecse-2005
computer-networks
network-switching
normal
2
votes
29
GATE CSE 2019 | Question: 36
Consider the following grammar and the semantic actions to support the inherited type declaration attributes. Let $X_1, X_2, X_3, X_4, X_5$, and $X_6$ be the placeholders for the non-terminals $D, T, L$ or $L_1$ ... $X_1=T, \: X_2=L, \: X_3=T, \: X_4 = L_1$
answered
in
Compiler Design
May 15, 2019
13.2k
views
gatecse-2019
compiler-design
syntax-directed-translation
2-marks
8
votes
30
GATE CSE 2018 | Question: 37
A lexical analyzer uses the following patterns to recognize three tokens $T_1, T_2$, and $T_3$ over the alphabet $\{a, b, c\}$. $T_1: a?(b \mid c)^\ast a$ $T_2: b?(a \mid c)^\ast b$ ... the string $bbaacabc$ is processed by the analyzer, which one of the following is the sequence of tokens it outputs? $T_1T_2T_3$ $T_1T_1T_3$ $T_2T_1T_3$ $T_3T_3$
answered
in
Compiler Design
May 15, 2019
16.6k
views
gatecse-2018
compiler-design
lexical-analysis
normal
2-marks
Page:
1
2
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
Recruitment of Scientific Officers in the Department of Atomic Energy 2023
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
1200/1000 = 1.2
Aptitude- 1- there was a question, Like in a...
Suppose typing happens at 1 keystroke per second....
The algorithm for graph colouring was to pick...
@Aakash_Bhardwaj all the best bro . For your...