GATE Overflow for GATE CSE
Login Register
@
  • Dark Mode
  • Profile
  • Edit my Profile
  • Messages
  • My favorites
  • Register
  • Activity
  • Q&A
  • Questions
  • Unanswered
  • Tags
  • Subjects
  • Users
  • Ask
  • Previous Years
  • Blogs
  • New Blog
  • Exams
Dark Mode
Filter
  • User manvi_agarwal
  • Wall
  • Recent activity
  • All questions
  • All answers
  • Exams Taken
  • All Blogs

Questions by manvi_agarwal

5 votes
1 answer
1
Graph
Also let me know the approach to find back edges, cross edges, forward edges, How to solve these questions
asked in Algorithms Sep 15, 2018
2.0k views
  • algorithms
  • graph-algorithms
  • depth-first-search
  • descriptive
  • test-series
0 votes
0 answers
2
MadeEasy Workbook: Algorithms - Graph Algorithms
Approach for Q8 and Q9 please
asked in Algorithms Sep 15, 2018
262 views
  • algorithms
  • graph-algorithms
0 votes
0 answers
3
Algorithm and data structure
https://gateoverflow.in/?qa=blob&qa_blobid=17275535249024428371
asked in Algorithms Sep 10, 2018
350 views
  • data-structures
  • algorithms
  • heap
0 votes
1 answer
4
Divide and conquer made easy
Is the answer to this solution is O( n2 log (n) ) or O( n log (n) )
asked in Algorithms Sep 3, 2018
821 views
  • divide-and-conquer
  • made-easy-test-series
1 vote
2 answers
5
Made easy , divide and conquer
https://gateoverflow.in/?qa=blob&qa_blobid=11583750777176064728 Approach please
asked in Algorithms Sep 3, 2018
434 views
  • algorithms
  • divide-and-conquer
  • made-easy-test-series
1 vote
2 answers
6
MadeEasy Subject Test: Algorithms - Recurrence
which of the following cannot be solved using masters theorem? a) T(n) = 2T(n/2) + n/logn b) T(n) = 2T(n/2) + logn c)T(n)=T(n/2)+logn d) non of these
asked in Algorithms Aug 11, 2018
1.6k views
  • made-easy-test-series
  • recurrence-relation
  • master-theorem
0 votes
2 answers
7
masters theorem
Solution using back substitution method T(n) = 2T(n/2) + nlogn ? detailed solution please. ans is nlognlogn or n(logn)^2
asked in Algorithms Aug 10, 2018
706 views
  • time-complexity
  • algorithms
  • master-theorem
  • asymptotic-notations
  • recurrence-relation
1 vote
1 answer
8
madeeasy
which is an efficient tree structure in terms of space and time complexity? a) AVL Tree b)Full Binary tree c)Complete binary tree d)Binary tree
asked in DS Aug 4, 2018
696 views
  • data-structures
  • tree
0 votes
1 answer
9
MadeEasy Workbook
https://gateoverflow.in/?qa=blob&qa_blobid=11435838562783483664 Approach for Q9 please . (Please note: it is the last question on left hand side, and part of it is written on right hand side) Answer is d, but according to me it should be b as in 3 situation ... but won't be restored in it's original state as mentioned in question. So only 1 and 2 is possible. Is it correct?
asked in DS Jul 30, 2018
1.6k views
  • made-easy-booklet
  • data-structures
  • queue
  • see-later
0 votes
1 answer
10
MadeEasy Workbook: Programming & DS - Queues
https://gateoverflow.in/?qa=blob&qa_blobid=10936115150698131975
asked in DS Jul 30, 2018
235 views
  • made-easy-workbook
  • data-structures
  • queue

Subscribe to GATE CSE 2023 Test Series

Subscribe to GO Classes for GATE CSE 2023

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

Recent Posts

  • Recruitment of Scientific Officers in the Department of Atomic Energy 2023
  • GATE CSE 2023 Paper & Analysis - Memory Based
  • From GATE to Australia
  • DRDO Previous Year Papers
  • From Rank 4200 to 64: My Journey to Success in GATE CSE Exam

Subjects

  • All categories
  • General Aptitude (2.5k)
  • Engineering Mathematics (9.3k)
  • Digital Logic (3.3k)
  • Programming and DS (5.9k)
  • Algorithms (4.6k)
  • Theory of Computation (6.7k)
  • Compiler Design (2.3k)
  • Operating System (5.0k)
  • Databases (4.6k)
  • CO and Architecture (3.8k)
  • Computer Networks (4.6k)
  • Non GATE (1.3k)
  • Others (2.4k)
  • Admissions (649)
  • Exam Queries (843)
  • Tier 1 Placement Questions (17)
  • Job Queries (75)
  • Projects (9)
  • Unknown Category (853)

Recent Blog Comments

  • +1
  • 1200/1000 = 1.2
  • Aptitude- 1- there was a question, Like in a...
  • Suppose typing happens at 1 keystroke per second....
  • The algorithm for graph colouring was to pick...
  • Send feedback
  • Rank Predictor
  • College Prediction
  • Useful Links
  • FAQ
  • Corrections
  • Discuss
  • Copyright
  • Request
  • Testimonials
  • Chat Logs
  • Chat
  • Badges
  • Search tips
  • Exam Category
  • Blog Category
  • Blog Tags
  • Privacy
  • Test Series
  • Contact Us
Developed by Chun