Recent activity by richa07 / GATE Overflow for GATE CSE

3 answers

1

GATE CSE 2014 Set 3 | Question: 4
Which one of the following statements is TRUE about every $n \times n$ matrix with only real eigenvalues? If the trace of the matrix is positive and the determinant of the matrix is negative, at least one of its eigenvalues is ... eigenvalues are positive. If the product of the trace and determinant of the matrix is positive, all its eigenvalues are positive.

Which one of the following statements is TRUE about every $n \times n$ matrix with only real eigenvalues?If the trace of the matrix is positive and the determinant of the...

11.3k views

commented Nov 30, 2016

1 answer

2

Made easy

361 views

asked Nov 18, 2016

1 answer

3

made easy test seies

239 views

asked Nov 18, 2016

3 answers

4

GATE Overflow | Data Structures | Test 1 | Question: 7
A $2-3$ tree is a tree such that all internal nodes have either 2 or 3 children all paths from root to the leaves have the same length. The maximum number of nodes of a 2-3 tree having 9 leaves is ___

A $2-3$ tree is a tree such thatall internal nodes have either 2 or 3 childrenall paths from root to the leaves have the same length.The maximum number of nodes of a 2-3 ...

1.1k views

comment edited Oct 14, 2016

6 answers

5

GATE Overflow | Mathematics | Test 1 | Question: 2
Four couples decide to form a committee of four members. The number of different committees that can be formed in which no couple finds a place is? 10 12 14 16

Four couples decide to form a committee of four members. The number of different committees that can be formed in which no couple finds a place is? 10121416

719 views

answered Oct 14, 2016

4 answers

6

GATE Overflow | Data Structures | Test 1 | Question: 5
A stack is used to implement a priority queue where $ENQUEUE(Q, x, p)$ ($p$ denotes priority, higher the better) and $DEQUE(Q)$ are implemented by appropriate PUSH and POP operations such that $DEQUE(Q)$ happens in $O(1)$. ... second element denotes the priority. No. of POP operations required on the given stack for $ENQUEUE(Q, 2, 0)$ is _____

A stack is used to implement a priority queue where $ENQUEUE(Q, x, p)$ ($p$ denotes priority, higher the better) and $DEQUE(Q)$ are implemented by appropriate PUSH and PO...

1.1k views

commented Oct 13, 2016

3 answers

7

GATE Overflow | Data Structures | Test 1 | Question: 9
Which of the following statements is false? A tree with $n$ nodes has $n-1$ edges A labeled rooted binary tree can be uniquely constructed given its in-order and pre-order traversal results. A complete binary tree with $n$ internal nodes has $n+1$ ... tree of height $h$ is $2^{h+1} - 1$ where $h$ is the maximum distance of a node from root.

Which of the following statements is false?A tree with $n$ nodes has $n-1$ edgesA labeled rooted binary tree can be uniquely constructed given its in-order and pre-order ...

1.1k views

commented Oct 13, 2016

4 answers

8

GATE Overflow | Data Structures | Test 1 | Question: 8
What is the number of binary trees with $4$ nodes which when traversed in pre-order gives the sequence A, B, C, D?

What is the number of binary trees with $4$ nodes which when traversed in pre-order gives the sequence A, B, C, D?

811 views

answered Oct 13, 2016

1 answer

9

Algorithm

579 views

asked Oct 11, 2016

1 answer

10

Algorithm
According to me answer should be 0(n).

According to me answer should be 0(n).

199 views

asked Oct 11, 2016

2 answers

11

GATE Overflow | Operating Systems | Test 1 | Question: 24
A system with a 2-level paging scheme in which a regular memory access takes 150 nanoseconds(ns) and page faults takes 4 miliseconds(ms). An average instruction takes 100 ns of cpu time and two memory accesses. The TLB hit ... every 100,000 instructions. What is the effective average instruction execution time? 446 ns 1230 ns 830 ns 1050 ns

A system with a 2-level paging scheme in which a regular memory access takes 150 nanoseconds(ns) and page faults takes 4 miliseconds(ms). An average instruction takes 100...

991 views

commented Oct 4, 2016

1 answer

12

GCD using modulo operator
Could anyone explain the complexity of function (finding GCD) using modulo operator

Could anyone explain the complexity of function (finding GCD) using modulo operator

939 views

asked Oct 4, 2016

11 answers

13

GATE CSE 2016 Set 2 | Question: 05
Suppose that a shop has an equal number of LED bulbs of two different types. The probability of an LED bulb lasting more than $100$ hours given that it is of Type $1$ is $0.7$, and given that it is of Type $2$ is $0.4$. The probability that an LED bulb chosen uniformly at random lasts more than $100$ hours is _________.

Suppose that a shop has an equal number of LED bulbs of two different types. The probability of an LED bulb lasting more than $100$ hours given that it is of Type $1$ is ...

9.6k views

commented Oct 3, 2016

12 answers

14

