Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Hirak
1
votes
2
answers
1
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
asked
Jun 14, 2019
Compiler Design
compiler-design
operator-grammar
parsing
+
–
1
votes
3
answers
2
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.7k
views
asked
Jun 13, 2019
Operating System
memory-management
paging
operating-system
multilevel-paging
self-doubt
+
–
0
votes
1
answer
3
DBMS: SELF DOUBT .
Is basic 2 phase locking always recoverable?
Is basic 2 phase locking always recoverable?
588
views
asked
Jun 10, 2019
Databases
databases
2phaselocking
two-phase-locking-protocol
+
–
3
votes
1
answer
4
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.9k
views
asked
Jun 9, 2019
Compiler Design
compiler-design
lexical-analysis
compiler-tokenization
+
–
4
votes
3
answers
5
GEEKS FOR GEEKS GATE 2017 MOCK
If Kruskal’s algorithm is used for finding a minimum spanning tree of a weighted graph G with n vertices and m edges and edge weights are already given in a sorted list, then, What will be the time complexity to compute the minimum cost spanning tree given that union and find operations take amortized O(1) ? A O(m logn) B O(n) C O(m) D O(n logm)
If Kruskal’s algorithm is used for finding a minimum spanning tree of a weighted graph G with n vertices and m edges and edge weights are already given in a sorted list...
3.6k
views
asked
Jun 9, 2019
Algorithms
graph-algorithms
minimum-spanning-tree
time-complexity
geeksforgeeks-test-series
+
–
0
votes
0
answers
6
Compiler Design: Self Doubt on Operator Grammar
Say I have a grammar, S→ AB A→ a B→ b This grammar is not operator grammar as 2 non terminals are lying side by side, but can be converted to an operator grammar. S→ ab , A→ a , B→ b here i have a doubt, operator grammar ... can we operate even two terminal symbols when placed side by side? Isn't it same as placing 2 non-terminal symbol side by side?
Say I have a grammar, S→ AB A→ a B→ bThis grammar is not operator grammar as 2 non ter...
613
views
asked
Jun 6, 2019
Compiler Design
compiler-design
operator-grammar
ullman
+
–
2
votes
4
answers
7
COMPILER DESIGN: Dragon Book self doubt
S→ A/a A→ a LL1 or not?
S→ A/aA→ aLL1 or not?
975
views
asked
Jun 4, 2019
Compiler Design
compiler-design
ll-parser
syntax-directed-translation
+
–
1
votes
1
answer
8
Self Doubt:Toc
378
views
asked
Jun 2, 2019
Theory of Computation
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
0
votes
2
answers
9
Self Doubt:Automata
Intersection of Recursive and Recursively Enumerable language is____________________ ?
Intersection of Recursive and Recursively Enumerable language is____________________ ?
724
views
asked
Jun 2, 2019
Theory of Computation
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
0
votes
1
answer
10
Self Doubt:Infinite loop
#include<iostream> using namespace std; int i=0; void a() { i+=1; cout<<i<< ".hello"<<endl; a(); } int main() { a(); } For this above code the output is only upto → 64891.Hello Does this mean that that the stack can hold only 64891 recursive calls? (I am using dev c++)
#include<iostream using namespace std; int i=0; void a() { i+=1; cout<<i<< ".hello"<<endl; a(); } int main() { a(); }For this above code the output is only upto → 6489...
1.2k
views
asked
Jun 2, 2019
Programming in C
algorithms
programming-in-c
recursion
+
–
0
votes
1
answer
11
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.1k
views
asked
Jun 1, 2019
Compiler Design
compiler-design
ll-parser
parsing
syntax-directed-translation
+
–
0
votes
1
answer
12
Self Doubt:TDM and Polling
Is Time division multiplexing and Polling in syllabus? In the official website they have mentioned only ethernet..
Is Time division multiplexing and Polling in syllabus?In the official website they have mentioned only ethernet..
817
views
asked
May 30, 2019
Computer Networks
computer-networks
polling
+
–
0
votes
1
answer
13
GeeksForGeeks IP addressing ...
Which of the following is a public IP? 10.15.14.12 192.168.52.62 173.32.1.1 None
Which of the following is a public IP?10.15.14.12192.168.52.62173.32.1.1None
3.1k
views
asked
May 30, 2019
Computer Networks
computer-networks
ip-addressing
network-addressing
ip
+
–
0
votes
0
answers
14
GATE MOCK 2018
An orthogonal matrix A has eigen values 1, 2 and 4, then trace of the matrix $A^T$ is ___________
An orthogonal matrix A has eigen values 1, 2 and 4, then trace of the matrix $A^T$ is ___________
504
views
asked
May 28, 2019
Linear Algebra
eigen-value
linear-algebra
+
–
5
votes
3
answers
15
MadeEasy Test Series: Theory Of Computation - Regular Languages
Consider the following statements: $S_1:\{(a^n)^m|n\leq m\geq0\}$ $S_2:\{a^nb^n|n\geq 1\} \cup \{a^nb^m|n \geq1,m \geq 1\} $ Which of the following is regular? $S_1$ only $S_2$ only Both Neither of the above
Consider the following statements:$S_1:\{(a^n)^m|n\leq m\geq0\}$$S_2:\{a^nb^n|n\geq 1\} \cup \{a^nb^m|n \geq1,m \geq 1\} $Which of the following is regular?$S_1$ only$S_2...
1.8k
views
asked
May 25, 2019
Theory of Computation
made-easy-test-series
theory-of-computation
regular-language
+
–
0
votes
0
answers
16
MADE EASY ELECTRONICS
The number of Essential Prime implicants are ______________.
The number of Essential Prime implicants are ______________.
533
views
asked
May 25, 2019
Digital Logic
digital-logic
prime-implicants
+
–
3
votes
1
answer
17
MADE EASY Relational Algebra
In a relational algebra ∩ is not a basic operator, to make it basic only relational operator we should have are X, – X, U U, –
In a relational algebra ∩ is not a basic operator, to make it basic only relational operator we should have areX, – X, UU, –
2.1k
views
asked
May 25, 2019
Databases
databases
relational-algebra
+
–
0
votes
1
answer
18
Self Doubt about ME Test Series
Are comparison charts of Made easy genuine? And say now if my rank is 3 in a test and after sometime if someone scores more than me will my rank get shifted to 4?
Are comparison charts of Made easy genuine?And say now if my rank is 3 in a test and after sometime if someone scores more than me will my rank get shifted to 4?
636
views
asked
May 25, 2019
GATE
made-easy-test-series
self-doubt
general
+
–
0
votes
1
answer
19
VANI Question Bank :DBMS
Minimum number of tables required to represent the relation R where the $A_n$ stands for the primary key of each entity is ___________
Minimum number of tables required to represent the relation R where the $A_n$ stands for the primary key of each entity is ___________
684
views
asked
May 25, 2019
Databases
databases
rdbms
+
–
1
votes
1
answer
20
Self Doubt: CO Syllabus
Is pipeline hazards there in the syllabus? And are there any previous year questions from there?
Is pipeline hazards there in the syllabus? And are there any previous year questions from there?
587
views
asked
May 23, 2019
CO and Architecture
co-and-architecture
pipelining
haza
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register