Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Hirak
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Hirak
1
answer
1
Addressing Modes
How many memory accesses required by the following instructions? SUB r1, r2, r3 MUL r1, r2, (r3) DIV r1, r2, @(r4) Suppose every instruction is one word long, as well as every address. (A) 4 (B) 6 (C) 8 (D) 9
How many memory accesses required by the following instructions?SUB r1, r2, r3MUL r1, r2, (r3)DIV r1, r2, @(r4)Suppose every instruction is one word long, as well as ever...
2.1k
views
commented
Aug 4, 2019
CO and Architecture
addressing-modes
co-and-architecture
+
–
1
answer
2
C-SCAN and C-LOOk
No. of seek distances with C-SCAN and C-LOOK?
No. of seek distances with C-SCAN and C-LOOK?
3.7k
views
commented
Aug 1, 2019
Operating System
operating-system
file-system
disk-scheduling
+
–
2
answers
3
Made Easy Test Series: Synchronization
Consider the two processes need to access $P_{i}$ and $P_{j}$ need to access the C.S. The following synchronization construct used by both the processes. Process Pi While(true){ j=false; i=true; while(j==true); CRITICAL SECTION i=false; } ... true); CRITICAL SECTION j=false; } I got it is not satisfying M.E., but will it satisfying deadlock too?? Plz explain-
Consider the two processes need to access $P_{i}$ and $P_{j}$ need to access the C.S. The following synchronization construct used by both the processes.Process Pi While...
1.4k
views
commented
Jul 17, 2019
Operating System
made-easy-test-series
operating-system
process-synchronization
+
–
0
answers
4
GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 11
Which of the following is TRUE regarding the running time of a LR(1) parser? It runs in linear time for all inputs It runs in polynomial time but not necessarily $O(n^3)$ for all inputs For some inputs it may take exponential time It runs in $O(n^3)$ but not always $O(n^2)$
Which of the following is TRUE regarding the running time of a LR(1) parser?It runs in linear time for all inputsIt runs in polynomial time but not necessarily $O(n^3)$ f...
2.0k
views
commented
Jul 15, 2019
Compiler Design
go-cd-1
+
–
1
answer
5
MadeEasy Test Series: Compiler Design - Syntax Directed Translation
Consider the following grammar and their Syntax Directed Translation (SDT) rules. (Here id represent a integer and id.val is value of that integer) S1: Given SDT is L-attributed and using L-attributed evaluation the value of ... doubt here: Is there any difference in the way of evaluation of L-attributed SDT and S-attributed SDT ?
Consider the following grammar and their Syntax Directed Translation (SDT) rules. (Here id represent a integer and id.val is value of that integer)S1: Given SDT is L-attr...
3.3k
views
answered
Jul 15, 2019
Compiler Design
made-easy-test-series
compiler-design
syntax-directed-translation
+
–
1
answer
6
Compiler design test series problem
343
views
commented
Jul 15, 2019
Compiler Design
compiler-design
parsing
ll-parser
lr-parser
testbook-test-series
+
–
1
answer
7
deterministic pushdown automata-prefix property
How to find DPDA’s that accept by null stack? Someone explain the prefix property for DPDA,How can we use this property?
How to find DPDA’s that accept by null stack?Someone explain the prefix property for DPDA,How can we use this property?
3.4k
views
commented
Jul 15, 2019
Theory of Computation
theory-of-computation
self-doubt
dpda
+
–
1
answer
8
GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 9
For which of the following languages a LL(1) grammar does not exist? $\{a^n o b^n \mid n \geq 1\} \cup \{ a^n b^{n} \mid n \geq 1 \}$ $\{ a^n b^m \mid m,n \geq 0 \}$ $\{a^ib^j\mid i\geq j\}$ $\{a^ib^j\mid i= j\}$
For which of the following languages a LL(1) grammar does not exist?$\{a^n o b^n \mid n \geq 1\} \cup \{ a^n b^{n} \mid n \geq 1 \}$$\{ a^n b^m \mid m,n \geq 0 \}$$\{a^i...
1.8k
views
commented
Jul 14, 2019
Compiler Design
go-cd-1
+
–
0
answers
9
ME Testseries
270
views
commented
Jul 10, 2019
4
answers
10
GATE CSE 2011 | Question: 52
Consider a network with five nodes, $N1$ to $N5$, as shown as below. The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distance vectors at different nodes are as follows. N1: $(0, 1, 7, 8, 4)$ N2: $(1, 0, 6, 7, 3)$ N3: $(7, 6, 0, 2, 6)$ ... $N3$? $(3, 2, 0, 2, 5)$ $(3, 2, 0, 2, 6)$ $(7, 2, 0, 2, 5)$ $(7, 2, 0, 2, 6)$
Consider a network with five nodes, $N1$ to $N5$, as shown as below.The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distanc...
23.4k
views
commented
Jul 10, 2019
Computer Networks
gatecse-2011
computer-networks
routing
distance-vector-routing
normal
+
–
3
answers
11
Find address of element in 3d array
A is an array $[2.....6, 2.....8, 2.......10]$ of elements. The starting location is $500$. The location of an element $A(5, 5, 5)$ using column major order is __________.
A is an array $[2.....6, 2.....8, 2.......10]$ of elements. The starting location is $500$. The location of an element $A(5, 5, 5)$ using column major order is __________...
15.5k
views
commented
Jul 7, 2019
DS
data-structures
array
algorithms
+
–
2
answers
12
GATE CSE 1992 | Question: 02,xiv
Consider the $\text{SLR(1)}$ and $\text{LALR (1)}$ parsing tables for a context free grammar. Which of the following statement is/are true? The goto part of both tables may be different. The shift entries are identical in both the tables. The reduce entries in the tables may be different. The error entries in tables may be different
Consider the $\text{SLR(1)}$ and $\text{LALR (1)}$ parsing tables for a context free grammar. Which of the following statement is/are true?The goto part of both tables m...
14.3k
views
commented
Jun 30, 2019
Compiler Design
gate1992
compiler-design
normal
parsing
multiple-selects
+
–
8
answers
13
GATE CSE 2017 Set 1 | Question: 37
Consider the context-free grammars over the alphabet $\left \{ a, b, c \right \}$ given below. $S$ and $T$ are non-terminals. $G_{1}:S\rightarrow aSb \mid T, T \rightarrow cT \mid \epsilon$ ... is Finite Not finite but regular Context-Free but not regular Recursive but not context-free
Consider the context-free grammars over the alphabet $\left \{ a, b, c \right \}$ given below. $S$ and $T$ are non-terminals.$G_{1}:S\rightarrow aSb \mid T, T \rightarrow...
12.1k
views
commented
Jun 30, 2019
Theory of Computation
gatecse-2017-set1
theory-of-computation
context-free-language
identify-class-language
normal
+
–
2
answers
14
Isro Interview Question 17 March 2016
What is peephole (In peephole Optimization technique) ?
What is peephole (In peephole Optimization technique) ?
1.5k
views
commented
Jun 29, 2019
Compiler Design
isro-interview-question
code-optimization
+
–
1
answer
15
Lexical Analysis: Self Doubt
The above diagram is Transition Diagrams for identifiers. As we can see that the identifier is said to be accepted if it starts with a letter and ends with a valid delimiter, which includes blank symbol, arithmetic, logical operator, left parenthesis, right ... with a delimiter and + is a valid delimiter and the error in declaration will not be detected at this stage...
The above diagram is Transition Diagrams for identifiers. As we can see that the identifier is said to be accepted if it starts with a letter and ends with a valid delimi...
1.8k
views
commented
Jun 27, 2019
Compiler Design
compiler-design
lexical-analysis
compiler-tokenization
+
–
2
answers
16
Test by Bikram | Algorithms | Test 2 | Question: 14
Match the following: ... S 1 - S, 2 - R, 3 - Q, 4- R, 5 - S 1 - S, 2 - P, 3 - Q, 4- R, 5 - S
Match the following:$\begin{array}{|l|l|l|l|} \hline (1) & \text{Multistage graph} & (P) & \text{Divide and conquer}\\ \hline (2) & \text{Convex hull } & (Q) & \text{Dept...
378
views
commented
Jun 26, 2019
Algorithms
tbb-algorithms-2
+
–
7
answers
17
GATE IT 2006 | Question: 46
Which of the following is the correct decomposition of the directed graph given below into its strongly connected components? $\left \{ P, Q, R, S \right \}, \left \{ T \right \},\left \{ U \right \}, \left \{ V \right \}$ ... $\left \{ P, Q, R, S, T, U, V \right \}$
Which of the following is the correct decomposition of the directed graph given below into its strongly connected components?$\left \{ P, Q, R, S \right \}, \left \{ T \...
11.7k
views
commented
Jun 23, 2019
Algorithms
gateit-2006
algorithms
graph-algorithms
normal
+
–
12
answers
18
GATE CSE 2016 Set 1 | Question: 19
Consider the following code segment. x = u - t; y = x * v; x = y + w; y = t - z; y = x * y; The minimum number of total variables required to convert the above code segment to static single assignment form is __________.
Consider the following code segment.x = u - t; y = x * v; x = y + w; y = t - z; y = x * y;The minimum number of total variables required to convert the above code segment...
27.3k
views
commented
Jun 22, 2019
Compiler Design
gatecse-2016-set1
compiler-design
static-single-assignment
normal
numerical-answers
+
–
6
answers
19
GATE CSE 2007 | Question: 52
Consider the grammar with non-terminals $N=\left\{S,C,S_1\right\}$, terminals $T=\left\{a, b, i, t, e\right\}$, with $S$ as the start symbol, and the following set of rules: $S \rightarrow iCtSS_1 \mid a$ ... $C \rightarrow b$ The grammar is NOT LL(1) because: it is left recursive it is right recursive it is ambiguous it is not context-free
Consider the grammar with non-terminals $N=\left\{S,C,S_1\right\}$, terminals $T=\left\{a, b, i, t, e\right\}$, with $S$ as the start symbol, and the following set of rul...
12.7k
views
commented
Jun 17, 2019
Compiler Design
gatecse-2007
compiler-design
grammar
normal
+
–
7
answers
20
GATE CSE 2005 | Question: 83a
Statement for Linked Answer Questions 83a & 83b: Consider the following expression grammar. The semantic rules for expression evaluation are stated next to each grammar production. ... a reduce action It detects shift-reduce conflict, and resolves the conflict in favor of a reduce over a shift action
Statement for Linked Answer Questions 83a & 83b:Consider the following expression grammar. The semantic rules for expression evaluation are stated next to each grammar pr...
20.2k
views
commented
Jun 17, 2019
Compiler Design
gatecse-2005
compiler-design
parsing
difficult
+
–
10
answers
21
GATE CSE 2003 | Question: 18
In a bottom-up evaluation of a syntax directed definition, inherited attributes can always be evaluated be evaluated only if the definition is L-attributed be evaluated only if the definition has synthesized attributes never be evaluated
In a bottom-up evaluation of a syntax directed definition, inherited attributes canalways be evaluatedbe evaluated only if the definition is L-attributedbe evaluated only...
36.5k
views
commented
Jun 17, 2019
Compiler Design
gatecse-2003
compiler-design
syntax-directed-translation
normal
+
–
1
answer
22
Compiler design Self doubt
S → aSbS /bSaS / ϵ S → aABb A→ c/ ϵ B → d/ ϵ Which of the following is LL1. Explain in details.
S → aSbS /bSaS / ϵS → aABb A→ c/ ϵ B → d/ ϵWhich of the following is LL1. Explain in details.
2.0k
views
answer selected
Jun 14, 2019
Compiler Design
compiler-design
ll-parser
parsing
syntax-directed-translation
+
–
2
answers
23
Operator Precedence Parsing.
In operator precedence parsing we have the rule that production cannot have two adjacent non-terminals or an epsilon production, so this production, S--> ab is allowed but not S--> AB, A->a and B->b, though they are giving us the same output. Why so?
In operator precedence parsing we have the rule that production cannot have two adjacent non-terminals or an epsilon production, so this production, S ab is allowed but ...
1.3k
views
commented
Jun 14, 2019
Compiler Design
compiler-design
operator-grammar
parsing
+
–
3
answers
24
Self Doubt:Paging
I have read that paging does not suffer from external fragmentation as the frames and the pages are all of the equal sizes, but when we store a last level page table in a frame at that time it may not fully occupy the frame. Similarly, if ... exceed a page size. Then there should be external fragmentation, right? So why is it said that paging does not have external fragmentation?
I have read that paging does not suffer from external fragmentation as the frames and the pages are all of the equal sizes, but when we store a last level page table in a...
1.6k
views
commented
Jun 13, 2019
Operating System
memory-management
paging
operating-system
multilevel-paging
self-doubt
+
–
7
answers
25
GATE CSE 2018 | Question: 5
Consider the following processor design characteristics: Register-to-register arithmetic operations only Fixed-length instruction format Hardwired control unit Which of the characteristics above are used in the design of a RISC processor? I and II only II and III only I and III only I, II and III
Consider the following processor design characteristics:Register-to-register arithmetic operations onlyFixed-length instruction formatHardwired control unitWhich of the c...
11.9k
views
commented
Jun 12, 2019
CO and Architecture
gatecse-2018
co-and-architecture
cisc-risc-architecture
easy
1-mark
+
–
2
answers
26
Circuit related doubt in digital logic
Given circuit is to be implemented with minimum number of 2 input NAND & NOR Gates.. Tell the minimum number of NAND NOR GATES required.. 1,4 4,1 2,4 None
Given circuit is to be implemented with minimum number of 2 input NAND & NOR Gates.. Tell the minimum number of NAND NOR GATES required.. 1,44,12,4None
744
views
commented
Jun 11, 2019
4
answers
27
Self doubt DIGITAL LOGIC
Is Y' + Z' same as (YZ)' ? Please explain this concept of compliments..!!
Is Y' + Z' same as (YZ)' ? Please explain this concept of compliments..!!
626
views
commented
Jun 11, 2019
1
answer
28
GATE2010 TF: GA-6
It has taken fifty-six long and frustrating, years to turn bronze, into gold for India's Olympics aspirations$.$ Beijing $2008$ marks a defining moment in India's Olympic history$.$ From Delhi to Beijing is a long journey but one that our ... India's Olympic history. Our Olympians have undertaken a long journey to Beijing. India's bronze medal turned into gold at Beijing.
It has taken fifty-six long and frustrating, years to turn bronze, into gold for India’s Olympics aspirations$.$ Beijing $2008$ marks a defining moment in India’s Oly...
988
views
commented
Jun 11, 2019
Verbal Aptitude
general-aptitude
verbal-aptitude
gate2010-tf
passage-reading
+
–
1
answer
29
DBMS: SELF DOUBT .
Is basic 2 phase locking always recoverable?
Is basic 2 phase locking always recoverable?
574
views
asked
Jun 10, 2019
Databases
databases
2phaselocking
two-phase-locking-protocol
+
–
8
answers
30
GATE2013 CE: GA-9
A firm is selling its product at Rs. $60$ per unit. The total cost of production is Rs. $100$ and firm is earning total profit of Rs. $500$. Later, the total cost increased by $30\%.$ By what percentage the price should be increased to maintained the same profit level. $5$ $10$ $15$ $30$
A firm is selling its product at Rs. $60$ per unit. The total cost of production is Rs. $100$ and firm is earning total profit of Rs. $500$. Later, the total cost increas...
7.9k
views
comment edited
Jun 9, 2019
Quantitative Aptitude
quantitative-aptitude
gate2013-ce
profit-loss
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register