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 kirtikanwar
0
votes
0
answers
1
Application
Why search option is not working?
Why search option is not working?
142
views
asked
Dec 17, 2017
0
votes
1
answer
2
made easy test series
192
views
asked
Feb 3, 2017
0
votes
1
answer
3
made easy test series
Sign bit-1 exponent-8 mantissa- 23
Sign bit-1 exponent-8 mantissa- 23
266
views
asked
Feb 3, 2017
2
votes
1
answer
4
execution time
how to solve this?
how to solve this?
400
views
asked
Feb 1, 2017
0
votes
0
answers
5
toc language question
144
views
asked
Feb 1, 2017
0
votes
1
answer
6
finding tuples
235
views
asked
Feb 1, 2017
0
votes
0
answers
7
binary tree
173
views
asked
Jan 25, 2017
0
votes
0
answers
8
ER Model
141
views
asked
Jan 24, 2017
1
votes
0
answers
9
computer architecture
944
views
asked
Jan 20, 2017
2
votes
2
answers
10
ER diagram
1.1k
views
asked
Jan 20, 2017
1
votes
1
answer
11
pipeline
How to solve this?
How to solve this?
752
views
asked
Jan 19, 2017
0
votes
1
answer
12
combinational circuits
360
views
asked
Jan 18, 2017
0
votes
0
answers
13
turing machine
247
views
asked
Jan 15, 2017
0
votes
0
answers
14
Turing machine
explain?
explain?
187
views
asked
Jan 15, 2017
0
votes
0
answers
15
Instruction Pipelining
How to solve this question?
How to solve this question?
220
views
asked
Jan 15, 2017
0
votes
1
answer
16
Parsing
Why in this I6 and I7 are not in same state??
Why in this I6 and I7 are not in same state??
310
views
asked
Jan 11, 2017
Compiler Design
compiler-design
parsing
lr-parser
test-series
+
–
1
votes
1
answer
17
ER MODEL
How to solve this question ?
How to solve this question ?
703
views
asked
Jan 11, 2017
Databases
er-diagram
+
–
1
votes
1
answer
18
tree and graph
If the graph G(V,E) is represented using adjacency matrix then to find universal sink (in degree is V-1 and out degree is 0)
If the graph G(V,E) is represented using adjacency matrix then to find universal sink (in degree is V-1 and out degree is 0)
915
views
asked
Jan 8, 2017
3
votes
1
answer
19
parsing
Consider the following operator grammar E->AaBcD A->bA|e B->bB|e D->eD|g Which of the following precedence relation is incorrect from the above grammar? Assume x<•y is used to represent x is having less precedence than y and in the expression x appears first and y appears next. a) a<•b b) c<•g c) a<•e d) c<•b
Consider the following operator grammarE->AaBcDA->bA|eB->bB|eD->eD|gWhich of the following precedence relation is incorrect from the above grammar? Assume x<•y is used ...
1.3k
views
asked
Jan 4, 2017
Compiler Design
compiler-design
parsing
operator-grammar
operator-precedence
+
–
0
votes
0
answers
20
parsing
Stmts-> Stmt| Stmts; Stmt Stmt-> Var= E Var-> id[E]|id E-> id|(E) find number of conflicts in LR(0).
Stmts- Stmt| Stmts; StmtStmt- Var= EVar- id[E]|idE- id|(E)find number of conflicts in LR(0).
291
views
asked
Jan 4, 2017
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register