Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
air1ankit
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
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$
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...
16.4k
views
answered
Nov 8, 2019
Compiler Design
gatecse-2019
compiler-design
syntax-directed-translation
2-marks
+
–
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$
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...
32.9k
views
answered
Apr 4, 2019
Operating System
gatecse-2017-set1
operating-system
process-synchronization
normal
+
–
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\}$
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...
12.2k
views
answered
Apr 4, 2019
Operating System
gatecse-2019
operating-system
process-synchronization
2-marks
+
–
1
votes
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
To implement Dijkstra’s shortest path algorithm on unweighted graphs so that it runs in linear time, the data structure to be used is:QueueStackHeapB-Tree
31.4k
views
answered
Mar 27, 2019
Algorithms
gatecse-2006
algorithms
graph-algorithms
easy
+
–
1
votes
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\}$
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 \...
14.7k
views
answered
Feb 15, 2019
Theory of Computation
gatecse-2019
theory-of-computation
regular-language
1-mark
+
–
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
The expenditure on the project _____ as follows: equipment Rs.$20$ lakhs, salaries Rs.$12$ lakhs, and contingency Rs.$3$ lakhs.break downbreakbreaks downbreaks
9.0k
views
answered
Feb 12, 2019
Verbal Aptitude
gatecse-2019
general-aptitude
verbal-aptitude
most-appropriate-word
1-mark
+
–
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$.
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...
11.1k
views
answered
Jan 8, 2019
Databases
gate1995
databases
database-normalization
normal
descriptive
+
–
1
votes
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
How many distinct minimum weight spanning trees does the following undirected, weighted graph have ?$8$$16$$32$$64$None of the above
4.4k
views
answered
Dec 12, 2018
Algorithms
tifr2019
algorithms
minimum-spanning-tree
+
–
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$
Which number does not belong in the series below?$\qquad2, 5, 10, 17, 26, 37, 50, 64$$17$$37$$64$$26$
2.6k
views
answered
Nov 29, 2018
Quantitative Aptitude
gatecse-2014-set3
quantitative-aptitude
number-series
easy
+
–
0
votes
10
GATE CSE 2013 | Question: 58
What will be the maximum sum of $44, 42, 40, \dots$ ? $502$ $504$ $506$ $500$
What will be the maximum sum of $44, 42, 40, \dots$ ?$502$$504$$506$$500$
5.6k
views
answered
Nov 29, 2018
Quantitative Aptitude
gatecse-2013
quantitative-aptitude
easy
arithmetic-series
+
–
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
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 A...
3.3k
views
answered
Nov 18, 2018
Analytical Aptitude
gate2013-ce
logical-reasoning
age-relation
+
–
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$
What is the value of $ \displaystyle\lim_{n \to \infty}\left(1 - \frac{1}{n}\right)^{2n}$ ?$0$$e^{-2}$$e^{-1/2}$$1$
8.9k
views
answered
Oct 8, 2018
Calculus
gatecse-2010
calculus
limits
normal
+
–
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)$
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)$
1.4k
views
answered
Oct 5, 2018
Combinatory
discrete-mathematics
recurrence-relation
relations
+
–
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}$
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}$$
4.6k
views
answered
Oct 5, 2018
Linear Algebra
gatecse-2002
linear-algebra
eigen-value
normal
descriptive
+
–
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$.
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...
11.1k
views
answered
Sep 12, 2018
Databases
gate1995
databases
database-normalization
normal
descriptive
+
–
1
votes
16
Discrete mathematics
What is a discrete set?
What is a discrete set?
1.6k
views
answered
Sep 1, 2018
0
votes
17
Normal Forms
If a relation has no functional dependency than what is the normal form of this relation???
If a relation has no functional dependency than what is the normal form of this relation???
2.0k
views
answered
Aug 31, 2018
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
In a resident – OS computer, which of the following systems must reside in the main memory under all situations?AssemblerLinkerLoaderCompiler
9.3k
views
answered
Aug 27, 2018
Compiler Design
gate1998
compiler-design
runtime-environment
normal
isro2008
+
–
1
votes
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.
Every subset of a countable set is countable.State whether the above statement is true or false with reason.
3.0k
views
answered
Aug 8, 2018
Set Theory & Algebra
gate1994
set-theory&algebra
normal
set-theory
countable-uncountable-set
true-false
+
–
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.$
Give a relational algebra expression using only the minimum number of operators from $(∪, −)$ which is equivalent to $R$ $∩$ $S.$
6.9k
views
answered
Aug 8, 2018
Databases
gate1994
databases
relational-algebra
normal
descriptive
+
–
0
votes
21
self doubt
what is the output of printf("%d",printf("gate19")?
what is the output of printf("%d",printf("gate19")?
437
views
answered
Aug 3, 2018
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
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 nodeA ...
19.2k
views
answered
Jul 19, 2018
Programming in C
gatecse-2000
programming
programming-in-c
easy
structure
+
–
1
votes
23
Algorithm substitution method
How to find log n base2+ log n base 3+ log n base4+........log n base n?
How to find log n base2+ log n base 3+ log n base4+........log n base n?
1.7k
views
answered
Jul 4, 2018
Algorithms
logarithmic-function
normal
descriptive
+
–
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 ?
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)...
5.1k
views
answered
Jun 1, 2018
Algorithms
algorithms
recurrence-relation
time-complexity
+
–
1
votes
25
T(n) = T(n/4) + T(3n/4) +n
How to solve above recurrence relation (With substitution method)??
How to solve above recurrence relation (With substitution method)??
13.3k
views
answered
Jun 1, 2018
Algorithms
algorithms
master-theorem
recurrence-relation
time-complexity
recursion
+
–
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
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 decl...
11.6k
views
answered
Feb 15, 2018
Operating System
gatecse-2018
operating-system
deadlock-prevention-avoidance-detection
normal
2-marks
+
–
1
votes
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}$
The correct matching for the following pairs is$$\begin{array}{ll|ll}\hline \text{A.} & \text{All pairs shortest path} & \text{1.} & \text{Greedy} \\\hline \text{B.} & \...
5.0k
views
answered
Feb 7, 2018
Algorithms
gate1997
algorithms
normal
algorithm-design-technique
easy
match-the-following
+
–
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
The set of all recursively enumerable languages is:closed under complementationclosed under intersectiona subset of the set of all recursive languagesan uncountable set
11.3k
views
answered
Feb 6, 2018
Theory of Computation
gatecse-2018
theory-of-computation
closure-property
easy
1-mark
+
–
0
votes
29
TEST SERIES
612
views
answered
Jan 30, 2018
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$ ?
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)=\fra...
4.1k
views
answered
Jan 18, 2018
Algorithms
gate1990
descriptive
algorithms
recurrence-relation
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register