Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
vishalshrm539
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by vishalshrm539
0
votes
1
trees
formula for which maximum number of nodes will be present in complete n-array tree?
formula for which maximum number of nodes will be present in complete n-array tree?
388
views
answered
Nov 2, 2018
DS
data-structures
+
–
0
votes
2
Handle in a grammar
Consider the following Grammar : $S \rightarrow ZZ$ $Z \rightarrow xZ|y$ Which of the following represents a handle in the generation of the string "xxxyxy" ? A. $ZxZ$ B. $Zxy$ C. $xZxy$ D. $xZ$ Please explain a little about handles too I have a little doubt about it. And do explain the difference between viable prefix and Handle Please :)
Consider the following Grammar :$S \rightarrow ZZ$$Z \rightarrow xZ|y$Which of the following represents a handle in the generation of the string "xxxyxy" ?A. $ZxZ$B. $Z...
7.7k
views
answered
Oct 3, 2018
Compiler Design
compiler-design
grammar
viable-prefix
+
–
0
votes
3
LR(k) grammar doubt
Do every LR(1) grammar have DPDA?
Do every LR(1) grammar have DPDA?
275
views
answered
Sep 11, 2018
Compiler Design
compiler-design
parsing
lr-parser
+
–
8
votes
4
GATE CSE 2009 | Question: 30
Consider a system with $4$ types of resources $R1$ ($3$ units), $R2$ ($2$ units), $R3$ ($3$ units), $R4$ ($2$ units). A non-preemptive resource allocation policy is used. At any given instance, a request is not entertained if it cannot be ... deadlock Only $P1$ and $P2$ will be in deadlock Only $P1$ and $P3$ will be in deadlock All three processes will be in deadlock
Consider a system with $4$ types of resources $R1$ ($3$ units), $R2$ ($2$ units), $R3$ ($3$ units), $R4$ ($2$ units). A non-preemptive resource allocation policy is used....
33.7k
views
answered
Jan 2, 2018
Operating System
gatecse-2009
operating-system
resource-allocation
normal
+
–
6
votes
5
GATE CSE 1994 | Question: 3.5
Match the following items ...
Match the following items$$\begin{array}{ll|ll}\hline \text{(i)} & \text{Backus-Naur form} & \text{(a)} & \text{Regular expressions} \\\hline \text{(ii)} & \text{Lexical...
5.3k
views
answered
Dec 24, 2017
Compiler Design
gate1994
compiler-design
grammar
normal
match-the-following
+
–
0
votes
6
MadeEasy Test Series: Algorithms - Sorting
Which of the following sorting techniques have best time complexity, if complexity is measured in terms of number of comparison? A Insertion sort B Selection sort C Merge sort D QuickSort
Which of the following sorting techniques have best time complexity, if complexity is measured in terms of number of comparison? A Insertion sortB Selection sortC Merge s...
1.0k
views
answered
Dec 8, 2017
Algorithms
made-easy-test-series
algorithms
sorting
time-complexity
+
–
1
votes
7
Heap Deletion
For searching an element from heap,then delete it from heap Why will it take O(n+log n) time and not O(n log n) time?
For searching an element from heap,then delete it from heapWhy will it take O(n+log n) time and not O(n log n) time?
493
views
answered
Dec 8, 2017
DS
data-structures
binary-heap
time-complexity
+
–
0
votes
8
OS:- Multilevel feedback queue scheduling
Does multilevel feedback queue suffer starvation?
Does multilevel feedback queue suffer starvation?
1.8k
views
answered
Aug 21, 2017
Operating System
multilevel
scheduling
operating-system
system
feedback
+
–
1
votes
9
Related to time complexity
Which one is greater in asymptomatic notation? 1)n 2)(log n)100
Which one is greater in asymptomatic notation?1)n 2)(log n)100
1.9k
views
answered
Jun 13, 2017
Algorithms
algorithms
time-complexity
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register