Dark Mode

Answers by air1ankit

2 votes

1

GATE CSE 2019 | Question: 36
Consider the following grammar and the semantic actions to support the inherited type declaration attributes. Let $X_1, X_2, X_3, X_4, X_5$, and $X_6$ be the placeholders for the non-terminals $D, T, L$ or $L_1$ ... $X_1=T, \: X_2=L, \: X_3=T, \: X_4 = L_1$

answered in Compiler Design Nov 8, 2019

16.5k views

0 votes

2

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$

answered in Operating System Apr 4, 2019

33.2k views

2 votes

3

GATE CSE 2019 | Question: 39
Consider the following snapshot of a system running $n$ concurrent processes. Process $i$ is holding $X_i$ instances of a resource $R$, $1 \leq i \leq n$. Assume that all instances of $R$ are currently in use. Further, for all $i$, process $i$ ... $\text{Min}(X_p,X_q) \leq \text{Max} \{Y_k \mid 1 \leq k \leq n, k \neq p, k \neq q\}$

answered in Operating System Apr 4, 2019

12.3k views

1 vote

4

GATE CSE 2006 | Question: 12
To implement Dijkstra’s shortest path algorithm on unweighted graphs so that it runs in linear time, the data structure to be used is: Queue Stack Heap B-Tree

answered in Algorithms Mar 27, 2019

31.5k views

1 vote

5

GATE CSE 2019 | Question: 7
If $L$ is a regular language over $\Sigma = \{a,b\} $, which one of the following languages is NOT regular? $L.L^R = \{xy \mid x \in L , y^R \in L\}$ $\{ww^R \mid w \in L \}$ $\text{Prefix } (L) = \{x \in \Sigma^* \mid \exists y \in \Sigma^* $such that$ \ xy \in L\}$ $\text{Suffix }(L) = \{y \in \Sigma^* \mid \exists x \in \Sigma^* $such that$ \ xy \in L\}$

answered in Theory of Computation Feb 15, 2019

14.7k views

2 votes

6

GATE CSE 2019 | Question: GA-1
The expenditure on the project _____ as follows: equipment Rs.$20$ lakhs, salaries Rs.$12$ lakhs, and contingency Rs.$3$ lakhs. break down break breaks down breaks

answered in Verbal Aptitude Feb 12, 2019

9.1k views

4 votes

7

GATE CSE 1995 | Question: 26
Consider the relation scheme $R(A, B, C)$ with the following functional dependencies: $A, B \rightarrow C,$ $C \rightarrow A$ Show that the scheme $R$ is in $3\text{NF}$ but not in $\text{BCNF}$. Determine the minimal keys of relation $R$.

answered in Databases Jan 8, 2019

11.1k views

1 vote

8

TIFR CSE 2019 | Part B | Question: 2
How many distinct minimum weight spanning trees does the following undirected, weighted graph have ? $8$ $16$ $32$ $64$ None of the above

answered in Algorithms Dec 12, 2018

4.6k views

0 votes

9

GATE CSE 2014 Set 3 | Question: GA-4
Which number does not belong in the series below? $\qquad2, 5, 10, 17, 26, 37, 50, 64$ $17$ $37$ $64$ $26$

answered in Quantitative Aptitude Nov 29, 2018

2.6k views

0 votes

10

GATE CSE 2013 | Question: 58
What will be the maximum sum of $44, 42, 40, \dots$ ? $502$ $504$ $506$ $500$

answered in Quantitative Aptitude Nov 29, 2018

5.6k views

3 votes

11

GATE2013 CE: GA-10
Abhishek is elder to Savar. Savar is younger to Anshul. Which of the given conclusions is logically valid and is inferred from the above statements? Abhishek is elder to Anshul Anshul is elder to Abhishek Abhishek and Anshul are of the same age No conclusion follows

answered in Analytical Aptitude Nov 18, 2018

3.3k views

2 votes

12

GATE CSE 2010 | Question: 5
What is the value of $ \displaystyle\lim_{n \to \infty}\left(1 - \frac{1}{n}\right)^{2n}$ ? $0$ $e^{-2}$ $e^{-1/2}$ $1$

answered in Calculus Oct 8, 2018

8.9k views

2 votes

13

Recurrence Relation
Let $T(n) = T(n-1) + \frac{1}{n} , T(1) = 1 ;$ then $T(n) = ? $ $O(n^{2})$ $O(logn)$ $O(nlogn)$ $O(n^{2}logn)$

answered in Combinatory Oct 5, 2018

1.4k views

0 votes

14