GATE CSE 2007 | Question: 24
Suppose we uniformly and randomly select a permutation from the $20 !$ permutations of $1, 2, 3\ldots ,20.$ What is the probability that $2$ appears at an earlier position than any other even number in the selected permutation? $\left(\dfrac{1}{2} \right)$ $\left(\dfrac{1}{10}\right)$ $\left(\dfrac{9!}{20!}\right)$ None of these

Suppose we uniformly and randomly select a permutation from the $20 !$ permutations of $1, 2, 3\ldots ,20.$ What is the probability that $2$ appears at an earlier positio...

15.2k views

answered Jun 9, 2016

5 answers

15

probability
QUESTION 8 : A bag contains 5 balls out of which some or maybe all are black. 2 balls are drawn from the bag and both are found to be black. What is the probability that all balls in the bag are black?

QUESTION 8 : A bag contains 5 balls out of which some or maybe all are black. 2 balls are drawn from the bag and both are found to be black. What is the probability that ...

615 views

answered Jun 2, 2016

7 answers

16

GATE CSE 2002 | Question: 2.12
A weight-balanced tree is a binary tree in which for each node, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the furthest ... which of the following? $\log_2 n$ $\log_{\frac{4}{3}} n$ $\log_3 n$ $\log_{\frac{3}{2}} n$

A weight-balanced tree is a binary tree in which for each node, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the rig...

23.4k views

commented May 15, 2016

5 answers

17

GATE2014 AG: GA-6
In a group of four children, Som is younger to Riaz. Shiv is elder to Ansu. Ansu is youngest in the group. Which of the following statements is/are required to find the eldest child in the group? Statements 1. Shiv is younger to Riaz. 2. Shiv is ... and $2$ are both required to determine the eldest child. Statements $1$ and $2$ are not sufficient to determine the eldest child.

In a group of four children, Som is younger to Riaz. Shiv is elder to Ansu. Ansu is youngest in the group. Which of the following statements is/are required to find the e...

3.2k views

answered Mar 30, 2016

4 answers

18

GATE2014 AG: GA-4
In any given year, the probability of an earthquake greater than Magnitude $6$ occurring in the Garhwal Himalayas is $0.04$. The average time between successive occurrences of such earthquakes is ____ years.

In any given year, the probability of an earthquake greater than Magnitude $6$ occurring in the Garhwal Himalayas is $0.04$. The average time between successive occurrenc...

4.1k views

commented Mar 30, 2016

2 answers

19

GATE2013 EE: GA-8
The set of values of $p$ for which the roots of the equation $3x^2+2x+p(p–1) = 0$ are of opposite sign is $(–∞, 0)$ $(0, 1)$ $(1, ∞)$ $(0, ∞)$

The set of values of $p$ for which the roots of the equation $3x^2+2x+p(p–1) = 0$ are of opposite sign is $(–∞, 0)$$(0, 1)$$(1, ∞)$$(0, ∞)$

3.3k views

commented Feb 29, 2016

2 answers

20

GATE2013 CE: GA-6
$X$ and $Y$ are two positive real numbers such that $2X+Y \leq 6$ and $X + 2Y \leq 8.$For which of the following values of $(X,Y)$ the function $f(X,Y)=3X + 6Y$ will give maximum value ? $\left(\dfrac{4}{3} , \dfrac{10}{3}\right)$ $\left(\dfrac{8}{3} , \dfrac{20}{3}\right)$ $\left(\dfrac{8}{3} , \dfrac{10}{3}\right)$ $\left(\dfrac{4}{3} , \dfrac{20}{3}\right)$

$X$ and $Y$ are two positive real numbers such that $2X+Y \leq 6$ and $X + 2Y \leq 8.$For which of the following values of $(X,Y)$ the function $f(X,Y)=3X + 6Y$ will give...

3.0k views

answered Feb 26, 2016

1 answer

21

GATE2013 CE: GA-8
Following table provides figures(in rupees) on annual expenditure of a firm for two years -$2010$ and $2011$ ... material and Salary & wages. Salary & wages and Advertising. Power & fuel and Advertising. Raw material and research & Development.

Following table provides figures(in rupees) on annual expenditure of a firm for two years -$2010$ and $2011$.$$\begin{array}{|l|r|r|} \hline \textbf{Category} & \textbf{2...

2.2k views

answered Feb 26, 2016

2 answers

22

logic

474 views

asked Aug 29, 2015

8 answers

23

GATE CSE 2015 Set 2 | Question: 7
The minimum number of $\text{JK}$ flip-flops required to construct a synchronous counter with the count sequence $(0, 0, 1, 1, 2, 2, 3, 3, 0, 0, \ldots)$ is _______.

The minimum number of $\text{JK}$ flip-flops required to construct a synchronous counter with the count sequence $(0, 0, 1, 1, 2, 2, 3, 3, 0, 0, \ldots)$ is _______.

36.8k views

commented Jul 17, 2015

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