Recent activity by crazysarth / GATE Overflow for GATE CSE

5 answers

1

#Divide and conquer
Given 2 sorted arrays each of n-elements and distinct. How much time it will take to find middle element of union array? (a) O(1) (b) O(log n) (c) O(n) (d) None of these

Given 2 sorted arrays each of n-elements and distinct. How much time it will take to find middle element of union array?(a) O(1)(b) O(log n)(c) O(n)(d) None of these

3.1k views

answered Aug 5, 2019

1 answer

2

Cormen Edition 3 Exercise 10.1 Question 5 (Page No. 236)
Whereas a stack allows insertion and deletion of elements at only one end, and a queue allows insertion at one end and deletion at the other end, a deque (double ended queue) allows insertion and deletion at both ends. Write ... time procedures to insert elements into and delete elements from both ends of a deque implemented by an array.

Whereas a stack allows insertion and deletion of elements at only one end, and a queue allows insertion at one end and deletion at the other end, a deque (double ended qu...

1.7k views

answered Jul 31, 2019

2 answers

3

Test by Bikram | Algorithms | Test 2 | Question: 4
What will be the running-time of Dijkstra's single source shortest path algorithm, if the graph $G(V,E)$ is stored in the form of an adjacency list and binary heap is used? $O (\mid V \mid 2)$ $O (\mid V \mid \log \mid V \mid)$ $O ( ( \mid E \mid+\mid V \mid ) \log \mid V \mid )$ $O( \log \mid V \mid )$

What will be the running-time of Dijkstra's single source shortest path algorithm, if the graph $G(V,E)$ is stored in the form of an adjacency list and binary heap is use...

1.2k views

answered Jul 30, 2019

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