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 raja11sep
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by raja11sep
1
answer
1
ace academy ToC
I don’t get the explanation, How do you categorize grammer on the basis of production?
commented
in
Theory of Computation
9 hours
ago
58
views
theory-of-computation
context-sensitive
grammar
ace-test-series
0
answers
2
#MadeEasy
consider a system having 22 resources of the same type. These resources are shared by 4 processes P, Q, R, and S having peak demands of 3,6, a, and b respectively. How many ordered pairs (a,b) are possible, such that the system is deadlock free?
commented
in
Operating System
9 hours
ago
63
views
operating-system
resource-allocation
made-easy-test-series
deadlock-prevention-avoidance-detection
6
answers
3
GATE CSE 2016 Set 2 | Question: 55
Consider a $128 \times 10^3$ bits/second satellite communication link with one way propagation delay of $150$ milliseconds. Selective retransmission (repeat) protocol is used on this link to send data with a frame size of $1$ kilobyte ... acknowledgement. The minimum number of bits required for the sequence number field to achieve $100 \%$ utilization is ________.
commented
in
Computer Networks
1 day
ago
16.7k
views
gatecse-2016-set2
computer-networks
sliding-window
normal
numerical-answers
0
answers
4
context free
Let $L = \{a^nb^nc^nd^n | n\ge1\}$. Show that $L$ can be expressed as the intersection of two context-free languages.
commented
in
Theory of Computation
1 day
ago
38
views
theory-of-computation
context-free-language
1
answer
5
GATE CSE 2022 | Question: 1
Which one of the following statements is $\text{TRUE}$ for all positive functions $f(n)?$ $f(n^{2}) = \theta (f(n)^{2}),$ when $f(n)$ is a polynomial $f(n^{2}) = o (f(n)^{2})$ $f(n^{2}) = O (f(n)^{2}),$ when $f(n)$ is an exponential function $f(n^{2}) = \Omega (f(n)^{2})$
commented
in
Algorithms
3 days
ago
4.9k
views
gatecse-2022
algorithms
asymptotic-notations
1-mark
1
answer
6
acacademy
CFG is not closed under complementation , but REC is?
answered
in
Theory of Computation
Nov 24
57
views
theory-of-computation
decidability
3
answers
7
#selfDoubt
complement of CFL can never be CFL. please explain if the above statement is true of false?
commented
in
Theory of Computation
Nov 24
304
views
theory-of-computation
context-free-language
normal
self-doubt
1
answer
8
CFL | TOC | Ace Academy Test Series
If L and $L^{c}$ both are CFL, the L must be DCFL a. TRUE b.FALSE
commented
in
Theory of Computation
Nov 24
49
views
theory-of-computation
context-free-language
self-doubt
dcfl
1
answer
9
Made Esy Test Series 2022 | COA | Subject wise Q.no 17
** MSQ ** Consider the following sequence of micro-operations (μO) on a system used for instruction fetch: Where MAR is memory address register, PC is program counter, MBR is memory buffer register and IR is instruction register. And ... the following μO's can execute parallely without conflict. μO2 and μO3 μO1 and μO3 μO4 and μO3 μO2 and μO4
commented
in
CO and Architecture
Nov 23
83
views
co-and-architecture
made-easy-test-series
multiple-selects
test-series
instruction-execution
4
answers
10
GATE CSE 2006 | Question: 75
Consider two cache organizations. First one is $32$ $kB$ $2$-way set associative with $32$ $byte$ block size, the second is of same size but direct mapped. The size of an address is $32$ $bits$ in both cases . A $2$-to-$1$ multiplexer has latency of $0.6 ns$ while a $k-$ ... of direct mapped is $h_2$. The value of $h_2$ is: $2.4$ $ns$ $2.3$ $ns$ $1.8$ $ns$ $1.7$ $ns$
commented
in
CO and Architecture
Nov 23
8.6k
views
gatecse-2006
co-and-architecture
cache-memory
normal
3
answers
11
GATE CSE 2004 | Question: 65
Consider a small two-way set-associative cache memory, consisting of four blocks. For choosing the block to be replaced, use the least recently used (LRU) scheme. The number of cache misses for the following sequence of block addresses is: $8, 12, 0, 12, 8$. $2$ $3$ $4$ $5$
commented
in
CO and Architecture
Nov 23
12.0k
views
gatecse-2004
co-and-architecture
cache-memory
normal
0
answers
12
Theory Of Computation
Can finite automata do addition, subtraction, and multiplication? Anyone, please explain in detail?
commented
in
Theory of Computation
Nov 22
89
views
finite-automata
1
answer
13
NIELIT 2016 DEC Scientist B (CS) - Section B: 54
If there is more than one key for relation schema in DBMS then each key in relation schema is classified as prime key super key candidate key primary key
commented
in
Databases
Nov 22
1.1k
views
nielit2016dec-scientistb-cs
databases
candidate-key
1
answer
14
NIELIT Scientific Assistant A 2020 November: 86
A minimal super key (i.e, one of the super keys for which no proper subset is a superkey) is called: Super Key Candidate Key Primary Key Both Candidate and Primary Key
commented
in
Databases
Nov 22
119
views
nielit-sta-2020
databases
database-normalization
candidate-key
1
answer
15
Test Series 2022
Please explain Ans is 22
commented
in
Databases
Nov 22
273
views
databases
candidate-key
test-series
numerical-answers
4
answers
16
GATE CSE 2000 | Question: 1.4
Let $S$ and $T$ be languages over $\Sigma=\{a,b\}$ represented by the regular expressions $(a+b^*)^*$ and $(a+b)^*$, respectively. Which of the following is true? $S \subset T$ $T \subset S$ $S = T$ $S \cap T = \phi$
commented
in
Theory of Computation
Nov 21
9.5k
views
gatecse-2000
theory-of-computation
regular-expression
easy
0
answers
17
gate academy
I think S1 is false because, for n=0, no 0’s will be added in stack, but in the transition to the next state (q2->q3) there is one mandatory 1 canceling out 0 in stack which will be absent in case of n=0. But solutions say S1 is true.
commented
in
Theory of Computation
Nov 21
83
views
theory-of-computation
dpda
4
answers
18
GATE IT 2008 | Question: 3
What is the chromatic number of the following graph? $2$ $3$ $4$ $5$
commented
in
Graph Theory
Nov 15
6.5k
views
gateit-2008
graph-theory
graph-coloring
normal
6
answers
19
GATE CSE 1996 | Question: 2.8
If $L_1$ and $L_2$ are context free languages and $R$ a regular set, one of the languages below is not necessarily a context free language. Which one? $L_1.L_2$ $L_1 \cap L_2$ $L_1 \cap R$ $L_1 \cup L_2$
commented
in
Theory of Computation
Nov 8
4.8k
views
gate1996
theory-of-computation
context-free-language
easy
3
answers
20
GATE CSE 1991 | Question: 16-b
Show that all vertices in an undirected finite graph cannot have distinct degrees, if the graph has at least two vertices.
commented
in
Graph Theory
Nov 8
3.1k
views
gate1991
graph-theory
degree-of-graph
descriptive
proof
1
answer
21
GATE CSE 2001 | Question: 2.7
Consider the following problem $X$. Given a Turing machine $M$ over the input alphabet $\Sigma$, any state $q$ of $M$ and a word $w \in \Sigma^*$, does the computation of $M$ on $w$ visit the state of $q$? Which of the ... ? $X$ is decidable $X$ is undecidable but partially decidable $X$ is undecidable and not even partially decidable $X$ is not a decision problem
commented
in
Theory of Computation
Nov 8
11.2k
views
gatecse-2001
theory-of-computation
decidability
normal
2
answers
22
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.
commented
in
Theory of Computation
Nov 8
2.4k
views
gatecse-2022
theory-of-computation
turing-machine
decidability
multiple-selects
2-marks
1
answer
23
Theory Of Computation (NFA/DFA)
**MSQ** The Finite State Autometa with a Regular Expression P= 0+1, will accept the string(s) 0 1 01 10
commented
in
Theory of Computation
Nov 8
82
views
finite-automata
theory-of-computation
easy
2
answers
24
toc decidablity
M is a Turing Machine and M is the only Turing Machine that accepts L(M) is decidable. TRUE/FALSE
answered
in
Theory of Computation
Nov 8
106
views
theory-of-computation
decidability
true-false
0
answers
25
#Unacademy
**Every group of prime order is always an abelian group on this fact please explain how can a 2 element group be an abelian group, please give an example
commented
in
Set Theory & Algebra
Nov 4
74
views
set-theory&algebra
abelian-group
group-theory
2
answers
26
GATE IT 2006 | Question: 80
Let $L$ be a regular language. Consider the constructions on $L$ below: repeat $(L) = \{ww \mid w \in L\}$ prefix $(L) = \{u \mid ∃v : uv \in L\}$ suffix $(L) = \{v \mid ∃u : uv \in L\}$ half $(L) = \{u \mid ∃v : | v | = | u | \text{ and } uv \in L\}$ Which of the constructions could lead to a non-regular language? Both I and IV Only I Only IV Both II and III
commented
in
Theory of Computation
Oct 31
7.0k
views
gateit-2006
theory-of-computation
normal
regular-language
1
answer
27
Theory of Computation
State True or False. All Linear languages are non-deterministic context free language.
commented
in
Theory of Computation
Oct 29
130
views
theory-of-computation
self-doubt
context-free-language
0
answers
28
Set theory
Let A = set of all real numbers. '*' be a binary operation a*b = a + b + a. b (A, *) is a group or not. Doubt : Till finding identity element (=0) every thing is okay. While finding inverse: a * $a^{-1}$ = e a + $a^{-1}$ + a$a^{-1}$ = 0 a + $a^{-1}$ + 1 = 0 Or a + $a^{-1}$(1+a) = 0 Both will lead to different answer. What is correct.
commented
in
Set Theory & Algebra
Oct 26
95
views
self-doubt
set-theory
3
answers
29
GATE CSE 2002 | Question: 1.21
In $2's$ complement addition, overflow is flagged whenever there is carry from sign bit addition cannot occur when a positive value is added to a negative value is flagged when the carries from sign bit and previous bit match None of the above
commented
in
Digital Logic
Oct 23
6.7k
views
gatecse-2002
digital-logic
number-representation
normal
3
answers
30
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
commented
in
Compiler Design
Oct 19
8.0k
views
gate1994
compiler-design
grammar
normal
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 ☺️☺️....