Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged test-series
0
votes
1
answer
481
Recurrence
How can we get this solution by solving this recurrence?
How can we get this solution by solving this recurrence?
saumya mishra
308
views
saumya mishra
asked
Sep 19, 2017
Algorithms
recurrence-relation
test-series
+
–
0
votes
2
answers
482
Asymptotic notation
Nisha moyal
2.0k
views
Nisha moyal
asked
Sep 19, 2017
Algorithms
asymptotic-notation
test-series
+
–
0
votes
1
answer
483
time complexity
Parshu gate
641
views
Parshu gate
asked
Sep 17, 2017
Algorithms
time-complexity
algorithms
asymptotic-notation
programming-in-c
test-series
+
–
5
votes
1
answer
484
CPU scheduling
Which of the following CPU scheduling leads to convey effect? i) SJF ii) Priority iii) FCFS the answer is all . is it true ? Also , i read somewhere .. that for SJF convoy effect is usually confused with priority inversion . kindly clear this doubt .
Which of the following CPU scheduling leads to convey effect?i) SJFii) Priorityiii) FCFSthe answer is all .is it true ?Also , i read somewhere .. that for SJF convoy effe...
shaurya vardhan
1.6k
views
shaurya vardhan
asked
Sep 5, 2017
Operating System
test-series
operating-system
+
–
1
votes
1
answer
485
Time complexity of the given program.
Rishabh Gupta 2
1.4k
views
Rishabh Gupta 2
asked
Aug 31, 2017
Algorithms
time-complexity
programming-in-c
asymptotic-notation
test-series
+
–
0
votes
1
answer
486
Compiler Design
a) (i) and (ii) only b) (ii) and (iii) only c) (i) and (iv) only d) All are correct
a) (i) and (ii) onlyb) (ii) and (iii) onlyc) (i) and (iv) onlyd) All are correct
stblue
869
views
stblue
asked
Aug 26, 2017
Compiler Design
compiler-design
intermediate-code
compilation-phases
test-series
+
–
3
votes
1
answer
487
Time Complexity
Is the answer D ?
Is the answer D ?
Pranjali1894
653
views
Pranjali1894
asked
Aug 18, 2017
Algorithms
algorithms
time-complexity
test-series
+
–
2
votes
1
answer
488
algorithms Asymptotic Notations
Pavan Kumar Munnam
583
views
Pavan Kumar Munnam
asked
Aug 12, 2017
Algorithms
asymptotic-notation
algorithms
time-complexity
test-series
+
–
2
votes
2
answers
489
Complier Design Test 1.1
Ques. S --> Aa/bAc/dc A --> d Which of them is correct. Please provide detailed information. a) LALR(1) but not SLR(1) b) Both SLR(1) and LALR(1) c) Grammar is Ambiguous d) Neither SLR(1) NOR LALR(1)
Ques. S Aa/bAc/dc A dWhich of them is correct. Please provide detailed information.a) LALR(1) but not SLR(1)b) Both SLR(1) and LALR(1)c) Grammar is Ambiguo...
Shivam Bhardwaj
887
views
Shivam Bhardwaj
asked
Aug 10, 2017
Compiler Design
compiler-design
parsing
lr-parser
ambiguous-grammar
test-series
+
–
2
votes
1
answer
490
Time Complexity
I think answer should be $O(n^{3})$ but given options are $a.O(n^{4}) b.O(n^{5}) c.O(n^{6}) d.O(n^{7})$ What is the running time of the following code:
I think answer should be $O(n^{3})$but given options are$a.O(n^{4}) b.O(n^{5}) c.O(n^{6}) d.O(n^{7})$What is the running time of the following code:
Manu Thakur
602
views
Manu Thakur
asked
Jul 31, 2017
Algorithms
time-complexity
asymptotic-notation
algorithms
test-series
+
–
8
votes
2
answers
491
OS PAGING William stallings
Consider a virtual memory system with 32-bit virtual addresses and 1 KB pages. Each page table entry requires 32- bits. It is desired to limit the page table size to one page. How many levels of page tables required? Also find the size memory ... solution. I am weak in understanding these concepts. Answer for the first one is 3 and for the second one is 8208 bytes.
Consider a virtual memory system with 32-bit virtual addresses and 1 KB pages. Each page table entry requires 32- bits. It is desired to limit the page table size to one ...
humblefool
9.3k
views
humblefool
asked
Jul 19, 2017
Operating System
test-series
virtual-memory
operating-system
paging
+
–
1
votes
1
answer
492
Discrete
Kuldeep Pal
359
views
Kuldeep Pal
asked
Jul 16, 2017
Algorithms
graph-algorithms
depth-first-search
graph-search
test-series
+
–
0
votes
0
answers
493
Testbook Series TOC 2018 GATE
In the above, doesn't it also accepts empty string, and {a} or {b}? I think the answer there is wrong. Correct me if I am wrong. How is that they took different string here in the second one? z should be same, isn't it? Is PDA possible here? Isn't empty allowed?
In the above, doesn't it also accepts empty string, and {a} or {b}? I think the answer there is wrong. Correct me if I am wrong.How is that they took different string her...
Vasu Srivastava
569
views
Vasu Srivastava
asked
Jul 14, 2017
Theory of Computation
theory-of-computation
gatecse-2018
test-series
+
–
1
votes
1
answer
494
Daa........
What is the ans and give reason
What is the ans and give reason
Dharam raj
705
views
Dharam raj
asked
Jul 12, 2017
Algorithms
sorting
algorithm-design-technique
test-series
+
–
2
votes
1
answer
495
Gate algorithm
Harikesh Kumar
502
views
Harikesh Kumar
asked
Jul 10, 2017
Algorithms
sorting
binary-search
time-complexity
test-series
+
–
1
votes
1
answer
496
Parsing
Someone please explain. Answer given is 2.
Someone please explain. Answer given is 2.
atul_21
221
views
atul_21
asked
Jul 8, 2017
Compiler Design
compiler-design
parsing
numerical-answers
test-series
+
–
0
votes
2
answers
497
Test series
Which test series good for gate 2018 students????? For cs branch..
Which test series good for gate 2018 students????? For cs branch..
anonymous
4.5k
views
anonymous
asked
Jun 18, 2017
GATE
test-series
+
–
3
votes
2
answers
498
Quick sort algorithm selects (n/5)th element as the smallest element
Please show the working
Please show the working
rahuldb
2.5k
views
rahuldb
asked
May 10, 2017
Algorithms
algorithms
sorting
time-complexity
test-series
+
–
3
votes
2
answers
499
Time complexity
student2018
479
views
student2018
asked
Apr 30, 2017
Algorithms
time-complexity
test-series
+
–
1
votes
1
answer
500
How to find Complexity of this type of Question
akash.dinkar12
355
views
akash.dinkar12
asked
Apr 11, 2017
Algorithms
time-complexity
test-series
+
–
0
votes
0
answers
501
ACE test
How can this be true...? I guess answer is b
How can this be true...? I guess answer is b
Dhawal Gajwe
483
views
Dhawal Gajwe
asked
Feb 5, 2017
Operating System
ace-test-series
test-series
bad-question
+
–
–1
votes
1
answer
502
number of steps in derivation
iita
6.0k
views
iita
asked
Feb 3, 2017
Compiler Design
compiler-design
context-free-grammar
parsing
numerical-answers
test-series
+
–
0
votes
1
answer
503
Vertex degrees
Let G be a simple undirected graph such that G contains only vertex 'u' of maximum degree and let D be a DFS tree of G such that D contains only vertex 'v' of maximum degree. Which of the following is True? [ A ] 'u' is same ... loops, hence having a degree of 2n. But the dfs tree should have just one vertex with a single self loop in this case, right?
Let G be a simple undirected graph such that G contains only vertex 'u' of maximum degree and let D be a DFS tree of G such that D contains only vertex 'v' of maximum deg...
Krunal2016
293
views
Krunal2016
asked
Feb 3, 2017
Algorithms
depth-first-search
test-series
+
–
4
votes
2
answers
504
Mathematics
In how many different ways 10 identical ball can be distributed among 3 children, if each receives atleast 2 balls and no more than 4 balls?
In how many different ways 10 identical ball can be distributed among 3 children, if each receives atleast 2 balls and no more than 4 balls?
srestha
1.6k
views
srestha
asked
Feb 2, 2017
Combinatory
test-series
+
–
0
votes
1
answer
505
Compexity of sum of complexity bounds
Mahesha999
259
views
Mahesha999
asked
Feb 2, 2017
Algorithms
algorithms
time-complexity
test-series
+
–
2
votes
1
answer
506
Ace Test Series: Databases - Er Diagram
AmitPatil
877
views
AmitPatil
asked
Feb 1, 2017
Databases
ace-test-series
test-series
er-diagram
databases
+
–
2
votes
0
answers
507
Min heap
how to solve this please explain procedure...
how to solve this please explain procedure...
S Ram
577
views
S Ram
asked
Feb 1, 2017
Programming in C
binary-heap
test-series
+
–
0
votes
1
answer
508
BFS traversal
here S1 ans S2 seems confusing for me can someone help me to varify this answer i think given 3 are true in some case??
here S1 ans S2 seems confusing for me can someone help me to varify this answer i think given 3 are true in some case??
S Ram
229
views
S Ram
asked
Feb 1, 2017
Algorithms
breadth-first-search
test-series
+
–
2
votes
1
answer
509
Remove Left recursion from context free grammer
rahuldb
1.9k
views
rahuldb
asked
Jan 31, 2017
Compiler Design
compiler-design
grammar
left-recursion
recurrence-relation
test-series
+
–
0
votes
1
answer
510
Construct LL(1) Parsing table for the following grammar
rahuldb
4.9k
views
rahuldb
asked
Jan 31, 2017
Compiler Design
compiler-design
parsing
grammar
ll-parser
theory-of-computation
test-series
+
–
Page:
« prev
1
...
12
13
14
15
16
17
18
19
20
21
22
...
29
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register