Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Blogs
Previous Year
Exams
Recent activity
0
votes
0
answers
Self doubt  Graph Connectivity (NPTEL & PY)
Let G be a graph with n vertices and if every vertex has a degree of at least $\frac{n−1}{2}$ then G is connected. Source : https://gateoverflow.in/1221/gate200723 Let G be a graph with n vertices and if every vertex has a degree of at ... then G is connected. source : https://nptel.ac.in/courses/106/106/106106183/ My doubt : Which one is right?
commented
1 minute
ago
in
Graph Theory
by
KUSHAGRA गुप्ता
(
1.4k
points)

13
views
discretemaths
graphtheory
0
votes
0
answers
#toc#zeal test series #cfl
Why option c is a CFL,please explain?
commented
3 minutes
ago
in
Theory of Computation
by
Ehraz Hasan
(
348
points)

8
views
0
votes
0
answers
Algorithm :Tardos
Suppose you are consulting for a bank, that is concerned about fraud detection and they came to you with the following problem. They have the collection of n bank cards they have confiscated, suspecting them of being used in fraud. Each bank card is a ... are to pick two of them and plug them into the equivalent tester. What is Time Complexity to find answer of this question?
commented
3 hours
ago
in
Algorithms
by
Shaik Masthan
(
1.4k
points)

12
views
algorithms
0
votes
1
answer
Self doubt:Algorithm BookTardos
Can we measure , number of inversion in $O\left ( nlogn \right )$ time?Give some hint.
commented
3 hours
ago
in
Algorithms
by
Ehraz Hasan
(
348
points)

11
views
algorithms
0
votes
0
answers
SELF DOUBT GATE 2001 digital logic
https://gateoverflow.in/726/gate200128 I am unable to understand, how this is working Can anyone explain it in one go?
commented
3 hours
ago
in
Digital Logic
by
Shaik Masthan
(
1.4k
points)

8
views
0
votes
0
answers
made easy test series
Consider the functions – logn! , (logn)! , (logn)^logn , log(logn)! , and (loglogn)!. What should be the increasing order of the functions?
commented
3 hours
ago
in
Algorithms
by
ankitgupta.1729
(
139
points)

18
views
0
votes
1
answer
Made Easy Operating system doubt
Multilevel feedback queue scheduling suffers from starvation [True or False]. I think it is false, Multilevel queue scheduling suffers starvation, while in Multilevel feedback queue scheduling we move the process from lower priority queue to higher priority ... starvation, and therefore it should be false. [As per madeeasy key it is true, Someone please explain]
answered
3 hours
ago
in
Operating System
by
Ehraz Hasan
(
348
points)

7
views
operatingsystem
0
votes
0
answers
Self doubt in instructionpipeline.
In a 5 stages pipeline named as IF,ID,OF,MR,WB.in order to execute I1:load r0,3(r1) I2:add r3,r2;r0. l3:sub r4,r3,r5; I4:mul r6,r4,r7; can we execute OF and MR or OF and EX stage in the same clock cycle given that the operand forwarding is used.if every stage takes 1 clk cycle then how long will take it to complete the above instruction in the pipeline
commented
4 hours
ago
in
CO & Architecture
by
Shaik Masthan
(
1.4k
points)

5
views
0
votes
0
answers
made easy test series
if L1 is regular and L2 is DCFL then (L1 intersection L2*)’ is what a)CFL b)CSL c)recursive d)REL options given are b,c,d but if we apply * to any language it becomes regular language then (regular intersection regular) is regular so option should be “all are correct”. Can any one please explain?
commented
6 hours
ago
in
Theory of Computation
by
Shaik Masthan
(
1.4k
points)

9
views
#dcfl
0
votes
1
answer
Self Doubt Database recoverability
All conflict serializable schedules are recoverable.[True or False] Please provide the explanation as well as reference too if possible
commented
8 hours
ago
in
Databases
by
Ollie
(
453
points)

35
views
databases
serializablity
recoverable
0
votes
0
answers
PETER LINZ PG 78 Q13
$L$= {a^{n}b^{m}  n\geqslant 2, m\geq 1, nm\geqslant 3}$ What will be the Regular expression for this
commented
8 hours
ago
in
Theory of Computation
by
Shaik Masthan
(
1.4k
points)

7
views
peterlinz
0
votes
0
answers
GeeksforGeeks
Select the correct asymptotic complexity of an algorithm with runtime T(n, n) where T(x, c) = Θ(x) for c <= 2, T(c, y) = Θ(y) for c <= 2, and T(x, y) = Θ(x+y) + T(x/2, y/2) (A) Θ(nLogn) (B) Θ(n$^2$) (C) Θ(n) (D) Θ(n$^2$Logn)
asked
8 hours
ago
in
Algorithms
by
Musa
(
1
points)

