Recent activity by mkagenius / GATE Overflow for GATE CSE

8 answers

1

GATE CSE 2020 | Question: 42
The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is ______.

The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is ______.

16.5k views

commented Dec 7, 2020

4 answers

2

GATE CSE 2020 | Question: 41
In a balanced binary search tree with $n$ elements, what is the worst case time complexity of reporting all elements in range $[a,b]$? Assume that the number of reported elements is $k$. $\Theta (\log n)$ $\Theta (\log n +k)$ $\Theta (k \log n)$ $\Theta ( n \log k)$

In a balanced binary search tree with $n$ elements, what is the worst case time complexity of reporting all elements in range $[a,b]$? Assume that the number of reported ...

21.9k views

commented Feb 20, 2020

6 answers

3

GATE CSE 2020 | Question: 12
Consider the following statements about process state transitions for a system using preemptive scheduling. A running process can move to ready state. A ready process can move to running state. A blocked process can move to running state. A blocked process can move to ready state. ... TRUE? I, II, and III only II and III only I, II, and IV only I, II, III and IV only

Consider the following statements about process state transitions for a system using preemptive scheduling.A running process can move to ready state.A ready process can m...

12.9k views

commented Feb 19, 2020

9 answers

4

GATE CSE 2020 | Question: 39
Which one of the following predicate formulae is NOT logically valid? Note that $W$ is a predicate formula without any free occurrence of $x$. $\forall x (p(x) \vee W) \equiv \forall x \: ( px) \vee W$ ... $\exists x(p(x) \rightarrow W) \equiv \forall x \: p(x) \rightarrow W$

Which one of the following predicate formulae is NOT logically valid?Note that $W$ is a predicate formula without any free occurrence of $x$.$\forall x (p(x) \vee W) \equ...

17.2k views

commented Feb 15, 2020

6 answers

5

GATE CSE 2020 | Question: 40
Let $G = (V,E)$ be a directed, weighted graph with weight function $w: E \rightarrow \mathbb{R}$. For some function $f: V \rightarrow \mathbb{R}$, for each edge$(u,v)\in E$, define ${w}'(u,v)$ as $w(u,v)+f(u)-f(v)$. Which one of the ... from $s$ to $u$ in the graph obtained by adding a new vertex $s$ to $G$ and edges of zero weight from $s$ to every vertex of $G$

Let $G = (V,E)$ be a directed, weighted graph with weight function $w: E \rightarrow \mathbb{R}$. For some function $f: V \rightarrow \mathbb{R}$, for each edge$(u,v)\in ...

18.1k views

commented Feb 14, 2020

5 answers

6

GATE CSE 2020 | Question: 31
Let $G = (V, E)$ be a weighted undirected graph and let $T$ be a Minimum Spanning Tree (MST) of $G$ maintained using adjacency lists. Suppose a new weighed edge $(u, v) \in V \times V$ is added to $G$. The worst case time complexity of determining if $T$ is still an MST ... $\Theta (\mid E \mid \mid V \mid) \\$ $\Theta(E \mid \log \mid V \mid) \\$ $\Theta( \mid V \mid)$

Let $G = (V, E)$ be a weighted undirected graph and let $T$ be a Minimum Spanning Tree (MST) of $G$ maintained using adjacency lists. Suppose a new weighed edge $(u, v) ...

19.1k views

commented Feb 14, 2020

9 answers

7

GATE CSE 2020 | Question: 16
What is the worst case time complexity of inserting $n$ elements into an empty linked list, if the linked list needs to be maintained in sorted order? $\Theta(n)$ $\Theta(n \log n)$ $\Theta ( n)^{2}$ $\Theta(1)$

