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
Recent activity by sachin1410
2
answers
1
admission through Gate query
How do I use the previous year's GATE score for the current year for admissions? I completed B.tech in CSE in 2021 and I appeared for Gate 2021 CS and secured AIR1717 with a score of 619 and around 48 marks. I took a drop and reappeared for ... colleges and options would be available for me? What is the best college I can get with this score? What should I do next?
How do I use the previous year's GATE score for the current year for admissions?I completed B.tech in CSE in 2021 and I appeared for Gate 2021 CS and secured AIR1717 with...
1.0k
views
answered
Feb 6, 2022
Written Exam
admissions
+
–
4
answers
2
GATE CSE 2021 Set 1 | Question: 27
The following relation records the age of $500$ employees of a company, where $empNo$ (indicating the employee number) is the key: $empAge(\underline{empNo},age)$ ... Employee numbers of all employees whose age is not the minimum Employee numbers of all employees whose age is the minimum
The following relation records the age of $500$ employees of a company, where $empNo$ (indicating the employee number) is the key:$$empAge(\underline{empNo},age)$$Conside...
7.1k
views
commented
Apr 27, 2021
Databases
gatecse-2021-set1
databases
relational-algebra
2-marks
+
–
8
answers
3
GATE CSE 2021 Set 1 | Question: 7
Let $p$ and $q$ be two propositions. Consider the following two formulae in propositional logic. $S_1: (\neg p\wedge(p\vee q))\rightarrow q$ $S_2: q\rightarrow(\neg p\wedge(p\vee q))$ Which one of the following choices is correct? Both $S_1$ and ... but $S_2$ is not a tautology $S_1$ is not a tautology but $S_2$ is a tautology Neither $S_1$ nor $S_2$ is a tautology
Let $p$ and $q$ be two propositions. Consider the following two formulae in propositional logic.$S_1: (\neg p\wedge(p\vee q))\rightarrow q$$S_2: q\rightarrow(\neg p\wedge...
8.3k
views
answered
Feb 18, 2021
Mathematical Logic
gatecse-2021-set1
mathematical-logic
propositional-logic
1-mark
+
–
3
answers
4
GATE CSE 2021 Set 1 | Question: 32
Let $r_i(z)$ and $w_i(z)$ denote read and write operations respectively on a data item $z$ by a transaction $T_i$. Consider the following two schedules. $S_1: r_1(x)r_1(y)r_2(x)r_2(y)w_2(y)w_1(x)$ ... serializable, and $S_2$ is conflict serializable Both $S_1$ and $S_2$ are conflict serializable Niether $S_1$ nor $S_2$ is conflict serializable
Let $r_i(z)$ and $w_i(z)$ denote read and write operations respectively on a data item $z$ by a transaction $T_i$. Consider the following two schedules.$S_1: r_1(x)r_1(y)...
5.5k
views
answered
Feb 18, 2021
Databases
gatecse-2021-set1
databases
transaction-and-concurrency
conflict-serializable
2-marks
+
–
6
answers
5
GATE CSE 2021 Set 1 | Question: 25
Three processes arrive at time zero with $\text{CPU}$ bursts of $16,\;20$ and $10$ milliseconds. If the scheduler has prior knowledge about the length of the $\text{CPU}$ bursts, the minimum achievable average waiting time for these three processes in a non-preemptive scheduler (rounded to nearest integer) is _____________ milliseconds.
Three processes arrive at time zero with $\text{CPU}$ bursts of $16,\;20$ and $10$ milliseconds. If the scheduler has prior knowledge about the length of the $\text{CPU}$...
9.2k
views
answered
Feb 18, 2021
Operating System
gatecse-2021-set1
operating-system
process-scheduling
numerical-answers
1-mark
+
–
4
answers
6
GATE CSE 2021 Set 1 | Question: 48
Consider the following $\text{ANSI C}$ function: int SimpleFunction(int Y[], int n, int x) { int total = Y[0], loopIndex; for (loopIndex=1; loopIndex<=n-1; loopIndex++) total=x*total +Y[loopIndex]; return total; } Let $\textsf{Z}$ be an array ... $i$ such that $0 \leq i \leq 9$. The value returned by $\textsf{SimpleFunction(Z},10,2)$ is __________
Consider the following $\text{ANSI C}$ function:int SimpleFunction(int Y[], int n, int x) { int total = Y[0], loopIndex; for (loopIndex=1; loopIndex<=n-1; loopIndex++) to...
6.2k
views
answered
Feb 18, 2021
Algorithms
gatecse-2021-set1
algorithms
numerical-answers
identify-function
2-marks
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register