GATE CSE 2002 | Question: 5a
Obtain the eigen values of the matrix$A=\begin {bmatrix} 1 & 2 & 34 & 49 \\ 0 & 2 & 43 & 94 \\ 0 & 0 & -2 & 104 \\ 0 & 0 & 0 & -1 \end{bmatrix}$

answered in Linear Algebra Oct 5, 2018

4.6k views

2 votes

15

GATE CSE 1995 | Question: 26
Consider the relation scheme $R(A, B, C)$ with the following functional dependencies: $A, B \rightarrow C,$ $C \rightarrow A$ Show that the scheme $R$ is in $3\text{NF}$ but not in $\text{BCNF}$. Determine the minimal keys of relation $R$.

answered in Databases Sep 12, 2018

11.1k views

1 vote

16

Discrete mathematics
What is a discrete set?

answered in Mathematical Logic Sep 1, 2018

1.6k views

0 votes

17

Normal Forms
If a relation has no functional dependency than what is the normal form of this relation???

answered in Databases Aug 31, 2018

2.0k views

3 votes

18

GATE CSE 1998 | Question: 1.25, ISRO2008-41
In a resident – OS computer, which of the following systems must reside in the main memory under all situations? Assembler Linker Loader Compiler

answered in Compiler Design Aug 27, 2018

9.3k views

1 vote

19

GATE CSE 1994 | Question: 3.9
Every subset of a countable set is countable. State whether the above statement is true or false with reason.

answered in Set Theory & Algebra Aug 8, 2018

3.0k views

0 votes

20

GATE CSE 1994 | Question: 3.8
Give a relational algebra expression using only the minimum number of operators from $(∪, −)$ which is equivalent to $R$ $∩$ $S.$

answered in Databases Aug 8, 2018

6.9k views

0 votes

21

self doubt
what is the output of printf("%d",printf("gate19")?

answered in Programming in C Aug 3, 2018

462 views

2 votes

22

GATE CSE 2000 | Question: 1.11
The following C declarations: struct node { int i: float j; }; struct node *s[10]; define s to be: An array, each element of which is a pointer to a structure of type node A structure of $2$ ... $3$ fields: an integer, a float, and an array of $10$ elements An array, each element of which is a structure of type node

answered in Programming in C Jul 19, 2018

19.2k views

1 vote

23

Algorithm substitution method
How to find log n base2+ log n base 3+ log n base4+........log n base n?

answered in Algorithms Jul 4, 2018

1.7k views

0 votes

24

Solve Recurrence Equation T(n) = 2T(n/4) + √3
I've been struggling to come to exact solution for this. Master's theorem is not applicable and likely way to get to answer is Recursion tree. Which is giving me Theta(n) as an answer. Steps : => 1) T(n) = 2T(n/4) + √3 2) ... .. = n/2 Which is incorrect , Answer given is ( √n log n ) , would appreciate if someone could shed light how so ?

answered in Algorithms Jun 1, 2018

5.1k views

1 vote

25

T(n) = T(n/4) + T(3n/4) +n
How to solve above recurrence relation (With substitution method)??

answered in Algorithms Jun 1, 2018

13.3k views

0 votes

26

GATE CSE 2018 | Question: 39
In a system, there are three types of resources: $E, F$ and $G$. Four processes $P_0$, $P_1$, $P_2$ and $P_3$ execute concurrently. At the outset, the processes have declared their maximum resource requirements using a matrix named Max as given below. ... $safe$ state, but would be $safe$ if one more instance of $G$ were available

answered in Operating System Feb 15, 2018

11.6k views

1 vote

27

GATE CSE 1997 | Question: 1.5
The correct matching for the following pairs is ... $\text{A-3 B-4 C-1 D-2}$ $\text{A-3 B-4 C-2 D-1}$ $\text{A-4 B-1 C-2 D-3}$

answered in Algorithms Feb 7, 2018

5.0k views

7 votes

28

GATE CSE 2018 | Question: 7
The set of all recursively enumerable languages is: closed under complementation closed under intersection a subset of the set of all recursive languages an uncountable set

answered in Theory of Computation Feb 6, 2018

11.4k views

0 votes

29

answered in Programming in C Jan 30, 2018

628 views

4 votes

30

GATE CSE 1990 | Question: 17a
Express $T(n)$ in terms of the harmonic number $\displaystyle H_{n}= \sum_{i=1}^{n} \frac{1}{i},\quad n \geq 1$, where $T(n)$ satisfies the recurrence relation, $T(n)=\frac{n+1}{n} T(n - 1)+1$, for $n \geq \sum$ and $T(1) = 1$ What is the asymptotic behaviour of $T(n)$ as a function of $n$ ?

answered in Algorithms Jan 18, 2018

4.2k views

Page:

1
2
3
next »