What is the worst case time complexity of inserting $n$ elements into an empty linked list, if the linked list needs to be maintained in sorted order?$\Theta(n)$$\Theta(n...

26.5k views

commented Feb 13, 2020

2 answers

8

GATE CSE 2020 | Question: GA-10
The total revenue of a company during $2014-2018$ is shown in the bar graph. If the total expenditure of the company in each year is $500$ million rupees, then the aggregate profit or loss (in percentage) on the total expenditure of the company during $2014-2018$ is ___________. $16.67 \%$ profit $16.67 \%$ loss $20 \%$ profit $20 \%$ loss

The total revenue of a company during $2014-2018$ is shown in the bar graph. If the total expenditure of the company in each year is $500$ million rupees, then the aggreg...

6.7k views

commented Feb 12, 2020

1 answer

9

TIFR CSE 2020 | Part B | Question: 6
Consider the context-free grammar below ($\epsilon$ denotes the empty string, alphabet is $\{a,b\}$): $S\rightarrow \epsilon \mid aSb \mid bSa \mid SS.$ What language does it generate? $(ab)^{\ast} + (ba)^{\ast}$ $(abba) {\ast} + (baab)^{\ast}$ ... of the form $a^{n}b^{n}$ or $b^{n}a^{n},n$ any positive integer Strings with equal numbers of $a$ and $b$

Consider the context-free grammar below ($\epsilon$ denotes the empty string, alphabet is $\{a,b\}$):$$S\rightarrow \epsilon \mid aSb \mid bSa \mid SS.$$What language doe...

502 views

commented Feb 11, 2020

5 answers

10

GATE CSE 2013 | Question: 55
Relation $R$ has eight attributes $\text{ABCDEFGH}$. Fields of $R$ contain only atomic values. $F = \text{{CH $\rightarrow$ G, A $\rightarrow$ BC, B $\rightarrow$ CFH, E $\rightarrow$ A, F $\rightarrow$ EG}}$ is a set of functional dependencies $(FDs)$ ... in $\text{2NF}$, but not in $\text{3NF}$. in $\text{3NF}$, but not in $\text{BCNF}$. in $\text{BCNF}$.

Relation $R$ has eight attributes $\text{ABCDEFGH}$. Fields of $R$ contain only atomic values. $F = \text{{CH $\rightarrow$ G, A $\rightarrow$ BC, B $\rightarrow$ CFH, E ...

14.7k views

commented Feb 1, 2020

7 answers

11

GATE CSE 2013 | Question: 52
A computer uses $46\text{-bit}$ virtual address, $32\text{-bit}$ physical address, and a three-level paged page table organization. The page table base register stores the base address of the first-level table $\text{(T1)}$ ... is $64$ bytes. What is the size of a page in $\textsf{KB}$ in this computer? $2$ $4$ $8$ $16$

A computer uses $46\text{-bit}$ virtual address, $32\text{-bit}$ physical address, and a three–level paged page table organization. The page table base register stores ...

37.5k views

commented Jan 31, 2020

10 answers

12

GATE CSE 2017 Set 1 | Question: 48
Let $A$ be an array of $31$ numbers consisting of a sequence of $0$'s followed by a sequence of $1$'s. The problem is to find the smallest index $i$ such that $A\left [i \right ]$ is $1$ by probing the minimum number of locations in $A$. The worst case number of probes performed by an optimal algorithm is ____________.

Let $A$ be an array of $31$ numbers consisting of a sequence of $0$'s followed by a sequence of $1$'s. The problem is to find the smallest index $i$ such that $A\left [i ...

21.8k views

commented Jan 25, 2020

1 answer

13

TIFR CSE 2018 | Part B | Question: 7
Consider the recursive quicksort algorithm with "random pivoting". That is, in each recursive call, a pivot is chosen uniformly at random from the sub-array being sorted.When this randomized algorithm is applied to an array of size $n$ all whose elements are distinct, ... $\Theta\left(\dfrac{1}{n \log^{2} n}\right)$

Consider the recursive quicksort algorithm with "random pivoting". That is, in each recursive call, a pivot is chosen uniformly at random from the sub-array being sorted....

8.3k views

commented Jan 23, 2020

5 answers

14

TIFR CSE 2019 | Part A | Question: 15
Consider the matrix $A = \begin{bmatrix} \frac{1}{2} &\frac{1}{2} & 0\\ 0& \frac{3}{4} & \frac{1}{4}\\ 0& \frac{1}{4} & \frac{3}{4} \end{bmatrix}$ What is $\displaystyle \lim_{n→\infty}$A^n$ ? $\begin{bmatrix} \ 0 ... $\text{The limit exists, but it is none of the above}$

Consider the matrix$$A = \begin{bmatrix} \frac{1}{2} &\frac{1}{2} & 0\\ 0& \frac{3}{4} & \frac{1}{4}\\ 0& \frac{1}{4} & \frac{3}{4} \end{bmatrix}$$What is $\displaystyle ...

2.8k views

commented Dec 5, 2019

1 answer

15

TIFR Answer keys
Anyone have answer keys for tifr gs 2010/2011 ? and 2012- 2018 Question papers without answers marked. kindly share.

Anyone have answer keys for tifr gs 2010/2011 ?and 2012- 2018 Question papers without answers marked.kindly share.

3.3k views

answered Dec 4, 2019

2 answers

16

TIFR CSE 2011 | Part A | Question: 5
Three distinct points $x, y, z$ lie on a unit circle of the complex plane and satisfy $x+y+z=0$. Then $x, y, z$ form the vertices of . An isosceles but not equilateral triangle. An equilateral triangle. A triangle of any shape. A triangle whose shape can't be determined. None of the above.

Three distinct points $x, y, z$ lie on a unit circle of the complex plane and satisfy $x+y+z=0$. Then $x, y, z$ form the vertices of .An isosceles but not equilateral tri...

711 views

answered Dec 3, 2019

5 answers

17

MadeEasy Subject Test 2019: Compiler Design - Lexical Analysis

2.6k views

answered Jun 30, 2019

2 answers

18

token generation doubt
which one of the following string can definitely said to be a token without looking at the next input: +(++,+=) return(return a) *(*=) =(==) ++ , ( ) ‘ ; option e is: plusplus, comma, bracket open, bracket close, single quote ;

which one of the following string can definitely said to be a token without looking at the next input:+(++,+=)return(return a)*(*=)=(==)++ , ( ) ‘ ; option e is: plu...

4.1k views

answered Jun 30, 2019

1 answer

19

GATE OFFICIAL ANSWER KEY
Will gate rank predictor be revised according to the official and final answer key?

Will gate rank predictor be revised according to the official and final answer key?

1.6k views

answered Mar 13, 2019

1 answer

20

GATE Admissions
I'm getting 63.67 marks in GATE 2019 with expected score 743 (OBC-NCL) (rank 500-530) according to pragy sir's app. I'm in final year of my BE, and have job offer as SE (Data science/NLP/CV domain) salary 6lpa. My questions: 1. What ... IITM TA? Right now I'm confused whether I should do job for a year and then consider MTech or do it right away. Please guide.

I'm getting 63.67 marks in GATE 2019 with expected score 743 (OBC-NCL) (rank 500-530) according to pragy sir's app. I'm in final year of my BE, and have job offer as SE (...

759 views

answered Mar 3, 2019

8 answers

21

Gate 2019 answer key
I want to challenge the recursive question of gate 2019.Can u suggest what supporting document can be placed?

I want to challenge the recursive question of gate 2019.Can u suggest what supporting document can be placed?

2.4k views

answered Feb 21, 2019

3 answers

22

GATE CSE 2019 | Question: GA-7
In the given diagram, teachers are represented in the triangle, researchers in the circle and administrators in the rectangle. Out of the total number of the people, the percentage of administrators shall be in the range of _______ $0$ to $15$ $16$ to $30$ $31$ to $45$ $46$ to $60$

In the given diagram, teachers are represented in the triangle, researchers in the circle and administrators in the rectangle. Out of the total number of the people, the ...

10.2k views

answer edited Feb 20, 2019

2 answers

23

Gate 2019
Are the gate keys out yet. If not, any info on when will they be out?

Are the gate keys out yet. If not, any info on when will they be out?

747 views

answered Feb 19, 2019

1 answer

24

why should one prefer GATE over macine learning ?
why should working professional prefer GATE over trending technology like machine learning. If they spent same amount of time to crack GATE in machine learning they would be getting better results. can some one explain me with pros and cons of preparing for GATE and getting started with Machine learning course ?

why should working professional prefer GATE over trending technology like machine learning. If they spent same amount of time to crack GATE in machine learning they woul...

1.5k views

answered Feb 19, 2019

9 answers

25

GATE CSE 2019 | Question: 22
Two numbers are chosen independently and uniformly at random from the set $\{1,2,\ldots,13\}.$ The probability (rounded off to $3$ decimal places) that their $4\text{-bit}$ (unsigned) binary representations have the same most significant bit is ___________.

Two numbers are chosen independently and uniformly at random from the set $\{1,2,\ldots,13\}.$The probability (rounded off to $3$ decimal places) that their $4\text{-bit}...

20.1k views

answered Feb 12, 2019

4 answers

26

GATE CSE 2019 | Question: 20
An array of $25$ distinct elements is to be sorted using quicksort. Assume that the pivot element is chosen uniformly at random. The probability that the pivot element gets placed in the worst possible location in the first round of partitioning (rounded off to $2$ decimal places) is ________

An array of $25$ distinct elements is to be sorted using quicksort. Assume that the pivot element is chosen uniformly at random. The probability that the pivot element ge...

16.3k views

comment edited Feb 8, 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