Answers by Tendua / GATE Overflow for GATE CSE

1 votes

61

what will be the time complexity for the below question ?
Let an array A[1,....n] has n elements, and every element of an array is less than or equal to n. An element is said to be "majority element" if it is occurred in more than n/2 positions of an array. what is the time complexity to check whether the majority element exist or not?

Let an array A[1,....n] has n elements, and every element of an array is less than or equal to n. An element is said to be "majority element" if it is occurred in more th...

771 views

answered Nov 17, 2016

2 votes

62

Greedy Approach - Task selection

1.2k views

answered Nov 17, 2016

0 votes

63

Ace Test Series: Algorithms - Time Complexity

576 views

answered Nov 16, 2016

0 votes

64

me/test
1.p!=NULL 2.q!=NULL 3.(p!=NULL)&&(q!=NULL) 4.(.p!=NULL)||(q!=NULL)

1.p!=NULL2.q!=NULL3.(p!=NULL)&&(q!=NULL)4.(.p!=NULL)||(q!=NULL)

318 views

answered Nov 15, 2016

0 votes

65

Quick Sort-Counting of No of Swap

2.5k views

answered Nov 12, 2016

1 votes

66

SQL query
when we calculated avg fun in sql then we exclude the null value or not in count (sum/count) somewhere it consider null vlaue also in count soomwher not?? wht is actual procedure

when we calculated avg fun in sql then we exclude the null value or not in count (sum/count)somewhere it consider null vlaue also in count soomwher not??wht is actual pro...

307 views

answered Nov 4, 2016

17 votes

67

TIFR CSE 2012 | Part A | Question: 1
Amar and Akbar both tell the truth with probability $\dfrac{3 } {4}$ and lie with probability $\dfrac{1}{4}$. Amar watches a test match and talks to Akbar about the outcome. Akbar, in turn, tells Anthony, "Amar told me that India won". What ... $\left(\dfrac{7}{16}\right)$ $\left(\dfrac{10}{16}\right)$ None of the above

Amar and Akbar both tell the truth with probability $\dfrac{3 } {4}$ and lie with probability $\dfrac{1}{4}$. Amar watches a test match and talks to Akbar about the outco...

9.4k views

answered Nov 1, 2016

0 votes

68

BFS Theory
1. Does space complexity includes both input space and extra space needed for algorithm or only extra space? 2.What will be Space complexity for BFS algorithm with adjacency matrix representation? Please reply with supporting references.

1. Does space complexity includes both input space and extra space needed for algorithm or only extra space?2.What will be Space complexity for BFS algorithm with adjacen...

773 views

answered Oct 12, 2016

0 votes

69

flooding
Pick the correct statement about flooding It is a type of isolated routing It is a method in which every incoming packet is sent out on every outgoing line except the one by which it arrived Flooding does not always select the shortest path Selective flooding is a type in which the packets are sent to those lines that are going approximately in the right direction

Pick the correct statement about floodingIt is a type of isolated routingIt is a method in which every incoming packet is sent out on every outgoing line except the one b...

3.1k views

answered Jun 23, 2016

2 votes

70

Recursion
Identify the false statement a. When a module calls a subroutine recursively ,in each call , all of the information is popped in the same order when sub routines are terminated one after another and finally the control is returned to the calling module b. A recursion algorithm has two elements: each call either solves only part of the problem or it reduces the size of the problem

Identify the false statement a. When a module calls a subroutine recursively ,in each call , all of the information is popped in the same order when sub routines are term...

1.0k views

answered May 31, 2016

2 votes

71

class c network subnet problem
A class c n/w has been connected to a router with mask 255.255.255.49. a packet with ip 195.200.180.173 arrived at router.find the no of subnet in the network.

A class c n/w has been connected to a router with mask 255.255.255.49. a packet with ip 195.200.180.173 arrived at router.find the no of subnet in the network.

596 views

answered Feb 3, 2016

8 votes

72

GATE CSE 2012 | Question: 29
Let $G$ be a weighted graph with edge weights greater than one and $G'$ be the graph constructed by squaring the weights of edges in $G$. Let $T$ and $T'$ be the minimum spanning trees of $G$ and $G'$, respectively, with total weights $t$ ... $t' < t^2$ $T' \neq T$ but total weight $t' = t^2$ None of the above

Let $G$ be a weighted graph with edge weights greater than one and $G'$ be the graph constructed by squaring the weights of edges in $G$. Let $T$ and $T'$ be the minimum ...

16.6k views

answered Feb 3, 2016

1 votes

73

Virtual Gate Test Series: Theory Of Computation - Undecidability

337 views

answered Feb 3, 2016

1 votes

74

General doubt in computer architecture
I want to know whether after executing HALT instruction is PC incremented or not?

I want to know whether after executing HALT instruction is PC incremented or not?

334 views

answered Feb 2, 2016

1 votes

75

language

646 views

answered Jan 30, 2016

2 votes

76

Virtual Gate Test Series: CO & Architecture - Pipelining Comparision
For D1 1st instruction will take 3+2+4+2+3 = 16ns rest 99 instruction will take 99*4=396 Hence total: 16+396=412 For D2 1st instruction will take 2+2+2+2+2+2+2+2 = 16ns rest 99 instruction will take 99*2=198 Hence total: 16+198=214 Hence, 412-214=198 according to me Where am I going wrong?

