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
Virtual Gate Test Series: Algorithms - Graphs
SameekshaGupta
asked
in
Algorithms
Jan 13, 2019
retagged
Jul 8, 2022
by
Lakshman Bhaiya
468
views
0
votes
0
votes
algorithms
shortest-path
virtual-gate-test-series
SameekshaGupta
asked
in
Algorithms
Jan 13, 2019
retagged
Jul 8, 2022
by
Lakshman Bhaiya
by
SameekshaGupta
468
views
answer
comment
Follow
share this
share
2 Comments
by
raahul
commented
Jan 13, 2019
reply
Follow
share this
B?
0
0
by
SameekshaGupta
commented
Jan 13, 2019
reply
Follow
share this
Given ans is (d)
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
1
vote
1
vote
C is correct answr
gorya506
answered
Aug 18, 2019
by
gorya506
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
1
answer
1
dushyantsingh
asked
in
Algorithms
Dec 2, 2017
302
views
Virtual gate
dushyantsingh
asked
in
Algorithms
Dec 2, 2017
by
dushyantsingh
302
views
virtual-gate-test-series
graph-theory
shortest-path
0
votes
0
votes
1
answer
2
Utsav09
asked
in
Algorithms
Jan 31, 2018
361
views
Virtual Gate Test Series: Algorithms - Time Complexity
An array of $n$ distinct elements is said to be un-sorted if for every index $i$ such that $2 ≤ i ≤ n − 1,$ either $\{A[i] > max{A[i − 1], A[i + 1]}\},$ or $\{A[i] < min{A[i − 1], A[i + 1]}\}.$ What is the time-complexity of the fastest ... $O( \sqrt{n})$ $(C) O( \sqrt{n})$ but not $O(log n)$ $(D) O(log n)$ but not $O(1)$
Utsav09
asked
in
Algorithms
Jan 31, 2018
by
Utsav09
361
views
algorithms
time-complexity
virtual-gate-test-series
1
vote
1
vote
2
answers
3
Mk Utkarsh
asked
in
Algorithms
Nov 11, 2017
515
views
Virtual Gate Test Series: Algorithms - Hash Table(Linear Probing)
Mk Utkarsh
asked
in
Algorithms
Nov 11, 2017
by
Mk Utkarsh
515
views
algorithms
hashing
virtual-gate-test-series
1
vote
1
vote
2
answers
4
Manoja Rajalakshmi A
asked
in
Algorithms
Nov 8, 2017
879
views
Virtual Gate Test Series: Algorithms - Job Scheduling
We are given 10 tasks. The execution of task requires 1 unit of time. Each task Ti has profit pi and deadline di. Profit pi is earned if task Ti is completed before dith unit of time. Task T1 T2 T3 T4 T5 T6 T7 T8 ... 6 1 5 Suppose maximum total profit earned by scheduling above task is 129, then profit x' assigned to T3 is __________________.
Manoja Rajalakshmi A
asked
in
Algorithms
Nov 8, 2017
by
Manoja Rajalakshmi A
879
views
algorithms
job-scheduling
virtual-gate-test-series
numerical-answers
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(24)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(682)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
243k
comments
79.7k
users
Recent Blog Comments
Hlo I'm Rupesh I got AIR 3485 in gate CS and AIR...
@Ajay Sasank here is the direct link...
Thank you for the post didi My GATE 2023 & 2024...
I Hope it helps 😊
Today's best post I seen thank you for motivation
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy