Recent activity by Nandkishor3939 / GATE Overflow for GATE CSE

4 answers

1

GATE CSE 2007 | Question: 27
Consider the set of (column) vectors defined by$X = \left \{x \in R^3 \mid x_1 + x_2 + x_3 = 0, \text{ where } x^T = \left[x_1,x_2,x_3\right]^T\right \}$ ... independent set, but it does not span $X$ and therefore is not a basis of $X$. $X$ is not a subspace of $R^3$. None of the above

Consider the set of (column) vectors defined by$$X = \left \{x \in R^3 \mid x_1 + x_2 + x_3 = 0, \text{ where } x^T = \left[x_1,x_2,x_3\right]^T\right \}$$.Which of the f...

16.5k views

commented Oct 3, 2019

5 answers

2

GATE CSE 2007 | Question: 21
How many different non-isomorphic Abelian groups of order $4$ are there? $2$ $3$ $4$ $5$

How many different non-isomorphic Abelian groups of order $4$ are there?$2$$3$$4$$5$

19.6k views

commented Oct 3, 2019

9 answers

3

GATE CSE 2004 | Question: 75
Mala has the colouring book in which each English letter is drawn two times. She wants to paint each of these $52$ prints with one of $k$ colours, such that the colour pairs used to colour any two letters are different. Both prints of a letter can also be coloured with the same colour. What is the minimum value of $k$ that satisfies this requirement? $9$ $8$ $7$ $6$

Mala has the colouring book in which each English letter is drawn two times. She wants to paint each of these $52$ prints with one of $k$ colours, such that the colour pa...

16.7k views

commented Oct 1, 2019

2 answers

4

Nullity of matrix
Nullity of a matrix = Total number columns – Rank of that matrix But how to calculate value of x when nullity is already given(1 in this case)

Nullity of a matrix = Total number columns – Rank of that matrixBut how to calculate value of x when nullity is already given(1 in this case)

3.4k views

edited Sep 30, 2019

1 answer

5

Token Bucket
Token Bucket mechanism is used for congestion control at router. Bucket capacity in 700 Bytes (initially full), token arrival rate is 200 Bytes/sec and maximum output rate is 300 Bytes/sec. The amount of time (in sec) required to transmit 3000 Bytes file is _____.

Token Bucket mechanism is used for congestion control at router. Bucket capacity in 700 Bytes (initially full), token arrival rate is 200 Bytes/sec and maximum output rat...

4.3k views

commented Sep 30, 2019

7 answers

6

GATE CSE 2008 | Question: 23
Which of the following statements is true for every planar graph on $n$ vertices? The graph is connected The graph is Eulerian The graph has a vertex-cover of size at most $\frac{3n}{4}$ The graph has an independent set of size at least $\frac{n}{3}$

Which of the following statements is true for every planar graph on $n$ vertices?The graph is connectedThe graph is EulerianThe graph has a vertex-cover of size at most $...

65.1k views

commented Sep 29, 2019

5 answers

7

GATE CSE 2008 | Question: 30
Let $\text{fsa}$ and $\text{pda}$ be two predicates such that $\text{fsa}(x)$ means $x$ is a finite state automaton and $\text{pda}(y)$ means that $y$ is a pushdown automaton. Let $\text{equivalent}$ ...

Let $\text{fsa}$ and $\text{pda}$ be two predicates such that $\text{fsa}(x)$ means $x$ is a finite state automaton and $\text{pda}(y)$ means that $y$ is a pushdown autom...

14.1k views

commented Sep 28, 2019

4 answers

8

GATE CSE 2012 | Question: 13
What is the correct translation of the following statement into mathematical logic? “Some real numbers are rational” $\exists x (\text{real}(x) \lor \text{rational}(x))$ $\forall x (\text{real}(x) \to \text{rational}(x))$ $\exists x (\text{real}(x) \wedge \text{rational}(x))$ $\exists x (\text{rational}(x) \to \text{real}(x))$

What is the correct translation of the following statement into mathematical logic?“Some real numbers are rational”$\exists x (\text{real}(x) \lor \text{rational}(x))...

8.7k views

commented Sep 28, 2019

9 answers

9

GATE IT 2008 | Question: 21
Which of the following first order formulae is logically valid? Here $\alpha(x)$ is a first order formula with $x$ as a free variable, and $\beta$ ... $[(\forall x, \alpha(x)) \rightarrow \beta] \rightarrow [\forall x, \alpha(x) \rightarrow \beta]$

Which of the following first order formulae is logically valid? Here $\alpha(x)$ is a first order formula with $x$ as a free variable, and $\beta$ is a first order formul...

15.1k views

commented Sep 28, 2019

7 answers

10

GATE IT 2008 | Question: 4
What is the size of the smallest $\textsf{MIS}$ (Maximal Independent Set) of a chain of nine nodes? $5$ $4$ $3$ $2$

What is the size of the smallest $\textsf{MIS}$ (Maximal Independent Set) of a chain of nine nodes?$5$$4$$3$$2$

59.0k views

commented Sep 28, 2019

5 answers

11

GATE CSE 2013 | Question: 48
The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and one destination operand. Assume that all variables are dead after this code segment. c = ... while preserving correctness. What is the minimum number of spills to memory in the compiled code? 0 1 2 3

The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and on...

28.5k views

commented Sep 27, 2019

9 answers

12

GATE IT 2004 | Question: 13
Let $P$ be a singly linked list. Let $Q$ be the pointer to an intermediate node $x$ in the list. What is the worst-case time complexity of the best-known algorithm to delete the node $x$ from the list ? $O(n)$ $O(\log^2 n)$ $O(\log n)$ $O(1)$

Let $P$ be a singly linked list. Let $Q$ be the pointer to an intermediate node $x$ in the list. What is the worst-case time complexity of the best-known algorithm to del...

24.8k views

commented Sep 27, 2019

5 answers

13

GATE CSE 1997 | Question: 4.7
A priority queue $Q$ is used to implement a stack that stores characters. PUSH (C) is implemented as INSERT $(Q, C, K)$ where $K$ is an appropriate integer key chosen by the implementation. POP is implemented as ... For a sequence of operations, the keys chosen are in non-increasing order non-decreasing order strictly increasing order strictly decreasing order

A priority queue $Q$ is used to implement a stack that stores characters. PUSH (C) is implemented as INSERT $(Q, C, K)$ where $K$ is an appropriate integer key chosen by ...

24.5k views

commented Sep 27, 2019

1 answer

14

#Numerical methods-syllabus
What is the syllabus for Engineering Mathematics - Numerical methods?

What is the syllabus for Engineering Mathematics - Numerical methods?

1.9k views

commented Sep 25, 2019

10 answers

15

GATE CSE 2015 Set 1 | Question: 45
Let $G = (V, E)$ be a simple undirected graph, and $s$ be a particular vertex in it called the source. For $x \in V$, let $d(x)$ denote the shortest distance in $G$ from $s$ to $x$. A breadth first search (BFS) is performed starting at $s$. Let $T$ be the ... that is not in $T$, then which one of the following CANNOT be the value of $d(u) - d(v)$? $-1$ $0$ $1$ $2$

Let $G = (V, E)$ be a simple undirected graph, and $s$ be a particular vertex in it called the source. For $x \in V$, let $d(x)$ denote the shortest distance in $G$ from ...

18.2k views

commented Sep 21, 2019

7 answers

16

GATE CSE 2017 Set 1 | Question: 27
A multithreaded program $P$ executes with $x$ number of threads and uses $y$ number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are non-reentrant, i.e., if a thread holds a lock $l$, then it cannot re-acquire lock $l$ without releasing ... $x = 1, y = 2$ $x = 2, y = 1$ $x = 2, y = 2$ $x = 1, y = 1$

A multithreaded program $P$ executes with $x$ number of threads and uses $y$ number of locks for ensuring mutual exclusion while operating on shared memory locations. All...

33.3k views

commented Sep 19, 2019

5 answers

17

GATE CSE 2017 Set 1 | Question: 30
Let $u$ and $v$ be two vectors in $\mathbf{R}^{2}$ whose Euclidean norms satisfy $\left \| u \right \| = 2\left \| v \right \|$. What is the value of $\alpha$ such that $w = u + \alpha v$ bisects the angle between $u$ and $v$? $2$ $\frac{1}{2}$ $1$ $\frac{ -1}{2}$

Let $u$ and $v$ be two vectors in $\mathbf{R}^{2}$ whose Euclidean norms satisfy $\left \| u \right \| = 2\left \| v \right \|$. What is the value of $\alpha$ such that $...

14.0k views

commented Sep 19, 2019

9 answers

18

GATE CSE 2017 Set 1 | Question: 3
Let $c_{1}.....c_{n}$ be scalars, not all zero, such that $\sum_{i=1}^{n}c_{i}a_{i}$ = 0 where $a_{i}$ are column vectors in $R^{n}$. Consider the set of linear equations $Ax = b$ ... has a unique solution at $x=J_{n}$ where $J_{n}$ denotes a $n$-dimensional vector of all 1. no solution infinitely many solutions finitely many solutions

Let $c_{1}.....c_{n}$ be scalars, not all zero, such that $\sum_{i=1}^{n}c_{i}a_{i}$ = 0 where $a_{i}$ are column vectors in $R^{n}$.Consider the set of linear equations$...

20.3k views

commented Sep 19, 2019

19 answers

19

GATE CSE 2004 | Question: 47
Consider a system with a two-level paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An average instruction takes $100$ nanoseconds of CPU time, and two memory accesses. ... execution time? $\text{645 nanoseconds}$ $\text{1050 nanoseconds}$ $\text{1215 nanoseconds}$ $\text{1230 nanoseconds}$

Consider a system with a two-level paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An avera...

63.7k views

commented Sep 4, 2019

1 answer

20

Semaphore bounded wait
Does semaphore solution fulfill the condition of bounded wait for more than 2 processes I know we can implement the waiting list in such a way that makes it satisfy bounded wait but what is the standard?

Does semaphore solution fulfill the condition of bounded wait for more than 2 processesI know we can implement the waiting list in such a way that makes it satisfy bounde...

1.5k views

commented Sep 1, 2019

4 answers

21

GATE CSE 2019 | Question: 47
Suppose $Y$ is distributed uniformly in the open interval $(1,6)$. The probability that the polynomial $3x^2 +6xY+3Y+6$ has only real roots is (rounded off to $1$ decimal place) _______

Suppose $Y$ is distributed uniformly in the open interval $(1,6)$. The probability that the polynomial $3x^2 +6xY+3Y+6$ has only real roots is (rounded off to $1$ decimal...

16.3k views

commented Aug 14, 2019

0 answers

22

The string for which the grammar has maximum of two derivation trees is
The string for which the grammar has maximum of two derivation trees is (a) lion tiger lion (c) tiger lion (b) lion tiger (d) None of the above

The string for which the grammar has maximum of two derivation trees is(a) lion tiger lion(c) tiger lion(b) lion tiger(d) None of the above

731 views

commented Aug 11, 2019

9 answers

23

GATE CSE 2013 | Question: 44
Consider the following operation along with Enqueue and Dequeue operations on queues, where $k$ is a global parameter. MultiDequeue(Q){ m = k while (Q is not empty) and (m > 0) { Dequeue(Q) m = m – 1 } } What is the worst case time complexity of a sequence of $n$ queue operations on an initially empty queue? $Θ(n)$ $Θ(n + k)$ $Θ(nk)$ $Θ(n^2)$

Consider the following operation along with Enqueue and Dequeue operations on queues, where $k$ is a global parameter.MultiDequeue(Q){ m = k while (Q is not empty) and (m...

31.3k views

commented Aug 5, 2019

3 answers

24

Binary tree Made-easy-test-series
The minimum size that an array may require to store a binary tree with n nodes $2^{\left \lceil(log_2(n+1)) \right \rceil -1}$ $2n-1$ $2n-n+1$ $n+1$

The minimum size that an array may require to store a binary tree with n nodes$2^{\left \lceil(log_2(n+1)) \right \rceil -1}$$2n-1$$2n-n+1$$n+1$

4.3k views

commented Jul 15, 2019

0 answers

25

Madeeasy test sries
The minimum size that an array may require to store a binary tree with n nodes (A) 2celi(log2(n+1))-1 (B)2n-1 (C)2n-n+1 (D)n+1 answer given by them is option A. but I think it should be B. Please clear my doubt

The minimum size that an array may require to store a binary tree with n nodes(A) 2celi(log2(n+1))-1(B)2n-1(C)2n-n+1(D)n+1answer given by them is option A. but I think it...

678 views

commented Jul 15, 2019

0 answers

26

Ford-Fulkersons method:

441 views

commented Apr 28, 2019

1 answer

27

Wifi : Syllabus
What are the important topics in WIFI : It would be very helpful if some one answered this thank you:)

What are the important topics in WIFI :It would be very helpful if some one answered thisthank you:)

828 views

asked Mar 7, 2019

1 answer

28

When will be the exam forms of IITH-PG,ISRO and BITS-HD be out ?
If any one knows plz let me know … on websites I am not getting any fixed info.

If any one knows plz let me know … on websites I am not getting any fixed info.

841 views

answer selected Mar 7, 2019

8 answers

29

GATE CSE 2019 | Question: 1
A certain processor uses a fully associative cache of size $16$ kB, The cache block size is $16$ bytes. Assume that the main memory is byte addressable and uses a $32$-bit address. How many bits are required for the Tag and the Index fields respectively in the addresses ... $0$ bits $28$ bits and $4$ bits $24$ bits and $4$ bits $28$ bits and $0$ bits

A certain processor uses a fully associative cache of size $16$ kB, The cache block size is $16$ bytes. Assume that the main memory is byte addressable and uses a $32$-bi...

17.9k views

commented Feb 7, 2019

3 answers

30

GATE 2019
What was the Expectancy in the full binary tree question asked in the exam ? I got 3

What was the Expectancy in the full binary tree question asked in the exam ?I got 3

1.3k views

commented Feb 5, 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