Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by ascend
0
votes
1
GATE CSE 2014 Set 1 | Question: GA-5
The roots of $ax^{2}+bx+c = 0$ are real and positive. $a, b$ and $c$ are real. Then $ax^{2}+b\mid x \mid + c =0$ has no roots $2$ real roots $3$ real roots $4$ real roots
The roots of $ax^{2}+bx+c = 0$ are real and positive. $a, b$ and $c$ are real. Then $ax^{2}+b\mid x \mid + c =0$ has no roots$2$ real roots$3$ real roots$4$ real roots
8.9k
views
answered
Apr 14, 2021
Quantitative Aptitude
gatecse-2014-set1
quantitative-aptitude
quadratic-equations
normal
+
–
0
votes
2
Test by Bikram | Databases | Test 1 | Question: 26
Consider the following relations Employee (E#, Ename, salary, Bdate, D#) Department (D#, Dname, mgremp#, Location) Dependent (E#, DependentName) Which among these tuple calculus queries represent the following condition: List the names of mangers who have at least one dependent ... t (t ∈ DEPENDENT ∧ u ∈ DEPARTMENT ∧ t[E#] = u[D#] ∧ m[E#] = u[D#])}
Consider the following relationsEmployee (E#, Ename, salary, Bdate, D#)Department (D#, Dname, mgremp#, Location)Dependent (E#, DependentName)Which among these tuple calcu...
315
views
answered
Apr 1, 2021
Databases
tbb-dbms-1
+
–
1
votes
3
GATE CSE 2021 Set 2 | Question: 43
Consider a computer system with multiple shared resource types, with one instance per resource type. Each instance can be owned by only one process at a time. Owning and freeing of resources are done by holding a global lock $(L)$. ... not occur The scheme may lead to live-lock The scheme may lead to starvation The scheme violates the mutual exclusion property
Consider a computer system with multiple shared resource types, with one instance per resource type. Each instance can be owned by only one process at a time. Owning and ...
9.8k
views
answered
Mar 12, 2021
Operating System
gatecse-2021-set2
multiple-selects
operating-system
deadlock-prevention-avoidance-detection
2-marks
+
–
3
votes
4
GATE CSE 2021 Set 1 | Question: 36
Let $G=(V, E)$ be an undirected unweighted connected graph. The diameter of $G$ is defined as: $\text{diam}(G)=\displaystyle \max_{u,v\in V} \{\text{the length of shortest path between $u$ and $v$}\}$ Let $M$ be the adjacency matrix of $G$. Define graph $G_2$ ... $\text{diam}(G_2) = \text{diam}(G)$ $\text{diam}(G)< \text{diam}(G_2)\leq 2\; \text{diam}(G)$
Let $G=(V, E)$ be an undirected unweighted connected graph. The diameter of $G$ is defined as:$$\text{diam}(G)=\displaystyle \max_{u,v\in V} \{\text{the length of shortes...
9.9k
views
answered
Mar 1, 2021
Graph Theory
gatecse-2021-set1
graph-theory
graph-connectivity
2-marks
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register