Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
pps121
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by pps121
1
votes
1
answer
1
Virtual Gate Test Series: Discrete Mathematics - Graph Theory
Let $G$ be a graph on $n$ vertices with $4n-16$ edges.Consider the following: 1. There is a vertex of degree smaller than $8$ in $G.$ 2. There is a vertex such that there are less than $16$ vertices at a distance exactly $2$ from it. Which of the following is TRUE: 1 only 2 only Both 1 and 2 Neither 1 nor 2
Let $G$ be a graph on $n$ vertices with $4n-16$ edges.Consider the following:1. There is a vertex of degree smaller than $8$ in $G.$2. There is a vertex such that there a...
629
views
asked
Jan 8, 2019
Graph Theory
discrete-mathematics
graph-theory
virtual-gate-test-series
+
–
0
votes
1
answer
2
doubt
is this preemptive or non-preemptive?
is this preemptive or non-preemptive?
476
views
asked
Dec 15, 2018
Operating System
operating-system
process
+
–
0
votes
0
answers
3
Self doubt
which is/are TRUE: 1)All recursive lang are decidable problems? 2)All decidable problems are recursive language? - is both of them are true? any proof please?
which is/are TRUE:1)All recursive lang are decidable problems?2)All decidable problems are recursive language?- is both of them are true? any proof please?
195
views
asked
Dec 8, 2018
Theory of Computation
decidability
+
–
0
votes
0
answers
4
GATEBOOK
Please mention proper approach to solve similar questions
Please mention proper approach to solve similar questions
580
views
asked
Dec 7, 2018
Algorithms
time-complexity
algorithms
+
–
0
votes
0
answers
5
NIELIT Qtn
Consider the following possible outcomes of executing a Turing machine over a given input. Which of the following outcome is NOT possible? A)TM halts and accepts the input B)TM halts and rejects the input C)TM hangs and accepts the input D)TM never halts.
Consider the following possible outcomes of executing a Turing machine over a given input. Which of the following outcome is NOT possible?A)TM halts and accepts the input...
254
views
asked
Dec 2, 2018
Theory of Computation
turing-machine
theory-of-computation
+
–
0
votes
1
answer
6
NIELIT Qtn
Consider there are n/logn min heap trees each of size logn. What will be the time complexity to find the smallest element and greatest element in these min heap trees respectively? A) O(n/logn), O(n) B) O(n), O(n/logn) C) O(n), O(n) D) O(logn), O(logn)
Consider there are n/logn min heap trees each of size logn. What will be the time complexity to find the smallest element and greatest element in these min heap trees res...
535
views
asked
Dec 2, 2018
Algorithms
binary-heap
+
–
0
votes
0
answers
7
number system
How to convert a floating point number from Number system X to Number system Y? Ex: Given a number .75, I need to convert to base 9, say. Please help.
How to convert a floating point number from Number system X to Number system Y? Ex: Given a number .75, I need to convert to base 9, say. Please help.
324
views
asked
Aug 6, 2018
Digital Logic
digital-logic
number-representation
+
–
0
votes
1
answer
8
Virtual Gate Test Series: Algorithms - Recurrence Relation
274
views
asked
Jan 25, 2017
Combinatory
combinatory
recurrence-relation
virtual-gate-test-series
+
–
1
votes
0
answers
9
CO Doubt
Cache Doubt
Cache Doubt
186
views
asked
Jan 17, 2017
CO and Architecture
cache-memory
+
–
0
votes
1
answer
10
#doubt in ERD to relational DB
E1 and E2 are strong entities with 1:m relationship via R. we take 1 separate table for each strong entity => so 2 tables But if there is 1 : n relationship, then we take 1 side entity into many side => so it should be 1 table, not 2 as 1:n is given please explain which one is correct?
E1 and E2 are strong entities with 1:m relationship via R.we take 1 separate table for each strong entity = so 2 tablesBut if there is 1 : n relationship, then we take 1 ...
451
views
asked
Jan 13, 2017
Databases
er-diagram
+
–
0
votes
1
answer
11
doubt in data hazards
what are the ways to solve WAR and WAW hazards?
what are the ways to solve WAR and WAW hazards?
414
views
asked
Jan 6, 2017
CO and Architecture
pipelining
data-hazards
+
–
0
votes
0
answers
12
Weak Areas
I have below areas where I am not much condfident: Digital : Diff gate delays and overall circuit delays due to that. Network: Header + Data => Total data send by diff networks having diff capacity Please help with videos, resources, good Qtn URLs. Thank you .
I have below areas where I am not much condfident:Digital : Diff gate delays and overall circuit delays due to that.Network: Header + Data = Total data send by diff netwo...
168
views
asked
Jan 2, 2017
Study Resources
study-resources
preparation
general
+
–
0
votes
1
answer
13
proposition Logic
Please explain
Please explain
389
views
asked
Dec 18, 2016
Mathematical Logic
mathematical-logic
+
–
0
votes
1
answer
14
TOC Doubt
What is the approach to identify for such ambiguous grammar? any formula?
What is the approach to identify for such ambiguous grammar? any formula?
272
views
asked
Dec 14, 2016
Theory of Computation
theory-of-computation
+
–
1
votes
1
answer
15
DOubt TOC
L = { ap | P is NOT Prime } - How to prove is it CFL or NOT?
L = { ap | P is NOT Prime } - How to prove is it CFL or NOT?
376
views
asked
Nov 30, 2016
Theory of Computation
theory-of-computation
+
–
1
votes
2
answers
16
Self Doubt TOC
L = { am bm cn dn ei fi | i > m>n>0 , i<= 10 } is DCFL or not?
L = { am bm cn dn ei fi | i m>n>0 , i<= 10 } is DCFL or not?
438
views
asked
Nov 30, 2016
Theory of Computation
theory-of-computation
+
–
2
votes
1
answer
17
Digital doubt
357
views
asked
Nov 14, 2016
Digital Logic
digital-logic
+
–
0
votes
1
answer
18
Self Doubt
What is the difference between Context Switch Vs Interrupts? - Answers w.r.t CO & OS & from system internals will be more helpful.
What is the difference between Context Switch Vs Interrupts? - Answers w.r.t CO & OS & from system internals will be more helpful.
235
views
asked
Nov 1, 2016
1
votes
1
answer
19
Recursion Elimination
which data structure is used to "Eliminate recursion" ?
which data structure is used to "Eliminate recursion" ?
477
views
asked
Aug 2, 2016
1
votes
1
answer
20
matrix doubt
which of the above is true?
which of the above is true?
455
views
asked
May 10, 2016
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register