For D11st instruction will take 3+2+4+2+3 = 16nsrest 99 instruction will take 99*4=396Hence total: 16+396=412For D21st instruction will take 2+2+2+2+2+2+2+2 = 16nsrest 99...

682 views

answered Jan 30, 2016

1 votes

77

The number of colors needed to edge color a simple graph with maximum degree Δ is?
The number of colors needed to edge color a simple graph with maximum degree Δ is? Is this there in portion?

The number of colors needed to edge color a simple graph with maximum degree Δ is?Is this there in portion?

830 views

answered Jan 30, 2016

1 votes

78

MadeEasy Test Series: CO & Architecture - Pipelining
they have not given the number of cycles taken by ADD/LOAD..i have taken as 1..correct if i am wrong The following sequence of instruction is executed in a basic 5 stage pipelined processor (S1, S2, S3, S4, S5). Assume ... available in 3rd stage. Assume each stage take 1 cycle. What is the number of cycles are saved by using operand forwarding.

they have not given the number of cycles taken by ADD/LOAD..i have taken as 1..correct if i am wrongThe following sequence of instruction is executed in a basic 5 stage p...

581 views

answered Jan 28, 2016

4 votes

79

Internal Sorting
State True or False for internal sorting algorithms: (i) Internal sorting are applied when the entire collection if data to be sorted is small enough that the sorting can take place within main memory. (ii) The time required to read or write is considered to be significant in evaluating the ... B. (i)- True, (ii)- False C. (i)- False, (ii)- True D. (i)- False, (ii)- False

State True or False for internal sorting algorithms:(i) Internal sorting are applied when the entire collection if data to be sorted is small enough that the sorting can ...

10.9k views

answered Jan 27, 2016

8 votes

80

GATE IT 2005 | Question: 27
Which of the following statements is TRUE about CSMA/CD: IEEE $802.11$ wireless LAN runs CSMA/CD protocol Ethernet is not based on CSMA/CD protocol CSMA/CD is not suitable for a high propagation delay network like satellite network There is no contention in a CSMA/CD network

Which of the following statements is TRUE about CSMA/CD:IEEE $802.11$ wireless LAN runs CSMA/CD protocolEthernet is not based on CSMA/CD protocolCSMA/CD is not suitable f...

13.8k views

answered Jan 15, 2016

43 votes

81

GATE CSE 1991 | Question: 01,xv
The maximum number of possible edges in an undirected graph with $n$ vertices and $k$ components is ______.

The maximum number of possible edges in an undirected graph with $n$ vertices and $k$ components is ______.

11.6k views

answered Jan 15, 2016

0 votes

82

LRU policy
In LRU policy for cache replacement. the least recently used block is replaced. So, what happens when all the slots are empty at beginning? Is LRU or MRU easier to implement? Why?

In LRU policy for cache replacement. the least recently used block is replaced. So, what happens when all the slots are empty at beginning?Is LRU or MRU easier to impleme...

624 views

answered Jan 11, 2016

0 votes

83

Does compile time binding also indicate that the compiled code is allocated in memory at compile time ?

I have just one confusion that when we talk about compile time binding then all the symbols are resolved at compile time so does it necessarily imply that the code will ...

486 views

answered Jan 7, 2016

1 votes

84

Finding transfer time of a sector
Given explanation of the problem: I couldn't understand why to add average rotational latency. I think that transfer time of sector should be just 6 microsec. If the same question comes in GATE what should I write?

Given explanation of the problem:I couldn't understand why to add average rotational latency. I think that transfer time of sector should be just 6 microsec. If the same ...

1.6k views

answered Jan 6, 2016

0 votes

85

DMA
Consider a system in which DMA technique is used to transfer 16 MB of data from an I/O device into memory. The bandwidth of I/O device is 128 KB/s. What percentage of time is the CPU in busy mode (approximately)?

Consider a system in which DMA technique is used to transfer 16 MB of data from an I/O device into memory. The bandwidth of I/O device is 128 KB/s. What percentage of tim...

4.5k views

answered Jan 6, 2016

2 votes

86

Control address reg. And control data reg.
Using horizontal programming If no. Of mircrooperations r 1200 and processor h/w supports 64 Cs and 16 flags.8 different branch condition are used to control the branch logic. Then what is the size of CAR and CDR when one address address field in microinstruction to control the branch logic?? What do CAR and CDR indicate in microinstructions ??

Using horizontal programmingIf no. Of mircrooperations r 1200 and processor h/w supports 64 Cs and 16 flags.8 different branch condition are used to control the branch lo...

1.2k views

answered Jan 6, 2016

2 votes

87

computerNetwork

1.9k views

answered Jan 6, 2016

1 votes

88

Seriaizability

1.5k views

answered Jan 5, 2016

7 votes

89

Finding F's complement of a number
Given answer: C. Please tell me how to approach this problem.

Given answer: C. Please tell me how to approach this problem.

5.7k views

answered Jan 4, 2016

1 votes

90

seralizibilty
is blind writes and write after reading a data item same or not

is blind writes and write after reading a data item same or not

172 views

answered Jan 3, 2016

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