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 Ankita87077
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Ankita87077
0
votes
1
#self doubt
Every unambiguous grammar is LR(0) grammar?
answered
in
Compiler Design
Nov 18, 2021
1.3k
views
compiler-design
lr-parser
2
votes
2
GATE Overflow | Mock GATE | Test 1 | Question: 37
Consider the context switch of a CPU from the context of process $P1$ to that of process $P2$. Consider the following two events in the chronological order of the events during the context switch. (P) The Stack Pointer (SP) shifts ... via an atomic hardware instruction The relative ordering of $P$ and $Q$ varies from one context switch to the other
answered
in
Operating System
Oct 30, 2021
1.1k
views
go-mockgate-1
context-switch
operating-system
3
votes
3
Made Easy Test series
Consider the following language : P1 : {<M, x, k>| M is a TM and M does not halt on x within k steps} P2 : {<M>| M is TM and L(M) = $\phi$} P3 : {<M>| M is a TM and L(M) = finite language} The number of problems which are not RE is/are _______ ?
answered
in
Theory of Computation
Oct 26, 2021
626
views
made-easy-test-series
theory-of-computation
turing-machine
0
votes
4
Find number of variables in optimized code
Consider following 3 address code t1 = t+e t2 = g+a t3 = t1*t2 t4 = t2+t2 t5 = t4+t3 The minimum number of temporary variables that can be used in equivalent 3-address code of above code is Approach: t = t+e, g = g+a, t = t*g, g = g+g,t = t+g. Hence 4 temporary variables are needed. Is this right?
answered
in
Compiler Design
Oct 26, 2021
2.3k
views
compiler-design
intermediate-code
three-address-code
3
votes
5
3-Address Code Generation
Hi Everyone, For this the Given Answer is 5, I got 4. I am now confused about how the 3 address code is generated here.
answered
in
Compiler Design
Oct 15, 2021
1.4k
views
compiler-design
three-address-code
static-single-assignment
test-series
0
votes
6
Peter Linz Edition 4 Exercise 7.1 Question 9 (Page No. 183)
Is it possible to find a dfa that accepts the same language as the pda $M= (${$q_0,q_1$},{$a,b$},{$z$},$\delta,q_0,z,${$q_1$}), with $\delta(q_0,a,z)=${$(q_1,z)$}, $\delta(q_0,b,z)=${$(q_0,z)$}, $\delta(q_1,a,z)=${$(q_1,z)$}, $\delta(q_1,b,z)=${$(q_0,z)$} ?
answered
in
Theory of Computation
Sep 17, 2021
511
views
peter-linz
peter-linz-edition4
theory-of-computation
pushdown-automata
npda
0
votes
7
Chomskey Normal Form
State true/false In CNF , S-> espilon and Start symbol can appear on RHS side of production.
answered
in
Theory of Computation
Sep 16, 2021
2.9k
views
theory-of-computation
conjunctive-normal-form
0
votes
8
Peter Linz Edition 4 Exercise 5.2 Question 5 (Page No. 145)
Let $G = (V, T, S, P)$ be an s-grammar. Give an expression for the maximum size of $P$ in terms of $|V|$ and $|T|$.
answered
in
Theory of Computation
Sep 13, 2021
197
views
peter-linz
peter-linz-edition4
theory-of-computation
grammar
0
votes
9
Peter Linz Edition 4 Exercise 4.2 Question 14 (Page No. 114)
Find an algorithm for determining whether a regular language $L$ contains an infinite number of even-length strings.
answered
in
Theory of Computation
Sep 11, 2021
360
views
peter-linz
peter-linz-edition4
theory-of-computation
regular-language
0
votes
10
GATE CSE 2010 | Question: 39
Let $L=\{ w \in \:(0+1)^* \mid w\text{ has even number of }1s \}$. i.e., $L$ is the set of all the bit strings with even numbers of $1$s. Which one of the regular expressions below represents $L$? $(0^*10^*1)^*$ $0^*(10^*10^*)^*$ $0^*(10^*1)^*0^*$ $0^*1(10^*1)^*10^*$
answered
in
Theory of Computation
Sep 5, 2021
22.3k
views
gatecse-2010
theory-of-computation
regular-expression
normal
0
votes
11
GATE CSE 2011 | Question: 55
An undirected graph $G(V,E)$ contains $n \: (n>2)$ nodes named $v_1,v_2, \dots, v_n$. Two nodes $v_i, v_j$ are connected if and only if $ 0 < \mid i-j\mid \leq 2$. Each edge $(v_i,v_j)$ is assigned a weight $i+j$. A sample graph with $n=4$ is shown below. The length of the path from $v_5$ to $v_6$ in the MST of previous question with $n=10$ is $11$ $25$ $31$ $41$
answered
in
Algorithms
Aug 27, 2021
11.7k
views
gatecse-2011
algorithms
graph-algorithms
spanning-tree
normal
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:...