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 AskHerOut
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by AskHerOut
0
votes
0
answers
1
#Instruction-pipeline Data hazard between two consecutive memory access instruction
Although the following instructions do not make much sense but if such case occurs, is data forwarding from MA of I1 to MA of I2 allowed? Or will it result in some stall? Please add some reference, I couldn't find any yet. I1: Load A //A<-Mem[address] I2: Store Adress2, A // Mem[Address2] <- A
asked
in
CO and Architecture
Dec 22, 2017
466
views
co-and-architecture
pipelining
data-hazards
1
vote
2
answers
2
C. interesting scenario.
Can you see why the output of the following code is 256? main () { int a=0x1ff; char *careful= &a; *careful = 0; printf("%d", a); }
asked
in
Programming in C
Oct 24, 2017
511
views
programming
programming-in-c
output
3
votes
1
answer
3
DPDA: One Liners
1) Can a Deterministic PDA has two epsilon transition each reading different Stack symbol to perform a transition? 2) Can a transition be performed without reading Stack symbol at all. Like $ a, λ/ λ$?
asked
in
Theory of Computation
Oct 22, 2017
710
views
theory-of-computation
pushdown-automata
dpda
3
votes
1
answer
4
LL Grammar: how does look ahead affect left recursion and left factoring
lets consider a grammar as: $A\rightarrow Ab | Ac | a$ while checking whether it belongs to LL(1) grammar, we would point out that it has a left recursion as well as left factoring. I was wondering that what ... symbol, A to decide the production rule to be applied. any further insights about the same will be very helpful.
asked
in
Compiler Design
Oct 1, 2017
1.6k
views
compiler-design
parsing
grammar
ll-parser
1
vote
1
answer
5
Pushdown Automata: acceptance of a string
In certain Pushdown Automata, will the input string considered accepted if while reading it we reach to final state but 1) the stack in not empty and contain few symbols? AND/OR 2) there is still some remaining part of the string to be read(on processing which we might end up on some non-final state again). An elaborate answer will be highly appreciated.
asked
in
Theory of Computation
Oct 1, 2017
839
views
theory-of-computation
pushdown-automata
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:...