4
views
0
votes
0
answers
AVL tree help
The vertex of a binary tree is called an single child if it has a father's vertex but does not have a neighbor. The root is not considered an single child. numOnly indicate the number of vertices in binary tree that hold the attribute "single son ", and ... in the binary tree i need to prove that every nonempty AVL tree has inequality $\frac{numOnly}{n}\leq \frac{1}{2}$
commented
9 hours
ago
in
Algorithms
by
Shaik Masthan
(
1.4k
points)

17
views
binarytree
0
votes
0
answers
COUNTERS STUDY MATERIAL
I am so weak at solving counters and sequencial circuits problems Can anyone guide me from where I should study so that I get the concept straight in my mind. PLease help
commented
9 hours
ago
in
Digital Logic
by
S.R.
(
433
points)

23
views
selfdoubt
0
votes
0
answers
Made easy test series
we are given two strings: String S of length n and string T of length m for the LCS problem, we have produced the following exponential time recursive program. LCM (S, n, T, m) { if (n == 0m == 0) return 0 if (S[n] == T[m]) result t = 1 + LCS (S, ... , LCS (S, n, T, m  1)); return result; } then the number of times that LCS (S, 1, T, 1) is recursively called equals ________
asked
12 hours
ago
in
Algorithms
by
nehamawa
(
7
points)

4
views
0
votes
1
answer
made easy test series
Consider the array after one pass of quick sort algorithm: 9 7 17 21 18 24 29 the sum of all possible values that could have been used as a pivot is __ ?
commented
20 hours
ago
in
Algorithms
by
nehamawa
(
7
points)

31
views
+1
vote
2
answers
NIELIT2018 December
Look at this series : 25, 25, 37, 37, __, 51 , What number should fill the blank? (A) 51 (B) 39 (C) 23 (D) 25
commented
1 day
ago
in
Numerical Ability
by
Danishgupta
(
5
points)

605
views
general
number
series
0
votes
1
answer
#Toc Madeeasy
L = { $a^nb^m\;\; m>n \;or\; m<n$ } – is this language dcfl ?
answer selected
1 day
ago
in
Theory of Computation
by
srestha
(
993
points)

36
views
dcfl
toclanguages
0
votes
1
answer
Made easy test series
An 2dimensional array having n row and m column which contain positive integer is called cross sum array satisfying above property The minimum sum of a, b, c, d and e, such that it follow the above properties of cross sum array is ____.
commented
1 day
ago
in
Algorithms
by
nehamawa
(
7
points)

25
views
0
votes
0
answers
Compilers Ullman 2nd Edition, Page No. 542, Exercise 8.5.6
asked
2 days
ago
in
Compiler Design
by
infodevesh
(
5
points)

14
views
compilerdesign
dag
0
votes
1
answer
#General Query #GATE Calculator #Determinant
How to find determinant value using GATE calculator in GATE exam?
answered
2 days
ago
in
GATE
by
infodevesh
(
5
points)

35
views
selfdoubt
0
votes
1
answer
Test Question of Applied Gate
Not able to solve this question. How to solve this type of questions?
answered
2 days
ago
in
Combinatory
by
Ehraz Hasan
(
348
points)

18
views
combinatory
0
votes
0
answers
COMPUTER NETWORKS NPTEL ASSIGNMENT QUESTION
commented
2 days
ago
in
Computer Networks
by
S.R.
(
433
points)

31
views
computer
networks
0
votes
0
answers
ACE PRACTISE BOOK
Single source shortest path problems can be implemented by the Greedy Method using (a) RedBlack trees (b) Min Heap (c ) AVL Trees (d) None of these
asked
2 days
ago
in
Algorithms
by
Vishal_kumar98
(
5
points)

6
views
algorithms
0
votes
2
answers
ace test series
Consider a system with VAS of 8MB; Page table entry is 32bits.The optimal Page Size in order to minimize internal fragmentation and page table size overhead is________ KB
commented
2 days
ago
in
Operating System
by
S.R.
(
433
points)

17
views
0
votes
3
answers
RosenChapter 8, Ex 8.5,Question 24
Find the probability that when a fair coin is flipped five times tails comes up exactly three times, the first and last flips come up tails, or the second and fourth flips come up heads.
answered
2 days
ago
in
Combinatory
by
S.R.
(
433
points)

82
views
kennethrosen
discretemathematics
0
votes
1
answer
Self Doubt  Planar graph (PY)
$K_5$ is nonplanar. I am showing you my proof. Please tell me whether this is the right way or not to prove that $K_5$ is nonplanar. $\sum$ (deg)$=4+4+4+4+4=20$ $e=10$ and $n=5$ Assume $K_5$ is planar. $ve+r=2$ ... $K_5$ is nonplanar. If this is the right way, why this method didn't work in this graph. Source: https://gateoverflow.in/87129/gate19903vi
answer edited
2 days
ago
in
Graph Theory
by
S.R.
(
433
points)

