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 sukesh_reddy
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by sukesh_reddy
9
answers
1
Kenneth Rosen Edition 6 Question 45 (Page No. 346)
How many bit strings of length eight contain either three consecutive 0s or four consecutive 1s?
commented
in
Combinatory
Nov 27, 2023
8.9k
views
combinatory
counting
6
answers
2
GATE CSE 1987 | Question: 1-V
The most relevant addressing mode to write position-independent codes is: Direct mode Indirect mode Relative mode Indexed mode
answered
in
CO and Architecture
Aug 16, 2023
15.0k
views
gate1987
co-and-architecture
addressing-modes
easy
4
answers
3
GATE IT 2005 | Question: 37
Consider the non-deterministic finite automaton (NFA) shown in the figure. State $X$ is the starting state of the automaton. Let the language accepted by the NFA with $Y$ as the only accepting state be $L1$. Similarly, let the language accepted by the NFA with $Z$ as ... statements about $L1$ and $L2$ is TRUE? $L1 = L2$ $L1 \subset L2$ $L2 \subset L1$ None of the above
commented
in
Theory of Computation
Aug 16, 2023
16.3k
views
gateit-2005
theory-of-computation
finite-automata
normal
4
answers
4
GATE CSE 2014 Set 2 | Question: 1
The security system at an IT office is composed of $10$ computers of which exactly four are working. To check whether the system is functional, the officials inspect four of the computers picked at random (without replacement). The system is ... are working. Let the probability that the system is deemed functional be denoted by $p.$ Then $100p =$ _____________.
commented
in
Probability
Jun 27, 2023
11.8k
views
gatecse-2014-set2
probability
numerical-answers
normal
1
answer
5
The maximum number of distinct subwords of the word "AXIOMATIZABLE" is: a)183 b) 111 c)92 d)88
commented
in
Combinatory
Jan 7, 2023
5.1k
views
combinatory
4
answers
6
GATE CSE 2021 Set 2 | Question: 53
Consider a pipelined processor with $5$ stages, $\text{Instruction Fetch} (\textsf{IF})$, $\text{Instruction Decode} \textsf{(ID)}$, $\text{Execute } \textsf{(EX)}$, $\text{Memory Access } \textsf{(MEM)}$ ... $\textit{Speedup} $ achieved in executing the given instruction sequence on the pipelined processor (rounded to $2$ decimal places) is _____________
commented
in
CO and Architecture
Dec 24, 2022
15.2k
views
gatecse-2021-set2
co-and-architecture
pipelining
instruction-execution
numerical-answers
2-marks
4
answers
7
GATE CSE 2000 | Question: 1.8
Comparing the time T1 taken for a single instruction on a pipelined CPU with time T2 taken on a non-pipelined but identical CPU, we can say that T1 ≤ T2 T1 ≥ T2 T1 < T2 T1 and T2 plus the time taken for one instruction fetch cycle
commented
in
CO and Architecture
Dec 23, 2022
11.5k
views
gatecse-2000
pipelining
co-and-architecture
easy
6
answers
8
GATE CSE 2021 Set 1 | Question: 42
Consider the following Boolean expression. $F=(X+Y+Z)(\overline X +Y)(\overline Y +Z)$ Which of the following Boolean expressions is/are equivalent to $\overline F$ (complement of $F$ ... $X\overline Y +Y\overline Z + \overline X\; \overline Y \;\overline Z$
commented
in
Digital Logic
Dec 22, 2022
10.0k
views
gatecse-2021-set1
multiple-selects
digital-logic
boolean-algebra
2-marks
2
answers
9
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 8 (Page No. 174)
Consider a multiprogrammed system with degree of $6$ (i.e., six programs in memory at the same time). Assume that each process spends $40\%$ of its time waiting for I/O. What will be the CPU utilization?
commented
in
Operating System
Dec 12, 2022
2.7k
views
tanenbaum
operating-system
process-and-threads
descriptive
5
answers
10
GATE CSE 2001 | Question: 1.3
Consider two well-formed formulas in propositional logic $F_1: P \Rightarrow \neg P$ $F_2: (P \Rightarrow \neg P) \lor ( \neg P \Rightarrow P)$ Which one of the following statements is correct? $F_1$ is satisfiable, $F_2$ is valid $F_1$ unsatisfiable, $F_2$ is satisfiable $F_1$ is unsatisfiable, $F_2$ is valid $F_1$ and $F_2$ are both satisfiable
commented
in
Mathematical Logic
Dec 7, 2022
9.0k
views
gatecse-2001
mathematical-logic
easy
propositional-logic
6
answers
11
GATE CSE 2008 | Question: 82
Consider the following $\text{ER}$ diagram The minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is $2$ $3$ $4$ $5$
commented
in
Databases
Dec 3, 2022
26.4k
views
gatecse-2008
databases
er-diagram
normal
2
answers
12
GATE CSE 2001 | Question: 16
Consider the following grammar with terminal alphabet $\Sigma =\{a,(,),+,* \}$ and start symbol $E$. The production rules of the grammar are: $ E \rightarrow aA$ $ E \rightarrow (E)$ $A \rightarrow +E$ $A \rightarrow *E$ $A \rightarrow \epsilon $ Compute the FIRST and FOLLOW sets for $E$ and $A$. Complete the LL(1) parse table for the grammar.
commented
in
Compiler Design
Nov 22, 2022
4.8k
views
gatecse-2001
compiler-design
parsing
normal
descriptive
1
answer
13
decidability
a context-free grammar is ambiguous is undecidable But for a given context-free language if we can make more than one parse tree then it means that it is ambiguous..So how it is undecidable??
commented
in
Theory of Computation
Nov 21, 2022
3.2k
views
decidability
theory-of-computation
7
answers
14
GATE CSE 2017 Set 2 | Question: 32
Consider the following expression grammar $G$: $E \rightarrow E-T \mid T$ $T \rightarrow T + F \mid F$ $F \rightarrow (E) \mid id$ Which of the following grammars is not left recursive, but is equivalent to $G$? $E \rightarrow E-T \mid T$ ... $E \rightarrow TX \mid (TX)$ $X \rightarrow -TX \mid +TX \mid \epsilon$ $T \rightarrow id$
commented
in
Compiler Design
Nov 21, 2022
10.9k
views
gatecse-2017-set2
grammar
1
answer
15
GATE CSE 2021 Set 2 | Question: 37
For two $n$-dimensional real vectors $P$ and $Q$, the operation $s(P,Q)$ is defined as follows: $s(P,Q) = \displaystyle \sum_{i=1}^n (P[i] \cdot Q[i])$ Let $\mathcal{L}$ be a set of $10$-dimensional non-zero real vectors such that for every pair ... $s(P,Q)=0$. What is the maximum cardinality possible for the set $\mathcal{L}$? $9$ $10$ $11$ $100$
commented
in
Set Theory & Algebra
Oct 31, 2022
7.0k
views
gatecse-2021-set2
set-theory&algebra
set-theory
2-marks
5
answers
16
GATE CSE 2008 | Question: 70
Consider a file of $16384$ records. Each record is $32\;\text{bytes}$ long and its key field is of size $6\;\text{bytes}$ ... -level blocks in the multi-level index are respectively $8$ and $0$ $128$ and $6$ $256$ and $4$ $512$ and $5$
commented
in
Databases
Oct 18, 2022
23.6k
views
gatecse-2008
databases
indexing
normal
8
answers
17
GATE CSE 2014 Set 2 | Question: 21
The maximum number of superkeys for the relation schema $R(E,F,G,H)$ with $E$ as the key is _____.
commented
in
Databases
Oct 12, 2022
11.4k
views
gatecse-2014-set2
databases
numerical-answers
easy
candidate-key
7
answers
18
GATE CSE 2017 Set 1 | Question: 33
Consider a combination of $\text{T}$ and $\text{D}$ flip-flops connected as shown below. The output of the $\text{D}$ flip-flop is connected to the input of the $\text{T}$ flip-flop and the output of the $\text{T}$ flip-flop is connected to the input of ... $3^{\text{rd}}$ cycle are $01$ and after the $4^{\text{th}}$ cycle are $01$ respectively.
commented
in
Digital Logic
Sep 2, 2022
14.6k
views
gatecse-2017-set1
digital-logic
flip-flop
normal
4
answers
19
GATE CSE 2016 Set 2 | Question: 03
The minimum number of colours that is sufficient to vertex-colour any planar graph is ________.
commented
in
Graph Theory
Apr 30, 2022
15.4k
views
gatecse-2016-set2
graph-theory
graph-coloring
normal
numerical-answers
2
answers
20
Made Easy Test Series
Why option B is wrong
answered
in
Theory of Computation
Oct 1, 2021
689
views
theory-of-computation
identify-class-language
1
answer
21
GATE CSE 1987 | Question: 1-III
The above circuit produces the output sequence: $1111\quad 1111\quad0000\quad0000$ $1111 \quad 0000\quad1111\quad0000$ $1111 \quad 0001\quad0011\quad0101$ $1010\quad1010\quad1010\quad1010$
commented
in
Digital Logic
Sep 13, 2021
5.0k
views
gate1987
digital-logic
sequential-circuit
flip-flop
digital-counter
1
answer
22
NIELIT 2016 DEC Scientist B (IT) - Section B: 50
Which of the following statements about semaphores is true? $P$ and $V$ operations should be indivisible operations. A semaphore implementation should guarantee that threads do not suffer indefinite postponement. If several threads attempt a $P(S)$ operation simultaneously, only one thread should be allowed to proceed. All of the above.
commented
in
Operating System
Jun 16, 2021
11.6k
views
nielit2016dec-scientistb-it
operating-system
process-synchronization
6
answers
23
GATE CSE 2021 Set 2 | Question: 6
Consider the following statements $S1$ and $S2$ about the relational data model: $S1$: A relation scheme can have at most one foreign key. $S2$: A foreign key in a relation scheme $R$ cannot be used to refer to tuples of $R.$ Which one of the following choices ... are true $S1$ is true and $S2$ is false $S1$ is false and $S2$ is true Both $S1$ and $S2$ are false
answered
in
Databases
Mar 12, 2021
9.2k
views
gatecse-2021-set2
databases
referential-integrity
1-mark
4
answers
24
MadeEasy Subject Test: Databases - Er Diagram
Minimum no of table for this ER diagram
commented
in
Databases
Mar 12, 2021
1.1k
views
made-easy-test-series
databases
er-diagram
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...