menu
Questions by sarthakdarji
Login
Register
My account
Edit my Profile
Private messages
My favorites
Register
Questions by sarthakdarji
All Activity
Q&A
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Blogs
Previous Year
Exams
Questions by sarthakdarji
Filter
User sarthakdarji
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
0
answers
48
views
#MadeEasyTextBook #Permutation&Combinations
In the below shown question I am getting answer as 70 but the given answer in book is 35. Can anyone help me solving this question?
asked
in
Mathematical Logic
Oct 9, 2021
48
views
self-doubt
0
votes
1
answer
48
views
#TestSetLock #OS #SelfDoubt
Why Progress is guaranteed in test and set lock(TSL) because if we look at spin lock problem in which let’s say P1 having lower priority is in critical section and when P2 having higher priority comes which is interested in entering into Critical Section then it stops P2 from entering then how can we say that progress is guaranteed in test and set lock?
asked
in
Operating System
Aug 27, 2021
48
views
self-doubt
operating-system
0
votes
1
answer
50
views
Made easy theory book, Self doubt in pointers.
Here in this question answer is option a. But I think it would be option c please clear my doubt with proper explanation.
asked
in
Programming
Sep 12, 2020
50
views
pointers
self-doubt
0
votes
0
answers
139
views
Made easy theory, Self doubt in pointers
#include<stdio.h> int main() { char *p1="Graduate"; char *p2=p1; printf("%c",*++p2); printf("%d",sizeof(p2)); return 0; }
asked
in
Programming
Sep 11, 2020
139
views
programming
0
votes
0
answers
47
views
Self doubt in programming, made easy theory book
asked
in
Programming
Sep 11, 2020
47
views
pointers
self-doubt
0
votes
0
answers
152
views
Made easy online test series, Algorithms
I think that the Emax’s last addition will be +6 instead of +5. Am I correct please let me know. If I am wrong then please correct me. Below is the question.
asked
in
Algorithms
Sep 7, 2020
152
views
madeeasyots
algorithms
dijikstraalgo
0
votes
1
answer
81
views
Made easy Workbook, Self doubt in Minimum Spanning Tree
asked
in
Algorithms
Sep 5, 2020
81
views
made-easy-test-series
algorithms
minimumspanningtree
0
votes
0
answers
36
views
Made easy theory book,Self doubt in Hashing Techniques
asked
in
Programming
Sep 5, 2020
36
views
made-easy-test-series
datastructures
hashing
0
votes
0
answers
22
views
Made easy Work book, Self doubt in Graph Based Algorithms
asked
in
Algorithms
Sep 3, 2020
22
views
algorithms
graphbasedalgorithms
made-easy-test-series
0
votes
1
answer
50
views
Made easy workbook, Graph Based Algorithms
Which of the following is not a cross edge during given BFS traversal on G? a) d,c b) d,b c) e,b d) e,f
asked
in
Algorithms
Sep 2, 2020
50
views
made-easy-test-series
algorithms
graphbasedalgorithms
0
votes
1
answer
98
views
Made Easy theory book, Matrix Chain Multiplication
asked
in
Algorithms
Sep 2, 2020
98
views
algorithms
matrixchainmultiplication
0
votes
1
answer
41
views
Self doubt Made easy theory book Graph Based Algorithms
asked
in
Algorithms
Sep 1, 2020
41
views
algorithms
dft
graphbasedalgorithms
made-easy-test-series
0
votes
1
answer
49
views
Made Easy Theory Book, Graph Based Algorithms
How to find the number of cross edges in the below given question? (Selection of Adjacent vertex in DFS is decided by lexicographical order. )
asked
in
Algorithms
Sep 1, 2020
49
views
algorithms
graphbasedalgorithms
0
votes
0
answers
21
views
Made easy theory book, Graph Based Algorithms
How to find the number of cross edges in the below given question? (Selection of Adjacent vertex in DFS is decided by lexicographical order. )
asked
in
Algorithms
Sep 1, 2020
21
views
algorithms
graphbasedalgorithms
0
votes
1
answer
34
views
Self doubt in Graph Based Algorithms (Made easy theory book)
asked
in
Algorithms
Sep 1, 2020
34
views
algorithms
dfs
0
votes
1
answer
63
views
Made Easy Workbook
asked
in
Algorithms
Aug 30, 2020
63
views
madeeasyworkbook
algorithms
0
votes
1
answer
1.0k
views
Made easy theory book: Algorithms: Divide and Conqure
asked
in
Algorithms
Jul 23, 2020
1.0k
views
algorithms
divide-and-conquer
Ask a Question
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
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
Search GATE CSE Doubts