21
views
discretemaths
graphplanarity
graphtheory
selfdoubt
0
votes
1
answer
Made easy test series GATE 2021
Consider a two dimensional array A[039,039] in lower triangular matrix representation . The size of each element in the array is 1 byte. If the array is implemented in the memory in the form of row major order and base address of the array is 500. The address of A[15][25] will be
[closed]
closed
3 days
ago
in
Programming
by
KUSHAGRA गुप्ता
(
1.4k
points)

27
views
0
votes
0
answers
# Made Easy Test
[closed]
closed
3 days
ago
in
CO & Architecture
by
KUSHAGRA गुप्ता
(
1.4k
points)

20
views
0
votes
1
answer
MadeEasy Subject Wise OS
Consider the following code comprising of a swap function which is atomic. void swap(bool *a, bool *b){ bool temp; temp = *a; *a = *b; *b = temp; } bool lock = false void process(int i){ bool key; while(1){ // ... Bounded Waiting The code snippet solves the synchronization problem [According to me it should be bounded waiting but MadeEasy answer key says option (D)]
answered
3 days
ago
in
Operating System
by
Ehraz Hasan
(
348
points)

20
views
operatingsystem
synchronization
0
votes
1
answer
Made Easy Test Series 2021
Consider the following statements: 1.Union of 2 nonregular languages is nonregular 2.Intersection of a nonregular and regular language is nonregular 3.Kleenclosure of a nonregular language is nonregular 4.Union of a nonregular language with its complement is regular. The number of the above correct statements is/are:
answer selected
3 days
ago
in
Theory of Computation
by
srestha
(
993
points)

64
views
+1
vote
1
answer
Gravner Probability Exercise
comment edited
3 days
ago
in
Probability
by
akashmittal1208
(
71
points)

35
views
probability
+1
vote
1
answer
Decidability: ME
A student want to prove a relation between the “hello” and “world”, where “hello” and “world” are two problems , if the student proves that “hello” is reducible to “world” and “world” is decidable then “hello” is decidable. L={<M>  M is turing machine and $L\left ( M \right )\preceq _{p}\left \{ 0^{p} 1^{2p} p>0 \right \}$} Which one ofthe following is decidable?
answer edited
3 days
ago
in
Theory of Computation
by
g21
(
931
points)

53
views
theoryofcomputation
0
votes
0
answers
UGC NET 2016 as well as Discrete Maths Kenneth Rosen PAGE Pg 657 Q21
[closed]
closed
3 days
ago
in
Set Theory & Algebra
by
S.R.
(
433
points)

16
views
kennethrosen
combinatory
0
votes
0
answers
Seeking guidance
can someone please provide links to the pdf of subjectwise questions of previous year gate questions?
asked
3 days
ago
in
Study Resources
by
Setika Mehra
(
5
points)

18
views
gate
exam
mock
testseries
0
votes
1
answer
ROSEN question on Probability
find p(F I E) If p(E I F) = 1/3, p(E I F’) = 1/4, and p(F) = 2/3, where E and F are events from a sample space S. Is p(F I E) 11/12?
comment edited
3 days
ago
in
Probability
by
Shaik Masthan
(
1.4k
points)

21
views
+1
vote
1
answer
Self Doubt on Addressing Mode in COA
I read in some gateoverflow answer that register address mode is used for local variables and direct address mode is used for global variables. Why are local variables stored in registers? Arent they part of the activation record which gets ... C programming language there is a special keyword register to store the variable in register. Am I missing something?
answered
3 days
ago
in
CO & Architecture
by
gatecse
(
87
points)

34
views
0
votes
0
answers
#Decidability
Can anyone tell me how to approach the problems like 1) Is Language generated by CFG subset of langauage generated by regular grammar is decidable?? 2)membership of cfg,emptiness problems....???(Not just these two but how to approach such type of problems)?????
asked
3 days
ago
in
Theory of Computation
by
Jithendra319
(
13
points)

20
views
decidability
0
votes
2
answers
madeeasy topicwise
A 3ary tree in which every internal node has exactly 3 children. The number of leaf nodes in such a tree with 10 internal nodes will be _____
answered
4 days
ago
in
Programming
by
Mellophi
(
325
points)

32
views
programming
0
votes
0
answers
Self Doubt (OS)
https://gateoverflow.in/74241/twoprocesscriticalsectionsoftwaresolution In this question people are saying bounded waiting is satisfied. But in parbegin there are only 2 processes and once a process is complete it will not be scheduled again as parbegin statement is not inside any loop. So how can bounded waiting be not satisfied?
asked
4 days
ago
in
Operating System
by
Mellophi
(
325
points)

14
views
selfdoubt
To see more, click for the
full list of questions
or
popular tags
.
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Recent Posts
Guidelines to users
No Recent Blog Comments
Recent activity
8,180
questions
2,594
answers
12,728
comments
95,256
users