The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Questions by Hirak
User Hirak
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Hirak
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
answer
1
Operator Precedence Parsing.
In operator precedence parsing we have the rule that production cannot have two adjacent nonterminals 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?
asked
Jun 14
in
Compiler Design

105
views
compilerdesign
operatorgrammar
parsing
0
votes
2
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?
asked
Jun 13
in
Operating System

178
views
memorymanagement
paging
operatingsystem
multilevelpaging
pagetable
selfdoubt
0
votes
0
answers
3
DBMS: SELF DOUBT .
Is basic 2 phase locking always recoverable?
asked
Jun 10
in
Databases

77
views
databases
2phaselocking
twophaselockingprotocol
+2
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...
asked
Jun 9
in
Compiler Design

207
views
compilerdesign
lexicalanalysis
tokens
compilertokenization
0
votes
2
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)
asked
Jun 9
in
Algorithms

123
views
kruskalsalgorithm
graphalgorithms
greedyalgorithm
datastructure
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 nonterminal symbol side by side?
asked
Jun 6
in
Compiler Design

44
views
compilerdesign
operatorgrammar
ullman
+1
vote
3
answers
7
COMPILER DESIGN: Dragon Book self doubt
S→ A/a A→ a LL1 or not?
asked
Jun 4
in
Compiler Design

89
views
compilerdesign
ll1parser
syntaxdirectedtranslation
0
votes
1
answer
8
Self Doubt:Toc
asked
Jun 2
in
Theory of Computation

58
views
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
0
votes
2
answers
9
Self Doubt:Automata
Intersection of Recursive and Recursively Enumerable language is____________________ ?
asked
Jun 2
in
Theory of Computation

70
views
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
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++)
asked
Jun 2
in
Programming

143
views
algorithms
programminginc
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.
asked
Jun 1
in
Compiler Design

81
views
compilerdesign
ll1parser
parsing
syntaxdirectedtranslation
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..
asked
May 30
in
Computer Networks

85
views
computernetworks
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
asked
May 30
in
Computer Networks

146
views
computernetworks
ipaddressing
networkaddressing
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 ___________
asked
May 28
in
Linear Algebra

78
views
eigenvalue
linearalgebra
+3
votes
2
answers
15
MadeEasy Test Series: Theory Of Computation  Regular Languages
Consider the following statements: $S_1:\{(a^n)^mn\leq m\geq0\}$ $S_2:\{a^nb^nn\geq 1\} \cup \{a^nb^mn \geq1,m \geq 1\} $ Which of the following is regular? $S_1$ only $S_2$ only Both Neither of the above
asked
May 26
in
Theory of Computation

283
views
madeeasytestseries
theoryofcomputation
regularlanguages
0
votes
0
answers
16
MADE EASY ELECTRONICS
The number of Essential Prime implicants are ______________.
asked
May 25
in
Digital Logic

107
views
digitallogic
primeimplicants
0
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, –
asked
May 25
in
Databases

142
views
databases
relationalalgebra
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?
asked
May 25
in
GATE

100
views
madeeasytestseries
selfdoubt
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 ___________
asked
May 25
in
Databases

81
views
databases
rdbmstables
+2
votes
1
answer
20
Self Doubt: CO Syllabus
Is pipeline hazards there in the syllabus? And are there any previous year questions from there?
asked
May 23
in
CO and Architecture

95
views
coandarchitecture
pipelining
haza
0
votes
1
answer
21
ACE Academy: Recognition of CFG
$L1 =\left \{ a^{m} b^{n} c^{p}  \left ( m \geq n \right )\text{or} \left ( n = p \right ) \right \}$ $L2 =\left \{ a^{m} b^{n} c^{p}  \left ( m \geq n \right )\text{and} \left ( n = p \right ) \right \}$ $(a)$ Both are NCFL’s $(b)$ L1 is DCFL and L2 is NCFL $(c)$ L1 is NCFL and L2 is not contextfree $(d)$ Both are not contextfree
asked
May 23
in
Theory of Computation

78
views
cfg
contextfreelanguage
dcfl
+2
votes
3
answers
22
Ace Test Series: Theory Of Computation  Finite Automata
How many $2$ state DFA’s with the designated initial state can be constructed over the alphabet over the alphabet $\sum = \{a, b\}$ that accept universal language? $4$ $16$ $20$ $24$
asked
May 22
in
Theory of Computation

215
views
acetestseries
theoryofcomputation
finiteautomata
numberofdfa
+1
vote
1
answer
23
ACE ACADEMY: TOC
How many 2 state DFA’s with designated initial state can be constructed over the alphabet Σ = {a, b} that accept empty language ϕ ? (a) 4 (b) 16 (c) 20 (d) 24
asked
May 22
in
Theory of Computation

75
views
theoryofcomputation
numberofdfa
#dfa
+2
votes
1
answer
24
Ace Academy Question Bank: Automata
Find the no. of DFA’s that can be constructed over the alphabet Σ with 5 symbols, and with 10 states. (a) $2^5$^0$ × $50^5$ (b) $2^1$^0$ × $10^5$^0$ (c) $2^5$ × $10^5$^0$ (d) $2^5$^0$ × $50^5$
asked
May 22
in
Theory of Computation

87
views
theoryofcomputation
numberofdfa
0
votes
1
answer
25
self doubt: TOC
is union of regular language and context free language always regular?
asked
May 22
in
Theory of Computation

55
views
theoryofcomputation
regularlanguages
contextfreelanguage
+1
vote
0
answers
26
Self Doubt :automata
Is Mealy machine and Moore Machine in syllabus?
asked
May 22
in
Theory of Computation

27
views
syllabus
selfdoubt
+2
votes
1
answer
27
Vani Qs Bank Algorithms
.Given an array of distinct integers A[1, 2,…n]. Find the tightest upper bound to check the existence of any index i for which A[i]=i. Ans should be O(log n) right by doing binary search ??
asked
May 21
in
Algorithms

184
views
algorithms
datastructure
arrays
searching
+2
votes
0
answers
28
GEEKSFORGEEKS ALGO
What does it mean when we say that an algorithm X is asymptotically more efficient than Y? (A) X will be a better choice for all inputs (B) X will be a better choice for all inputs except small inputs (C) X will be a better choice for all inputs except large ... is it always the case?? At some points it might be true but I do not think this is the case for each and every input..
asked
May 20
in
Algorithms

69
views
algorithms
+2
votes
2
answers
29
GateForum Question Bank :Graph Theory
What is the probability that there is an edge in an undirected random graph having 8 vertices? 1 1/8
asked
May 19
in
Graph Theory

147
views
graphtheory
discretemathematics
+1
vote
0
answers
30
NPTEL: OS
asked
May 9
in
Operating System

107
views
operatingsystem
nptelquiz
Page:
1
2
next »
50,645
questions
56,615
answers
195,894
comments
102,332
users