Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
kirtikanwar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by kirtikanwar
0
answers
1
Application
Why search option is not working?
Why search option is not working?
141
views
asked
Dec 17, 2017
9
answers
2
GATE IT 2008 | Question: 44
When $n = 2^{2k}$ for some $k \geqslant 0$, the recurrence relation $T(n) = √(2) T(n/2) + √n$, $T(1) = 1$ evaluates to : $√(n) (\log n + 1)$ $√(n) \log n$ $√(n) \log √(n)$ $n \log √n$
When $n = 2^{2k}$ for some $k \geqslant 0$, the recurrence relation$T(n) = √(2) T(n/2) + √n$, $T(1) = 1$evaluates to :$√(n) (\log n + 1)$$√(n) \log n$$√(n) \log...
17.1k
views
commented
Dec 9, 2017
Algorithms
gateit-2008
algorithms
recurrence-relation
normal
+
–
1
answer
3
made easy test series
Sign bit-1 exponent-8 mantissa- 23
Sign bit-1 exponent-8 mantissa- 23
257
views
answer selected
Feb 3, 2017
1
answer
4
made easy test series
185
views
commented
Feb 3, 2017
1
answer
5
finding tuples
222
views
commented
Feb 2, 2017
1
answer
6
execution time
how to solve this?
how to solve this?
386
views
asked
Feb 1, 2017
0
answers
7
toc language question
142
views
asked
Feb 1, 2017
0
answers
8
binary tree
168
views
asked
Jan 25, 2017
1
answer
9
pipeline
How to solve this?
How to solve this?
715
views
commented
Jan 24, 2017
0
answers
10
ER Model
138
views
asked
Jan 24, 2017
0
answers
11
computer architecture
924
views
asked
Jan 20, 2017
2
answers
12
ER diagram
1.0k
views
asked
Jan 20, 2017
1
answer
13
combinational circuits
348
views
asked
Jan 18, 2017
0
answers
14
turing machine
244
views
asked
Jan 15, 2017
0
answers
15
Turing machine
explain?
explain?
184
views
asked
Jan 15, 2017
0
answers
16
Instruction Pipelining
How to solve this question?
How to solve this question?
220
views
asked
Jan 15, 2017
1
answer
17
ER MODEL
How to solve this question ?
How to solve this question ?
680
views
commented
Jan 14, 2017
Databases
er-diagram
+
–
1
answer
18
Parsing
Why in this I6 and I7 are not in same state??
Why in this I6 and I7 are not in same state??
303
views
asked
Jan 11, 2017
Compiler Design
compiler-design
parsing
lr-parser
test-series
+
–
1
answer
19
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)
892
views
asked
Jan 8, 2017
1
answer
20
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.2k
views
asked
Jan 4, 2017
Compiler Design
compiler-design
parsing
operator-grammar
operator-precedence
+
–
1
answer
21
parsing
consider the following grammar production S->XX X->0X|1 In the canonical LR method if [X->0•X,0] is an item then which of the following is the viable prefix of the item? a)000 b)111 c) 011 d)110
consider the following grammar productionS->XXX->0X|1In the canonical LR method if [X->0•X,0] is an item then which of the following is the viable prefix of the item?a)...
1.0k
views
commented
Jan 4, 2017
Compiler Design
compiler-design
viable-prefix
+
–
0
answers
22
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).
285
views
asked
Jan 4, 2017
1
answer
23
parsing
Convert the grammar to reduced form ? S->AB S->CA B->BC B->AB A->a C->aB |b
Convert the grammar to reduced form ?S->AB S->CA B->BC B->AB A->a C->aB |b
4.5k
views
commented
Jan 4, 2017
Compiler Design
compiler-design
parsing
context-free-grammar
descriptive
+
–
0
answers
24
parsing
Plz explain https://gateoverflow.in/?qa=blob&qa_blobid=17006947629127972543
Plz explainhttps://gateoverflow.in/?qa=blob&qa_blobid=17006947629127972543
176
views
asked
Jan 4, 2017
3
answers
25
#GATE
There are 4 sorted lists of n/4 elements each. If we merge these lists into a single sorted list of n elements , for the n=400 number of key comparison in the worst case using an efficient algorithm is?
There are 4 sorted lists of n/4 elements each. If we merge these lists into a single sorted list of n elements , for the n=400 number of key comparison in the worst case ...
394
views
asked
Jan 2, 2017
Algorithms
sorting
algorithms
time-complexity
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register